Ternary Egyptian fractions with prime denominator
Published version
Peer-reviewed
Repository URI
Repository DOI
Change log
Authors
Abstract
AbstractFor a prime number p, let $$A_3(p)= | { m \in \mathbb {N}: \exists m_1,m_2,m_3 \in \mathbb {N}, \frac{m}{p}=\frac{1}{m_1}+\frac{1}{m_2}+\frac{1}{m_3} } |$$
A
3
(
p
)
=
|
{
m
∈
N
:
∃
m
1
,
m
2
,
m
3
∈
N
,
m
p
=
1
m
1
+
1
m
2
+
1
m
3
}
|
. In 2019 Luca and Pappalardi proved that $$x (\log x)^3 \ll \sum _{p \le x} A_{3}(p) \ll x (\log x)^5$$
x
(
log
x
)
3
≪
∑
p
≤
x
A
3
(
p
)
≪
x
(
log
x
)
5
. We improve the upper bound, showing $$\sum _{p \le x} A_{3}(p) \ll x (\log x)^3 (\log \log x)^2$$
∑
p
≤
x
A
3
(
p
)
≪
x
(
log
x
)
3
(
log
log
x
)
2
.
Description
Funder: Cambridge Commonwealth, European and International Trust; doi: http://dx.doi.org/10.13039/501100003343
Funder: Engineering and Physical Sciences Research Council; doi: http://dx.doi.org/10.13039/501100000266
Funder: Trinity College, University of Cambridge; doi: http://dx.doi.org/10.13039/501100000727
Journal Title
Research in Number Theory
Conference Name
Journal ISSN
2522-0160
2363-9555
2363-9555
Volume Title
8
Publisher
Springer Science and Business Media LLC
Publisher DOI
Rights and licensing
Except where otherwised noted, this item's license is described as http://creativecommons.org/licenses/by/4.0/

