mersenneforum.org Primes Arithmetic Progression (PAP) and CPAP
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2021-09-25, 22:50   #23
Batalov

"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

7·23·61 Posts

Quote:
 Originally Posted by Dr Sardonicus Just out of curiosity, I wrote a Pari-GP script to check this number for factors up to 2^28, and there were none.
I sieved to 2^37-ish iirc, so ..good! My sieve doesn't have a bug.

The middle part primes (array of Yi) are of course known, - and I do add a comment to them. That comment will make them live longer than they would given the rate the Top5000 grows.

Those "Arithmetic progression (2,d=...)" primes are:As for the "Arithmetic progression (1,d=...)" primes, they owe their digital life to me: they were not eligible for Top5000 when they were found (they are vanity primes and were found exclusively to pump up "PrimeGrid credits"), and now that I made them members of the AP-3 chain - they are. PrimeGrid is credited as a project that found them. ~Half of the seed array of Xj is actually in Top5000 in expired state; to those I will merely add a comment.

 2021-09-26, 01:25 #24 Dr Sardonicus     Feb 2017 Nowhere 5×1,153 Posts With a = 33*2^2939064 - 5606879602425*2^1290000 - 1 and d = 33*2^2939063 - 5606879602425*2^1290000, a == 2 (mod 5) and d == 4 (mod 5), so a + 2*d is divisible by 5. Thus a, a + d, a + 2d is not a 3-term AP of primes. 5606879602425*2^1290000 - 1 No prime factors < 2^28. 33*2^2939063 - 1 prime (table lookup) 33*2^2939064 - 5606879602425*2^1290000 - 1 99*2^2939063 - 5606879602425*2^1290001 - 1 33*2^2939065 - 16820638807275*2^1290000 - 1 Divisible by 5 Estimates of base-ten logs of a - d, a, a + d: (log(33)+2939063*log(2))/log(10) 884747.64066010744143595512237352714687 (log(33)+2939064*log(2))/log(10) 884747.94169010310541715033611242187136 (Matches value given here.) (log(99) + 2939063*log(2))/log(10) 884748.11778136216109839241740143040198 Thus a - d, a, a + d is (presumably) a 3-term AP of primes. Luckily, a - d is an 884748 decimal digit number as well as a, so assuming this is the first term of an AP-3 the digit count is still good. If a - 2d = 5606879602425*2^1290000 - 1 happens to be prime, then a - 2d, a - d, a, a + d is a 4-term AP. But a - 2d "only" has 388342 decimal digits (base-ten log is 388341.44312776625375912068666134298687, approximately)
 2021-09-26, 01:33 #25 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 231358 Posts I did test for the 4th AP term. for the lower AP-3, 5^2 | A(4) for the higher AP-3, I have not found a trivial factor, but it is composite. A1 = 5606879602425*2^1290000-1 prime A2 = 33*2^2939063-1 prime A3 = 33*2^2939064-5606879602425*2^1290000-1 prime A4 = 99*2^2939063-5606879602425*2^1290001-1 composite
2021-09-26, 14:02   #26
Dr Sardonicus

Feb 2017
Nowhere

5·1,153 Posts

Quote:
 Originally Posted by Batalov I did test for the 4th AP term. for the lower AP-3, 5^2 | A(4) for the higher AP-3, I have not found a trivial factor, but it is composite. A1 = 5606879602425*2^1290000-1 prime A2 = 33*2^2939063-1 prime A3 = 33*2^2939064-5606879602425*2^1290000-1 prime A4 = 99*2^2939063-5606879602425*2^1290001-1 composite
So, A3 is the top, as I originally guessed and you confirmed. Obviously, I don't know which end is up.

If the common difference is d, the AP-3 is A3 - 2d, A3 - d, A3.

