Let σ(n) denote the sum of positive divisors of the integer n, and let φ denote Euler's function, that is, φ(n) is the number of integers in the interval [1, n] that are relatively prime to n. It has been conjectured by Mąkowski and Schinzel that σ(φ(n))/n ≥ 1/2 for all n. We show that σ(φ(n))/n → ∞ on a set of numbers n of asymptotic density 1. In addition, we study the average order of σ(φ(n))/n as well as its range. We use similar methods to prove a conjecture of Erdős that φ(n − φ(n)) < φ(n) on a set of asymptotic density 1.
Let σ(n) denote the sum of positive divisors of the integer n, and let φ denote Euler's function, that is, φ(n) is the number of integers in the interval [1, n] that are relatively prime to n. It has been conjectured by Mąkowski and Schinzel that σ(φ(n))/n ≥ 1/2 for all n. We show that σ(φ(n))/n → ∞ on a set of numbers n of asymptotic density 1. In addition, we study the average order of σ(φ(n))/n as well as its range. We use similar methods to prove a conjecture of Erdős that φ(n − φ(n)) < φ(n) on a set of asymptotic density 1.
“…Estimates similar to those considered in Theorem 1.1 were established by Warlimont [17] in the case k = 1; see the remarks at the end of Section 2.…”
Section: Theorem 11 Fix a Positive Integer K Then As X → ∞ We Havementioning
confidence: 67%
“…Warlimont [17] calculated asymptotic formulas for the partial sums of ϕ/ϕ 2 , ϕ 2 /ϕ and log ϕ ϕ2 . There is no difficulty in calculating corresponding formulas for the partial sums of ϕ k /ϕ k+1 , ϕ k+1 /ϕ k , or log ϕ k ϕ k+1 , for any fixed k, by the methods employed in the proof of Theorem 1.1.…”
Let ϕ k denote the kth iterate of Euler's ϕ-function. We study two questions connected with these iterates. First, we determine the average order of ϕ k and 1/ϕ k ; e.g., we show that for each k ≥ 0, n≤x
“…Since the inequalities 1 ≥ ϕ(λ(n)) λ(n) 1 log 2 λ(n) ≥ 1 log 2 n hold for all n, and the estimate λ(n) = n exp(− (1 + o(1)) log 2 n log 3 n) (49) holds for almost all n (see [19]), it follows that ϕ(λ(n)) = n exp(− (1 + o(1)) log 2 n log 3 n)…”
Section: Lemma 10 the Following Estimate Holdsmentioning
confidence: 99%
“…For a variety of other results with a similar flavor, we refer the reader to [3,4,5,6,8,10,12,13,21,22,23,24,26,33,34,40,42,45,49] and the references contained therein.…”
Abstract. 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)).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.