YMN The Young Mathematicians' Network
Serving the Community of Young Mathematicians
Sections: Front Page   Job Search   Grad Life   Career   Work and Family Life   Editors   Misc   Research   Teaching   Undergrad Life   Events   News
Big news in Number Theory Research
By jvano
Posted Mon Aug 19, 2002 at 03:54:22 PM PDT
If you haven't heard yet, three Indian Mathematicians have found a `polynomial time' algorithm which determines whether or not a large integer is prime. This has long been thought of one of the main hard open questions in computational number theory. You can read more about this here and even get their paper here.

Post a Comment

< Jenn's Joke | Proposal Reviews at the National Science Foundation >
Display: Sort:
Big news in Number Theory | 1 comment (1 topical, 0 hidden)
[new] Still slower than Rubin-Miller (none / 0) (#1)
by SeminoleNo1 on Fri Aug 30, 2002 at 03:18:52 AM PDT

It is supposedly still much slower than Rubin-Miller, but maybe someone will be inspired by it to produce a faster one.

Still, R-M only "verifies" probablistic primes, so for solidified security, this is good news -- if you can afford or need the time.





Big news in Number Theory | 1 comment (1 topical, 0 hidden)
Display: Sort:
Menu
create account
FAQ
Search
Recent Comments

Login
Make a new account
Username:
Password:

Related Links
here
here [2]
Also by jvano

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