mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Five or Bust - The Dual Sierpinski Problem

Reply
 
Thread Tools
Old 2010-10-13, 18:28   #320
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA

11000100110102 Posts
Default

Quote:
Originally Posted by Cybertronic View Post
Hello, can anyone send me a www.sendspace.com link for downloading the latest version of windows-pfgw 3.4.1 ?

http://openpfgw.svn.sourceforge.net/...7.zip?view=log

I have ever trouble with "sourceforge.net".

Thanks !

This thread is enough.
Here you go: http://www.sendspace.com/file/1dmq5y
mdettweiler is offline   Reply With Quote
Old 2010-10-13, 18:31   #321
Cybertronic
 
Cybertronic's Avatar
 
Jan 2007
Germany

3×239 Posts
Default

I believe the original zip-file have bugs ,or ?

-------------

@mdettweiler

Thank you !

Last fiddled with by Cybertronic on 2010-10-13 at 18:43
Cybertronic is online now   Reply With Quote
Old 2011-03-06, 00:50   #322
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

65748 Posts
Default

LLR now has the option of the BPSW primality test as well as the Frobenius test: http://www.mersenneforum.org/showthread.php?t=15332

http://www.trnicely.net/misc/bpsw.html
http://mathworld.wolfram.com/Baillie...alityTest.html

Code:
2^56366+39079 is base 2-Strong Fermat PRP!  Time : 5.705 sec.
2^56366+39079 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = -3, D = 13)  Time : 20.933 sec.
2^61792+21661 is base 2-Strong Fermat PRP!  Time : 5.952 sec.
2^61792+21661 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 2, D = -7)  Time : 21.883 sec.
2^73360+10711 is base 2-Strong Fermat PRP!  Time : 7.675 sec.
2^73360+10711 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 2, D = -7)  Time : 29.307 sec.
2^73845+14717 is base 2-Strong Fermat PRP!  Time : 7.968 sec.
2^73845+14717 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = -3, D = 13)  Time : 31.113 sec.
2^103766+17659 is base 2-Strong Fermat PRP!  Time : 16.176 sec.
2^103766+17659 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 3, D = -11)  Time : 60.245 sec.
2^104095+7013 is base 2-Strong Fermat PRP!  Time : 17.081 sec.
2^104095+7013 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = -7, D = 29)  Time : 64.099 sec.
2^105789+48527 is base 2-Strong Fermat PRP!  Time : 16.764 sec.
2^105789+48527 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = -4, D = 17)  Time : 61.494 sec.
2^139964+35461 is base 2-Strong Fermat PRP!  Time : 33.342 sec.
2^139964+35461 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 2, D = -7)  Time : 129.441 sec.
2^148227+60443 is base 2-Strong Fermat PRP!  Time : 33.912 sec.
2^148227+60443 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 2, D = -7)  Time : 130.399 sec.
2^176177+60947 is base 2-Strong Fermat PRP!  Time : 56.482 sec.
2^176177+60947 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 5, D = -19)  Time : 221.824 sec.
2^304015+64133 is base 2-Strong Fermat PRP!  Time : 148.693 sec.
2^304015+64133 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 3, D = -11)  Time : 622.268 sec.
2^308809+37967 is base 2-Strong Fermat PRP!  Time : 147.017 sec.
2^308809+37967 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = -7, D = 29)  Time : 618.084 sec.
2^551542+19249 is base 2-Strong Fermat PRP!  Time : 541.642 sec.
2^551542+19249 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = -3, D = 13)  Time : 2477.977 sec.
I'm working on the last 7 prps.

Last fiddled with by ATH on 2011-03-06 at 00:52
ATH is offline   Reply With Quote
Old 2011-03-06, 13:00   #323
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

22·863 Posts
Default

2^983620+60451 is base 2-Strong Fermat PRP! Time : 1765.694 sec.
2^983620+60451 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 3, D = -11) Time : 9495.456 sec.
2^1191375+8543 is base 2-Strong Fermat PRP! Time : 2585.068 sec.
2^1191375+8543 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 3, D = -11) Time : 12651.006 sec.
2^1518191+75353 is base 2-Strong Fermat PRP! Time : 4108.723 sec.
2^1518191+75353 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 6, D = -23) Time : 21756.783 sec.
ATH is offline   Reply With Quote
Old 2011-03-10, 12:46   #324
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

