1 Let ϕ and λ be the Euler and Carmichael functions, respectively. In this paper, we establish lower and upper bounds for the number of positive integers n ≤ x such that ϕ(λ(n)) = λ(ϕ(n)). We also study the normal order of the function ϕ(λ(n))/λ(ϕ(n)).
Let φ denote the Euler function. For a fixed integer k ≠ 0, we study positive integers n for which t...
A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the asso...
If n is a positive integer such that ϕ(n)σ(n) = m² for some positive integer m, then m≤n. We put m =...
Let ϕ(n) and λ(n) denote the Euler and Carmichael functions, respectively. In this paper, we investi...
Let ϕ denote the Euler function. In this paper, we estimate the number of positive integers n ≤ x wi...
We give upper bounds for the number of solutions to congruences with the Euler function φ(n) and wit...
http://www.math.missouri.edu/~bbanks/papers/index.htmlThe Euler function has long been regarded as o...
For a positive integer n, we let φ(n) and λ(n) denote the Euler function and the Carmichael function...
Dedicated to Hugh Williams on the occasion of his sixtieth birthday. Abstract. We establish upper bo...
The arithmetic function λ(n) is the exponent of the cyclic group (Z/nZ)^x. The k-th iterate of λ(n...
This is a preprint of an article published in Monatshefte für Mathematik (2005), Volume 146, Number ...
We give upper bounds for the number of solutions to congruences with the Euler function ϕ(n) modulo ...
Let ϕ(·) denote the Euler function, and let a> 1 be a fixed integer. We study several divisibilit...
Abstract Let λ denote Carmichael's function, so λ(n) is the universal exponent for the multipli...
Abstract. Let g ≥ 2. A real number is said to be g-normal if its base g expansion contains every fin...
Let φ denote the Euler function. For a fixed integer k ≠ 0, we study positive integers n for which t...
A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the asso...
If n is a positive integer such that ϕ(n)σ(n) = m² for some positive integer m, then m≤n. We put m =...
Let ϕ(n) and λ(n) denote the Euler and Carmichael functions, respectively. In this paper, we investi...
Let ϕ denote the Euler function. In this paper, we estimate the number of positive integers n ≤ x wi...
We give upper bounds for the number of solutions to congruences with the Euler function φ(n) and wit...
http://www.math.missouri.edu/~bbanks/papers/index.htmlThe Euler function has long been regarded as o...
For a positive integer n, we let φ(n) and λ(n) denote the Euler function and the Carmichael function...
Dedicated to Hugh Williams on the occasion of his sixtieth birthday. Abstract. We establish upper bo...
The arithmetic function λ(n) is the exponent of the cyclic group (Z/nZ)^x. The k-th iterate of λ(n...
This is a preprint of an article published in Monatshefte für Mathematik (2005), Volume 146, Number ...
We give upper bounds for the number of solutions to congruences with the Euler function ϕ(n) modulo ...
Let ϕ(·) denote the Euler function, and let a> 1 be a fixed integer. We study several divisibilit...
Abstract Let λ denote Carmichael's function, so λ(n) is the universal exponent for the multipli...
Abstract. Let g ≥ 2. A real number is said to be g-normal if its base g expansion contains every fin...
Let φ denote the Euler function. For a fixed integer k ≠ 0, we study positive integers n for which t...
A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the asso...
If n is a positive integer such that ϕ(n)σ(n) = m² for some positive integer m, then m≤n. We put m =...
DOI
Add to ORKG