![]() |
|
|
#1772 |
|
"Dave"
Sep 2005
UK
1010110110002 Posts |
You wait around for ages for a prime ... and then 3 come along at once!
4063*2^2309263-1 (695162 digits) 4063*2^2310187-1 (695440 digits) 4063*2^2313843-1 (696540 digits) |
|
|
|
|
|
#1773 | |
|
Dec 2011
After milion nines:)
101101010112 Posts |
Quote:
Congratulations! And in average you wait about 10 days between primes, not ages :) |
|
|
|
|
|
|
#1774 |
|
"Dave"
Sep 2005
UK
23×347 Posts |
The reference was intended to be for k=4063 where the last prime was for n=738843, although in reality I was just stealing the saying about buses (at least in the UK).
|
|
|
|
|
|
#1775 |
|
Dec 2011
After milion nines:)
1,451 Posts |
|
|
|
|
|
|
#1776 |
|
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
3·17·97 Posts |
143*2^2007888-1 is prime! (604437 decimal digits) Time : 1351.837 sec. from SMD.
|
|
|
|
|
|
#1777 |
|
"Curtis"
Feb 2005
Riverside, CA
22·1,217 Posts |
13*23527315-1. 1061829 digits.
That's 3 over 3M for k=13, and 5 over 2M! |
|
|
|
|
|
#1778 |
|
Sep 2002
Database er0rr
2·32·11·19 Posts |
|
|
|
|
|
|
#1779 |
|
"NOT A TROLL"
Mar 2016
California
197 Posts |
![]() :chicken: :rainbow: :fireworks: How do you do these things? How to find a prime like the one above except 52*3^n+/-1, or some other k. b = 2 to 16 (the bases) Last fiddled with by PawnProver44 on 2016-04-15 at 06:52 |
|
|
|
|
|
#1780 | |
|
Sep 2002
Database er0rr
2·32·11·19 Posts |
Quote:
![]() If you are bent on finding a mega-prime, start with testing those. (mods please feel free to detach this sub-thread) |
|
|
|
|
|
|
#1781 |
|
"Dave"
Sep 2005
UK
23·347 Posts |
4161*2^2240358-1 (674419 digits)
|
|
|
|
|
|
#1782 |
|
"Dave"
Sep 2005
UK
AD816 Posts |
4161*2^2326875-1 (700463 digits)
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Inefficient behaviour in yafu when doing large NFS with lots of threads | 2147483647 | YAFU | 3 | 2016-12-25 21:44 |
| Lots of roundoff errors | TheMawn | Software | 18 | 2014-08-16 03:54 |
| POST LOTS AND LOTS AND LOTS OF PRIMES HERE | lsoule | Riesel Prime Search | 1999 | 2010-03-17 22:33 |
| lots of large primes | Peter Hackman | Factoring | 2 | 2008-08-15 14:26 |
| How do I get computer to do lots of little tasks? | jasong | Information & Answers | 4 | 2007-10-04 20:40 |