Seems horrible but actually trivial. —EthanWYX2009
1. Introduction
Let
n be a positive integer. Let
,
and
denote the Euler totient function, Dedekind function and sum–of–divisors function respectively. For
, we have
These arithmetic functions satisfy many important properties. For example, the following inequality is well–known:
In this paper we are looking for bounds for quantities
In 2011, Atanassov [
1] first obtained a lower bound for
. He showed that for any
, we have
In 2013, Kannan and Srikanth [
2] sharpened (3) by showing that
Finally, Sándor and Atanassov [
3] in 2019 proved the following refined estimates using the weighted AM–GM inequality.
For other types of inequalities between arithmetic functions, we refer the readers to [
4] and its references. In this paper, we shall use some refined inequalities to improve the upper bounds proved by Sándor and Atanassov [
3].
Theorem 1.
For any integer , we have the following inequalities:
and
All inequalities above may be replaced with function instead of function .
Note that we have
where
means that
X implies
Y.
2. Refinements of the Weighted AM–GM Inequality
In this section we shall list several variants of the weighted AM–GM inequality. First, recall that the classical weighted AM–GM inequality states that
Lemma 1.
If real numbers satisfy , then for , we have
Moreover, for this becomes
In Lemma 1, put , , and we get
Lemma 2 ([
3], Proposition 1)
. For any , we have
Again, put , , and we get
Lemma 3 ([
3], Proposition 2)
. For any , we have
We remark that Sándor and Atanassov [
3] used Lemmas 1–3 to prove their bounds.
Next, we mention some results that yield improvements on Lemma 1. We will use them to prove our Theorem 1 in the next section.
Lemma 4 ([
5], Theorem, [
6], Remark 3)
. Let , and . Suppose that . Then we have
Moreover, for this becomes
Lemma 5 ([
7], Theorem)
. Let , and . Suppose that . Then we have
Moreover, for this becomes
Lemma 6 ([
6], Theorem 1)
. Let , and . Suppose that . Then we have
Moreover, for this becomes
Lemma 7 ([
8], Theorem 2.2)
. Let , and . Suppose that . Then we have
Moreover, for this becomes
Lemma 8 ([
9], Corollary 2.3)
. Let , and . Suppose that . Then we have
Moreover, for this becomes
Note that the left–hand side is just [[10], Proposition 5.1].
Lemma 9 ([
11], Theorem 1)
. Let , and . Suppose that . Then we have
Moreover, for this becomes
Lemma 10 ([
12], Proposition 2.7)
. Let , and . Suppose that . Then we have
Moreover, for , and , this becomes
3. Proof of Theorem 1
3.1. Proof of (A1) and (A2)
By Lemma 4 we know that for
,
and
, we have
For
(A1), put
,
,
and
, (7) becomes
Let
and
. By (2) we have
, hence
. Putting this into (8), we have
Now
(A1) is proved. For
(A2), put
,
,
and
, (7) becomes
Now
(A2) is proved.
3.2. Proof of (B1) and (B2)
By Lemma 5 we know that for
,
and
, we have
For
(B1), put
,
,
and
, (13) becomes
Now
(B1) is proved. For
(B2), put
,
,
and
, (13) becomes
Now
(B2) is proved.
3.3. Proof of (C1) and (C2)
By Lemma 6 we know that for
,
and
, we have
For
(C1), put
,
,
and
, (18) becomes
Now
(C1) is proved. For
(C2), put
,
,
and
, (18) becomes
Now
(C2) is proved.
3.4. Proof of (D1) and (D2)
By Lemma 7 we know that for
,
and
, we have
For
(D1), we put
,
,
and
. Since
and
, we have
hence
. Then (23) becomes
Now
(D1) is proved. For
(D2), put
,
,
and
, (23) becomes
Now
(D2) is proved.
We note that Lemma 8 and Lemma 7 actually yield the same result here. By Lemma 8 we know that for
,
and
, we have
For
(D1), we put
,
,
and
. Again, we have
. Then (28) becomes
Now
(D1) is proved. For
(D2), put
,
,
and
, (28) becomes
Now
(D2) is proved.
3.5. Proof of (E1) and (E2)
By Lemma 9 we know that for
,
and
, we have
For
(E1), put
,
,
and
, (33) becomes
Now
(E1) is proved. For
(E2), put
,
,
and
, (33) becomes
Now
(E2) is proved.
3.6. Proof of (F1) and (F2)
By Lemma 10 we know that for
,
and
, we have
For
(F1), we put
,
,
and
. Since
, we can write (38) as
Now
(F1) is proved. For
(F2), we put
,
,
and
. Since
, (38) becomes
Now
(F2) is proved.
Appendix: An Application of Karamata’s Inequality
By the definition of
, we can easily show that
. By [[
1], Lemma], we also know that
Thus,
In 2023, Dimitrov [[
13], Theorem 1] proved the quadratic case of (44):
and he [[
14], Theorems 1 and 2] proved the cubic and quartic cases in 2024:
By (44)–(47), one can naturally conjecture that for any integer
, we have
In 2024, user EthanWYX2009 on AoPS gave a simple but amazing proof of (48). His proof is much shorter than Dimitrov’s proof of cases . In this appendix, we shall rewrite his remarkable proof.
Theorem 2 (EthanWYX2009)
. For any integer , we have
Proof. We first make the definition of Weakly Majorization in an elementary manner.
Definition 1
A sequence weakly majorizes a sequence if and only if , and
Moreover, if we also have
then majorizes .
By the definition, we know that
Next we shall provide the famous Karamata’s inequality in the form given by [
15], which plays a crucial role in the proof.
Lemma 11 (Karamata’s inequality)
. Let be an increasing function on an interval , and let and be two sequences of real numbers in I. Suppose that weakly majorizes . Then
Now, let , , , and . By Lemma 11, the bound and (43), the proof of Theorem 2 is completed. □
References
- Atanassov, K.T. Note on φ, ψ and σ–functions. Part 3. Notes on Number Theory and Discrete Mathematics 2011, 17, 13–14. [Google Scholar]
- Kannan, V.; Srikanth, R. Note on φ and ψ functions. Notes on Number Theory and Discrete Mathematics 2013, 19, 19–21. [Google Scholar]
- Sándor, J.; Atanassov, K.T. Inequalities between the arithmetic functions φ(n), ψ(n) and σ(n). Part 2. Notes on Number Theory and Discrete Mathematics 2019, 25, 30–35. [Google Scholar] [CrossRef]
- Dimitrov, S. Inequalities involving arithmetic functions. Lithuanian Math. J. 2024, 64, 421–452. [Google Scholar] [CrossRef]
- Cartwright, D.I.; Field, M.J. A refinement of the arithmetic mean–geometric mean inequality. Proc. Amer. Math. Soc. 1978, 71, 36–38. [Google Scholar] [CrossRef]
- Aldaz, J.M. Self improvemvent of the inequality between arithmetic and geometric means. J. Math. Inequal. 2009, 3, 213–216. [Google Scholar] [CrossRef]
- Alzer, H. A new refinement of the arithmetic mean–geometric mean inequality. Rocky Mountain J. Math. 1997, 27, 663–667. [Google Scholar] [CrossRef]
- Aldaz, J.M. Sharp bounds for the difference between the arithmetic and geometric means. Arch. Math. 2012, 99, 393–399. [Google Scholar] [CrossRef]
- Aldaz, J.M. Comparison of differences between arithmetic and geometric means. Tamkang J. Math. 2011, 43, 453–462. [Google Scholar] [CrossRef]
- Furuichi, S. On refined Young inequalities and reverse inequalities. J. Math. Inequal. 2011, 5, 21–31. [Google Scholar] [CrossRef]
- Aldaz, J.M. A refinement of the inequality between arithmetic and geometric means. J. Math. Inequal. 2008, 2, 473–477. [Google Scholar] [CrossRef]
- Cîrtoaje, V. The best lower bound depended on two fixed variables for Jensen’s inequality with ordered variables. J. Inequal. Appl. 2010, 128258. [Google Scholar] [CrossRef]
- Dimitrov, S. Lower bounds on expressions dependent on functions φ(n), ψ(n) and σ(n). Notes on Number Theory and Discrete Mathematics 2023, 29, 713–716. [Google Scholar] [CrossRef]
- Dimitrov, S. Lower bounds on expressions dependent on functions φ(n), ψ(n) and σ(n), II. Notes on Number Theory and Discrete Mathematics 2024, 30, 547–556. [Google Scholar] [CrossRef]
- Junnila, J. A generalization of Karamata’s inequality. Available online at: https://kheavan.wordpress.com/wp-content/uploads/2010/06/karamata.pdf 2010, pp. 1–3.
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).