Welcome to Laser Pointer Forums - discuss green laser pointers, blue laser pointers, and all types of lasers

LPF Donation via Stripe | LPF Donation - Other Methods

Links below open in new window

ArcticMyst Security by Avery

UCLA's 13 million-digit prime number

daguin

0
Joined
Mar 29, 2008
Messages
15,989
Points
113
LOS ANGELES (AP) -- Mathematicians at UCLA have discovered a 13 million-digit prime number, a long-sought milestone that makes them eligible for a $100,000 prize.

The group found the 46th known Mersenne prime last month on a network of 75 computers running Windows XP. The number was verified by a different computer system running a different algorithm.

"We're delighted," said UCLA's Edson Smith, the leader of the effort. "Now we're looking for the next one, despite the odds."

It's the eighth Mersenne prime discovered at UCLA.

Primes are numbers like three, seven and 11 that are divisible by only two whole positive numbers: themselves and one.

Mersenne primes -- named for their discoverer, 17th-century French mathematician Marin Mersenne -- are expressed as 2P-1, or two to the power of "P" minus one. P is itself a prime number. For the new prime, P is 43,112,609.

Thousands of people around the world have been participating in the Great Internet Mersenne Prime Search, a cooperative system in which underused computing power is harnessed to perform the calculations needed to find and verify Mersenne primes.

The $100,000 prize is being offered by the Electronic Frontier Foundation for finding the first Mersenne prime with more than 10 million digits. The foundation supports individual rights on the Internet and set up the prime number prize to promote cooperative computing using the Web.

The prize could be awarded when the new prime is published, probably next year.
 





Joined
Dec 26, 2007
Messages
6,129
Points
0
that's cool!

i hope they publish a website that shows every single digit :)

(crysis for benchmarks? meh, use the 13M prime digits website!)
 
Joined
Jun 7, 2007
Messages
1,771
Points
0
so if i just randomly punch in a huge number in my calculator and try to divide it by many different numbers and they all wont evenly divide then I could win teh moneyz?
 

daguin

0
Joined
Mar 29, 2008
Messages
15,989
Points
113
mikeeey said:
so if i just randomly punch in a huge number in my calculator and try to divide it by many different numbers and they all wont evenly divide then I could win teh moneyz?


Absolutely!

However, if you're going to do it by hand, you should probably pack a lunch

Peace,
dave
 
Joined
Dec 26, 2007
Messages
6,129
Points
0
mikeeey said:
so if i just randomly punch in a huge number in my calculator and try to divide it by many different numbers and they all wont evenly divide then I could win teh moneyz?


I don't think they did it randomly..


Brute force will take you years, dave gave you great advice :p
 
Joined
Feb 28, 2008
Messages
1,809
Points
0
Mersenne primes are pretty cool. crazy useful for RSA and other factoring type algorithms :)

yay internet encryption!
 

Mirage

0
Joined
Oct 6, 2008
Messages
10
Points
0
You would think the discovery of higher primes would allow them to more simply find even higher ones more quickly with the data they possess. But it sounds like it's a lot easier said than done.
 

iewed

0
Joined
Feb 3, 2008
Messages
797
Points
0
One thing that I've been pondering about this number is, is this number larger than a googolplex?
 

daguin

0
Joined
Mar 29, 2008
Messages
15,989
Points
113
Mirage said:
You would think the discovery of higher primes would allow them to more simply find even higher ones more quickly with the data they possess. But it sounds like it's a lot easier said than done.


I think that their fingers just get tired.

Peace,
dave
 
Joined
Jul 25, 2008
Messages
504
Points
0
iewed said:
One thing that I've been pondering about this number is, is this number larger than a googolplex?
No, this has 13 million digits. A googolplex has a googol digits.
 

Switch

0
Joined
Dec 9, 2007
Messages
3,327
Points
0
Mirage said:
You would think the discovery of higher primes would allow them to more simply find even higher ones more quickly with the data they possess. But it sounds like it's a lot easier said than done.
Yes because prime numbers have no apparent rule to follow.The only method being that of keep trying, well not the only one ::) I'd imagine they used a monster back-tracking algorithm to find this, and also took quite a while. :p

so if i just randomly punch in a huge number in my calculator and try to divide it by many different numbers and they all wont evenly divide then I could win the moneyz?

Yea just imagine you have something like 748328726384763. you have to try to divide it by 27.355.597 different numbers.And this number only has 15 digits.Imagine over 10 milion digits.It's not exactly easy money. ::)
 
Joined
Oct 2, 2008
Messages
266
Points
0
I know one way to find prime numbers.... the sieve of eratosthenes. I'm not sure whether it'll apply to Mersenne Primes or that it'll work on large numbers easily. But I use this method quite often when finding real numbers.

A googleplex may be large..... but there is a number far larger than it. I mean, u can still imagine a googleplex. It's not that hard. But for this number, you get stuck at the first step.

This number is the greatest number ever used in calculation (i.e. to solve a valid problem sum, not a problem like "what's the largest number you know?") and is known as Graham's number. (I still don't have an idea of how large it is. It's really.... mindblowingly large.... and I really mean it!!!!)
 
Joined
Apr 29, 2008
Messages
1,562
Points
48
Tw15t3r said:
I still don't have an idea of how large it is. It's really.... mindblowingly large.... and I really mean it!!!!
;D ;)

About the prime number..
Wow, 13 million digits. Is this the largest prime number ever discovered (so far)?

Edit:
Yeah, it is.
 

Switch

0
Joined
Dec 9, 2007
Messages
3,327
Points
0
Well, it's not hard imaginig big numbers :D Just picture exponential or "power towers" like 10^10^10^10^10^.....10.Then you can take the Knuth's double arrow operator 10^^10=10^10^10^10^10^10^10^10^10^10.Then extend that notation to a n-tuple arrow operator 10^...^10=a big ass number whose number of digits still is enough to circle the gallaxy in nanometers ;D

Of course Graham's number would need cr@p loads of terabytes just to be written in extended form.Don't wanna do any calculations now, but it's pretty possible that all the hardware storage in the world is not enough to hold every digit of this number :p
 




Top