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 "Wacław Sierpiński"

From Prime-Wiki
Jump to: navigation, search
m
(cat. changed)
Line 1: Line 1:
'''Waclaw Sierpiński''' {{BirthDeath|14. March 1882|21. October 1969}} was a Polish [[mathematician]] contributing in [[number theory]] and others.
+
'''Waclaw Sierpiński''' {{BirthDeath|1882-03-14|1969-10-21}} was a Polish [[mathematician]] contributing in [[number theory]] and others.
  
 
In 1960 he proved there are infinitely many odd integers ''k'' (named after him [[Sierpiński number]]s) such that all k&times;2<sup>n</sup>+1 for all ''n'' are composite.
 
In 1960 he proved there are infinitely many odd integers ''k'' (named after him [[Sierpiński number]]s) such that all k&times;2<sup>n</sup>+1 for all ''n'' are composite.
Line 8: Line 8:
 
==External links==
 
==External links==
 
*[[Wikipedia:Wac%C5%82aw_Sierpi%C5%84ski|Wacław Sierpiński]]
 
*[[Wikipedia:Wac%C5%82aw_Sierpi%C5%84ski|Wacław Sierpiński]]
[[Category:Persons|Sierpinski, Waclaw]]
+
[[Category:Person|Sierpinski, Waclaw]]

Revision as of 09:17, 6 March 2019

Waclaw Sierpiński (∗ 1882-03-14; † 1969-10-21) was a Polish mathematician contributing in number theory and others.

In 1960 he proved there are infinitely many odd integers k (named after him Sierpiński numbers) such that all k×2n+1 for all n are composite.

See also

Sierpiński problem

External links