![]() |
Sierpinski base 149
[CODE]
k,n 2,3 3,2 [/CODE] With conjectured k=4, k=1 remains. |
Sierpinski base 155
[CODE]
k,n 2,1 3,1 [/CODE] With conjectured k=5, k=1 and k=4 remain. |
Sierpinski base 159
[CODE]
k,n 1,2 2,3 3,1 4,29 5,234 6,2 7,1 8,5 [/CODE] With conjectured k=9, this conjecture is proven. |
Sierpinski base 164
[CODE]
k,n 1,4 2,3 3,4 [/CODE] With conjectured k=4, this conjecture is proven. |
Sierpinski base 167
[CODE]
k,n 1,16 3,1 4,10 [/CODE] With conjectured k=5, k=2 remains. |
Sierpinski base 173
[CODE]
k,n 1,16 2,1 3,2 4,10 5,1 6,1 [/CODE] With conjectured k=7, this conjecture is proven. |
Sierpinski base 174
[CODE]
k,n 1,4 2,1 3,1 5,2 [/CODE] With conjectured k=6, k=4 remains. |
Sierpinski base 179
[CODE]
k,n 2,1 3,1 [/CODE] With conjectured k=4, k=1 remains. |
Riesel base 131
[CODE]
k,n 1,3 2,4 3,2 4,1 [/CODE] With conjectured k=5, this conjecture is proven. |
Riesel base 134
[CODE]
k,n 1,5 2,2 3,1 [/CODE] With conjectured k=4, this conjecture is proven. |
Riesel base 139
[CODE]
k,n 1,163 2,1 3,114 5,1 [/CODE] With conjectured k=6, k=4 proven composite by partial algebraic factors, this conjecture is proven. |
| All times are UTC. The time now is 22:55. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.