mersenneforum.org possibly stupid question about winning the $100,000  User Name Remember Me? Password  Register FAQ Search Today's Posts Mark Forums Read  2005-09-10, 21:30 #1 jasong "Jason Goatcher" Mar 2005 350710 Posts possibly stupid question about winning the$100,000 Not understanding the proving math, but having a good memory, wouldn't calculating "primorial 1billion minus 1" technically create a record prime? Or is there some lawyer wording to prevent this? "I'm assuming I'm correct in the assumption that primorial x minus 1 is always prime. Primorial x means multiplying all the primes from 1 to x, correct? Last fiddled with by jasong on 2005-09-10 at 21:30
 2005-09-10, 21:42 #2 akruppa     "Nancy" Aug 2002 Alexandria 2,467 Posts Step 1 (always!): Look at small cases. Alex
2005-09-10, 22:21   #3
jasong

"Jason Goatcher"
Mar 2005

1101101100112 Posts

Quote:
 Originally Posted by akruppa Step 1 (always!): Look at small cases. Alex
I know it's correct for the first five. The square root of the sixth one(30029) is about 173, and I'm feeling lazy. Truthfully, I seem to remember that it's proven that primorial x minus 1 is prime, am I wrong?

 2005-09-10, 22:34 #4 akruppa     "Nancy" Aug 2002 Alexandria 2,467 Posts >I know it's correct for the first five. 2*3*5*7-1 = 209 = 11*19 For the primorial n#, n#ยฑ1 has no prime divisor โคn, but can very well have larger divisors. Alex Last fiddled with by akruppa on 2005-09-16 at 14:52
 2005-09-10, 22:40 #5 fetofs     Aug 2005 Brazil 2·181 Posts Other than that, there is another constraint: Calculating the primorial for 1 billion digit would actually involve knowing every other prime below it.
 2005-09-10, 22:55 #6 akruppa     "Nancy" Aug 2002 Alexandria 2,467 Posts I read jasong's suggestion as 1000000000#-1, i.e. $\large \prod_{2\leq p\leq10^9\\p \textrm{ prime}} {p} \hspace{3}- 1$ Computing the primes <10^9 is quite easy, but the product will be pretty large. Alex (my TeX-fu is weak . This took way too long)
 2005-09-10, 23:18 #7 jasong     "Jason Goatcher" Mar 2005 350710 Posts Okay, I'm confused, am I right or wrong about the idea that primorial x minus 1 is prime? I seem to remember a proof, but...
 2005-09-10, 23:25 #8 rogue     "Mark" Apr 2003 Between here and the 23·19·43 Posts Check out http://primorialprime.home.comcast.net/. It is a search for primorial primes. You can clearly see that there are few primorials.
2005-09-10, 23:32   #9
jasong

"Jason Goatcher"
Mar 2005

66638 Posts

Quote:
 Originally Posted by rogue Check out http://primorialprime.home.comcast.net/. It is a search for primorial primes. You can clearly see that there are few primorials.
Okay, I apologize, although I would like to know where I got my false idea.

Okay, this goes in the bin along with the mentally ill delusion I used to have that Saddam Hussein and Bill Clinton were in cahoots. (Cahoots over what? I don't remember)

2005-09-10, 23:34   #10
jasong

"Jason Goatcher"
Mar 2005

1101101100112 Posts

Quote:
Originally Posted by akruppa
Quote:
 Originally Posted by jasong I know it's correct for the first five.
2*3*5*7-1 = 209 = 11*19

For the primorial n#, n#ฑ1 has no prime divisor ≤n, but can very well have larger divisors.

Alex
Sorry, I missed this.

Last fiddled with by jasong on 2005-09-10 at 23:37

 Similar Threads Thread Thread Starter Forum Replies Last Post LaurV Information & Answers 14 2015-06-18 23:37 Uncwilly Lounge 19 2013-03-07 04:44 jasong Linux 4 2006-12-23 21:24 Biggles Prime Sierpinski Project 3 2006-02-07 22:50 fropones Math 2 2003-05-28 00:44

All times are UTC. The time now is 13:59.

Wed Jan 26 13:59:00 UTC 2022 up 187 days, 8:27, 0 users, load averages: 0.79, 0.93, 1.03

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

โ  ยฑ โ รท ร ยท โ โ โฐ โ โ โ โ โ โค โฅ โฆ โง โจ โฉ โบ โป โผ โฝ โ โ โ โ ยฒ ยณ ยฐ
โ  โ ยฐ โ ~ โ โ โซ
โก โ โ โ โ โช โซ โโ โโ โ โ โ โ โง โจ โฉ โช โจ โ โ ๐ ๐ ๐ โฒ โณ
โ โ โ โฆ โฃ โฉ โช โ โ โ โ โ โ โ โ โ โ โ โ โ โ โค โ โ โ โต โถ โท โธ ๐
ยฌ โจ โง โ โ โ โ โ โ โ โ โ โด โต โค โฅ โข โจ โซค โฃ โฆ โฏ โฎ โฐ โฑ
โซ โฌ โญ โฎ โฏ โฐ โ โ ฮด โ โฑ โ โ
๐ข๐ผ ๐ฃ๐ฝ ๐ค๐พ ๐ฅ๐ฟ ๐ฆ๐๐ ๐ง๐ ๐จ๐ ๐ฉ๐๐ ๐ช๐ ๐ซ๐ ๐ฌ๐ ๐ญ๐ ๐ฎ๐ ๐ฏ๐ ๐ฐ๐ ๐ฑ๐ ๐ฒ๐ ๐ด๐ ๐ต๐ ๐ถ๐ ๐ท๐๐ ๐ธ๐ ๐น๐ ๐บ๐