mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > sweety439

Reply
 
Thread Tools
Old 2016-12-27, 16:41   #45
sweety439
 
sweety439's Avatar
 
Nov 2016

2,267 Posts
Default

Quote:
Originally Posted by Batalov View Post
(570^2-1)/569 is prime.
(598^2-1)/597 is prime.
...Then, of course, (570^12907-1)/569 is a PRP. I found it in 2 minutes after 1 minute of sieving.

Big fat tables are useful only if they contain at least the easiest of all possible results that would potentially make up for the time lost reading.

Batalov, there are 56 bases 2<=b<=1025 remain (excluding perfect powers): 184, 185, 200, 210, 269, 281, 306, 311, 326, 331, 371, 380, 384, 385, 394, 396, 452, 465, 485, 511, 522, 570, 574, 598, 601, 629, 631, 632, 636, 640, 649, 670, 684, 691, 693, 711, 713, 731, 752, 759, 771, 795, 820, 861, 866, 872, 881, 932, 938, 948, 951, 956, 963, 996, 1005, 1015, with no known odd prime p such that (b^p-1)/(b-1) is prime.

Last fiddled with by sweety439 on 2016-12-27 at 16:54
sweety439 is offline   Reply With Quote
Old 2016-12-27, 16:43   #46
sweety439
 
sweety439's Avatar
 
Nov 2016

2,267 Posts
Default

This is the text file for the status.

Last fiddled with by sweety439 on 2016-12-27 at 16:46
sweety439 is offline   Reply With Quote
Old 2016-12-27, 17:29   #47
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

9,127 Posts
Default

Quote:
Originally Posted by sweety439 View Post
...with no known odd prime p such that (b^p-1)/(b-1) is prime.
That's exactly where you should realize that


Are you trying to say that 11 is not a rep-unit or is that it is not prime?
Batalov is offline   Reply With Quote
Old 2016-12-28, 12:59   #48
sweety439
 
sweety439's Avatar
 
Nov 2016

2,267 Posts
Default

Quote:
Originally Posted by Batalov View Post
That's exactly where you should realize that


Are you trying to say that 11 is not a rep-unit or is that it is not prime?
No, I am not trying, 11 is of course a repunit prime, but I am searching the smallest odd prime p such that (b^p-1)/(b-1) is a (probable) prime. (but I don't have these programs)

Last fiddled with by sweety439 on 2016-12-28 at 13:01
sweety439 is offline   Reply With Quote
Old 2016-12-28, 13:08   #49
sweety439
 
sweety439's Avatar
 
Nov 2016

2,267 Posts
Default

Bases 711, 713, 731, 759, 771, 795, 820, 938, 948, 951, 963, 996, 1005, 1015 tested to 8500 (8001-8500).

No (probable) prime found.

Also, bases 752, 861, 866, 872, 881, 932, 956 were already tested to 10000 with no (probable) primes found.

Reserve bases 601<=b<=700 with no known (probable) prime of the form (b^p-1)/(b-1) with odd prime p (including 601, 629, 631, 632, 636, 640, 649, 670, 684, 691, 693) to 10000, using factordb.

Last fiddled with by sweety439 on 2016-12-28 at 13:10
sweety439 is offline   Reply With Quote
Old 2016-12-29, 00:23   #50
carpetpool
 
carpetpool's Avatar
 
"Sam"
Nov 2016

311 Posts
Post

Quote:
Originally Posted by sweety439 View Post
No, I am not trying, 11 is of course a repunit prime, but I am searching the smallest odd prime p such that (b^p-1)/(b-1) is a (probable) prime. (but I don't have these programs)
Then download them if you are able to and want to find new primes fast and quick:

https://sourceforge.net/projects/ope...e=typ_redirect (PFGW)

https://sites.google.com/site/geoffr...grams/sr1sieve (sr1sieve)

You should start to learn how to use these programs if you don't already by reading the docfiles or READMEs.
carpetpool is offline   Reply With Quote
Old 2016-12-29, 09:45   #51
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

8,761 Posts
Default

Quote:
Originally Posted by sweety439 View Post
Batalov, there are 56 bases 2<=b<=1025 remain (excluding perfect powers): 184, 185, 200, 210, 269, 281, 306, 311, 326, 331, 371, 380, 384, 385, 394, 396, 452, 465, 485, 511, 522, 570, 574, 598, 601, 629, 631, 632, 636, 640, 649, 670, 684, 691, 693, 711, 713, 731, 752, 759, 771, 795, 820, 861, 866, 872, 881, 932, 938, 948, 951, 956, 963, 996, 1005, 1015, with no known odd prime p such that (b^p-1)/(b-1) is prime.
For all even bases you need about 6-7 minutes per base to test it to p<10k, and for all odd bases you need about 15 minutes per base to test it to n=10k. This is in a slow laptop with 2 cores, using pari/gp, srsieve, and pfgw. The odd bases take longer because I don't know how to sieve them, and I just let pfgw to deal with them directly (with -f).

Edit: does "using factordb" mean that you just put there the numbers and wait until somebody else (fdb elves) factor it for you?

I think you are only trolling....

Last fiddled with by LaurV on 2016-12-29 at 09:49
LaurV is online now   Reply With Quote
Old 2016-12-29, 12:01   #52
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

25008 Posts
Default

This Sweety439 is not just trolling, he just need all our attention :) When he got his thread ( and now something completely different) he was unsatisfied because none except him read that thread. And that is only thing that he dont need. He need to become center of Universe, at least. I assume that begin center on this forum is just start point to begin center of Universe . In mean time I waiting time when we leave this forum. Many before this guy left forum, and he will not be the last one: I am sure :)

