mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2021-10-22, 15:57   #287
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

19×523 Posts
Default

Quote:
Originally Posted by pepi37 View Post
If I may ask how many candidates remain after that ?
Sure.
Attached Thumbnails
Click image for larger version

Name:	K_w.png
Views:	99
Size:	11.6 KB
ID:	26004  
Batalov is offline   Reply With Quote
Old 2021-10-22, 17:44   #288
bur
 
bur's Avatar
 
Aug 2020
79*6581e-4;3*2539e-3

60110 Posts
Default New Primorial Prime found

Recently a new -1 type primorial prime was found at PRPNet.

3267113# - 1

It has 1418398 digits, making it the largest known one. The last -1 primorial prime was found more than 9 years ago, so this is quite the finding. The last +1 primorial prime hit is from 2001 btw. 20 years ago. :D

I think it's an interesting type of prime due to its involvement in Euclid's proof of the infinitude of primes. Not many people seem to hunt for them though and they seem somewhat scarce taking into account that N+-1 has lots of factors.

MODERATOR NOTE: Moved to this thread, which already has this post and several followups related to this number.

Last fiddled with by Dr Sardonicus on 2021-10-23 at 02:37
bur is offline   Reply With Quote
Old 2021-10-22, 18:03   #289
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

11·389 Posts
Default

Quote:
Originally Posted by bur View Post
Recently a new -1 type primorial prime was found at PRPNet.

3267113# - 1

It has 1418398 digits, making it the largest known one. The last -1 primorial prime was found more than 9 years ago, so this is quite the finding. The last +1 primorial prime hit is from 2001 btw. 20 years ago. :D

I think it's an interesting type of prime due to its involvement in Euclid's proof of the infinitude of primes. Not many people seem to hunt for them though and they seem somewhat scarce taking into account that N+-1 has lots of factors.
PRP tests for these are quite quick, compared to proofs. However they need generic modular reduction for Fermat PRP tests, whereas small-k Riesel and Proth prime run 4x (?) faster using a special mod.

The rarity of these numbers might put the next beyond the powers of Batalov-Propper.

MODERATOR NOTE: Moved to this thread, which already has this post and several followups related to this number.

Last fiddled with by Dr Sardonicus on 2021-10-23 at 02:38
paulunderwood is offline   Reply With Quote
Old 2021-10-25, 17:34   #290
bur
 
bur's Avatar
 
Aug 2020
79*6581e-4;3*2539e-3

601 Posts
Default

Thanks for moving the post.
Quote:
The rarity of these numbers might put the next beyond the powers of Batalov-Propper.
Who knows, it's not like where GIMPS is currently at where 20M+ consecutive candidates are composite - at least I don't think so.



I always forget the estimate for the digit size of primorials but the FFT size remains very managable even up to 20,000,000# where it's 3M.


So if anyone was willing to put some larger ressources towards primorials or factorials, I'm pretty sure it'll yield some nice results before ending up in GIMPS waters.
bur is offline   Reply With Quote
Old 2021-10-25, 20:53   #291
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

23·32·83 Posts
Default

Quote:
Originally Posted by bur View Post
I always forget the estimate for the digit size of primorials but the FFT size remains very managable even up to 20,000,000# where it's 3M.
The number of decimal digits in pk is roughly pk/ln(10). We have

? 3267113/log(10)
%1 = 1418889.1476543787883927627556683863802

As indicated above, 3267113# - 1 actually has 1418398 digits.

The estimate is a consequence of the Prime Number Theorem, which gives the asymptotic estimate

ln(pk#) = ln(2) + ln(3) + ... + ln(pk) ~ pk
Dr Sardonicus is offline   Reply With Quote
Old 2022-01-10, 19:42   #292
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

427910 Posts
Default 288465! + 1

Congrats to René Dohmen for the new factorial prime 288465! + 1 (1,449,771 decimal digits)
paulunderwood is offline   Reply With Quote
Old 2022-01-10, 22:07   #293
unconnected
 
unconnected's Avatar
 
May 2009
Moscow, Russia

281910 Posts
Default

Seems that this prime was found outside of Factorial Prime Search by Primegrid.
unconnected is online now   Reply With Quote
Old 2022-01-10, 22:39   #294
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

427910 Posts
Default

Quote:
Originally Posted by unconnected View Post
Seems that this prime was found outside of Factorial Prime Search by Primegrid.
Sniped!
paulunderwood is offline   Reply With Quote
Old 2022-01-10, 23:30   #295
rudy235
 
rudy235's Avatar
 
Jun 2015
Vallejo, CA/.

113010 Posts
Default

Time to update
https://oeis.org/A002982
rudy235 is offline   Reply With Quote
Old 2022-01-11, 01:32   #296
mathwiz
 
Mar 2019

12E16 Posts
Default

Quote:
Originally Posted by rudy235 View Post
I think you mean https://oeis.org/A002981?
mathwiz is offline   Reply With Quote
Old 2022-01-11, 07:32   #297
rudy235
 
rudy235's Avatar
 
Jun 2015
Vallejo, CA/.

100011010102 Posts
Default

Quote:
Originally Posted by mathwiz View Post
I think you mean https://oeis.org/A002981?
Exactly! N! + 1
I misread the post.
rudy235 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Mersenne Primes p which are in a set of twin primes is finite? carpetpool Miscellaneous Math 4 2022-07-14 02:29
Patterns in primes that are primitive roots / Gaps in full-reptend primes mart_r Prime Gap Searches 14 2020-06-30 12:42
Distribution of Mersenne primes before and after couples of primes found emily Math 34 2017-07-16 18:44
Conjecture about Mersenne primes and non-primes v2 Mickey1 Miscellaneous Math 1 2013-05-30 12:32
possible primes (real primes & poss.prime products) troels munkner Miscellaneous Math 4 2006-06-02 08:35

All times are UTC. The time now is 16:31.


Mon Sep 26 16:31:18 UTC 2022 up 39 days, 13:59, 1 user, load averages: 2.59, 2.43, 2.30

Powered by vBulletin® Version 3.8.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.

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