mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Wikis > Prime Wiki

Reply
 
Thread Tools
Old 2019-05-29, 10:52   #12
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

5×13×47 Posts
Default

Also, will you create the "Carol least" and the "Kynea least" pages? Like the Williams MP least and the Williams MM least pages.

Also the "Gen. Cullen least" and the "Gen. Woodall least" pages. (I know that the definition of Gen. Cullen number and Gen. Woodall number in this wiki does not have the condition that n>=b-1)

Last fiddled with by sweety439 on 2019-05-29 at 10:55
sweety439 is offline   Reply With Quote
Old 2019-06-04, 14:14   #13
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

5·13·47 Posts
Default

Kar_bon, there are many known primes of the form (b+-1)*b^n+-1 and b^n+-(b+-1) for b<=16 that are not currently in the corresponding OEIS sequence, thus you can extend these OEIS sequences:

Quote:
For the n such that these forms is prime:
a1(b): numbers n such that (b-1)*b^n-1 is prime
a2(b): numbers n such that (b-1)*b^n+1 is prime
a3(b): numbers n such that (b+1)*b^n-1 is prime
a4(b): numbers n such that (b+1)*b^n+1 is prime (not exist when b == 1 mod 3)
a5(b): numbers n such that b^n-(b-1) is prime
a6(b): numbers n such that b^n+(b-1) is prime
a7(b): numbers n such that b^n-(b+1) is prime
a8(b): numbers n such that b^n+(b+1) is prime (not exist when b == 1 mod 3)

Using "------------" if there is currently no OEIS sequence, "xxxxxxx" if such n not exist (only for a4(b) and a8(b) for b == 1 mod 3)

b a1(b) a2(b) a3(b) a4(b) a5(b) a6(b) a7(b) a8(b)
2 A000043 ------------ A002235 A002253 A000043 ------------ A050414 A057732
3 A003307 A003306 A005540 A005537 A014224 A051783 A058959 A058958
4 A272057 ------------ ------------ xxxxxxx A059266 A089437 A217348 xxxxxxx
5 A046865 A204322 A257790 A143279 A059613 A124621 A165701 A089142
6 A079906 A247260 ------------ ------------ A059614 A145106 A217352 A217351
7 A046866 A245241 ------------ xxxxxxx A191469 A217130 A217131 xxxxxxx
8 A268061 A269544 ------------ ------------ A217380 A217381 A217383 A217382
9 A268356 A056799 ------------ ------------ A177093 A217385 A217493 A217492
10 A056725 A056797 A111391 xxxxxxx A095714 A088275 A092767 xxxxxxx
11 A046867 A057462 ------------ ------------ ------------ ------------ ------------ ------------
12 A079907 A251259 ------------ ------------ ------------ A137654 ------------ ------------
13 A297348 ------------ ------------ xxxxxxx ------------ ------------ ------------ xxxxxxx
14 A273523 ------------ ------------ ------------ ------------ ------------ ------------ ------------
15 ------------ ------------ ------------ ------------ ------------ ------------ ------------ ------------
16 ------------ ------------ ------------ xxxxxxx ------------ ------------ ----------- xxxxxxx
e.g. A217352: a7(6), 6^n-(6+1) is prime for n=2, 4, 6, 8, 9, 10, 15, 20, 46, 49, 61, 98, 110, 144, 266, 344, 978, 1692, 1880, 1924, 3142, 3220, 4209, 5708, 7064, 13465, 13858, 19474, 22666, but currently the sequence only lists the terms up to 7064.

Also, you can extended the sequence A122396 (exactly the Williams primes MM with prime b) up to n=50 and A087139 (exactly the Williams MP with prime b) up to n=91. (e.g. A087139(54) = 102979, since (251-1)*251^102978+1 is prime, and this number equals 251^102979 - 251^102978 + 1)

Last fiddled with by kar_bon on 2019-06-06 at 08:35 Reason: table
sweety439 is offline   Reply With Quote
Old 2019-06-04, 21:26   #14
matzetoni
 
matzetoni's Avatar
 
Feb 2019

10110112 Posts
Default

https://www.rieselprime.de/ziki/Williams_prime_PP_3


Just wanted to let you know that I'm still searching on the numbers above.

