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-08-20 17:28

4 Attachment(s)
From the thread [URL="https://mersenneforum.org/showthread.php?t=10354&page=10"]https://mersenneforum.org/showthread.php?t=10354&page=10[/URL], searched up to n=6000, k=4 and k=5 (for the Riesel side) are still running ....

sweety439 2020-08-22 20:38

3 Attachment(s)
All searched up to n=2^12

Riesel k=4, Sierp k=4, Sierp k=5, Sierp k=6 are still running

sweety439 2020-08-24 01:02

Exclusions for k<=12:

Riesel k=1:
b=m^r with r>1 proven composite by full algebraic factors

Riesel k=2:
none

Riesel k=3:
none

Riesel k=4:
b==(4 mod 5): odd n, factor of 5; even n, algebraic factors
b=m^2 proven composite by full algebraic factors

Riesel k=5:
b==(11 mod 12): covering set [2, 3]

Riesel k=6:
b==(34 mod 35): covering set [5, 7]
b=6*m^2 with m==(2, 3 mod 5): even n, factor of 5; odd n, algebraic factors

Riesel k=7:
b==(11 mod 12): covering set [2, 3]

Riesel k=8:
b==(20 mod 21): covering set [3, 7]
b==(83, 307 mod 455): covering set [5, 7, 13]
b=m^3 proven composite by full algebraic factors

Riesel k=9:
b==(4 mod 5): odd n, factor of 5; even n, algebraic factors
b==(9 mod 16): odd n, factor of 2; even n, algebraic factors
b=m^2 proven composite by full algebraic factors

Riesel k=10:
b==(32 mod 33): covering set [3, 11]

Riesel k=11:
b==(14 mod 15): covering set [3, 5]
b==(19 mod 20): covering set [2, 5]
b=11*m^2 with m==(2, 3 mod 5): even n, factor of 5; odd n, algebraic factors

Riesel k=12:
b==(142 mod 143): covering set [11, 13]
base 307: covering set [5, 11, 29]
base 901: covering set [7, 11, 13, 19]

Sierp k=1:
b=m^r with odd r>1 proven composite by full algebraic factors

Sierp k=2:
none

Sierp k=3:
none

Sierp k=4:
b==(14 mod 15); covering set [3, 5]
b=m^4 proven composite by full algebraic factors

Sierp k=5:
b==(11 mod 12): covering set [2, 3]

Sierp k=6:
b==(34 mod 35); covering set [5, 7]

Sierp k=7:
b==(5, 11, 23 mod 24): covering set [2, 3]

Sierp k=8:
b==(20 mod 21): covering set [3, 7]
b==(47, 83 mod 195): covering set [3, 5, 13]
base 467: covering set [3, 5, 7, 19, 37]
base 722: covering set [3, 5, 13, 73, 109]
b=m^3 proven composite by full algebraic factors
base 128: no possible prime

Sierp k=9:
b==(19 mod 20): covering set [2, 5]

Sierp k=10:
b==(32 mod 33): covering set [3, 11]

Sierp k=11:
b==(14 mod 15): covering set [3, 5]
b==(19 mod 20): covering set [2, 5]
b==(5 mod 24): covering set [2, 3]

Sierp k=12:
b==(142 mod 143): covering set [11, 13]
bases 296 and 901: covering set [7, 11, 13, 19]
bases 562, 828, 900, and 1166: covering set [7, 13, 19]
base 563 and 1433: covering set [5, 7, 13, 19, 29]
base 597: covering set [5, 13, 29]

sweety439 2020-08-29 14:39

4 Attachment(s)
Update files.

sweety439 2020-08-29 15:13

Primality certificates for the primes >= 300 digits for the proven or near-proven bases for the k such that gcd(k+-1,b-1) (+ for Sierpinski, - for Riesel) is not 1: (only for k < 1st CK)

S7:

[URL="http://factordb.com/cert.php?id=1100000000887911448"]k=141[/URL]

S13:

[URL="http://factordb.com/index.php?id=1100000000000217927"]k=11[/URL] (proven by N-1-method)

S16:

[URL="http://factordb.com/cert.php?id=1100000000001707231"]k=23[/URL]

S25:

[URL="http://factordb.com/cert.php?id=1100000000894427397"]k=61[/URL]

