mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2008-03-31, 19:59   #12
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

10,597 Posts
Default

On Sierp base 3, I've now reached k=9M and n=25K.

I've now added a new Sierp base 3 reservations page. 28 k's are remaining as shown on the page.

I will likely start a big sieve after we reach 100 k's remaining.
gd_barnes is offline   Reply With Quote
Old 2008-04-01, 16:34   #13
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

10,597 Posts
Default

On Sierp base 3, I'm now up to k=10M and n=25K. 36 k's remaining as shown on the Sierp base 3 reservations page.

I'm taking a break for ~2-3 weeks from this base and then will resume testing by k-value to n=25K until there are 100 k's remaining. That will probably happen between k=15M and 20M.


Gary
gd_barnes is offline   Reply With Quote
Old 2008-04-08, 17:28   #14
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

22×35 Posts
Default Base 3 sierpinski sieve reservation.

Hi Gary. Reserving k 110M-120M for base3 sierpinski conjecture. Thanks for your help. When this range is done, I may consider start a riesel conjecture sieveing. Thanks again. Looking forward to submit my few thousands k's :)

EDIT: Whoops forgot to mention that I take it to 25,000 n!

Last fiddled with by gd_barnes on 2008-04-14 at 07:06 Reason: Corrected reservation from k=110M-1110M to 110M-120M
KEP is online now   Reply With Quote
Old 2008-04-08, 20:56   #15
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

101001011001012 Posts
Default

Quote:
Originally Posted by KEP View Post
Hi Gary. Reserving k 110M-1110M for base3 sierpinski conjecture. Thanks for your help. When this range is done, I may consider start a riesel conjecture sieveing. Thanks again. Looking forward to submit my few thousands k's :)

EDIT: Whoops forgot to mention that I take it to 25,000 n!
Welcome to the effort KEP! And thanks for asking the detailed questions ahead of time in the PM's.

I'm assuming that you mean k=110M-111M (instead of 110M-1110M). 110M-111M is what your sample script showed in the PM that you sent me.

If so, for a k=1M range, there should be less than 20-30 k's remaining. Base 3 is a VERY prime base! After you're done, you may find that you want to reserve a larger range.

For example, for the range of k=9M-10M for me, there were only 8 k's remaining after a search to n=25K. Of course with higher k's, there will be less chance of each k-value having a small prime so you should have more than that but not many more.


Gary
gd_barnes is offline   Reply With Quote
Old 2008-04-11, 14:04   #16
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

22·35 Posts
Default

Hi Gary

I would appreciate if you wrote me down for k=110M to 120M, since I'm working on these 5 ranges. If you would then please tell me if only equal k's has to be tested for the base3 rieselconjecture, then I would like to start a huge attack on this base. Also can I still use the same code in the input file (just changing plus to minus)? But please put me down for the specific k range. Maybe I just rambeled in my reservation. Either way I would like to attack the riesel base3 conjecture when I sometime next week completes this 10M k range :) Thanks for all your understanding and support.

Regards

KEP

Last fiddled with by KEP on 2008-04-11 at 14:30 Reason: To much rambeling and to little fact :)
KEP is online now   Reply With Quote
Old 2008-04-11, 19:52   #17
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

1059710 Posts
Default

Quote:
Originally Posted by KEP View Post
Hi Gary

I would appreciate if you wrote me down for k=110M to 120M, since I'm working on these 5 ranges. If you would then please tell me if only equal k's has to be tested for the base3 rieselconjecture, then I would like to start a huge attack on this base. Also can I still use the same code in the input file (just changing plus to minus)? But please put me down for the specific k range. Maybe I just rambeled in my reservation. Either way I would like to attack the riesel base3 conjecture when I sometime next week completes this 10M k range :) Thanks for all your understanding and support.

Regards

KEP

OK, I will change your reservation from k=110M-111M to 110M-120M.

I responded to your PM on the Riesel conjecture. The script on the input file would be the same except -1 instead of +1. Like the Sierp conjecture, only even k's need to be tested so no change there.

But there is a slight change on the command line. Instead use:

input.txt -f100 -l100k.txt -tp


The -tp switch tells it to prove the primality of "-1" numbers vs. "+1" numbers.

Good luck and thank you for attacking these huge bases!


Gary
gd_barnes is offline   Reply With Quote
Old 2008-04-11, 20:48   #18
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

3·2,083 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
<snip>
But there is a slight change on the command line. Instead use:

input.txt -f100 -l100k.txt -tp


