mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Lounge (https://www.mersenneforum.org/forumdisplay.php?f=7)
-   -   You just might be addicted to GIMPS if... (https://www.mersenneforum.org/showthread.php?t=654)

StarQwest 2006-05-04 02:44

The most ridiculous item of the day:
 
[QUOTE=TTn (On June 9th, 2003, page one of this thread (#9)!)]You've got so many mersenne exponents reserved, that you are sure to win the EFE, but by that time the universe will be dust, and E=mc^2 is so hard to find that you can no longer run your INTEL P10^n.
:rolleyes:[/QUOTE]


In fact, the universe would definitely not be dust. If the odds of finding a ten million digit prime are about 300,000 to one, you would need to reserve the next couple of million exponents to be pretty darn sure you will win. I can test about twenty of these a year on my computer, so it would take about 100,000 years to find it. The universe will most certainly not be dust in that time frame, and even YOU might live to see it. Well, maybe. Unfortunately, the odds of that are approximately 10^10^10^10^10^...^10^10^10 (10^10^10^10^10^10^10^10^10^10 TENS!!!) to one! Good luck on that one. (By the way, that is ten tetrated to 10^10^10^10^10^10^10^10^10^10 or ten raised to the power of itself 10^10^10^10^10^10^10^10^10^10 times! In other words, a huge a** number, even bigger (by far) than MM127.)

P.S. Your Intel P10^n must be a powerful machine indeed. In about ten years, Intel went from the P1 processor to the P4 (thats three levels up), so in 100,000 years, they would go up about 30,000 levels. Therefore, in 100,000 years, your P10^n would actually be a P30,004, or a P10^4.477179. However, this means that the exponents could be tested much faster, possibly enabling you to find the ten million digit prime in about one thousand years (however, computers would "only" be up to the P304 by then, so my calculations may still be way off, but who the hell cares at this point anyway). You are much more likely to live to see that one, however. I read in a book once that it has been calculated that the odds against a person living 1,000 years are approximately 10^10^36 or 10^undecillion to one. Okay, still very unlikely, but you never know??????

StarQwest 2006-05-04 03:29

You are DEFINATELY addicted to GIMPS if:

You are so obsessed with prime numbers that you type up my above post. I would also agree that you might be ever so slightly addicted if you calculate the time it would take to perform a lucas lehmer test by means of PENCIL AND PAPER! Lets start with a 100 digit number (2^333-1 is the first mersenne number with 100 digits, although it is most obviously not prime). To perform one iteration would take approximately:
Square the 100 digit number: 10 minutes
Subtract 2: negligible
Modulo the 100 digit number: 10 minutes
Thus, one iteration would take approximately 20 minutes. Thus, the whole test would take (20 minutes per iteration) x (333 iterations) = 111 hours. Thus, if you worked on it 40 hours a week, it would take 2.775 weeks to perform the test. Since the time required for a LL test goes up at a quadratic rate (double the size quadruple the time, 10x the size, 100x the time, etc.), it would take 277.5 weeks = 5.336538 years to LL test a 1,000 digit number, 5,336,538 years to test a 1,000,000 digit number, and 534 million years to test a 10 million digit number! Thus, my computer is approximately 11 billion times faster than I am. I always thought I was a little slow. lol. So, how long would it take to LL test MM127 (5.122 x 10^37 digits)? This number is approximately 5.122 x 10^30 times larger than a 10 million digit number, so it would take 2.623 x 10^61 times longer. Therefore, to test 2^(2^127-1)-1 with only pen and paper would require some 1.399903 x 10^70 years! This isn't even considering the fact that this would take approximately 10^72 sheets of paper and 10^71 ink pens, and there isn't even enough material in the Universe to construct all of these. Furthermore, this test would only credit you with 1.9 x 10^62 P90-CPU years, so it would hardly be worth your time (unless, of course, it proved PRIME, which I believe it probably is). This test would even take about 2.5 x 10^60 years on my computer (assuming I could somehow manage to find a 10^29 gigabyte hard drive).

P.S. The Universe definately WILL be dust in 1.4 x 10^70 years! After all, all protons will decay in ~10^37 years and all stellar black holes will decay in about 10^67 years. Unfortunately, the odds of you living to complete this insane task are infinity to one, as your protons will decay after 1/10^33rd of that time, assuming you even lived that long (10^37 years), at which the odds against THAT are worse than Graham's number to one. I will not even attempt to explain in words the size of the number (it is even bigger than 10^10^10^thisisinsane^10^10^...) Okay, whatever. I have more important things to worry about. I have a LL test on M35,338,627 finishing in less than five days! Wish me good luck.

StarQwest 2006-05-04 03:30

Okay, I admit it. I am currently addicted to GIMPS (After all, I am the guy spending 11 months LL testing M100,000,007, which has 30,103,002 digits). However, I do not wish to seek professional help. lol.

jinydu 2006-05-04 05:37

[QUOTE=StarQwest]After all, all protons will decay in ~10^37 years[/QUOTE]

Actually, as far as I know, we don't know for sure that protons do decay; although several theories predict they do, no proton decays have ever been observed experimentally...

Of course, that is rather irrelevant to both the purpose of this thread and the last few posts.

jinydu 2006-05-04 22:03

... you try to restore this thread to the topic of what you do if you might be addicted to GIMPS.

StarQwest 2006-05-04 23:07

You just might be addicted to GIMPS if:

You cry every time one of your LL tests comes up composite, and you can't wait for the next test to finish, so you can cry when it comes up composite too.

Uncwilly 2006-05-05 02:31

... you try to figure out if the display computers at the local shop, just might be connected to the net, so that you can borg them.

edorajh 2006-05-05 08:24

... you make a post in a thread just because it will be a prime number post in thread

(guilty - this is post #541 in this thread, and 541 is a prime!)

Primeinator 2006-05-07 01:06

...If you are planning to write your extended essay for the I.B. program (International Baccalaureate) on a prime number related topic. (like what I'll be doing)

Uncwilly 2006-05-10 23:38

[QUOTE=Uncwilly]You set up your machine to poll primenet hourly and then page/text you when a new prime has been found.[/QUOTE]

Anyone want to set up one of these?

jinydu 2006-05-12 01:58

[QUOTE=Uncwilly]You set up your machine to pole primenet hourly and then page/text you when a new prime has been found.[/QUOTE]

... you chuckle because a competitor is wasting precious CPU cycles.


All times are UTC. The time now is 22:53.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.