Elementary Observations Concerning Euler's Prime Generating Polynomial f(n) = n2-n + 41

DOI10.1080/0025570X.1962.11975324MaRDI QIDQ3290767zbMATH OpenOpenAlexFDO

Authors Sidney Kravitz

Publication date 1962

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0025570x.1962.11975324

zbMATH Keywords

Euler's prime generating polynomial

Mathematics Subject Classification ID

Primes (11A41) Primes represented by polynomials; other multiplicative structures of polynomial values (11N32)

Recommendations

• scientific article; zbMATH DE number 4125500
• Euler's famous prime generating polynomial and the class number of imaginary quadratic fields
• scientific article; zbMATH DE number 4083761
• scientific article; zbMATH DE number 3829840
• Note on the Euler Numbers and Polynomials
• A note on generalized Euler numbers and polynomials
• A note on Euler numbers and polynomials
• A note on the generalized Euler numbers and polynomials
• A note on Euler number and polynomials
• Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function

Cited in

(2)

• scientific article; zbMATH DE number 4112719 (Why is no real title available?)
• A new formula for prime numbers

This page was built for publication: Elementary Observations Concerning Euler's Prime Generating Polynomial f(n) = n²-n + 41

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3290767)