The Bouniakowsky Conjecture

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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


Snapshots


Details

detailSectionParagraph


Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send