The Bouniakowsky Conjecture

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.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.