Lucky numbers of Euler
Obviously, when k is equal to n, the value cannot be prime anymore since n2 − n + n = n2 is divisible by n. Since the polynomial can be rewritten as k (k−1) + n, using the integers k with −(n−1) < k ≤ 0 produces the same set of numbers as 1 ≤ k < n.
Leonhard Euler published the polynomial k2 − k + 41 which produces prime numbers for all integer values of k from 1 to 40. Only 6 lucky numbers of Euler exist, namely 2, 3, 5, 11, 17 and 41 (sequence A014556 in the OEIS).
These numbers are not related to the lucky numbers generated by a sieve algorithm.
- Le Lionnais, F. Les Nombres Remarquables. Paris: Hermann, pp. 88 and 144, 1983.
|This number article is a stub. You can help Wikipedia by expanding it.|