I already finished to n=800k without new primes.
matzetoni is offline   Reply With Quote
Old 2019-06-04, 22:10   #15
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

1011011011012 Posts
Default

Quote:
Originally Posted by matzetoni View Post
https://www.rieselprime.de/ziki/Williams_prime_PP_3
Just wanted to let you know that I'm still searching on the numbers above.
I already finished to n=800k without new primes.
Thanks, marked WilliamsPP3 as reserved by you and added a history entry.
kar_bon is offline   Reply With Quote
Old 2019-06-05, 08:06   #16
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

292510 Posts
Default

@sweety439:
Plases do me a favour:
Take a range or a dozen bases, test them to n=10k, attach a file with the primes with the range done.

I will not update the Wiki every day for your small primes and no searched range given.
For example the next prime for MM 126 is less 10000.

Last fiddled with by kar_bon on 2019-06-06 at 08:32 Reason: addressed
kar_bon is offline   Reply With Quote
Old 2019-06-06, 07:14   #17
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

32×52×13 Posts
Default

@sweety439

I've deleted your posts with results here!

This is the thread for the Wiki not for your results.
Please post those in your own threads.
kar_bon is offline   Reply With Quote
Old 2019-06-09, 00:10   #18
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

5×13×47 Posts
Default

There are other sequences for Riesel/Proth prime small bases least n: (not only A119591 and A253178)

A119624 (Proth k=2, 0 for bases with no possible prime)

A088782 (Proth k=10, 0 for bases with no possible prime)

A098873 (Riesel k=2 for bases divisible by 6)

A098872 (Proth k=2 for bases divisible by 6)

A098876 (Riesel k=3 for bases divisible by 6)

A098877 (Proth k=3 for bases divisible by 6)

Last fiddled with by sweety439 on 2019-06-09 at 00:11
sweety439 is offline   Reply With Quote
Old 2019-06-10, 14:39   #19
WGJC3107
 
WGJC3107's Avatar
 
"Will Conway"
May 2018
UK

26 Posts
Default

Is it possible for you to add Operation Billion Digits as a project on the wiki?I can’t seem to find any mention of it.

Last fiddled with by WGJC3107 on 2019-06-10 at 14:39
WGJC3107 is offline   Reply With Quote
Old 2019-06-10, 14:42   #20
Dylan14
 
Dylan14's Avatar
 
"Dylan"
Mar 2017

2·293 Posts
Default

Quote:
Originally Posted by WGJC3107 View Post
Is it possible for you to add Operation Billion Digits as a project on the wiki?I can’t seem to find any mention of it.
It is in the wiki, see here.
Dylan14 is offline   Reply With Quote
Old 2019-06-10, 15:25   #21
WGJC3107
 
WGJC3107's Avatar
 
"Will Conway"
May 2018
UK

6410 Posts
Default

Thanks, I didn’t realise there was a page there.
Is it possible for me to make an account on there to edit pages or is that just admin’s job?
WGJC3107 is offline   Reply With Quote
Old 2021-01-01, 19:30   #22
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

171F16 Posts
Default

Quote:
Originally Posted by kar_bon View Post
Using here Google Chrome V87 64Bit on WIN10 shows the issues as in your image.
Pressing STRG+F5 to clear the cache solved the issue and all is displayed without errors.
Please test again.
Ctrl-F5 didn't do anything for me.

I have attached an image of the errors/warnings I am getting.
Attached Thumbnails
Click image for larger version

Name:	missingdependency.PNG
Views:	119
Size:	45.7 KB
ID:	24098  
henryzz is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
P-1 discussion kladner GPU to 72 43 2012-01-27 20:43
10,375- LA discussion Raman Cunningham Tables 27 2008-12-04 21:17
Sieve Discussion em99010pepe Prime Cullen Prime 61 2007-06-07 22:23
P-1 discussion AntonVrba Prime Cullen Prime 5 2007-04-04 04:59
New .dat discussion VJS Prime Sierpinski Project 7 2006-07-25 14:31

All times are UTC. The time now is 18:14.


Wed Oct 20 18:14:16 UTC 2021 up 89 days, 12:43, 0 users, load averages: 1.37, 1.32, 1.26

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.