20171103, 13:14  #1 
Nov 2017
Morocco
7 Posts 
Endorsement Prime Numbers finding algorithm
Hi,
Iam looking for endorsement to publish my prime numbers finding algorithm that I've invented about 3 years ago. the algorithm is an optimization to the segmented sieve of Eratosthenes,it finds primes up to N without any repetition of multiples of primes, its time complexity is sublinear. The one who will endorse this research will be my coauthor. The algorithm could be found here => http://vixra.org/pdf/1505.0119v2.pdf Thank you 
20171103, 13:44  #2  
Sep 2002
Database er0rr
3×1,327 Posts 
Quote:
Quote:
Quote:
Also make your margins smaller with something like this in the header (before begin document): Code:
\addtolength{\oddsidemargin}{.875in} \addtolength{\evensidemargin}{.875in} \addtolength{\textwidth}{1.75in} \addtolength{\topmargin}{.875in} \addtolength{\textheight}{1.75in} Capitalize at least the first word of the title. Begin every sentence with a capital letter. (I am not commenting on the validity of this as a new algorithm  I will leave that to someone else.) Last fiddled with by paulunderwood on 20171103 at 14:23 

20171103, 14:23  #3  
"Robert Gerbicz"
Oct 2005
Hungary
1,531 Posts 
Quote:


20171103, 14:50  #4  
Nov 2017
Morocco
7_{8} Posts 
Quote:


20171103, 14:51  #5  
Feb 2017
Nowhere
23·233 Posts 
Near the end, it says (I cleaned up the expression for the upper limit)
Quote:


20171103, 14:57  #6  
Nov 2017
Morocco
111_{2} Posts 
Quote:
The computational analysis I did may be wrong, but what do you think about the algorithm itself ? 

20171103, 15:56  #7  
Feb 2017
Nowhere
1010011101111_{2} Posts 
Quote:
Quote:
In any event, the first step requires you to specify all the primes up to sqrt(b). I don't know the computational cost of doing that, but if b is at all large my guess is, "a lot." 

20171103, 16:53  #8  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
Quote:


20171103, 22:43  #9  
Aug 2006
13533_{8} Posts 
Quote:
On the other hand your earlier issue, like the ones R. Gerbicz identified, are pretty bad. I certainly wouldn't endorse a paper in this state. But if I have a chance I'll look over the algorithm. Last fiddled with by CRGreathouse on 20171103 at 22:44 

20171103, 22:57  #10  
Nov 2017
Morocco
7 Posts 
Quote:


20171104, 01:04  #11  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
Quote:
a few more typos to fix: earliar > earlier wich > which 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
This simple algorithm incomplete can only calculate prime numbers?  Ale  Miscellaneous Math  38  20151129 23:27 
OEIS  (2^n5)/3  n odd  LLTlike algorithm for finding PRPs  T.Rex  Miscellaneous Math  10  20150901 18:07 
OEIS  2^n5  LLTlike algorithm for finding PRPs  T.Rex  Miscellaneous Math  13  20150901 13:09 
New method of finding large prime numbers  georgelouis@mac  Math  41  20110125 21:06 
New PrimeFinding Algorithm Discovered! L00K HERE!  dilip_1bhowmik  Miscellaneous Math  22  20090109 23:39 