In number theory, a Sierpiński number is an odd natural number k such that k × 2 n + 1 {\displaystyle k\times 2^{n}+1} is composite for all natural numbers n. In 1960, Wacław Sierpiński proved that there are infinitely many odd integers k which have this property.
In number theory, a Sierpiński number is an odd natural number k such that k × 2 n + 1 {\displaystyle k\times 2^{n}+1} is composite for all natural numbers n. In 1960, Wacław Sierpiński proved that there are infinitely many odd integers k which have this property.
Source: Wikipedia "Sierpiński number" · CC BY-SA 4.0
Share this article: X · Bluesky