mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   sweety439 (https://www.mersenneforum.org/forumdisplay.php?f=137)
-   -   A Sierpinski/Riesel-like problem (https://www.mersenneforum.org/showthread.php?t=21839)

sweety439 2020-12-21 18:32

Newest status for b<=128 and k<=128:

[URL="https://en.wikipedia.org/w/index.php?title=Wikipedia:Sandbox&oldid=995377108"]Riesel[/URL]

[URL="https://en.wikipedia.org/w/index.php?title=Wikipedia:Sandbox&oldid=995377170"]Sierpinski[/URL]

sweety439 2020-12-21 18:38

[QUOTE=sweety439;565822][URL="https://docs.google.com/document/d/e/2PACX-1vTptXk4o1cdLQYGl-_gEiFtsvUYnG2oxR3Kl28Rfqh19Mreqrym00f0tT97GZA5LHQc_i7wgHppPnpz/pub"]https://docs.google.com/document/d/e/2PACX-1vTptXk4o1cdLQYGl-_gEiFtsvUYnG2oxR3Kl28Rfqh19Mreqrym00f0tT97GZA5LHQc_i7wgHppPnpz/pub[/URL]

Update the file of Riesel conjectures to include the newest test limit of R2[/QUOTE]

A missing Enter character after "146561 (11280802)" in the "Top 10 k's with largest first primes: k (n)" column for R2

[URL="https://docs.google.com/document/d/e/2PACX-1vQHBapjMHDluiuqDyfenn3O2CjwmNYeJBjrAHwAoa8nSTbvVk1DcmWG9zaftII3IZcpVC8_KaoPaVRy/pub"]https://docs.google.com/document/d/e/2PACX-1vQHBapjMHDluiuqDyfenn3O2CjwmNYeJBjrAHwAoa8nSTbvVk1DcmWG9zaftII3IZcpVC8_KaoPaVRy/pub[/URL]

sweety439 2020-12-21 20:08

Riesel base 129
 
[CODE]
1,5
2,1
3,1
4,(partial algebra factors)
5,3
6,1
7,2
8,1
9,(partial algebra factors)
10,1
11,1
12,228
13,1
[/CODE]

With CK=14

All k where k = m^2 and m = = 2 or 3 mod 5:
for even n let k = m^2 and let n = 2*q; factors to:
(m*129^q - 1) * (m*129^q + 1)
odd n:
factor of 5

This includes k = 4, 9

Conjecture proven

sweety439 2020-12-21 20:10

Zip file for all Sierpinski/Riesel bases 2<=b<=128: [URL="https://github.com/xayahrainie4793/Extended-Sierpinski-Riesel-conjectures/archive/master.zip"]https://github.com/xayahrainie4793/Extended-Sierpinski-Riesel-conjectures/archive/master.zip[/URL]

sweety439 2020-12-21 21:50

Riesel base 130
 
1 Attachment(s)
searched to n=2000, see the text file for the status, 0 if no (probable) prime found for this k

CK=2563

sweety439 2020-12-21 21:51

Riesel base 131
 
[CODE]
1,3
2,4
3,2
4,1
[/CODE]

With CK=5

Conjecture proven

sweety439 2020-12-21 21:53

Riesel base 132
 
[CODE]
1,47
2,1
3,38
4,3
5,1
6,2
7,2
8,11
9,1
10,1
11,1
12,1
13,2
14,1
15,1
16,1
17,1
18,62
19,9
[/CODE]

With CK=20

Conjecture proven

sweety439 2020-12-21 21:53

Riesel base 133
 
[CODE]
1,13
2,4
3,1
4,3
5,2
6,1
7,3
8,1
9,3
10,1
11,5
12,3
13,2
14,1
15,1
16,1
[/CODE]

With CK=17

Conjecture proven

sweety439 2020-12-21 21:54

Riesel base 134
 
[CODE]
1,5
2,2
3,1
[/CODE]

With CK=4

Conjecture proven

sweety439 2020-12-21 22:06

Riesel base 135
 
[CODE]
1,1171
2,1
3,2
4,5
5,1
6,1
7,26
8,2
9,1
10,4
11,2
12,1
13,1
14,1
15,4
16,(partial algebra factors)
17,11
18,569
19,2
20,1
21,3
22,1
23,6
24,5
25,317
26,13
27,0
28,1
29,697
30,1
31,2
32,0
[/CODE]

With CK=33

All k where k = m^2 and m = = 4 or 13 mod 17:
for even n let k = m^2 and let n = 2*q; factors to:
(m*135^q - 1) * (m*135^q + 1)
odd n:
factor of 17

This includes k = 16

k = 27, 32 remain at n=2000

sweety439 2020-12-21 22:09

Riesel base 136
 
CK = 22195 and too many k not in CRUS (k == 1 mod 3 or k == 1 mod 5 (or both)), thus not run this base

All k where k = m^2 and m = = 37 or 100 mod 137:
for even n let k = m^2 and let n = 2*q; factors to:
(m*136^q - 1) * (m*136^q + 1)
odd n:
factor of 137

This includes k = 1369, 10000


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

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.