- **gophne**
(*https://www.mersenneforum.org/forumdisplay.php?f=149*)

- - **"New" primality test/check**
(*https://www.mersenneforum.org/showthread.php?t=22838*)

[QUOTE=gophne;474993]Hi CRGreathouse
Time O(log n) -Very very fast. Serious. Call me crazy[/QUOTE] What do you mean by [TEX]n[/TEX]? Is it the [TEX]n[/TEX] in [TEX]2^n-1[/TEX] or something else? |

[QUOTE=gophne;475000]
That was my intention, to submit the algorithm to the world on this site, with the advantage that the algorithm will be ripped to pieces in a matter of micro seconds, if it is a hoax, with myself probably banned for life from this site, if not all other serious math sites as well. [/QUOTE] Posting an algorithm is not a reason to institute a ban, hoax or otherwise (short of it being some sort of obfuscated malicious fork-bomb algorithm or something). In fact, open dialog about math, primes, and code is encouraged! It is how we all learn. |

[QUOTE=gophne;474993]
[COLOR="Red"]ALL primes are covered- tested to M34 -2^1,257,787-1[/COLOR], Seriously! ALL composites are identified! Call me crazy[/QUOTE] Ok, if you insist. You are crazy, dude. "You tested all primes" to M34. ...oh... oh... allrighty then. :leaving: |

[QUOTE=guptadeva;475003]the mathematical community was the first scientific group to understand, that classical publications in books, journals or other printed media has limits.
you could always publish your results in arxiv ([URL]https://arxiv.org/help/submit[/URL]) and/or here in mersenneforum where the density of prime experts is very high and where you would get deep and quick feedback needed to determine the future of your new primality check ...[/QUOTE] Hi guptadeva I will try arXiv then. I will start to prepare the submission to as professional a level as I can manage on the Site. Time frame should be 2 weeks to a month, if I consider all the implications going forward. Should I include the background development of the algorithm, tables, the logic of the algorithm as well. The actual algorithm/formula is concise and straight forward and only involves an inherent relationship between odd numbers and prime numbers. I said previously that it would be Euclidian in nature. My only concern is that I would like to be advanced some kind of intellectual protection, although I would like to share the discovery on an open source basis. Is this too much to ask? |

[QUOTE=Batalov;475007]Ok, if you insist. You are crazy, dude.
"You tested all primes" to M34. ...oh... oh... allrighty then. :leaving:[/QUOTE] Hi Batalov I don't blame you for your skeptisism. Did you ever hear about a guy called Archimedes? I hear your incredulity about testing M34 - IT IS CRAZY!....wait for it. But console yourself....I share your incredulity from where you come from being a serious mathematician. But I would like to believe amazing discoveries have been made in the course of history and will continue to be made into the future. I beg of you only to wait then for the submission of the algorithm...then to rip it apart...but I suspect you will be disappointed in this. |

[QUOTE=jnml;475005]What do you mean by [TEX]n[/TEX]? Is it the [TEX]n[/TEX] in [TEX]2^n-1[/TEX] or something else?[/QUOTE]
Mersenne primes are involved in the algorithm. |

[QUOTE=gophne;475014]Hi Batalov
I don't blame you for your skeptisism. Did you ever hear about a guy called Archimedes? I hear your incredulity about testing M34 - IT IS CRAZY!....wait for it. But console yourself....I share your incredulity from where you come from being a serious mathematician. But I would like to believe amazing discoveries have been made in the course of history and will continue to be made into the future. I beg of you only to wait then for the submission of the algorithm...then to rip it apart...but I suspect you will be disappointed in this.[/QUOTE] Testing M34 is easy. But you've claimed something different, ie. to test all primes to M34. Do you realize what number of tests you're even talking about? And what about that complexity question of mine? |

[QUOTE=gophne;474999]However, I would like to believe that a Site such as this would be able to offer me some sort of protection of my work/intellectual property, even if is open source. This is my dilemma.[/QUOTE]
There is no dilemma. Publishing here would prove that you are the original discoverer. If you look at the bottom of this page (and every other page on this site) you will see a GNU Free Documentation License. Thus, as the author, you maintain copyright and must be credited for any duplication. Iff this turns out to be true, you'll go down in history. If it isn't, you won't be banned. Being incorrect is encouraged around here; it's how everyone learns. |

[QUOTE=chalsall;475019]There is no dilemma. Publishing here would prove that you are the original discoverer.
If you look at the bottom of this page (and every other page on this site) you will see a GNU Free Documentation License. Thus, as the author, you maintain copyright and must be credited for any duplication. Iff this turns out to be true, you'll go down in history. If it isn't, you won't be banned. Being incorrect is encouraged around here; it's how everyone learns.[/QUOTE] Agreed, but hand-waving not so much. |

[QUOTE=Batalov;475007]Ok, if you insist. You are crazy, dude.
"You tested all primes" to M34. ...oh... oh... allrighty then. :leaving:[/QUOTE] Hi Batalov Your point about testing all primes to M34...of course being humongous number, let alone the possible "missing" large primes...but this statement relates to the logic of the algorithm. You don't have to count to infinity to know that x+1 follows x at any point of the set of let us say "integers". I really value you input, as I would consider any other approach to be naive to a large degree with respect to the claims being made. |

[QUOTE=jnml;475020]Agreed, but hand-waving not so much.[/QUOTE]
See my reply #21 to Batalov w.r.t to testing "all" primes to M34. I said the algorithm is mindblowingly simple...it involves an (elusive) prime relationship. |

All times are UTC. The time now is 00:57. |

Powered by vBulletin® Version 3.8.11

Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.