mersenneforum.org  

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

Reply
 
Thread Tools
Old 2008-07-12, 21:28   #1
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

3·313 Posts
Default Bases 501-1030 reservations/statuses/primes

@Garys edit: actually i'm now running a perfect test for base 781 sierpinski and it actually finds primes just the same as with bases below or equal 255. But if one take a look at the pfgwdoc.txt file, and looks under "-b" it states something with bases having to be between 2 and 255
KEP is offline   Reply With Quote
Old 2008-07-12, 21:40   #2
michaf
 
michaf's Avatar
 
Jan 2005

479 Posts
Default

That's the base it uses internaly to prove primality, it has nothing to do with the formula you are testing (No need to set it usually, it choses for you automagically...)

See http://primes.utm.edu/prove/prove2_2.html for more reading material
michaf is offline   Reply With Quote
Old 2008-07-13, 00:26   #3
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

100111111100102 Posts
Default

Quote:
Originally Posted by michaf View Post
That's the base it uses internaly to prove primality, it has nothing to do with the formula you are testing (No need to set it usually, it choses for you automagically...)

See http://primes.utm.edu/prove/prove2_2.html for more reading material
Thanks for the info. Micha.

Based on that, test whatever base you want but please limit them to bases with somewhat low conjectured k-values.


Gary

Last fiddled with by gd_barnes on 2008-07-13 at 00:27
gd_barnes is offline   Reply With Quote
Old 2008-07-16, 10:53   #4
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

2×5,113 Posts
Default

KEP had mentioned testing base 781 with PFGW for primality proving. That got me curious because so many k's on this base have trivial factors. So I checked the conjecture of it and it is k=528 with a covering set of {17 23}.

Seeing that there were only ~120-130 k's that would need to be tested after eliminating all k==(1 mod 2), (2 mod 3), (4 mod 5), and (12 mod 13) that had trivial factors, I decided to give it a whirl.

It's not bad at all with just 2 k's remaining, k=346 & 370, at n=3K.

Based on this and my earlier test of k=4 on Sierp base 242 to n=3K, I will reserve all 3 of the k's on these 2 bases up to n=10K.


Gary

Last fiddled with by gd_barnes on 2008-07-16 at 21:11
gd_barnes is offline   Reply With Quote
Old 2008-07-16, 21:11   #5
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

100111111100102 Posts
Default

One k-value is now down for Sierp base 781:

346*781^4210+1 is prime.


Gary

Last fiddled with by gd_barnes on 2010-01-18 at 07:54 Reason: remove bases <= 500
gd_barnes is offline   Reply With Quote
Old 2008-07-19, 10:54   #6
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

2×5,113 Posts
Default

Sierp base 781 k=370 is complete to n=10K. No primes.

No more work to be done on it.
gd_barnes is offline   Reply With Quote
Old 2008-07-19, 14:11   #7
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

3×313 Posts
Default

@ Willem and Gary: Excuse me for asking a ton of questions, but if it is not the covering sets (as I thought) that comes as output in the line saying something with "examining the primes in the covering set"(1) in the command line program, then what is it?

Example given:

Sierpinski base: 1023
1.: 13,61,1321 (covering no/yes?)
k: 632462
Exponent: 6

Hope it is clear what I asked, and also, if the "1." isn't the conjecture, the why is the covering.exe program only programmed to come up with a solution only and not a covering set on the same time?

My questions doesn't mean that I'll do any more conjectures, as stated earlier I doesn't have the skills, but they are simply out of curiosity and a slim hope of someday understanding

Regards

Kenneth!

Last fiddled with by KEP on 2008-07-19 at 14:14
KEP is offline   Reply With Quote
Old 2008-07-19, 15:57   #8
Siemelink
 
Siemelink's Avatar
 
Jan 2006
Hungary

4148 Posts
Default

Quote:
Originally Posted by KEP View Post
Sierpinski base: 1023
1.: 13,61,1321 (covering no/yes?)
k: 632462
Exponent: 6

Kenneth!
A covering set means that there must be an elements of the set that divides 632462*1023^n+1, for any n. Occasionally there are more elements in that list than you strictly need. For this example you would have that

1321 divides 632462*1023^(3q+1)+1
61 divides 632462*1023^(3q+2)+1
13 divides 632462*1023^(3q+3)+1

covering all values of n.

Willem.
Siemelink is offline   Reply With Quote
Old 2008-07-19, 16:22   #9
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

3×313 Posts
Default

Quote:
Originally Posted by Siemelink View Post
A covering set means that there must be an elements of the set that divides 632462*1023^n+1, for any n. Occasionally there are more elements in that list than you strictly need. For this example you would have that

1321 divides 632462*1023^(3q+1)+1
61 divides 632462*1023^(3q+2)+1
13 divides 632462*1023^(3q+3)+1

covering all values of n.

Willem.
Ah now it all makes sence... but the above you state, just shows that it is in fact not for one with my mathematical skills to carry out such a search Thanks for the info.

Kenneth!
KEP is offline   Reply With Quote
Old 2008-07-19, 16:38   #10
Siemelink
 
Siemelink's Avatar
 
Jan 2006
Hungary

22×67 Posts
Default

Quote:
Originally Posted by KEP View Post
Ah now it all makes sence... but the above you state, just shows that it is in fact not for one with my mathematical skills to carry out such a search Thanks for the info.

Kenneth!
Oh, this is high school stuff. It is just a matter of having the right programs that give the output nicely.

Willem
Siemelink is offline   Reply With Quote
Old 2009-04-10, 21:05   #11
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

16538 Posts
Default

Hello

As part of my goal for this year, aswell in order to make sure my computer is not running idle while away on 3 weeks vacation some 4 weeks from now, I've decided to reserve 679 different Riesel bases with 1 thing in common, they all have k<=100K. All bases should be reported as completed in the end of this year. Also all bases will be tested to n=25K or proven. Already as I speak, 14 bases has been tested and 10 has been proven

This also means, that the Sierp base 63 reservation will still run, though it will only run in idle mode, so during nighttime and awaytime from the computer, the Sierpinski base 63 reservation will get full attention. Hope that everyone is alright with this new approach

Also I'll start by knooking down the riesel conjectures with the lowest predicted k-value.

Regards

KEP

Ps. Will frequently return my output results to Gary, as more and more bases gets completely proven or tested to n=25K
Attached Files
File Type: txt 679_base_reservations.txt (3.3 KB, 282 views)
KEP is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Bases 33-100 reservations/statuses/primes Siemelink Conjectures 'R Us 1672 2020-10-25 07:39
Bases 101-250 reservations/statuses/primes gd_barnes Conjectures 'R Us 852 2020-10-24 15:52
Bases 251-500 reservations/statuses/primes gd_barnes Conjectures 'R Us 2182 2020-10-24 09:19
Bases 4-32 reservations/statuses/primes gd_barnes Conjectures 'R Us 1415 2020-10-24 09:18
Riesel base 3 reservations/statuses/primes KEP Conjectures 'R Us 1051 2020-10-23 23:01

All times are UTC. The time now is 11:03.

Mon Oct 26 11:03:14 UTC 2020 up 46 days, 8:14, 0 users, load averages: 1.84, 2.13, 2.00

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