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"

From Prime-Wiki
Jump to: navigation, search
(restored)
 
(name corr.)
Line 1: Line 1:
 
A '''Sierpinski number''' is an odd natural number ''k'' such that all k&times;2<sup>n</sup>+1 for all n are [[Composite number|composite]].
 
A '''Sierpinski number''' is an odd natural number ''k'' such that all k&times;2<sup>n</sup>+1 for all n are [[Composite number|composite]].
  
These numbers are named after [[Waclaw Sierpinski]].
+
These numbers are named after [[Wacław Sierpiński]].
  
 
==See also==
 
==See also==

Revision as of 13:30, 28 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 Wacław Sierpiński.

See also

Sierpinski problem

External links