YMN The Young Mathematicians' Network
Serving the Community of Young Mathematicians
Sections: Front Page   Career   Diaries   Editors   Work and Family Life   Grad Life   Job Search   Misc   Paths to Math   Research   Teaching   Undergrad Life   Events   Frequently Asked Questions   News
Researchers find new prime number Research

By Anonymous Hero
Posted Wed Jan 04, 2006 at 01:46:35 PM PDT
Here's the story plus link:

http://news.yahoo.com/s/ap/20060104/ap_on_sc/largest_prime_number

By GARANCE BURKE, Associated Press Writer
Tue Jan 3, 10:09 PM ET

KANSAS CITY, Mo. - Researchers at a Missouri university have identified the largest known prime number, officials said Tuesday.

The team at Central Missouri State University, led by associate dean Steven Boone and mathematics professor Curtis Cooper, found it in mid-December after programming 700 computers years ago.

A prime number is a positive number divisible by only itself and 1 -- 2, 3, 5, 7 and so on.

The number that the team found is 9.1 million digits long. It is a Mersenne prime known as M30402457 -- that's 2 to the 30,402,457th power minus 1.

Mersenne primes are a special category expressed as 2 to the "p" power minus 1, in which "p" also is a prime number.

"We're super excited," said Boone, a chemistry professor. "We've been looking for such a number for a long time."

The discovery is affiliated with the Great Internet Mersenne Prime Search, a global contest using volunteers who run software that searches for the largest Mersenne prime.

Post a Comment

< Which Undergrad Subjects Should I Learn? | BLS Occupational Outlook Handbook on Mathematicians >
Display: Sort:
Researchers find new prime number | 0 comments (0 topical, 0 hidden)
Display: Sort:
Menu
create account
FAQ
Search
Recent Comments

Login
Make a new account
Username:
Password:

Related Links
Also by Anonymous Hero

SourceForge Logo Powered by Scoop
All trademarks and copyrights on this page are owned by their respective companies. Comments are owned by the Poster. The Rest

create account | faq | search