:banana: :banana: Go Portland! :banana: Go Portland! :banana: Go Portland! :banana: :banana:

GAH! Someone edit that last post and get rid of some of those bananas! They're wasting FAR too many CPU cycles! :wink:

[QUOTE=jinydu]"Think of the biggest number you can and then double it, triple it, quadruple it. Sky's the limit.
You still won't be in Josh Findley's stratosphere. And you definitely won't be in the orbit of the tens of thousands of people who join him in a strange, unabashedly geeky quest for the largest prime number known to man." I'm sure people have heard of the googolplex before. Its much bigger than M41.[/QUOTE] Fermat numbers 0wnz googleplex. :grin: 
F333 is the first Fermat number bigger than a googolplex.
But in order for a Mersenne number to be bigger than a googolplex, the exponent most be over 3.32192809 googol! 
[QUOTE=Prime95]Our first U.S. newspaper report:
[url]http://seattletimes.nwsource.com/html/localnews/2001952730_findley10e.html[/url][/QUOTE] I'd rate that write up as one of my favorites. Now, M42 where are you? :question: 
Satisfying the New Mersenne Conjecture
Satisfying the New Mersenne Conjecture
Finally, 58*13466917+1 divides (2^13466917+1)/3, so the NMC remains alive. Another result  486*24036583+1 divides (2^24036583+1)/3, so the New Mersenne Conjecture still holds. 
Off Topic  New Mersenne Conjecture.
Here is what they establish the New Mersenne Conjecture.
Let p be any odd natural number. If two of the following conditions hold, then so does the third: 1) p = 2^k +/ 1 or p = 4^k +/ 3 2) 2^p  1 is a prime 3) (2^p + 1)/3 is a prime 
All times are UTC. The time now is 19:34. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2020, Jelsoft Enterprises Ltd.