The Bouniakowsky Conjecture
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
In 1857, Bouniakowsky conjectured that if is an irreducible polynomial, generates an infinite number of primes. Dirichlet proved the conjecture for . Beyond that, neither proofs nor counterexamples are known. Here, a signed logplot is given for a variety of polynomials, with red dots indicating primes.
Contributed by: Ed Pegg Jr (April 2007)
Open content licensed under CC BY-NC-SA
"The Bouniakowsky Conjecture"
Wolfram Demonstrations Project
Published: April 27 2007