On factoring of unlimited integers #
by KAREL HRBACEK
We prove a special case of Dickson's Conjecture as stated in the paper: the case where
gcd(a,b)>1
orb=1
n = gcd(a,b) > 1 implies n | f(k) = a+bk for all k, violating the main hypothesis of Dickson's conjecture.
See dickson_strong
.
Dickson's Conjecture is trivial for ℓ = 0 and we do not need Hrbacek's assumption that ℓ ≥ 1.