Let ϕ denote Euler’s totient function. It is shown that if r ≥ 2 there exist only finitely many positive integers n such that ϕ(n) divides n − 1 and ϕ(n)2 ≡ r (mod n). It is also shown that if k ≥ 2 there exist only finitely many positive integers n such that ϕ(n) divides n − 1 and ϕ(n)k ≡ 1 (mod n)
Let denotes the sum of the positive divisors of the positive integer and be the Euler’s totient f...
Abstract: P. Kesava Menon's elegant identity states thatX a (mod n) (a;n)=1 (a ¡ 1; n) = Á(n) ...
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...
AbstractLet n > 2 be an integer, and for each integer 0 < x < n with (n, x) = 1, define x by the con...
AbstractLet n > 2 be an integer, and for each integer 0 < x < n with (n, x) = 1, define x by the con...
Let ϕ(·) denote the Euler function, and let a> 1 be a fixed integer. We study several divisibilit...
If n is a positive integer such that ϕ(n)σ(n) = m² for some positive integer m, then m≤n. We put m =...
If n is a positive integer such that ϕ(n)σ(n) = m² for some positive integer m, then m≤n. We put m =...
If n is a positive integer such that ϕ(n)σ(n) = m² for some positive integer m, then m≤n. We put m =...
We give upper bounds for the number of solutions to congruences with the Euler function ϕ(n) modulo ...
AbstractIterating the Euler ϕ-function, we write ϕl(n) = ϕ (ϕl − 1(n)), and, for a fixed l, we inves...
exist infinitely many positive integers not of the form n − ϕ(n), where ϕ is the Euler function. We ...
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, ...
Let denotes the sum of the positive divisors of the positive integer and be the Euler’s totient f...
Abstract: P. Kesava Menon's elegant identity states thatX a (mod n) (a;n)=1 (a ¡ 1; n) = Á(n) ...
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...
AbstractLet n > 2 be an integer, and for each integer 0 < x < n with (n, x) = 1, define x by the con...
AbstractLet n > 2 be an integer, and for each integer 0 < x < n with (n, x) = 1, define x by the con...
Let ϕ(·) denote the Euler function, and let a> 1 be a fixed integer. We study several divisibilit...
If n is a positive integer such that ϕ(n)σ(n) = m² for some positive integer m, then m≤n. We put m =...
If n is a positive integer such that ϕ(n)σ(n) = m² for some positive integer m, then m≤n. We put m =...
If n is a positive integer such that ϕ(n)σ(n) = m² for some positive integer m, then m≤n. We put m =...
We give upper bounds for the number of solutions to congruences with the Euler function ϕ(n) modulo ...
AbstractIterating the Euler ϕ-function, we write ϕl(n) = ϕ (ϕl − 1(n)), and, for a fixed l, we inves...
exist infinitely many positive integers not of the form n − ϕ(n), where ϕ is the Euler function. We ...
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, ...
Let denotes the sum of the positive divisors of the positive integer and be the Euler’s totient f...
Abstract: P. Kesava Menon's elegant identity states thatX a (mod n) (a;n)=1 (a ¡ 1; n) = Á(n) ...
Let ϕ(n) and λ(n) denote the Euler and Carmichael functions, respectively. In this paper, we investi...
DOI
Add to ORKG