Euler's $\phi$ function, which counts the number of positive integers relative prime to and smaller than its argument, as well as the sum of divisors function $\sigma$, play an important role in number theory and its applications. In this paper, we survey various old and new results related to the distribution of the values of these two functions, their popular values, their champions, and the distribution of those positive integers satisfying certain equations involving such function, like the perfect numbers and the amicable numbers. In the second part of this paper, we discuss some of the ideas which are used in the proof of a recent result of Ford, Luca, and Pomerance which says that there are infinitely many common values in the ran...
This work aims at the study of arithmetic functions and the study of elementary theorems about the ...
The Euler equation gives a set of an infinite number of relations between the values of prime number...
AbstractFor a fixed integer s≥2, we estimate exponential sums with alternative power sums As(n)=∑i=0...
Euler's $\phi$ function, which counts the number of positive integers relative prime to and smaller ...
The function of defined to be the sum of all positive integer divisors of n. This dissertation is a ...
In this paper we study the problem of the discrepancy of Euler's phi-function and, extending a resul...
This thesis presents some problems of chance on the sum of counting numbers. It gives the probabilit...
This paper deals with a problem (proposed by P. Erdos in 1949) about the discrepancy of values of Eu...
In 1909, Landau showed that \[\limsup \tfrac{n}{\phi(n) \log\log{n}} = e^\gamma,\] where $\phi(n)$ ...
Dedicated to Hugh Williams on the occasion of his sixtieth birthday. Abstract. We establish upper bo...
In this thesis, we will study a class of divisor functions: the prime symmetric functions. These are...
Euler\u27s φ (phi) Function counts the number of positive integers not exceeding n and relatively pr...
DOI: Let \(\sigma(n)\) denote the sum of the positive divisors of \(N\). In 1933, Davenport showed ...
The divisor function $\tau(n)$ counts the number of positive divisors of an integer n. We are concer...
We show that for some $k\le 3570$ and all $k$ with $442720643463713815200|k$, the equation $\phi(n)=...
This work aims at the study of arithmetic functions and the study of elementary theorems about the ...
The Euler equation gives a set of an infinite number of relations between the values of prime number...
AbstractFor a fixed integer s≥2, we estimate exponential sums with alternative power sums As(n)=∑i=0...
Euler's $\phi$ function, which counts the number of positive integers relative prime to and smaller ...
The function of defined to be the sum of all positive integer divisors of n. This dissertation is a ...
In this paper we study the problem of the discrepancy of Euler's phi-function and, extending a resul...
This thesis presents some problems of chance on the sum of counting numbers. It gives the probabilit...
This paper deals with a problem (proposed by P. Erdos in 1949) about the discrepancy of values of Eu...
In 1909, Landau showed that \[\limsup \tfrac{n}{\phi(n) \log\log{n}} = e^\gamma,\] where $\phi(n)$ ...
Dedicated to Hugh Williams on the occasion of his sixtieth birthday. Abstract. We establish upper bo...
In this thesis, we will study a class of divisor functions: the prime symmetric functions. These are...
Euler\u27s φ (phi) Function counts the number of positive integers not exceeding n and relatively pr...
DOI: Let \(\sigma(n)\) denote the sum of the positive divisors of \(N\). In 1933, Davenport showed ...
The divisor function $\tau(n)$ counts the number of positive divisors of an integer n. We are concer...
We show that for some $k\le 3570$ and all $k$ with $442720643463713815200|k$, the equation $\phi(n)=...
This work aims at the study of arithmetic functions and the study of elementary theorems about the ...
The Euler equation gives a set of an infinite number of relations between the values of prime number...
AbstractFor a fixed integer s≥2, we estimate exponential sums with alternative power sums As(n)=∑i=0...