mersenneforum.org  

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

Reply
 
Thread Tools
Old 2012-08-10, 18:01   #331
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

22×52×7 Posts
Default

Status update:

Test 196 Bit 49147/56367
Test 153 Bit 55754/61793

The smaller one is noticeably picking up speed.
Puzzle-Peter is offline   Reply With Quote
Old 2012-08-11, 06:14   #332
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

22×52×7 Posts
Default

Quote:
Originally Posted by philmoore View Post
Primo generates a list of prime numbers:
P1 > P2 > P3 > ... > Pn plus a set of elliptic curves for each consecutive pair. P1 can be proven prime if P2 can be proven prime, P2 can be proven prime if P3 can be proven prime, and so on. The elliptic curve provides the proof.
If I understand this correctly, each Primo run not only proves the candidate, but also all the intermediate numbers P1...Pn. Would it be worth the work to collect these so if another run happens to stumble across one of them the rest of the proof could be "recycled"? Don't know about the chances of something like this happening though...
Puzzle-Peter is offline   Reply With Quote
Old 2012-08-11, 16:32   #333
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Liverpool (GMT/BST)

3×23×89 Posts
Default

Quote:
Originally Posted by Puzzle-Peter View Post
If I understand this correctly, each Primo run not only proves the candidate, but also all the intermediate numbers P1...Pn. Would it be worth the work to collect these so if another run happens to stumble across one of them the rest of the proof could be "recycled"? Don't know about the chances of something like this happening though...
The chances of this happening is so small. The chance of hitting each number at size ~2^n is around 1 in 2^n. n is > 50000 so the chance is very small indeed. 2^50000 is much larger than the number of numbers in the factordb even. By the time the numbers get small enough that it could happen it would be faster to regenerate it.
henryzz is offline   Reply With Quote
Old 2012-08-12, 05:56   #334
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

22·52·7 Posts
Default

That would be any random number. As all our numbers need to be primes the probability would be much greater. Still too small though.
Puzzle-Peter is offline   Reply With Quote
Old 2012-09-10, 14:49   #335
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

22×52×7 Posts
Default

The larger of the two runs crashed without writing a .tmp file. The screenshot shows the latest files. I sent this to M. Martin and I hope he can tell me how to resume this.
Attached Thumbnails
Click image for larger version

Name:	primo-screenshot.PNG
Views:	246
Size:	20.8 KB
ID:	8572  
Puzzle-Peter is offline   Reply With Quote
Old 2012-09-11, 17:12   #336
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

70010 Posts
Default

I was able to reconstruct a .tmp file so only one day of work was lost.
Puzzle-Peter is offline   Reply With Quote
Old 2012-09-14, 16:39   #337
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

10101111002 Posts
Default

Status update:
Test 401, Bit 41779 / 56367
Test 264, Bit 51633 / 61793

Puzzle-Peter is offline   Reply With Quote
Old 2012-10-22, 11:05   #338
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

22·52·7 Posts
Default

Who should be credited when submitting to the TOP5000 list? These numbers are small but they still make the TOP20 ECPP list.
Puzzle-Peter is offline   Reply With Quote
Old 2012-10-22, 18:05   #339
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

22×52×7 Posts
Default

Never mind. I just copied what Cybertronic used.

The certificate for 2^56366 + 39079 can be found here:

http://www.sendspace.com/file/y8jrn1


The other test is down to 44000 bits. I hope I can finish it this year.

Last fiddled with by Puzzle-Peter on 2012-10-22 at 18:07
Puzzle-Peter is offline   Reply With Quote
Old 2012-10-22, 18:58   #340
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
San Diego, Calif.

101000000111012 Posts
Thumbs up

Congratulations!

I'll run a validation.

Did you try to submit it to factordb? It will do a linux-based validation, too (unless you will hit a limit that Markus may have set). I've submitted it on your behalf. The link to factordb is going to be better than sendspace (when it is processed).
Batalov is offline   Reply With Quote
Old 2012-10-22, 19:43   #341
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

22×52×7 Posts
Default

Thanks!

Factordb? I think I've read this before but honestly I don't even really know what it is. I can guess from the name though. But this numbers does not have any factors. I am confused. I think I need to do some reading...
Puzzle-Peter is offline   Reply With Quote
Reply



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:14 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.

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