345210 Posts
Default

2^2249255+28433 is base 2-Strong Fermat PRP! Time : 9788.623 sec.
2^2249255+28433 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 2, D = -7) Time : 41861.086 sec.
2^4583176+2131 is base 2-Strong Fermat PRP! Time : 45341.497 sec.
2^4583176+2131 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 2, D = -7) Time : 263278.015 sec.
2^5146295+41693 is base 2-Strong Fermat PRP! Time : 62297.273 sec.
2^5146295+41693 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 2, D = -7) Time : 327043.150 sec.

Jeff Gilchrist is doing 2^9092392+40291
http://www.mersenneforum.org/showthread.php?t=15242

Last fiddled with by ATH on 2011-03-10 at 12:50
ATH is offline   Reply With Quote
Old 2011-03-20, 00:35   #325
Jeff Gilchrist
 
Jeff Gilchrist's Avatar
 
Jun 2003
Ottawa, Canada

3×17×23 Posts
Default

2^9092392+40291 is base 2-Strong Fermat PRP! Time : 190718.322 sec.
2^9092392+40291 is strong-Fermat and BPSW PRP, Starting Frobenius test sequence
2^9092392+40291 is strong-Fermat, BPSW and Frobenius PRP! (P = 1, Q = 3, D = -11) Time : 953429.151 sec.
Jeff Gilchrist is offline   Reply With Quote
Old 2011-04-15, 13:52   #326
Dead J. Dona
 
Feb 2007
Kiev, Ukraine

3×7 Posts
Default

How long it takes to test whether 2^56366+39079 is a prime?

And how 2^5146295+41693?
Dead J. Dona is offline   Reply With Quote
Old 2011-04-18, 16:18   #327
philmoore
 
philmoore's Avatar
 
"Phil"
Sep 2002
Tracktown, U.S.A.

19×59 Posts
Default

For 256366+39079, Norman estimated 18 months on a 3.4 GHz Phenom II X4 965. Perhaps with the newer version of Primo and a faster computer, maybe a little less, but who knows? More cores would be better, of course.

On the other hand, I estimated 225 billion years for 25146295+41693 via ECPP, maybe only 60 billion years (on a single processor) if we could prove the generalized Riemann hypothesis:
http://www.mersenneforum.org/showthread.php?t=12784
philmoore is offline   Reply With Quote
Old 2012-01-25, 19:41   #328
enderak
 
enderak's Avatar
 
Feb 2009

3×13 Posts
Default

There's a new Primo version, 4.0.0 which is not only 64-bit but uses multiple cores (up to 16). Looks like it runs on Linux only, and is still an alpha version.

I don't have a spare computer with decent specs to install Linux on and test it out, but it looks like it might open the door to proving a few more of the PRP's.

Link: http://www.ellipsa.eu/public/primo/primo.html

Last fiddled with by enderak on 2012-01-25 at 19:41 Reason: Added link
enderak is offline   Reply With Quote
Old 2012-05-31, 19:28   #329
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

22×52×7 Posts
Default

OK, I'll bite and try to prove the next two candidates in the list.
Puzzle-Peter is offline   Reply With Quote
Old 2012-06-29, 14:20   #330
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

12748 Posts
Default

I'm taking a 3 week break now. Both tests have eliminated ~3500 bits so far. The smaller one is taking less time per step but the gains per step are smaller and there is more backtracking. So they are nearly equally fast atm.
Puzzle-Peter is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
2^9092392+40291 is a probable prime! engracio Five or Bust - The Dual Sierpinski Problem 91 2023-03-06 21:22
generalized minimal (probable) primes sweety439 sweety439 140 2022-12-20 07:08
probable largest prime. sudaprime Miscellaneous Math 11 2018-02-05 08:10
Hi, how can I test my probable prime number? mohdosa Information & Answers 22 2014-10-10 11:34
Record probable prime found! philmoore Five or Bust - The Dual Sierpinski Problem 18 2009-01-28 19:47

All times are UTC. The time now is 15:41.


Fri Jul 7 15:41:16 UTC 2023 up 323 days, 13:09, 0 users, load averages: 1.46, 1.29, 1.16

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.

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