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 a1,a2,,ak,b1,b2,,bk are integers with all the ai1. Then, consider the polynomials:

fi(x):=aix+bi,i{1,2,,n}

Then, one of the following is true:

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