Hostname: page-component-7479d7b7d-pfhbr Total loading time: 0 Render date: 2024-07-16T00:20:57.590Z Has data issue: false hasContentIssue false

# Euler’s prime-producing polynomial revisited

Published online by Cambridge University Press:  15 February 2024

## Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Euler’s polynomial f (n) = n2 + n + 41 is famous for producing 40 different prime numbers when the consecutive values 0, 1, …, 39 are substituted: see Table 1. Some authors, including Euler, prefer the polynomial f (n − 1) = n2n + 41 with prime values for n = 1, …, 40. Since f (−n) = f (n − 1), f (n) actually takes prime values (with each value repeated once) for n = −40, −39, …, 39; equivalently the polynomial f (n − 40) = n2 − 79n + 1601 takes (repeated) prime values for n = 0, 1, …, 79.

Type
Articles
Information
The Mathematical Gazette , March 2024 , pp. 69 - 77
Creative Commons
This is an Open Access article, distributed under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike licence (https://creativecommons.org/licenses/by-nc-sa/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the same Creative Commons licence is included and the original work is properly cited. The written permission of Cambridge University Press must be obtained for commercial re-use.