Increasing sequences with decreasing prime factors
We bound the length of the longest sequence of increasing numbers ≤ x for which their smallest prime factors form a decreasing sequence. While the upper bound is unconditional, the lower bound relies on a conjecture about prime gaps.
Authors
- Noah Lebowitz-Lockard (ORCID: https://orcid.org/0000-0002-2214-0624)
Institutions
- University of California, Irvine (US)
- Irvine University (US)
Publication Details
- Journal
- Notes on Number Theory and Discrete Mathematics
- Published
- 2025-01-01
- DOI
- https://doi.org/10.7546/nntdm.2025.31.3.635-638
- Primary Topic
- Rings, Modules, and Algebras
- Type
- article
- Field-Weighted Citation Impact
- 0.00