mersenneforum.org > Math A prime finding formula. what do you think?
 Register FAQ Search Today's Posts Mark Forums Read

 2009-05-17, 11:04 #1 cipher     Feb 2007 211 Posts A prime finding formula. what do you think? http://recursed.blogspot.com/2008/07...finds-new.html Rutgers Graduate Student Finds New Prime-Generating Formula Read the article + comments.
2009-05-17, 11:10   #2
ET_
Banned

"Luigi"
Aug 2002
Team Italia

10010111000102 Posts

Quote:
 Originally Posted by cipher http://recursed.blogspot.com/2008/07...finds-new.html Rutgers Graduate Student Finds New Prime-Generating Formula Read the article + comments.
:-/

 2009-05-17, 16:56 #3 CRGreathouse     Aug 2006 3×1,993 Posts There are way too many commenters there who (1) think that this method can ever be efficient at generating primes, and (2) think far too highly of Wolfram.
 2009-05-17, 22:26 #4 Dougy     Aug 2004 Melbourne, Australia 100110002 Posts Cute result. Although, I don't really understand why there's a discussion on the Riemann hypothesis, etc. Rowland writes: the primality of p is being established essentially by trial division'' and It's not a magical generator of large primes'.' The sequence it generates is Sloane's A132199. Here it is without the 1s.
2009-05-18, 05:44   #5
flouran

Dec 2008

72×17 Posts

Quote:
 Originally Posted by cipher http://recursed.blogspot.com/2008/07...finds-new.html Rutgers Graduate Student Finds New Prime-Generating Formula Read the article + comments.
I discovered a prime-generating formula similar to that, but I never bothered to publish it. The reason why most people *shouldn't* publish stuff about prime-generating formulas is that they are often times either computationally intractable or just inefficient/insufficient.

Besides, a simple prime-generating formula such as this one does not deserve nearly the amount of attention it has received. Those are my two cents....

Last fiddled with by flouran on 2009-05-18 at 05:45

2009-05-18, 06:05   #6
Dougy

Aug 2004
Melbourne, Australia

2308 Posts

Quote:
 Originally Posted by flouran I discovered a prime-generating formula similar to that, but I never bothered to publish it. The reason why most people *shouldn't* publish stuff about prime-generating formulas is that they are often times either computationally intractable or just inefficient/insufficient.
Oh? Just because something is computationally intractable doesn't mean it can't be used theoretically by a future mathematician. It's still of some value.

In this case, it's definitely not the author's fault that the theorem's value has been misinterpreted.

2009-05-18, 06:09   #7
flouran

Dec 2008

72×17 Posts

Quote:
 Originally Posted by Dougy Oh? Just because something is computationally intractable doesn't mean it can't be used theoretically by a future mathematician. It's still of some value.
Since Rowland's result is so trivial, I would think that the future mathematician whom you refer to would have figured his result out already.
Nonetheless, you make a good point.
However, I still think the result is too trivial to be published....but that's my opinion, and I think I'm entitled to it.

 2009-05-18, 08:10 #8 Dougy     Aug 2004 Melbourne, Australia 23×19 Posts Indeed. It's an interesting topic as to what constitutes a paper. I've seen lots of papers with a lot less material than this one. I find that good quality mathematicians don't have too much time to publish minor results (even though they may be of some importance somehow).
 2009-05-18, 09:03 #9 retina Undefined     "The unspeakable one" Jun 2006 My evil lair 2·23·137 Posts I am inclined to agree with flouran here. The trivial result is really not worth so much effort to publish in such a big way. All it needed was a small mention somewhere and anyone interested in prime formulas could easy search for them and find it.
 2009-05-18, 17:21 #10 10metreh     Nov 2008 2·33·43 Posts I also agree with flouran. There are other prime-finding formulae out there, and this is just one more. And it is not an easy way to find a 100 million digit (non-Mersenne) prime. What would be nice is a fast algorithm that produced primes which got progressively larger with each iteration, so that you were quickly into the 100s of millions of digits. On second thoughts, though, it wouldn't be good, because that would mean the end of GIMPS.
 2009-05-18, 21:55 #11 Dougy     Aug 2004 Melbourne, Australia 23·19 Posts Things are a bit difficult when you're a student - there's a lot of pressure to get publications and citations (which these cutesy-poo papers tend to receive). By the looks of things, he's already achieved that: [1] Benoit Cloitre, Beyond Rowlandâ€™s gcd sequence, in preparation. At some point he might be looking for a research career and might consequently have one more publication.

 Similar Threads Thread Thread Starter Forum Replies Last Post wildrabbitt Information & Answers 3 2014-12-19 20:50 meeztamike Miscellaneous Math 11 2010-07-18 04:13 jasong Math 5 2007-12-25 05:08 debasish Miscellaneous Math 20 2007-09-28 03:48 tjmag Miscellaneous Math 6 2003-12-11 20:21

All times are UTC. The time now is 00:52.

Tue Dec 7 00:52:54 UTC 2021 up 136 days, 19:21, 1 user, load averages: 1.52, 1.47, 1.27