General SectionMultiplicative functions on shifted primes
Introduction
The understanding of the local behavior of arithmetic functions has been the subject of research of many mathematicians. Part of this research involves the study of the values of an arithmetic function on consecutive integers. For example, if we denote the divisor function by τ, in 1952 Erdös and Mirsky [1] asked whether the equation admits infinitely many solutions in the set of natural numbers, a question that can be considered as a close relative of the twin prime conjecture. It remained open for about thirty years until Heath-Brown [3] answered it affirmatively in 1984 by showing that
The method of Heath-Brown also yielded that there exist infinitely many positive integer solutions to the equation , where Ω counts the number of prime factors of n with multiplicity. His method, however, was not successful in proving that the analogous equation has infinitely many positive integer solutions for the function ω which counts the number of distinct prime factors of n. It was Schlage-Puchta [8] who proved for the first time that even the equality holds for infinitely many natural numbers n.
In 2011, Goldston, Graham, Pintz and Yildirim [2] made a significant breakthrough. They did not just prove that there are infinitely many integer solutions of those equations, but they also showed that the value of the relevant arithmetic function or ω can be specified. For instance, they proved that there are infinitely many integers n such that .
Arithmetic functions, such as τ, are very sensitive on the exact number of prime factors of their input. In particular, they are highly sensitive on the large prime factors of their input. On the other hand, if we consider functions that are less sensitive to large prime factors, we can say more. Indeed, recently, De Koninck and Luca [6] proved that for any fixed integer we have that is arbitrarily close to 1 infinitely often. Here φ stands for the Euler totient function. They also established the same result for the additive functions ω, Ω, the sum of divisors function and the kernel function γ, which is the multiplicative function defined by the relation for any prime power .
They had also proved [5, Problem 8.6] that if is a permutation of , the inequalities hold for an infinite set of natural numbers n.
The purpose of the present paper is to extend these results. We state below our main result and an immediate consequence of it. Both of them are in the same spirit as the work of De Koninck and Luca.
Theorem 1.1 Let k be a positive integer and let f be a positive multiplicative function such that and when . There exists a positive real number c such that the set of tuples is dense either in or in .
Corollary 1.2 Let be an integer and let f be a positive multiplicative function such that and when . If is a permutation of , the inequalities hold for infinitely many primes p.
Proof In Theorem 1.1, we may choose sufficiently small or large (this depends on whether we have density in or ) non-negative numbers such that and for all on a subsequence of the primes. Then, for such that , we have that for infinitely many primes p. □
Remark 1.1 In Theorem 1.1 we assumed that the function f is positive. However, we can have an analogous result for f being zero only on a finite set of primes by replacing the shifts by the k first multiples of the product of those primes. For example, if , we can modify the proofs below by replacing the shifts by the even shifts 2i. Doing so implies that there exists a constant such that the set of tuples is dense either in or .
Remark 1.2 This theorem extends (1.1), proven by De Koninck and Luca. It is also worth noting that there are additive functions whose values on consecutive integers can be ordered. For example, De Koninck, Friedlander and Luca [4] proved that the inequalities hold infinitely often. They also proved that ω can be replaced by Ω in (1.2). Furthermore, minor changes in the solution of Problem 7.26 in [5] can lead to these results with .
Theorem 1.1 may be directly deduced from its more technical analogue, which is the following theorem that we prove in Section 2.
Theorem 1.3 Let be an integer and let f be a positive multiplicative function such that as . Let also . (a) If then the set of tuples is dense in . (b) If the set of tuples is dense in .
Let and let n be a natural number. The y-rough part of n is defined to be equal to and its y-smooth part is given by .
Section snippets
Auxiliary results and proof of Theorem 1.3
In this section we prove two preparatory lemmas and use them to establish Theorem 1.3. We begin with the first lemma, which will be only needed for the proof of the second one and we then make use of the second lemma to prove Theorem 1.3.
Lemma 2.1 Let be a sequence of non-negative terms with and as . If , there exists a subsequence of such that .
Proof Since , we may define to be the smallest positive integer such that for all . Moreover,
Proof of inequality (2.5)
To complete the proof of Theorem 1.3, it remains to prove inequality (2.5). Its proof will be based upon the Fundamental Lemma of Sieve Methods.
Theorem 3.1 The Fundamental Lemma of Sieve Theory Let be a finite set of integers and let be a set of primes. We define If there exists a non-negative multiplicative function v, some real number X, remainder terms and positive constants κ and C such that for all ,
Acknowledgments
The author would like to thank his advisor Dimitris Koukoulopoulos for all the useful discussions on Theorem 1.3 and for suggesting a sieving argument that led to a simplification of Theorem 1.1. He would also like to thank Andrew Granville for sharing his ideas about the necessity of the conditions in the statement of the main theorem. Last, but not least, he thanks the Stavros Niarchos Scholarships Foundation for the generous financial support that provides to him for his doctoral studies.
References (8)
- et al.
The distribution of values of the divisor function
Proc. Lond. Math. Soc. (3)
(1952) - et al.
Small gaps between almost primes, the parity problem, and some conjectures of Erdös on consecutive integers
Int. Math. Res. Not.
(2011) The divisor function at consecutive integers
Mathematika
(1984)- et al.
On strings of consecutive integers with a distinct number of prime factors
Proc. Am. Math. Soc.
(2009)