| 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"
(restored) |
(No difference)
|
Revision as of 00:02, 24 January 2019
A Sierpinski number is an odd natural number k such that all k×2n+1 for all n are composite.
These numbers are named after Waclaw Sierpinski.
