On Erdős sums of almost primes

<p>In 1935, Erdős proved that the sums fk = Pn1/(n log n), over integers n with exactly k prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that fk is maximized by the prime sum f1 = Pp1/(p log p). According to a 2013 conjecture of Banks and Martin, the sums fk are p...

Full description

Bibliographic Details
Main Authors: Gorodetsky, O, Lichtman, JD, Wong, MD
Format: Journal article
Language:English
Published: Elsevier 2023
_version_ 1826315390396923904
author Gorodetsky, O
Lichtman, JD
Wong, MD
author_facet Gorodetsky, O
Lichtman, JD
Wong, MD
author_sort Gorodetsky, O
collection OXFORD
description <p>In 1935, Erdős proved that the sums fk = Pn1/(n log n), over integers n with exactly k prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that fk is maximized by the prime sum f1 = Pp1/(p log p). According to a 2013 conjecture of Banks and Martin, the sums fk are predicted to decrease monotonically in k. In this article, we show that the sums restricted to odd integers are indeed monotonically decreasing in k, sufficiently large. By contrast, contrary to the conjecture we prove that the sums fk increase monotonically in k, sufficiently large.</p> <p>Our main result gives an asymptotic for fk which identifies the (negative) secondary term, namely fk = 1 − (a + o(1))k 2/2k for an explicit constant a = 0.0656 · · ·. This is proven by a refined method combining real and complex analysis, whereas the classical results of Sathe and Selberg on products of k primes imply the weaker estimate fk = 1 + Oε(kε−1/2). We also give an alternate, probability-theoretic argument related to the Dickman distribution. Here the proof reduces to showing a sequence of integrals converges exponentially quickly to e−γ, which may be of independent interest.</p>
first_indexed 2024-12-09T03:24:32Z
format Journal article
id oxford-uuid:e7d36e0f-3ba8-474d-a879-6e7317e0702b
institution University of Oxford
language English
last_indexed 2024-12-09T03:24:32Z
publishDate 2023
publisher Elsevier
record_format dspace
spelling oxford-uuid:e7d36e0f-3ba8-474d-a879-6e7317e0702b2024-11-26T12:55:53ZOn Erdős sums of almost primesJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:e7d36e0f-3ba8-474d-a879-6e7317e0702bEnglishSymplectic ElementsElsevier2023Gorodetsky, OLichtman, JDWong, MD<p>In 1935, Erdős proved that the sums fk = Pn1/(n log n), over integers n with exactly k prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that fk is maximized by the prime sum f1 = Pp1/(p log p). According to a 2013 conjecture of Banks and Martin, the sums fk are predicted to decrease monotonically in k. In this article, we show that the sums restricted to odd integers are indeed monotonically decreasing in k, sufficiently large. By contrast, contrary to the conjecture we prove that the sums fk increase monotonically in k, sufficiently large.</p> <p>Our main result gives an asymptotic for fk which identifies the (negative) secondary term, namely fk = 1 − (a + o(1))k 2/2k for an explicit constant a = 0.0656 · · ·. This is proven by a refined method combining real and complex analysis, whereas the classical results of Sathe and Selberg on products of k primes imply the weaker estimate fk = 1 + Oε(kε−1/2). We also give an alternate, probability-theoretic argument related to the Dickman distribution. Here the proof reduces to showing a sequence of integrals converges exponentially quickly to e−γ, which may be of independent interest.</p>
spellingShingle Gorodetsky, O
Lichtman, JD
Wong, MD
On Erdős sums of almost primes
title On Erdős sums of almost primes
title_full On Erdős sums of almost primes
title_fullStr On Erdős sums of almost primes
title_full_unstemmed On Erdős sums of almost primes
title_short On Erdős sums of almost primes
title_sort on erdos sums of almost primes
work_keys_str_mv AT gorodetskyo onerdossumsofalmostprimes
AT lichtmanjd onerdossumsofalmostprimes
AT wongmd onerdossumsofalmostprimes