 mersenneforum.org Searching for generalized repunit PRP
 Register FAQ Search Today's Posts Mark Forums Read  2016-12-13, 18:42 #34 sweety439   Nov 2016 8B616 Posts Usually, for all integers a, b with a>1, -a 2016-12-13, 21:39 #35 Batalov   "Serge" Mar 2008 Phi(4,2^7658614+1)/2 22·2,281 Posts If you are re-tracing the path along the steps of Mike Oakes, Jean-Louis Charton, Robert Price, Lelio Paula, Richard Fischer and others - and boldly go where many men went 10+ years ago, for your own edification - that's totally fine. Just don't call it new. The only reason that you are not seeing anyone on the path is ...because they are miles ahead of you! There is no need to dump fat tables of tiny primes (or composites). Quality, not quantity counts. All small cases are known. Recreating them with a trivial script is a matter of seconds. The only "new" direction to go is up.   2016-12-14, 12:51   #36
sweety439

Nov 2016

42668 Posts Quote:
 Originally Posted by sweety439 Update newest status. (according to Batalov) There are still 5 families without know (probable) primes: (note: p=2 is not allowed) (32^p+5^p)/(32+5), (43^p-7^p)/(43-7), (44^p+43^p)/(44+43), (46^p-31^p)/(46-31), (50^p+37^p)/(50+37). The top 12 PRPs are: (only sorted by exponent) (48^58543-47^58543)/(48-47) (50^56099+43^56099)/(50+43) (46^45281+11^45281)/(46+11) (49^38069-46^38069)/(49-46) (47^32833-33^32833)/(47-33) (18^25667-1^25667)/(18-1) (49^16747+46^16747)/(49+46) (38^16747+7^16747)/(38+7) (37^13217-34^13217)/(37-34) (47^9181+37^9181)/(47+37) (31^6961-6^6961)/(31-6) (47^5641-23^5641)/(47-23)
These are only the top PRPs for the smallest (probable) primes of the form (a^p-b^p)/(a-b) or (a^p+b^p)/(a+b) with fixed a, b and odd prime p.

Last fiddled with by sweety439 on 2016-12-14 at 12:51   2016-12-15, 14:15   #37
sweety439

Nov 2016

2·5·223 Posts Quote:
 Originally Posted by sweety439 Thanks for Batalov! How about the numbers (b^p-1)/(b-1) or (b^p+1)/(b+1) for 2<=b<=1025 and odd prime p? For (b^p-1)/(b-1), I cannot find a (probable) prime for b = 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. Besides, are those numbers you found are the smallest (probable) prime of these forms?
Is there any project to find the smallest generalized repunit (probable) prime to base b for 2<=b<=1025? (except perfect power b)

Last fiddled with by sweety439 on 2016-12-15 at 14:15   2016-12-15, 19:01   #38
sweety439

Nov 2016

2·5·223 Posts The generalized repunit (probable) primes in bases 2<=b<=1025 are in this text file, but there are still 56 non-perfect power bases b without known generalized repunit (probable) prime. All of them are checked to at least p=7000.
Attached Files least odd prime p such that (b^p-1)(b-1) is prime.txt (8.7 KB, 111 views)

Last fiddled with by sweety439 on 2016-12-15 at 19:03   2016-12-15, 21:35   #39
carpetpool

"Sam"
Nov 2016

4658 Posts Quote:
 Originally Posted by sweety439 Update newest status. (according to Batalov) There are still 5 families without know (probable) primes: (note: p=2 is not allowed) (32^p+5^p)/(32+5), (43^p-7^p)/(43-7), (44^p+43^p)/(44+43), (46^p-31^p)/(46-31), (50^p+37^p)/(50+37). The top 12 PRPs are: (only sorted by exponent) (48^58543-47^58543)/(48-47) (50^56099+43^56099)/(50+43) (46^45281+11^45281)/(46+11) (49^38069-46^38069)/(49-46) (47^32833-33^32833)/(47-33) (18^25667-1^25667)/(18-1) (49^16747+46^16747)/(49+46) (38^16747+7^16747)/(38+7) (37^13217-34^13217)/(37-34) (47^9181+37^9181)/(47+37) (31^6961-6^6961)/(31-6) (47^5641-23^5641)/(47-23)
