| Display title | Lucky numbers of Euler |
| Default sort key | Lucky numbers of Euler |
| Page length (in bytes) | 2,427 |
| Namespace ID | 0 |
| Page ID | 202975 |
| 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>LinXED |
| Date of page creation | 06:51, 27 June 2023 |
| Latest editor | imported>LinXED |
| Date of latest edit | 06:51, 27 June 2023 |
| 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. | Euler's "lucky" numbers are positive integers n such that for all integers k with 1 ≤ k < n, the polynomial k2 − k + n produces a prime number.
When k is equal to n, the value cannot be prime since n2 − n + n = n2 is divisible by n. Since the polynomial can be written as k(k−1) + n, using the integers... |
