1. Introduction
A positive integer
m is called a practical number if each
can be written as the sum of some distinct divisors of
m. Clearly all practical numbers are even except 1, and all even perfect numbers and powers of 2 are practical. Let
denote the number of practical numbers less than
x. In 1984, Hausman and Shapiro [
1] showed that
for any
. Margenstern [
2] showed in 1991 that
Tenenbaum [
3,
4] improved the bounds (1) and (2) to
Using a sieve method, Saias [
5] improved Tenenbaum’s result to
Margenstern conjectured that
with
.
Like the famous twin prime conjecture, Margenstern [
2] established that there are infinitely many twin practical numbers
m and
, and another detailed proof was given by Melfi [
6] in 1996. Let
denote the number of practical number pairs
less than
x. Margenstern’s proof leads to a lower bound
, and Melfi’s proof leads to a better lower bound
. In 2002, Melfi [
7] improved the lower bound to
with
. Margenstern also conjectured that
with
.
In 2022, Wang and Sun [
8] generalized Margenstern’s result and showed that there are infinitely many practical numbers
q such that
and
are also practical numbers. They showed their result by modifying Melfi’s cyclotomic method.
In this paper, we further state a conjecture and show some new results. For any positive integer
C, there are infinitely many practical numbers
q such that
and
are also practical numbers. Clearly the results of Margenstern [
2] and Melfi [
6,
7] imply the case
of Conjecture
Section 1, and Wang and Sun [
8] solved the cases
and
. Wang and Sun [
8] solved the cases
and
by proving that the sequence
are practical for every integer
. In this paper, we find four new sequences that generate infinitely many practical numbers.
Theorem 1. , , and are practical for every integer .
Using Theorem 1 we can easily deduce the following three Theorems.
Theorem 2. Let p denotes a prime number, . Then there are infinitely many practical numbers q such that and are also practical numbers.
Theorem 3. There are infinitely many practical numbers q such that:
(1). and are also practical numbers.
(2). and are also practical numbers.
Theorem 4. For any positive integer C, there exists an integer h such that there are infinitely many practical numbers q such that and are also practical numbers.
2. Proof of Theorem 1.2
In order to prove our Theorems, we need the following structure theorem:
Lemma 1 ([
6], Lemma 1).
Let m be any practical number. Then is practical for every . In particular, is practical for every .
Let denotes the mth cyclotomic polynomial, then we have
Now we start our proof of Theorem 1. Note that we may use to represent different sequences in different subsection.
2.1. Sequence 1
We shall prove that are practical for every .
Write
for
, then we only need to show that
is practical for every
. By a computer calculation we find that
By Lemma 1, we know that
is practical. Let
, then we have
and
. Since
, we have
. By Lemma 2, we have
Assume that
is practical, then we only need to show that
is practical.
By (9)–(13), we have
and
is practical by Lemma 1.
By (18)–(19), we have
and
is practical by Lemma 1.
By (16) and (21), we have
and
is practical by Lemma 1.
Since is practical, we can show that is practical for every by an inductive process. Now the proof of sequence is completed.
2.2. Sequence 2
We shall prove that are practical for every .
Write
for
, then we only need to show that
is practical for every
. By a computer calculation we find that
By Lemma 1, we know that
is practical. Let
, then we have
and
. Since
, we have
. By Lemma 2, we have
Assume that
is practical, then we only need to show that
is practical.
By (24)–(26), we have
and
is practical by Lemma 1.
By (27) and (29), we have
and
is practical by Lemma 1.
Since is practical, we can show that is practical for every by an inductive process. Now the proof of sequence is completed.
2.3. Sequence 3
We shall prove that are practical for every .
Write
for
, then we only need to show that
is practical for every
. By a computer calculation we find that
By Lemma 1, we know that
is practical. Let
, then we have
and
. Since
, we have
. By Lemma 2, we have
Assume that
is practical, then we only need to show that
is practical.
By (32)–(36), we have
and
is practical by Lemma 1.
By (37) and (39), we have
and
is practical by Lemma 1.
Since is practical, we can show that is practical for every by an inductive process. Now the proof of sequence is completed.
2.4. Sequence 4
We shall prove that are practical for every .
Write
for
, then we only need to show that
is practical for every
. By a computer calculation we find that
By Lemma 1, we know that
is practical. Let
, then we have
and
. Since
, we have
. By Lemma 2, we have
Assume that
is practical, then we only need to show that
is practical.
By (42)–(47), we have
and
is practical by Lemma 1.
By (48) and (51), we have
and
is practical by Lemma 1.
By (49) and (53), we have
and
is practical by Lemma 1.
Since is practical, we can show that is practical for every by an inductive process. Now the proof of sequence is completed.
Finally, we get Theorem 1 by combining the above four cases.
3. Proof of Theorems 1.3, 1.4 and 1.5
In order to prove Theorem 2, we need to show that at least one of the following five sequences generate infinitely many multiples of
p for all prime
:
By the following identities (where
m is any positive integer)
we complete the proof of Theorem 2. By combining those identities, we can also show that Conjecture
Section 1 holds true for many other integers.
We can prove Theorem 3 by taking the sequences
and
Similarly, for Theorem 4 we can take the sequence
with a suitable
h such that
is a multiple of
C.
References
- Hausman, M.; Shapiro, H.N. On practical numbers. Comm. Pure Appl. Math. 1984, 37, 705–713. [Google Scholar] [CrossRef]
- Margenstern, M. Les nombres pratiques: théorie, observations et conjectures. J. Number Theory 1991, 37, 1–36. [Google Scholar] [CrossRef]
- Tenenbaum, G. Sur un problème de crible et ses applications. Ann. Sci. École Norm. Sup. 1986, 19, 1–30. [Google Scholar] [CrossRef]
- Tenenbaum, G. Sur un problème de crible et ses applications, 2. Corrigendum et étude du graphe divisoriel. Ann. Sci. École Norm. Sup. 1995, 28, 115–127. [Google Scholar] [CrossRef]
- Saias, E. Entiers à diviseurs denses 1. J. Number Theory 1997, 62, 163–191. [Google Scholar] [CrossRef]
- Melfi, G. On two conjectures about practical numbers. J. Number Theory 1996, 56, 205–210. [Google Scholar] [CrossRef]
- Melfi, G. A note on twin practical numbers. Le Matematiche 2002, 57, 111–117. [Google Scholar]
- Wang, L.Y.; Sun, Z.W. On practical numbers of some special forms. Houston J. Math. 2022, 48, 241–247. [Google Scholar]
|
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. |