AbstractIterating the Euler ϕ-function, we write ϕl(n) = ϕ (ϕl − 1(n)), and, for a fixed l, we investigate the integers n which are solutions of the arithmetic equation n = kϕl(n), for some integer k
Let ϕ(·) denote the Euler function, and let a> 1 be a fixed integer. We study several divisibilit...
Abstract. We study the solutions of the equation φ(Cm)/φ(Cn) = r, where r is a fixed rational numbe...
Communicated by C. Pomerance We establish an asymptotic formula for the number of positive integers ...
Let ϕ(n) and λ(n) denote the Euler and Carmichael functions, respectively. In this paper, we investi...
Let ϕ(n) and λ(n) denote the Euler and Carmichael functions, respectively. In this paper, we investi...
Let ϕ denote Euler’s totient function. It is shown that if r ≥ 2 there exist only finitely many posi...
Let ϕ denote Euler’s totient function. It is shown that if r ≥ 2 there exist only finitely many posi...
Euler searches for integer solutions to axx+bx+c=yy and considers some applications to figurate numb...
Euler searches for integer solutions to axx+bx+c=yy and considers some applications to figurate numb...
AbstractWe study the solutions of the equation ϕ(Cm)/ϕ(Cn)=r, where r is a fixed rational number, Ck...
For any positive integer k let φ(k), σ(k), and τ(k) be the Euler function of k, the divisor sum func...
We give upper bounds for the number of solutions to congruences with the Euler function ϕ(n) modulo ...
summary:For a positive integer $n$ we write $\phi (n)$ for the Euler function of $n$. In this note, ...
summary:For a positive integer $n$ we write $\phi (n)$ for the Euler function of $n$. In this note, ...
We study the solutions of the equation 0(Cm)/0(Cmn) = r, where r is a fixed rational number, Ck is t...
Let ϕ(·) denote the Euler function, and let a> 1 be a fixed integer. We study several divisibilit...
Abstract. We study the solutions of the equation φ(Cm)/φ(Cn) = r, where r is a fixed rational numbe...
Communicated by C. Pomerance We establish an asymptotic formula for the number of positive integers ...
Let ϕ(n) and λ(n) denote the Euler and Carmichael functions, respectively. In this paper, we investi...
Let ϕ(n) and λ(n) denote the Euler and Carmichael functions, respectively. In this paper, we investi...
Let ϕ denote Euler’s totient function. It is shown that if r ≥ 2 there exist only finitely many posi...
Let ϕ denote Euler’s totient function. It is shown that if r ≥ 2 there exist only finitely many posi...
Euler searches for integer solutions to axx+bx+c=yy and considers some applications to figurate numb...
Euler searches for integer solutions to axx+bx+c=yy and considers some applications to figurate numb...
AbstractWe study the solutions of the equation ϕ(Cm)/ϕ(Cn)=r, where r is a fixed rational number, Ck...
For any positive integer k let φ(k), σ(k), and τ(k) be the Euler function of k, the divisor sum func...
We give upper bounds for the number of solutions to congruences with the Euler function ϕ(n) modulo ...
summary:For a positive integer $n$ we write $\phi (n)$ for the Euler function of $n$. In this note, ...
summary:For a positive integer $n$ we write $\phi (n)$ for the Euler function of $n$. In this note, ...
We study the solutions of the equation 0(Cm)/0(Cmn) = r, where r is a fixed rational number, Ck is t...
Let ϕ(·) denote the Euler function, and let a> 1 be a fixed integer. We study several divisibilit...
Abstract. We study the solutions of the equation φ(Cm)/φ(Cn) = r, where r is a fixed rational numbe...
Communicated by C. Pomerance We establish an asymptotic formula for the number of positive integers ...