2002
DOI: 10.4064/cm92-1-10
|View full text |Cite
|
Sign up to set email alerts
|

On some problems of Mąkowski–Schinzel and Erdős concerning the arithmetical functions φ and σ

Abstract: 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 as… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
33
0

Year Published

2004
2004
2018
2018

Publication Types

Select...
4
4

Relationship

3
5

Authors

Journals

citations
Cited by 30 publications
(33 citation statements)
references
References 16 publications
0
33
0
Order By: Relevance
“…The distribution of φ(n) and λ(n) has been investigated from a variety of perspectives. In particular, many interesting properties of these functions require knowledge of the distribution of prime factors of φ(n) and λ(n) (see e.g., [3]- [7], [12], [19]). …”
mentioning
confidence: 99%
“…The distribution of φ(n) and λ(n) has been investigated from a variety of perspectives. In particular, many interesting properties of these functions require knowledge of the distribution of prime factors of φ(n) and λ(n) (see e.g., [3]- [7], [12], [19]). …”
mentioning
confidence: 99%
“…Proof. It follows from a much more general statement about divisibility of the values of the Euler function, obtained in the proof of Theorem 4.1 of [2], that the number of positive integers n ≤ T with 3 ϕ(n) is O(T log −1/2 T ) (see also [8]). The same method also extends to integers with 3 σ(n) without any modifications.…”
Section: Holdsmentioning
confidence: 99%
“…By Lemma 2 of [24], we know that as t tends to infinity, the set G(t) of positive integers m ≤ t such that ϕ(m) is divisible by all primes p < log 2 t/(log 3 t) 2 is of cardinality #G(t) = (1 + o(1))t. By the Mertens formula, we see that the inequality…”
Section: #N (X)mentioning
confidence: 99%
“…We also need the following estimate, which is a variant of Lemma 2 of [24] and can be obtained by the same arguments:…”
Section: #N (X)mentioning
confidence: 99%
See 1 more Smart Citation