Dickson's conjecture

From Number
Revision as of 21:29, 29 January 2014 by Vipul (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search


Suppose are integers with all the . Then, consider the polynomials:

Then, one of the following is true:

  • There is a prime number such that the product is times an integer-valued polynomial. In other words, one of the polynomials is always congruent to 1 modulo .
  • There exist infinitely many [[natural number]s for which all the values are simultaneously prime.