You do realize you can simplify some of those forms, right? (namely when a = b+1 or b = +1 or -1)

48^58543-47^58543
(18^25667-1)/17   2016-12-16, 17:57   #40
sweety439

Nov 2016

42668 Posts Quote:
 Originally Posted by carpetpool You do realize you can simplify some of those forms, right? (namely when a = b+1 or b = +1 or -1) 48^58543-47^58543 (18^25667-1)/17
Of course I know, but I should write all the numbers as the same form: (a^p-b^p)/(a-b) or (a^p+b^p)/(a+b).   2016-12-17, 08:35 #41 carpetpool   "Sam" Nov 2016 3·103 Posts Also check out https://en.wikipedia.org/wiki/Mersenne_prime for lists of the original Mersenne primes, and all other types of generalizations, such as those of the forms (a^p-b^p)/(a-b), (a^p+b^p)/(a+b), etc. Also check how closely the primes p (which make (a^p-b^p)/(a-b) and or (a^p+b^p)/(a+b) prime) are distributed. I will give some of the basic conditions to help you understand more about these forms: For numbers of the form (a^p-b^p)/(a-b) integers a, b. (If it is (a^p+b^p)/(a-b), b is negative and p is odd) There are infinitely many primes of the form (a^p-b^p)/(a-b) if (a, b) are coprime, not perfect rth powers, -4ab is not x^4, and a > 1, -a < b < a. For all primes p, there are infinitely many (a, b) pairs such that (a^p-b^p)/(a-b) is prime, followed by this, for any fixed integers a, b, or (a-b), and a prime p, there are also infinitely many primes of the form (a^p-b^p)/(a-b). For each pair of positive integers (a, b) with a > 1, there are a unique set of generalizations for that base which are (a^p-b^p)/(a-b) (a^p+b^p)/(a+b) ((a^2)^p+(b^2)^p)/(a^2+b^2) ... ((a^(2^n))^p+(b^(2^n))^p)/(a^(2^n)+b^(2^n)) For each prime p and fixed (a, b) values which the conditions listed above hold, there should be infinitely many n values (as above) such that ((a^(2^n))^p+(b^(2^n))^p)/(a^(2^n)+b^(2^n)) is prime. All these are conjectures, as of now, and not proven to be true.   2016-12-26, 17:48   #42
sweety439

Nov 2016

42668 Posts Quote:
 Originally Posted by sweety439 The generalized repunit (probable) primes in bases 2<=b<=1025 are in this text file, but there are still 56 non-perfect power bases b without known generalized repunit (probable) prime. All of them are checked to at least p=7000.
Base 570, 574 and 598 tested to 10000 (9001-10000)

No (probable) prime found.

Now, all bases b<=600 are checked to at least p=10000.

Last fiddled with by sweety439 on 2016-12-26 at 18:29   2016-12-26, 18:28 #43 sweety439   Nov 2016 2×5×223 Posts I saw factordb and found that all bases b<=1025 are checked to at least 8000, some bases 701<=b<=1025 are even checked to 10000 (theses bases are 752, 861, 866, 872, 881, 932, 956), no primes found with 7001<=p<=8000 except (907^7331-1)/906, and no primes found with 701<=b<=1025 and 8001<=p<=10000. Reseving the base 701<=b<=1025 which were not checked to 10000 to 8500 (including bases 711, 713, 731, 759, 771, 795, 820, 938, 948, 951, 963, 996, 1005, 1015), using factordb.   2016-12-26, 23:26   #44
Batalov

"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

22×2,281 Posts Quote:
 Originally Posted by sweety439 Base 570, 574 and 598 tested to 10000 (9001-10000) No (probable) prime found. Now, all bases b<=600 are checked to at least p=10000.
(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.    Thread Tools Show Printable Version Email this Page Similar Threads Thread Thread Starter Forum Replies Last Post T.Rex Wagstaff PRP Search 190 2020-07-13 21:44 Batalov And now for something completely different 10 2019-09-12 13:31 Bob Underwood Math 11 2017-01-25 11:19 sweety439 And now for something completely different 1 2016-12-07 15:58 jasong Sierpinski/Riesel Base 5 2 2006-06-07 20:37

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

Fri Sep 18 19:23:57 UTC 2020 up 8 days, 16:34, 1 user, load averages: 2.16, 2.15, 2.13