# Divisors of Shifted Primes

@article{Koukoulopoulos2010DivisorsOS,
title={Divisors of Shifted Primes},
author={Dimitris Koukoulopoulos},
journal={International Mathematics Research Notices},
year={2010},
volume={2010},
pages={4585-4627}
}
We bound from below the number of shifted primes p+s x that have a divisor in a given interval (y;z). Kevin Ford has obtained upper bounds of the expected order of magnitude on this quantity as well as lower bounds in a special case of the parameters y and z. We supply here the corresponding lower bounds in a broad range of the parameters y and z. As expected, these bounds depend heavily on our knowledge about primes in arithmetic progressions. As an application of these bounds, we determine…
19 Citations
Generalized and Restricted Multiplication Tables of Integers
In 1955 Erdős posed the multiplication table problem: Given a large integer N , how many distinct products of the form ab with a ≤ N and b ≤ N are there? The order of magnitude of the above quantity
On the Distribution of Pseudopowers
• Mathematics
• 2010
Abstract An $x$ -pseudopower to base $g$ is a positive integer that is not a power of $g$ , yet is so modulo $p$ for all primes $p\,\le \,x$ . We improve an upper bound for the least such number, due
The Sato–Tate distribution in thin parametric families of elliptic curves
• Mathematics
• 2015
We obtain new results concerning the Sato–Tate conjecture on the distribution of Frobenius traces over single and double parametric families of elliptic curves. We consider these curves for values of
Open Problems for Polynomials over Finite Fields and Applications
• D. Panario
• Mathematics
Open Problems in Mathematics and Computational Science
• 2014
This work comments in some detail on the existence and number of several classes of polynomials and centers on classes of low-weight (irreducible) polynmials.
Pseudorandom numbers and hash functions from iterations of multivariate polynomials
• Mathematics
Cryptography and Communications
• 2009
Using this construction a new class of hash functions from iterations of polynomials is designed and estimates are used to motivate their “mixing” properties.
ROUGH INTEGERS WITH A DIVISOR IN A GIVEN INTERVAL
• K. Ford
• Mathematics
Journal of the Australian Mathematical Society
• 2020
Abstract We determine, up to multiplicative constants, the number of integers $n\leq x$ that have a divisor in $(y,2y]$ and no prime factor $\leq w$ . Our estimate is uniform in $x,y,w$ . We apply
On the greatest prime factor of ab + 1
We improve some results on the size of the greatest prime factor of the integers of the form ab + 1 where a and b belong to some general given finite sequences A and B with rather large density.
Exponential sums and prime divisors of sparse integers
We obtain a new lower bound on the number of prime divisors of integers whose g-ary expansion contains a fixed number of nonzero digits.
Artin's Primitive Root Conjecture – A Survey
A survey of the literature on this topic emphasizing the Artin primitive root conjecture (1927) and the contributions in the survey on `elliptic Artin' are due to Alina Cojocaru.
Multiplicative Energy of Shifted Subgroups and Bounds On Exponential Sums with Trinomials in Finite Fields
• Mathematics
• 2018
Abstract We prove a new bound on collinear triples in subgroups of prime finite fields and use it to give some new bounds on exponential sums with trinomials.

## References

SHOWING 1-10 OF 44 REFERENCES
On the maximal difference between an element and its inverse in residue rings
• Mathematics
• 2005
We investigate the distribution of n - M(n) where M(n) = max{|a - b|: 1 ≤ a, b < n - 1 and ab ≡ 1 (mod n)}. Exponential sums provide a natural tool for obtaining upper bounds on this quantity. Here
The distribution of integers with a divisor in a given interval
We determine the order of magnitude of H(x;y;z), the number of integers n x having a divisor in (y;z], for all x;y and z. We also study Hr(x;y;z), the number of integers n x having exactly r divisors
Short sums of certain arithmetic functions
• Mathematics
• 1998
uniformly for 1 6 q 6 y. This result has turned out to be very useful in a wide range of applications. A closer inspection of its proof reveals, in the case q = 1, that : (a) g needs only be
Zeros ofL-functions
for some fixed A and B. Both (2) and (3) are proved by the use of mean value theorems, the large sieve in the case of (3). The lack of a bound for (1) which is good with respect to both Q and Tmay be
On the Number of Carmichael Numbers up to x
It is shown that, for all large x, there are more than x0.33 Carmichael numbers up to x, improving on the ground‐breaking work of Alford, Granville and Pomerance, who were the first to demonstrate
Note on Sequences of Integers No One of Which is Divisible By Any Other
[Extracted from the Journal of the London Mathematical Society, Vol . 1.0 (1935) .] 1 Let at , a 2 , a3 , . . . be a sequence of integers, say (A), such that am is not a divisor of an unless m = n .
Multiplicative Number Theory
From the contents: Primes in Arithmetic Progression.- Gauss' Sum.- Cyclotomy.- Primes in Arithmetic Progression: The General Modulus.- Primitive Characters.- Dirichlet's Class Number Formula.- The
On Bombieri’s asymptotic sieve
If a sequence (an) of non-negative real numbers has best possible distribution in arithmetic progressions, Bombieri showed that one can deduce an asymptotic formula for the sum Σ n≤x a n Λ k (n) for
SOME REMARKS ON NUMBER THEORY
This note contains some disconnected minor remarks on number theory . 1 . Let (1) Iz j I=1, 1<j<co be an infinite sequence of numbers on the unit circle . Put n s(k, n) _ z~, Ak = Jim sup I s(k, n)
The Large Sieve
Let A be a thin set in Z n , and A N the intersection of A with the ball of diameter N centred at the origin. When n = 1 we have seen in §9.7 (as a consequence of Siegel’s theorem) that |A N | = O(N