Dickson's conjecture

From Number
Revision as of 21:29, 29 January 2014 by Vipul (talk | contribs) (Created page with "==Statement== Suppose <math>a_1,a_2,\dots,a_k,b_1,b_2,\dots,b_k</math> are integers with all the <math>a_i \ge 1</math>. Then, consider the polynomials: <math>f_i(x) := a_ix...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Statement

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.