mersenneforum.org  

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

Reply
 
Thread Tools
Old 2022-07-30, 19:32   #1
Alex
 
Alex's Avatar
 
"Alex_soldier (GIMPS)"
Aug 2020
www.Mersenne.ru

3·7 Posts
Plus 77777*2^n+1

Hello.
My next challenge is 77777*2^n+1 with n = [1..25.000.000]
NASH = 374 (low weight)

Sieved up to p = 1e14
Passed n = [1..1.000.000] (8119 tests).

Code:
77777*2^15+1 is prime! (10 decimal digits, Trial divisions)  Time : 0.282 ms.
77777*2^103+1 is prime! (36 decimal digits, APRCL test)  Time : 20.084 ms.
77777*2^223+1 is prime! (73 decimal digits, APRCL test)  Time : 245.466 ms.
77777*2^1063+1 is prime! (325 decimal digits)  Time : 65.969 ms.
77777*2^34087+1 is prime! (10267 decimal digits)  Time : 3.796 sec. - First found in 1999 by Pavlos Saridis
Confirmed 5 small primes.
No new primes found yet.
Alex is offline   Reply With Quote
Old 2023-01-03, 21:43   #2
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

57308 Posts
Default

Your edits in the PrimeWiki for reaching n=2M is not valid, as along as you don't give here a reference and a resultfile (zip for n=1 to 2.0M).
Do not reactivate your old entry I've deleted today again.
kar_bon is offline   Reply With Quote
Old 2023-01-06, 23:19   #3
Alex
 
Alex's Avatar
 
"Alex_soldier (GIMPS)"
Aug 2020
www.Mersenne.ru

3·7 Posts
Plus Checked to n = 2.000.000

Quote:
Originally Posted by kar_bon View Post
...
Hello.
Status updated at 2022-11-30:

Sieved up to p = 1.7e14
Passed n = [1.000.001..2.000.000] (7563 tests).

No new primes found yet.
Attached Files
File Type: zip Proth-k77777-n01M.zip (150.9 KB, 7 views)
File Type: zip Proth-k77777-n02M.zip (150.7 KB, 14 views)
Alex is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 18:50.


Fri Mar 31 18:50:53 UTC 2023 up 225 days, 16:19, 0 users, load averages: 0.50, 0.65, 0.70

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, 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.

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