mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Data > Marin's Mersenne-aries

Reply
 
Thread Tools
Old 2003-09-29, 15:11   #1
GP2
 
GP2's Avatar
 
Sep 2003

5·11·47 Posts
Default Semi-automated P-1 testing

Xyzzy,

After you finish any manual batch of P-1 tests, how about trying the method suggested by Complex33 for semi-automating it:
http://mersenneforum.org/showthread....1671#post11671

It would make sense to do P-1 testing this way (for Primenet credit to boot).

I can still post Pfactor= sets though for those who want them, in higher ranges well away from the leading edge of double-checking.

I have another idea though (not P-1) that will require some manual Mersenne-ary work. I'll describe it in another thread.

[Edit: this thread (message) in particular].

Last fiddled with by GP2 on 2003-09-29 at 15:50
GP2 is offline   Reply With Quote
Old 2003-09-29, 15:19   #2
GP2
 
GP2's Avatar
 
Sep 2003

A1916 Posts
Default

Actually, it occurs to me that the semi-automated method mentioned above would only do P-1 testing of exponents that had never been P-1 tested... but there are some exponents that have been P-1 tested with lower-than-average bounds.

For instance:

10401191,145000,145000


Someone with a machine with more memory could redo these P-1 tests with higher bounds. This would have to be done by manual testing, since the semi-automated method would skip any exponents that have had any P-1 test done at all no matter how low the bounds.

Still, the higher priority would probably be exponents that haven't had any P-1 test at all done, and there's still plenty of those.
GP2 is offline   Reply With Quote
Old 2003-09-29, 19:01   #3
GP2
 
GP2's Avatar
 
Sep 2003

258510 Posts
Default

So in summary:

I think we can have two kinds of P-1 testing going on in parallel:

1) The semi-automated method described in http://mersenneforum.org/showthread....1671#post11671
whose purpose would be to do a clean sweep of all P-1 tests ahead of the leading edge of double-checking.

2) The manual method of posting sets of Pfactor=p,depth,1 lines for worktodo.ini. These won't be consecutive, rather they'll be a mix of smaller and larger exponents. The idea is to thin out the overall herd of un-P-1-tested exponents rather than do an entire range at a time.
GP2 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Semi-prime factorization conjecture Alberico Lepore Alberico Lepore 7 2018-02-16 08:27
Automated LLR testing with LLRnet mdettweiler No Prime Left Behind 24 2011-11-04 19:20
Automated testing for all bases and k/n kar_bon Conjectures 'R Us 59 2009-08-13 07:47
Automated primality testing with LLRnet mdettweiler Conjectures 'R Us 18 2008-03-04 00:06
Automated PRP discussions ltd Sierpinski/Riesel Base 5 20 2006-09-02 22:19

All times are UTC. The time now is 19:07.


Thu May 19 19:07:27 UTC 2022 up 35 days, 17:08, 1 user, load averages: 1.07, 1.15, 1.16

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.

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