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"
m (Karbon moved page Sierpinski number to Sierpiński number without leaving a redirect: name) |
m |
||
Line 1: | Line 1: | ||
− | A ''' | + | A '''Sierpiński number''' is an odd natural number ''k'' such that all k×2<sup>n</sup>+1 for all n are [[Composite number|composite]]. |
These numbers are named after [[Wacław Sierpiński]]. | These numbers are named after [[Wacław Sierpiński]]. | ||
==See also== | ==See also== | ||
− | [[ | + | [[Sierpiński problem]] |
==External links== | ==External links== | ||
− | *[ | + | *[[Wikipedia:Sierpinski_number|Sierpiński number]] |
[[Category:Numbers]] | [[Category:Numbers]] |
Revision as of 10:52, 20 February 2019
A Sierpiński number is an odd natural number k such that all k×2n+1 for all n are composite.
These numbers are named after Wacław Sierpiński.