|
2018-10-29, 18:05
|
#23 |
Aug 2006
5,987 Posts |
So the winner so far is N = 2^13372531+1 = 3p = 1 (mod 2^13372531).
 Are there any other classes of large (pseudo-)primes that can be brought to bear? |
|
|
|
2018-10-29, 19:34
|
#25 |
|
Aug 2006
5,987 Posts |
Well, since the prp Dr Sardonicus chose is atop the list, and the 18 known primes which are larger are not of the requisite form, I think we can call this done for now.
https://primes.utm.edu/top20/page.php?id=3 |
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Tentative conjecture | devarajkandadai | Number Theory Discussion Group | 10 | 2018-07-22 05:38 |
| benchmarks over-clock definition? | lfm | PrimeNet | 4 | 2009-11-15 00:43 |
| Mersenne Numbers: Definition | R.D. Silverman | Math | 47 | 2009-09-24 05:23 |
| Project Definition | Greenbank | Octoproth Search | 4 | 2007-12-07 18:41 |
| Mathematics definition | Damian | Lounge | 1 | 2007-05-27 13:30 |
