► n^2 - n + 41 produces prime numbers for all integers n, from n=0 to n=40
► The number figures in the polynomial f(n) = n^2 + n + 41, which yields primes for −40 ≤ n < 40.
► 41 is the first number of a prime number sequence that is 41 numbers long:
41 + 2 = 43
43 + 4 = 47
47 + 6 = 53
53 + 8 = 61
61 + 10 = 71
71 + 12 = 83, and so on...
► 41 is the smallest non-palindromic prime which on subtracting its reverse gives a perfect cube (41 - 14 = 3^3), and is also the smallest number that is not of the form |2^x - 3^y|.
► The number figures in the polynomial f(n) = n^2 + n + 41, which yields primes for −40 ≤ n < 40.
► 41 is the first number of a prime number sequence that is 41 numbers long:
41 + 2 = 43
43 + 4 = 47
47 + 6 = 53
53 + 8 = 61
61 + 10 = 71
71 + 12 = 83, and so on...
► 41 is the smallest non-palindromic prime which on subtracting its reverse gives a perfect cube (41 - 14 = 3^3), and is also the smallest number that is not of the form |2^x - 3^y|.
No comments:
Post a Comment