mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Open Projects

Reply
 
Thread Tools
Old 2017-01-21, 11:43   #45
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

5×7×89 Posts
Default

I checked (b-1)*b^n+1 for 2<=b<=500, (b+1)*b^n-1 for 2<=b<=300 and (b+1)*b^n+1 for 2<=b<=200.

For the primes of the form (b+-1)*b^n+-1 with integer b>=2 and integer n>=1:

For (b-1)*b^n-1, it is already searched in http://harvey563.tripod.com/wills.txt for b<=2049, but one prime is missing in this website: (91-1)*91^519-1, and the exponent of b=38 is wrong, it should be (38-1)*38^136211-1, not (38-1)*38^136221-1. Besides, (128-1)*128^n-1 has been reserved by Cruelty. The known primes with b<=500 and n>1000 are (38-1)*38^136211-1, (83-1)*83^21495-1, (98-1)*98^4983-1, (113-1)*113^286643-1, (125-1)*125^8739-1, (188-1)*188^13507-1, (228-1)*228^3695-1, (347-1)*347^4461-1, (357-1)*357^1319-1, (401-1)*401^103669-1, (417-1)*417^21002-1, (443-1)*443^1691-1, (458-1)*458^46899-1, (494-1)*494^21579-1. The bases b<=500 without known prime are 128 (n>1700000), 233, 268, 293, 383, 478, 488, all are checked to at least n=200000.

For (b-1)*b^n+1, the known primes with b<=500 and n>500 are (53-1)*53^960+1, (65-1)*65^946+1, (77-1)*77^828+1, (88-1)*88^3022+1, (122-1)*122^6216+1, (158-1)*158^1620+1, (180-1)*180^2484+1, (197-1)*197^520+1, (248-1)*248^604+1, (249-1)*249^1851+1, (257-1)*257^1344+1, (269-1)*269^1436+1, (275-1)*275^980+1, (319-1)*319^564+1, (356-1)*356^528+1, (434-1)*434^882+1. The bases b<=500 without known prime are 123 (n>100000), 202 (reserving, n>1024), 251 (n>73000), 272 (reserving, n>1024), 297 (CRUS prime), 298, 326, 328, 342 (n>100000), 347, 362, 363, 419, 422, 438 (n>100000), 452, 455, 479, 487 (n>100000), 497, 498 (CRUS prime), all are checked to at least n=1024.

For (b+1)*b^n-1, the known primes with b<=300 and n>500 are (63+1)*63^1483-1, (88+1)*88^1704-1, (143+1)*143^921-1. The bases b<=300 without known primes are 208, 232, 282, 292, all are checked to at least n=1024. (except the case b=208, all of them are CRUS primes)

For (b+1)*b^n+1, in this case this b should not = 1 (mod 3), or all numbers of the form (b+1)*b^n+1 are divisible by 3, the known primes with b<=200 (b != 1 mod 3) and n>500 are (171+1)*171^1851+1, there is no such prime with b=201 and n<=1024.
sweety439 is offline   Reply With Quote
Old 2018-12-07, 08:32   #46
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

24·3·61 Posts
Default

4*5^282989-1 is prime! (197802 decimal digits), A046865 changed, continuing.
kar_bon is offline   Reply With Quote
Old 2018-12-14, 22:20   #47
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

5·7·89 Posts
Default

Quote:
Originally Posted by kar_bon View Post
4*5^282989-1 is prime! (197802 decimal digits), A046865 changed, continuing.
Where is the wiki... I want the data for all Williams (1st, 2nd, 3rd and 4th) primes (and their dual) for bases b <= 32 ... (and my additional search for b = 38, 83, 88, 93 and 113 ...)
sweety439 is offline   Reply With Quote
Old 2018-12-14, 23:43   #48
GP2
 
GP2's Avatar
 
Sep 2003

A1916 Posts
Default

Quote:
Originally Posted by kar_bon View Post
A046865 changed, continuing.
I don't see this change in A046865. Maybe it is still stuck in editing?

Is it confirmed that there are no intervening terms between 15393 and 282989? If so, 282989 can be added, but if not, then you should add a comment instead: "282989 is also a member of this sequence".
GP2 is offline   Reply With Quote
Old 2018-12-15, 10:45   #49
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

24×3×61 Posts
Default

Edits confirmed and I've checked the whole range again, continuing.
kar_bon is offline   Reply With Quote
Old 2018-12-15, 17:15   #50
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

259116 Posts
Default

Always press 'these edits are ready for review'. It's a gotcha in the OEIS Wiki.

(It was not always on the Wiki engine, actually.)
Batalov is offline   Reply With Quote
Old 2018-12-15, 20:30   #51
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

24·3·61 Posts
Default

Quote:
Originally Posted by Batalov View Post
Always press 'these edits are ready for review'. It's a gotcha in the OEIS Wiki.
Yes, overviewd this button on the bottom but got a mail after 7 days without doing so.
kar_bon is offline   Reply With Quote
Old 2019-01-17, 09:21   #52
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

24·3·61 Posts
Default

Found:
4*5^498483-1 is prime! (348426 decimal digits)
4*5^504221-1 is prime! (352436 decimal digits)

Currently at n=695k, OEIS updated.
kar_bon is offline   Reply With Quote
Old 2019-01-28, 09:23   #53
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

292810 Posts
Default

4*5^754611-1 is prime: 527452 decimal digits.
kar_bon is offline   Reply With Quote
Old 2019-02-25, 15:32   #54
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

292810 Posts
Default

4*5^864751-1 is prime: 604436 decimal digits.

I've not updated the OEIS seq with the last two primes, will do after reaching n=1M.
kar_bon is offline   Reply With Quote
Old 2019-04-04, 10:01   #55
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

1011011100002 Posts
Default

4*5^n-1 completed to n=1M and releasing
- no more primes found
- OEIS / Wiki updated
- S.Harvey informed
kar_bon is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Reserved for MF - Sequence 276 kar_bon Aliquot Sequences 136 2021-10-21 16:17
A new sequence devarajkandadai Miscellaneous Math 3 2020-12-01 22:08
Primes in n-fibonacci sequence and n-step fibonacci sequence sweety439 And now for something completely different 17 2017-06-13 03:49
Fun Sequence Sam Kennedy Miscellaneous Math 4 2013-02-07 11:53
What's the next in the sequence? roger Puzzles 16 2006-10-18 19:52

All times are UTC. The time now is 04:38.


Sat Dec 4 04:38:36 UTC 2021 up 133 days, 23:07, 0 users, load averages: 1.66, 1.52, 1.31

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