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

Sierpiński number

From Prime-Wiki
Revision as of 13:37, 8 April 2023 by HappyBot (talk | contribs) (Adding accent to Sierpiński)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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.

See also

Sierpiński problem

External links