arXiv · 1909.00804
Almost primes and the Banks-Martin conjecture
Abstract
It has been known since Erdos that the sum of $1/(n\log n)$ over numbers $n$ with exactly $k$ prime factors (with repetition) is bounded as $k$ varies. We prove that as $k$ tends to infinity, this sum tends to 1. Banks and Martin have conjectured that these sums decrease monotonically in $k$, and in earlier papers this has been shown to hold for $k$ up to 3. However, we show that the conjecture is false in general, and in fact a global minimum occurs at $k=6$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jared Duker Lichtman. 2019-12-18. Almost primes and the Banks-Martin conjecture. https://doi.org/10.1016/j.jnt.2019.11.006
Cite the original work for its findings. Save a collection to share your selection of sources.