![]() |
![]() |
#45 | |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
266616 Posts |
![]() Quote:
I only need ~20 to hit CPAP-8. The pyramid constant for this form with a certain level of sieving is 20. Pyramid goes like this: you test candidates, 1/20 of them yields hits of 1st order, 1/202 of them yields hits of 2nd order, etc... (each level is ~1/20) Currently: Code:
53367736 ..6937 2664600 ..7147 132644 ..7357 6621 ..7567 309 ..7777 24 ..7987 --> 1/20 of these can have a hit at ..6727 (i.e. CPAP-7) 1 ..8197 --> CPAP-7, 1/20 of these can have a hit at ..6727 (i.e. CPAP-8) 0 ..8417 --> CPAP-8, 1/20 of these can have a hit at ..6727 (i.e. CPAP-9) |
|
![]() |
![]() |
![]() |
#46 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
231468 Posts |
![]()
CPAP-8 is found [early, actually] (also improves CPAP-7):
8081110034864*619#+x253+210*n, n=1..8 (272 digits) CPAP-7 new record is (interim): 8081110034864*619#+x253+210*n, n=2..8 |
![]() |
![]() |
![]() |
#47 |
Jan 2007
Germany
2×239 Posts |
![]()
>Define B1 !
B1=1 I know, there a not all 100% composite but it is possible that k*1261#/2154317507668859+d,d=0,....1260 the only 7 primes. I wish I had your CPU-park, Serge ! Last fiddled with by Cybertronic on 2021-11-15 at 07:04 |
![]() |
![]() |
![]() |
#48 | |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2×5×983 Posts |
![]() Quote:
That's why the construction of those x99, x253 and xOther addends is genial (they remove all that guess work), and "my"* x10 for CPAP-4-6 is also quite good (*I am pretty sure that I only "re"discovered it. I did put it to good practical use though.) |
|
![]() |
![]() |
![]() |
#49 |
Jan 2007
Germany
2×239 Posts |
![]() |
![]() |
![]() |
![]() |
#50 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
100110011001102 Posts |
![]()
A new CPAP-9 updated record
7661619169627*379#+x153+210*n, n=0..8 (167 digits) where Code:
x153=965638364011503965472274037609810695853057694474510858763504060537115782698320398681243637298572057965220341992180981784112973206136355565433981118807417 This is not perfect for CPAP-9; you have to go small so the modulo leaves sacrifices in the sequence of [N .. N+1680]; note that the perfect presieved x253 has no sacrificed holes. x153 leaves 30 holes so you have to work for a while so that no intermingling primes creep in the 30 holes ... but the stats is on our side. You search for a while and you find one. Next stop: updated CPAP-10. |
![]() |
![]() |
![]() |
#51 |
Jan 2007
Germany
2×239 Posts |
![]()
Congratulation Serge !
Site is updated: https://www.pzktupel.de/JensKruseAndersen/CPAP.htm |
![]() |
![]() |
![]() |
#52 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·5·983 Posts |
![]() |
![]() |
![]() |
![]() |
#53 |
Jan 2007
Germany
47810 Posts |
![]() |
![]() |
![]() |
![]() |
#54 |
Jan 2007
Germany
2·239 Posts |
![]()
Also I have now refreshed the CPAP-site.
It is more compact and CPAP-k history have more than 10 now. http://www.pzktupel.de/JensKruseAndersen/CPAP.htm regards Norman |
![]() |
![]() |
![]() |
#55 |
Jan 2007
Germany
1110111102 Posts |
![]()
BTW, the overworked page of CC is also online.
https://www.pzktupel.de/JensKruseAndersen/cc.htm |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Exponent Progression | storm5510 | Information & Answers | 15 | 2017-07-26 18:02 |
Bertrand's Theorem for Arithmetic Progression | literka | Math | 0 | 2013-06-01 12:42 |
sieving primes in arithmetic progressions | maxal | Software | 18 | 2010-10-04 17:11 |
nth prime number in an arithmetic progression | Unregistered | Information & Answers | 1 | 2010-04-04 22:06 |
Arithmetic and Polynomial Progression of Primes? | drake2 | Math | 13 | 2006-10-10 00:43 |