Sierpinski problem
The Sierpinski Problem: Definition and Status In 1960 Waclaw Sierpinski (1882-1969) proved the following interesting result. Theorem . There exist infinitely many odd integers k such that k.2n + 1 is composite for every n 1. A multiplier k with this property is called a Sierpinski number. The Sierpinski problem consists in determining the smallest Sierpinski number. In 1962, John Selfridge ...
|
Division Rules