Polynomial values with small prime divisors
Polynomials taking prime values. (Polynômes prenant des valeurs premières.)
Power-free values, large deviations, and integer points on irrational curves
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.
Prime constellations in triangles with binomial coefficient congruences
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...
Prime factors of values of polynomials
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 ℤ.
Prime producing polynomials: Proof of a conjecture by Mollin and Williams
Prime valued polynomials and class numbers of quadratic fields.
Prime values of reducible polynomials, I
Prime values of reducible polynomials, II
Progrès récents du crible et applications
Propriétés multiplicatives des valeurs de certains polynômes en deux variables