20091102, 19:25  #1 
2^{3}·23^{2} Posts 
New method of finding large prime numbers
Dear Mersenne Prime number enthusiasts,
I have a degree in mathematics and have developed a recursive infinite sequence that includes many prime numbers and gets larger much faster than the Mersenne number sequence. It's not related to the Merseene numbers. Because of it nature it may be much easier to test and prove that a give number of the sequence is a prime than it is to prove those of the Merseene number sequence are prime, i.e. much less computing power. Now that you've won the $100,000 prize there's a total of $400,000 prize money for generating prime numbers of 100,000,000 or more digits. If you're interested in more information about my sequence, please use the contact information below. You may respond via email or call 7days a week 6194019876 or toll free 8885889542 between 8AM and 11:45PM Pacific Time. Best regards, George S. Louis, CEO Digital Systems & Solutions 1573 Kimberly Woods Drive El Cajon, CA 920207261 Email: gslouis at gslouis dotnospam com Website: <url removed> Last fiddled with by Prime95 on 20091102 at 19:35 Reason: email address massaged, web addr removed 
20091102, 19:52  #2  
Nov 2003
16444_{8} Posts 
Quote:
excuse does he have for writing incoherent prose replete with bad grammar, bad spelling, and unsubstantiated claims? And having an infinite sequence that grows "much faster" than the Mersenne sequence has NOTHING to do with a faster prime proving algorithms. And if the sequence is sufficiently fast growing then it contains finitely many primes with probability 1. 

20091102, 20:07  #3  
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts 
Quote:
Define: s_{0} = 2 s_{1} = 3 for x ≥ 2, s_{x} = s_{x1}+2 Granted, it doesn't increase as quickly as the Mersenne numbers, but it gets there eventually. It's so dense with primes that 8 of the first 10 numbers are prime! By index x, there are about 2*x/(log x 1) primes in the sequence. Shouldn't this be in Misc Math, where Silverman and anyone else being serious can ignore it? Last fiddled with by MiniGeek on 20091102 at 20:24 

20091102, 20:50  #4 
Cranksta Rap Ayatollah
Jul 2003
641 Posts 
This smells like spam. The guys website seems to be hawking some snake oil to audiophiles.
ETA: Oh yuck, he's also an ambulance chaser. Although the math degree claim is substantiated on another website. http://www.positivefeedback.com/Iss...alityCheck.htm Last fiddled with by Orgasmic Troll on 20091102 at 21:01 
20091103, 00:04  #5 
∂^{2}ω=0
Sep 2002
República de California
3×5^{3}×31 Posts 
George Louis is an anagram of "gorgeous lie".
I just knew y'all were dying to know that. 
20091103, 00:28  #6 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2·5·13·73 Posts 

20091103, 00:29  #7 
∂^{2}ω=0
Sep 2002
República de California
3·5^{3}·31 Posts 

20091103, 02:54  #8 
Dec 2008
7^{2}×17 Posts 

20091103, 06:24  #9 
May 2007
Kansas; USA
2×5,171 Posts 
Shouldn't the mods just delete this entire thread?

20091103, 11:02  #10 
Oct 2008
n00bville
5^{2}×29 Posts 
Another narcissistic behavior from R.D. Silverman ..

20091103, 15:07  #11 
∂^{2}ω=0
Sep 2002
República de California
3×5^{3}×31 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Endorsement Prime Numbers finding algorithm  marouane  Computer Science & Computational Number Theory  18  20171106 15:41 
Mersenne prime factors of very large numbers  devarajkandadai  Miscellaneous Math  15  20120529 13:18 
Montgomery method in Prime Numbers: ACP  SPWorley  Math  5  20090818 17:27 
newbie question  finding small factors of very large numbers  NeoGen  Math  7  20070313 00:04 
Mersenne Prime Factors of v.large numbers  devarajkandadai  Miscellaneous Math  6  20060104 22:44 