ABSTRACT. We show that the equation φ(a) = σ(b) has infinitely many solutions, where φ is Euler’s totient function and σ is the sum-of-divisors function. This proves a 50-year old conjecture of Erdős. Moreover, we show that for some c> 0, there are infinitely many integers n such that φ(a) = n and σ(b) = n each have more than nc solutions. The proofs rely on the recent work of the first two authors and Konyagin on the distribution of primes p for which a given prime divides some iterate of φ at p, and on a result of Heath-Brown connecting the possible existence of Siegel zeros with the distribution of twin primes. 1
Abstract. We study the number and nature of solutions of the equation (n) = (n + k), where denotes ...
In 2 2 2a b c there are infinitely many primes a and c solutions. The generalized Pythagorean tr...
We study the sum [equation omitted for formating reasons] of consecutive iterations of the Euler fun...
ABSTRACT. We show that the equation φ(a) = σ(b) has infinitely many solutions, where φ is Euler’s t...
We prove that the only solutions to the equation σ(n)=2φ(n) with at most three distinct prime factor...
AbstractLet ν(n) denote the number of distinct prime factors of n. We show that the equation n + ν(n...
We find the form of all solutions to ø(n) | σ(n) with three or fewer prime factors, except when the ...
We give upper bounds for the number of solutions to congruences with the Euler function φ(n) and wit...
Let φ denote the Euler function. For a fixed integer k ≠ 0, we study positive integers n for which t...
We study integers n > 1 satisfying the relation σ(n) = γ(n)², where σ(n) and γ(n) are the sum of div...
We find the form of all solutions to φ(n) |σ(n) with three or fewer prime factors, except when the q...
For any positive integer k let φ(k), σ(k), and τ(k) be the Euler function of k, the divisor sum func...
Let σ(n)=∑d∣nd be the usual sum-of-divisors function. In 1933, Davenport showed that n/σ(n) possesse...
AbstractThe expressions ϕ(n)+σ(n)−3n and ϕ(n)+σ(n)−4n are unusual among linear combinations of arith...
We study the set D of positive integers d for which the equation $\phi(a)-\phi(b)=d$ has infinitely ...
Abstract. We study the number and nature of solutions of the equation (n) = (n + k), where denotes ...
In 2 2 2a b c there are infinitely many primes a and c solutions. The generalized Pythagorean tr...
We study the sum [equation omitted for formating reasons] of consecutive iterations of the Euler fun...
ABSTRACT. We show that the equation φ(a) = σ(b) has infinitely many solutions, where φ is Euler’s t...
We prove that the only solutions to the equation σ(n)=2φ(n) with at most three distinct prime factor...
AbstractLet ν(n) denote the number of distinct prime factors of n. We show that the equation n + ν(n...
We find the form of all solutions to ø(n) | σ(n) with three or fewer prime factors, except when the ...
We give upper bounds for the number of solutions to congruences with the Euler function φ(n) and wit...
Let φ denote the Euler function. For a fixed integer k ≠ 0, we study positive integers n for which t...
We study integers n > 1 satisfying the relation σ(n) = γ(n)², where σ(n) and γ(n) are the sum of div...
We find the form of all solutions to φ(n) |σ(n) with three or fewer prime factors, except when the q...
For any positive integer k let φ(k), σ(k), and τ(k) be the Euler function of k, the divisor sum func...
Let σ(n)=∑d∣nd be the usual sum-of-divisors function. In 1933, Davenport showed that n/σ(n) possesse...
AbstractThe expressions ϕ(n)+σ(n)−3n and ϕ(n)+σ(n)−4n are unusual among linear combinations of arith...
We study the set D of positive integers d for which the equation $\phi(a)-\phi(b)=d$ has infinitely ...
Abstract. We study the number and nature of solutions of the equation (n) = (n + k), where denotes ...
In 2 2 2a b c there are infinitely many primes a and c solutions. The generalized Pythagorean tr...
We study the sum [equation omitted for formating reasons] of consecutive iterations of the Euler fun...