| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Sierpiński number base 5"
(restored) |
m |
||
| Line 1: | Line 1: | ||
| − | A ''' | + | A '''Sierpiński number base 5''' is a value of ''k'' such that ''k × 5<sup>n</sup> + 1'' is always [[composite number|composite]]. |
| − | Using the same method presented in the [[ | + | Using the same method presented in the [[Sierpiński problem]] article, it was found that ''{{Num|159986}} × 5<sup>n</sup> + 1'' is multiple of 3, 7, 13, 31 or 601 (the [[covering set]]) depending on the value of ''n'', so it is always composite. |
| − | In order to demonstrate whether {{Num|159986}} is the smallest | + | In order to demonstrate whether {{Num|159986}} is the smallest Sierpiński number base 5 or not, a [[distributed computing project]] was created named [[Sierpiński-Riesel Base 5]] |
[[Category:Numbers]] | [[Category:Numbers]] | ||
Revision as of 11:02, 20 February 2019
A Sierpiński number base 5 is a value of k such that k × 5n + 1 is always composite.
Using the same method presented in the Sierpiński problem article, it was found that 159,986 × 5n + 1 is multiple of 3, 7, 13, 31 or 601 (the covering set) depending on the value of n, so it is always composite.
In order to demonstrate whether 159,986 is the smallest Sierpiński number base 5 or not, a distributed computing project was created named Sierpiński-Riesel Base 5
