It is shown that Dickson’s Conjecture about primes in linear polynomials implies that if f is a reducible quadratic polynomial with integral coefficients and non-zero discriminant then for every r there exists an integer such that the polynomial represents at least r distinct primes.
Let be a polynomial of degree without roots of multiplicity or . Erdős conjectured that, if satisfies the necessary local conditions, then is free of th powers for infinitely many primes . This is proved here for all with sufficiently high entropy.The proof serves to demonstrate two innovations: a strong repulsion principle for integer points on curves of positive genus, and a number-theoretical analogue of Sanov’s theorem from the theory of large deviations.
The primality of numbers, or of a number constellation, will be determined from residue solutions in the simultaneous congruence equations for binomial coefficients found in Pascal’s triangle. A prime constellation is a set of integers containing all prime numbers. By analyzing these congruences, we can verify the primality of any number. We present different arrangements of binomial coefficient elements for Pascal’s triangle, such as by the row shift method of Mann and Shanks and especially by...
We prove that for every quadratic binomial f(x) = rx² + s ∈ ℤ[x] there are pairs ⟨a,b⟩ ∈ ℕ² such that a ≠ b, f(a) and f(b) have the same prime factors and min{a,b} is arbitrarily large. We prove the same result for every monic quadratic trinomial over ℤ.
We obtain a conditional, under the Generalized Riemann Hypothesis, lower bound on the number of distinct elliptic curves over a prime finite field of elements, such that the discriminant of the quadratic number field containing the endomorphism ring of over is small. For almost all primes we also obtain a similar unconditional bound. These lower bounds complement an upper bound of F. Luca and I. E. Shparlinski (2007).