The -tp switch tells it to prove the primality of "-1" numbers vs. "+1" numbers.y
Actually, no. -tp signifies that PFGW should do an N+1 test (as opposed to an N-1 test with just plain -t), which can be used for numbers that an N-1 test can't prove primality for. (I've run into those occasionally.) Both N-1 and N+1 tests are not dependent on any form of number, so either should work for both +1 and -1 numbers.
mdettweiler is offline   Reply With Quote
Old 2008-04-11, 21:22   #19
axn
 
axn's Avatar
 
Jun 2003

527510 Posts
Default

Quote:
Originally Posted by Anonymous View Post
Actually, no. -tp signifies that PFGW should do an N+1 test (as opposed to an N-1 test with just plain -t), which can be used for numbers that an N-1 test can't prove primality for. (I've run into those occasionally.) Both N-1 and N+1 tests are not dependent on any form of number, so either should work for both +1 and -1 numbers.
Actually, to successfully run an N+1 primality test, N+1 must be factored to atleast 33% of its length (meaning, if N is 100 digits, then at least 33 digits worth of prime factorization should be known). Vice versa for N-1. If the 33% factorization criteria is not met, then the test can't "prove" the primality.

Since N+1 factorization of a "-1" number is trivial, it makes sense to use N+1 for "-1" (and N-1 for "+1" numbers).
axn is offline   Reply With Quote
Old 2008-04-11, 21:25   #20
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

3·2,083 Posts
Default

Quote:
Originally Posted by axn1 View Post
Actually, to successfully run an N+1 primality test, N+1 must be factored to atleast 33% of its length (meaning, if N is 100 digits, then at least 33 digits worth of prime factorization should be known). Vice versa for N-1. If the 33% factorization criteria is not met, then the test can't "prove" the primality.

Since N+1 factorization of a "-1" number is trivial, it makes sense to use N+1 for "-1" (and N-1 for "+1" numbers).
Oh, I see. Thanks for clearing that up!
mdettweiler is offline   Reply With Quote
Old 2008-04-12, 07:34   #21
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

32·443 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
But there is a slight change on the command line. Instead use:

input.txt -f100 -l100k.txt -tp
Are you sure? It is much quicker to do a "probable prime" test than do N+1 or N-1 tests when crunching a batch of numbers. Run the fully blown proving tests on those that the quick tests indicates might be prime. PFGW has a log file for probable primes: "pfgw.log"

Also: why are you not using a sieve instead of "-f"?
paulunderwood is offline   Reply With Quote
Old 2008-04-12, 09:25   #22
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

22·35 Posts
Default

Quote:
Originally Posted by paulunderwood View Post
Are you sure? It is much quicker to do a "probable prime" test than do N+1 or N-1 tests when crunching a batch of numbers. Run the fully blown proving tests on those that the quick tests indicates might be prime. PFGW has a log file for probable primes: "pfgw.log"

Also: why are you not using a sieve instead of "-f"?
Thanks Paul, your post actually just solved the issue mentioned in my previous post. Plus it creates a much smaller log file when doing only PRP tests. So now my command line Gary sounds like this:

"input.txt -l5M.txt" and when done sieving I will use this command line:

"pfgw.log -tp" this will be sufficient and very time consuming, since a lot of tests can very fast be verified up to max n or 25,000 which is my limit :)

So thanks Paul, and of course also to you Gary for helping out that much you did. Maybe if we implemented these lines at all tests, we would really start to see some improvement in speed. Anyway I'll now continue the Base3 attack and launch the major attack from Wednesday, maybe earlier, if I see the Sierpinski range complete in early time :)

Thanks and take care everyone.

KEP!

Ps. Gary you doesn't have to reply to my PMs regarding my problem which is now solved, but if you do that prior to reading this post its also OK, since one enjoys reading science stuff and other peoples solutions to issues occorring :)
KEP is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Bases 6-32 reservations/statuses/primes gd_barnes Conjectures 'R Us 1415 2022-01-25 19:13
Bases 251-500 reservations/statuses/primes gd_barnes Conjectures 'R Us 2377 2022-01-25 01:08
Bases 33-100 reservations/statuses/primes Siemelink Conjectures 'R Us 1715 2022-01-23 14:23
Bases 101-250 reservations/statuses/primes gd_barnes Conjectures 'R Us 967 2022-01-23 14:21
Riesel base 3 reservations/statuses/primes KEP Conjectures 'R Us 1130 2021-12-16 04:43

All times are UTC. The time now is 20:42.


Thu Jan 27 20:42:17 UTC 2022 up 188 days, 15:11, 3 users, load averages: 1.39, 1.53, 1.55

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.

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