| Display title | Sierpinski number |
| Default sort key | Sierpinski Number |
| Page length (in bytes) | 11,486 |
| Namespace ID | 0 |
| Page ID | 207777 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>WikiGary |
| Date of page creation | 06:19, 15 June 2021 |
| Latest editor | imported>WikiGary |
| Date of latest edit | 06:19, 15 June 2021 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In number theory, a Sierpiński number is an odd natural number k such that $ k\times 2^{n}+1 $ is composite for all natural numbers n. In 1960, Wacław Sierpiński proved that there are infinitely many odd integers k which have this property.
In other words, when k is a Sierpiński number, all members of... |
