![]() |
![]() |
#1838 | |
"Curtis"
Feb 2005
Riverside, CA
3×1,579 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#1839 |
"Curtis"
Feb 2005
Riverside, CA
473710 Posts |
![]()
A double-check on my i7-haswell (linux-sllr64) confirms compositeness. Next time I see the machine that found this "prime", I'll make sure I didn't transpose digits when I copied down the exponent; but that's pretty unlikely with 3 consecutive zeros.
|
![]() |
![]() |
![]() |
#1840 |
"W. Byerly"
Aug 2013
1423*2^2179023-1
103 Posts |
![]()
Since we are on the subject of consecutive large primes with small n gaps, here is a pair I found a while back:
1423*2^2179023-1 1423*2^2178363-1 The most interesting thing about this pair is that the k value has very low nash weight of just 309. It would be interesting if we could define a function that takes in the gap size, nash weight, and n size and outputs another number representing the "rarity" of the pair. |
![]() |
![]() |
![]() |
#1841 |
"Dave"
Sep 2005
UK
53308 Posts |
![]()
49*2^4360869-1 (1312755 digits)
49*2^4365175-1 (1314051 digits) |
![]() |
![]() |
![]() |
#1842 |
Feb 2003
22·32·53 Posts |
![]() |
![]() |
![]() |
![]() |
#1843 |
Nov 2003
2×1,811 Posts |
![]()
Hi Dave, Congrats on nice primes!
Congrats also to Trilo on his pair. |
![]() |
![]() |
![]() |
#1844 |
Dec 2017
2·5 Posts |
![]()
How long did your computer take to test it? And how many GHz has your computer?
|
![]() |
![]() |
![]() |
#1845 |
"Dave"
Sep 2005
UK
1010110110002 Posts |
![]()
The first took 6300s to test on a 3.6 GHz Ivy Bridge CPU. The second was tested on a 2.9 GHz Haswell CPU. I currently don't have access to the timing but given that it has AVX2, I would expect it to be at least as fast as the other despite the lower clock speed.
|
![]() |
![]() |
![]() |
#1846 |
Dec 2017
10102 Posts |
![]()
Thank you! amphoria. I am a new member.
|
![]() |
![]() |
![]() |
#1847 |
"Curtis"
Feb 2005
Riverside, CA
3×1,579 Posts |
![]()
229*22581111-1 is prime. 776995 digits.
|
![]() |
![]() |
![]() |
#1848 |
Feb 2003
22×32×53 Posts |
![]()
From our 7th drive:
2715*2^1629931-1 (490662 digits) 2715*2^1640137-1 (493734 digits) |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
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 |