Searcharxiv⌕ Search

arXiv subjects

Kevin Ford

Publications and source records attributed to Kevin Ford.

76 records · Page 5Linked to original sources

Sieving by large integers and covering systems of congruences

An old question of Erdos asks if there exists, for each number N, a finite set S of integers greater than N and residue classes r(n) mod n for n in S whose union is all the integers. We prove that if $\sum_{n\in S} 1/n$ is bounded for such a covering of the integers, then the least member of S is also bounded, thus confirming a conjecture of Erdos and Selfridge. We also prove a conjecture of Erdos and Graham, that, for each fixed number K>1, the complement in the integers of any union of residue classes r(n) mod n, for distinct n in (N,KN], has density at least d_K for N sufficiently large. Here d_K is a positive number depending only on K. Either of these new results implies another conjecture of Erdos and Graham, that if S is a finite set of moduli greater than N, with a choice for residue classes r(n) mod n for n in S which covers the integers, then the largest member of S cannot be O(N). We further obtain stronger forms of these results and establish other information, including an improvement of a related theorem of Haight.

math.NT↗

On Bombieri's asymptotic sieve

If a sequence $(a_n)$ of non-negative real numbers has ``best possible'' distribution in arithmetic progressions, Bombieri showed that one can deduce an asymptotic formula for the sum $\sum_{n\le x} a_n Λ_k(n)$ for $k\ge 2$. By constructing appropriate sequences, we show that any weakening of the well-distribution property is not sufficient to deduce the same conclusion.

math.NT↗

The number of solutions of phi(x)=m

An old conjecture of Sierpinski asserts that for every integer k \ge 2, there is a number m for which the equation ϕ(x)=m has exactly k solutions. Here ϕis Euler's totient function. In 1961, Schinzel deduced this conjecture from his Hypothesis H. The purpose of this paper is to present an unconditional proof of Sierpinski's conjecture. The proof uses many results from sieve theory, in particular the famous theorem of Chen.

math.NT↗