20171227, 19:11  #12 
Feb 2012
Prague, Czech Republ
10111001_{2} Posts 

20171227, 19:12  #13  
"Ben"
Feb 2007
2^{9}·7 Posts 
Quote:
In fact, open dialog about math, primes, and code is encouraged! It is how we all learn. 

20171227, 19:13  #14 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9682_{10} Posts 

20171227, 19:45  #15  
Feb 2017
3·5·11 Posts 
Quote:
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? 

20171227, 19:56  #16  
Feb 2017
3·5·11 Posts 
Quote:
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. 

20171227, 20:00  #17 
Feb 2017
3·5·11 Posts 

20171227, 20:02  #18  
Feb 2012
Prague, Czech Republ
5·37 Posts 
Quote:
And what about that complexity question of mine? Last fiddled with by jnml on 20171227 at 20:03 Reason: The last question was answered before I finished editing this post. 

20171227, 20:04  #19  
If I May
"Chris Halsall"
Sep 2002
Barbados
10,181 Posts 
Quote:
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. 

20171227, 20:06  #20  
Feb 2012
Prague, Czech Republ
5×37 Posts 
Quote:


20171227, 20:06  #21  
Feb 2017
3·5·11 Posts 
Quote:
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. 

20171227, 20:11  #22 
Feb 2017
3×5×11 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
gpuOwL: an OpenCL program for Mersenne primality testing  preda  GpuOwl  2751  20220103 14:57 
GQQ: a "deterministic" "primality" test in O(ln n)^2  Chair Zhuang  Miscellaneous Math  21  20180326 22:33 
AouessareEl HaddouchiEssaaidi "test": "if Mp has no factor, it is prime!"  wildrabbitt  Miscellaneous Math  11  20150306 08:17 
"New primality proving test from Alex Petrov"  ewmayer  Math  11  20070423 19:07 
P1 B1/B2 selection with "Test=" vs "Pfactor="  James Heinrich  Software  2  20050319 21:58 