S33: (k=319 and k=407 are only probable primes)

[URL="http://factordb.com/cert.php?id=1100000000899413872"]k=11[/URL]
[URL="http://factordb.com/index.php?id=1100000000899426975"]k=31[/URL] (proven by N-1-method)
[URL="http://factordb.com/cert.php?id=1100000000920998609"]k=63[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929860549"]k=251[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929860562"]k=305[/URL]

S36:

[URL="http://factordb.com/index.php?id=1100000000899428877"]k=223[/URL] (proven by N+1-method) ([URL="http://factordb.com/cert.php?id=1100000000908656035"]certificate for large prime factor for N+1[/URL])
[URL="http://factordb.com/cert.php?id=1100000000916755463"]k=1000[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929860596"]k=1669[/URL]

S37:

[URL="http://factordb.com/cert.php?id=1100000000921139606"]k=19[/URL]

S43:

[URL="http://factordb.com/cert.php?id=1100000000899429028"]k=9[/URL]
[URL="http://factordb.com/index.php?id=1100000000899429035"]k=13[/URL] (proven by N-1-method)

sweety439 2020-08-29 16:46

S46: (k=17 is only probable prime)

[URL="http://factordb.com/cert.php?id=1100000000920998568"]k=89[/URL]
[URL="http://factordb.com/cert.php?id=1100000000920998576"]k=95[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506869599"]k=140[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929841013"]k=229[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506863902"]k=278[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506861892"]k=347[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929845294"]k=551[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506868744"]k=619[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506860965"]k=729[/URL]

S58: (k=266 is only probable prime)

[URL="http://factordb.com/cert.php?id=1100000001506867741"]k=20[/URL]
[URL="http://factordb.com/cert.php?id=1100000000917723083"]k=29[/URL]
[URL="http://factordb.com/cert.php?id=1100000000920998505"]k=53[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929848891"]k=146[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929848930"]k=209[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506868811"]k=296[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929848453"]k=332[/URL]
[URL="http://factordb.com/cert.php?id=1100000001568659081"]k=362[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929848952"]k=383[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506867627"]k=392[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929848875"]k=416[/URL]

S61:

[URL="http://factordb.com/cert.php?id=1100000000922387835"]k=23[/URL]
[URL="http://factordb.com/cert.php?id=1100000000922387890"]k=43[/URL]
[URL="http://factordb.com/cert.php?id=1100000000922457360"]k=62[/URL]

S64:

[URL="http://factordb.com/cert.php?id=1100000000315647263"]k=11[/URL]

sweety439 2020-08-29 16:48

2 Attachment(s)
[QUOTE=sweety439;555375]Update files.[/QUOTE]

Update files, all Sierp/Riesel k=1~7 (for bases 2<=b<=1024) are searched to n=6000

sweety439 2020-09-02 16:06

[QUOTE=sweety439;555383]S46: (k=17 is only probable prime)

[URL="http://factordb.com/cert.php?id=1100000000920998568"]k=89[/URL]
[URL="http://factordb.com/cert.php?id=1100000000920998576"]k=95[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506869599"]k=140[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929841013"]k=229[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506863902"]k=278[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506861892"]k=347[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929845294"]k=551[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506868744"]k=619[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506860965"]k=729[/URL]

S58: (k=266 is only probable prime)

[URL="http://factordb.com/cert.php?id=1100000001506867741"]k=20[/URL]
[URL="http://factordb.com/cert.php?id=1100000000917723083"]k=29[/URL]
[URL="http://factordb.com/cert.php?id=1100000000920998505"]k=53[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929848891"]k=146[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929848930"]k=209[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506868811"]k=296[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929848453"]k=332[/URL]
[URL="http://factordb.com/cert.php?id=1100000001568659081"]k=362[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929848952"]k=383[/URL]
[URL="http://factordb.com/cert.php?id=1100000001506867627"]k=392[/URL]
[URL="http://factordb.com/cert.php?id=1100000000929848875"]k=416[/URL]

S61:

[URL="http://factordb.com/cert.php?id=1100000000922387835"]k=23[/URL]
[URL="http://factordb.com/cert.php?id=1100000000922387890"]k=43[/URL]
[URL="http://factordb.com/cert.php?id=1100000000922457360"]k=62[/URL]

S64:

[URL="http://factordb.com/cert.php?id=1100000000315647263"]k=11[/URL][/QUOTE]

S67:

[URL="http://factordb.com/cert.php?id=1100000000933743278"]k=11[/URL]

S72:

[URL="http://factordb.com/cert.php?id=1100000001545324465"]k=141[/URL]

S73: (k=14 is only probable prime)

[URL="http://factordb.com/cert.php?id=1100000000955319214"]k=21[/URL]
[URL="http://factordb.com/cert.php?id=1100000000933743766"]k=39[/URL]

S75:

[URL="http://factordb.com/cert.php?id=1100000000955319204"]k=11[/URL]

S79:

[URL="http://factordb.com/index.php?id=1100000000895533004"]k=3[/URL] (proven by N+1-method) ([URL="http://factordb.com/cert.php?id=1100000000266100655"]certificate for large prime factor for N+1[/URL])
[URL="http://factordb.com/index.php?id=1100000000936108459"]k=5[/URL] (proven by N-1-method)

S80:

[URL="http://factordb.com/cert.php?id=1100000000936108517"]k=552[/URL]

S81: (k=311 is only probable prime)

[URL="http://factordb.com/cert.php?id=1100000001544499856"]k=34[/URL]
[URL="http://factordb.com/cert.php?id=1100000000778119796"]k=41[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936108563"]k=43[/URL]
[URL="http://factordb.com/cert.php?id=1100000001545068937"]k=317[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936108914"]k=349[/URL]
[URL="http://factordb.com/cert.php?id=1100000001545089353"]k=389[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936108996"]k=415[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936109004"]k=425[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936109030"]k=431[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936109048"]k=433[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936109077"]k=479[/URL]
[URL="http://factordb.com/cert.php?id=1100000000934850796"]k=503[/URL]

S88:

[URL="http://factordb.com/cert.php?id=1100000000936509845"]k=8[/URL]

S92:

[URL="http://factordb.com/cert.php?id=1100000000936109437"]k=25[/URL]

S93: (k=19 is only probable prime)

[URL="http://factordb.com/index.php?id=1100000000895533224"]k=3[/URL] (proven by N-1-method)
[URL="http://factordb.com/cert.php?id=1100000000936109495"]k=31[/URL]
[URL="http://factordb.com/cert.php?id=1100000001094944813"]k=43[/URL]

S94:

[URL="http://factordb.com/cert.php?id=1100000000936109552"]k=17[/URL]

S97:

[URL="http://factordb.com/cert.php?id=1100000000936109659"]k=26[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936109743"]k=68[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936109794"]k=87[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936109874"]k=122[/URL]

S103: (k=13 is only probable prime)

[URL="http://factordb.com/cert.php?id=1100000000936113120"]k=20[/URL]

S105: (k=191 is only probable prime)

[URL="http://factordb.com/cert.php?id=1100000000936113242"]k=39[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936113332"]k=183[/URL]

S107:

[URL="http://factordb.com/index.php?id=1100000000895533274"]k=3[/URL] (proven by N+1-method)

S113:

[URL="http://factordb.com/cert.php?id=1100000000937227468"]k=13[/URL]

S115:

[URL="http://factordb.com/cert.php?id=1100000001062201612"]k=50[/URL]

sweety439 2020-09-02 16:26

S117:

[URL="http://factordb.com/cert.php?id=1100000001094680457"]k=11[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936593618"]k=47[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936593625"]k=67[/URL]
[URL="http://factordb.com/cert.php?id=1100000001094680500"]k=75[/URL]
[URL="http://factordb.com/cert.php?id=1100000000936593642"]k=77[/URL]
[URL="http://factordb.com/index.php?id=1100000000936593650"]k=81[/URL] (proven by N+1-method)

S256: (k=11 is only probable prime)

[URL="http://factordb.com/cert.php?id=1100000000001707231"]k=23[/URL]

S1024:

[URL="http://factordb.com/cert.php?id=1100000000001729238"]k=14[/URL]
[URL="http://factordb.com/cert.php?id=1100000000000876912"]k=41[/URL]
[URL="http://factordb.com/cert.php?id=1100000000315647263"]k=44[/URL]

sweety439 2020-09-02 20:11

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

Update newest file for Riesel problems to include R126

sweety439 2020-09-02 21:32

Reserve R70


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

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