I love team at this forum , and grateful for tons of help and time this forum gives to me!
Go go mersenneforum.org
pepi37 is online now   Reply With Quote
Old 2016-12-30, 18:59   #53
sweety439
 
sweety439's Avatar
 
Nov 2016

2,267 Posts
Default

Quote:
Originally Posted by LaurV View Post
For all even bases you need about 6-7 minutes per base to test it to p<10k, and for all odd bases you need about 15 minutes per base to test it to n=10k. This is in a slow laptop with 2 cores, using pari/gp, srsieve, and pfgw. The odd bases take longer because I don't know how to sieve them, and I just let pfgw to deal with them directly (with -f).

Edit: does "using factordb" mean that you just put there the numbers and wait until somebody else (fdb elves) factor it for you?

I think you are only trolling....
I want to test all bases 2<=b<=1025 to p=10K, except those 56 bases 2<=b<=1025 without known (probable) primes, there are only 2 bases with a known probable prime but without (probable) primes with p<=10K: base 18 ((18^25667-1)/17) and base 152 ((152^270217-1)/151).

If no primes found for p<=10K, then I will reserve to p=25K, then 100K, then 200K, ...

Last fiddled with by sweety439 on 2016-12-30 at 19:18
sweety439 is offline   Reply With Quote
Old 2016-12-30, 19:22   #54
sweety439
 
sweety439's Avatar
 
Nov 2016

2,267 Posts
Default

Quote:
Originally Posted by carpetpool View Post
Then download them if you are able to and want to find new primes fast and quick:

https://sourceforge.net/projects/ope...e=typ_redirect (PFGW)

https://sites.google.com/site/geoffr...grams/sr1sieve (sr1sieve)

You should start to learn how to use these programs if you don't already by reading the docfiles or READMEs.
My computer cannot open these programs, can you help me to find these (probable) primes?

Last fiddled with by sweety439 on 2016-12-30 at 19:23
sweety439 is offline   Reply With Quote
Old 2016-12-30, 19:53   #55
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

838410 Posts
Default

Quote:
Originally Posted by sweety439 View Post
My computer cannot open these programs, can you help me to find these (probable) primes?
you might get 7zip then that may help you unzip them.

Last fiddled with by science_man_88 on 2016-12-30 at 19:54
science_man_88 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Searching for Wagstaff PRP T.Rex Wagstaff PRP Search 190 2020-07-13 21:44
Near- and quasi-repunit PRPs Batalov And now for something completely different 10 2019-09-12 13:31
Generalized Repunit primes Bob Underwood Math 11 2017-01-25 11:19
generalized repunit PRP sweety439 And now for something completely different 1 2016-12-07 15:58
What should I be searching for in the output? jasong Sierpinski/Riesel Base 5 2 2006-06-07 20:37

All times are UTC. The time now is 05:22.

Thu Oct 1 05:22:09 UTC 2020 up 21 days, 2:33, 0 users, load averages: 1.31, 1.61, 1.64

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.