I assume A4 was checked for small factors, then subjected to a compositeness test that proved it to be composite, but did not reveal any factors.

 2021-09-29, 13:12 #27 Dr Sardonicus     Feb 2017 Nowhere 5×1,153 Posts In musing about APs of primes, I came upon a tantalizingly simple formula which, on the one hand very likely gives infinitely many longest-possible AP's starting with a given odd prime, but the other hand, is likely to be computationally useless for producing either AP's with large last term, or APs with large numbers of terms. Using the asymptotic formula in the Bateman-Horn conjecture shows that in either case, the prospects of success are vanishingly small. This may serve to illustrate how numerical data can fail to reflect what theory predicts. It may also serve to illustrate the level of artistry that goes into hunting for AP's of three or more terms which consist entirely of primes. Let k be a positive integer, pk the kth prime number, N = pk#, the product of the first k prime numbers. Let fj(x) = pk+1 + N*j*x, j = 1 to pk+1 - 1. Then the pk+1 - 1 polynomials fj(x) satisfy the hypotheses of the Bateman-Horn conjecture. (Note that with f0 = pk+1 however, f0 would be identically 0 (mod pk+1)) Thus, it would seem that for each positive integer k, there are infinitely many AP-pk+1's beginning with pk+1 and having common difference pk#*x for positive integer x. The first few such (with the smallest x for which the AP's consist entirely of primes) are 3, 3 + 2x, 3 + 4x (x = 1) 5, 5 + 6x, 5 + 12x, 5 + 18x, 5 + 24x (x = 1) 7, 7 + 30x, 7 + 60x, 7 + 90x, 7 + 120x, 7 + 150x, 7 + 180x (x = 5) 11, 11 + 210x, 11 + 420x, 11 + 630x, 11 + 840x, 11 + 1050x, 11 + 1260x, 11 + 1470x, 11 + 1680x, 11 + 1890x, 11 + 2100x (x = 7315048) The asymptotic formula in the Bateman-Horn conjecture indicates that for x in the vicinity of a large number X, the probability that the pk+1 - 1 degree-1 functions all yield prime values is $\frac{c_{k}}{(\log(X))^{p_{k+1}-1}}$ where for each k ck is a positive constant. The reader may verify that according to this estimate. in the vicinity of 10^884000, values of x for which 2x + 3 and 4x + 3 are both prime will be so thin on the ground, a simple-minded numerical sweep is very unlikely to find any. This is true a fortiori for the longer AP's. Likewise, as k increases, the smallest value of x for which pk+1, pk+1 + x*pk#, ..., pk+1 + (pk+1 - 1)*x*pk# are all prime, is likely to be too large for a simple-minded sweep to find it in a reasonable length of time. Last fiddled with by Dr Sardonicus on 2021-09-29 at 15:57 Reason: fignix optsy
 2021-10-15, 16:21 #28 Cybertronic     Jan 2007 Germany 1110111102 Posts AP Update Site is updated. http://www.pzktupel.de/JensKruseAndersen/aprecords.htm Incorrect or news or..., let me know. Last fiddled with by Cybertronic on 2021-10-15 at 16:22
 2021-10-16, 10:43 #29 Cybertronic     Jan 2007 Germany 7368 Posts Up to date I hope , I have caught all AP-updates in order of time. http://www.pzktupel.de/JensKruseAnde...ds.htm#records This link is now valid for later updates. Norman Last fiddled with by Cybertronic on 2021-10-16 at 10:43
 2021-10-18, 13:52 #30 Cybertronic     Jan 2007 Germany 1DE16 Posts BTW, I have extended Jens' prime page with cousin primes. You find it here: http://www.pzktupel.de/JensKruseAndersen/CPAP.htm I saw now +1 and +5 "is prime".
2021-11-06, 21:32   #31
Batalov

"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

7·23·61 Posts

Quote:
 Originally Posted by Cybertronic BTW, I have extended Jens' prime page with cousin primes. You find it here: http://www.pzktupel.de/JensKruseAndersen/CPAP.htm
For CPAP update: https://primes.utm.edu/primes/page.php?id=132893 (CPAP-4. 4285 digits)

 2021-11-06, 22:16 #32 Cybertronic     Jan 2007 Germany 1DE16 Posts Congratulation, Serge ! Site is updated: http://www.pzktupel.de/JensKruseAndersen/CPAP.htm#news
 2021-11-07, 05:26 #33 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 7·23·61 Posts And, to warm up, -- a small update to CPAP-6 (this is too small for PrimePages; working on larger size now...) 357807940468*1361#+3399421517+30*n, n=0..5 (581 digits)

 Similar Threads Thread Thread Starter Forum Replies Last Post storm5510 Information & Answers 15 2017-07-26 18:02 literka Math 0 2013-06-01 12:42 maxal Software 18 2010-10-04 17:11 Unregistered Information & Answers 1 2010-04-04 22:06 drake2 Math 13 2006-10-10 00:43

All times are UTC. The time now is 17:14.

Tue May 17 17:14:25 UTC 2022 up 33 days, 15:15, 0 users, load averages: 1.29, 1.13, 1.11

Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