![]() |
![]() |
#1 | |
"Jason Goatcher"
Mar 2005
3·7·167 Posts |
![]()
Found here.
Quote:
|
|
![]() |
![]() |
![]() |
#2 |
"Phil"
Sep 2002
Tracktown, U.S.A.
25×5×7 Posts |
![]()
Only a coincidence in that the researchers proved that the largest prime must be greater than 10^7, the second largest prime must be greater than 10^4, and the third must be greater than 10^2. With greater computing resources, these limits could undoubtedly be pushed higher, but it was decided to stop at a power of 10 in each case.
|
![]() |
![]() |
![]() |
#3 | |
"Jason Goatcher"
Mar 2005
3·7·167 Posts |
![]() Quote:
![]() |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Search restrictions | fivemack | Forum Feedback | 17 | 2017-04-27 15:18 |
Modular restrictions on factors of Mersenne numbers | siegert81 | Math | 23 | 2014-03-18 11:50 |
Ill-chosen password restrictions | James Heinrich | Puzzles | 42 | 2011-11-24 16:03 |