EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

On the number of prime factors of consecutive integers

Cheuk Fung (Joshua) Lau

Journal of the London Mathematical Society · 2026-11 · 114 (5)

DOI: 10.1112/jlms.70761 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of the London Mathematical Society, online erschienen am 10.11.2026. Verfasst von Cheuk Fung (Joshua) Lau. Die Arbeit nennt 7 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We prove that there are infinitely many such that for all integers . This improves on a result of Tao and Teräväinen, who have in place of . As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao–Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér‐type random models. Assuming this conjecture, the main bound is essentially sharp.

Zitieren

APA

Lau, C. F. J. (2026). On the number of prime factors of consecutive integers. Journal of the London Mathematical Society, 114(5). https://doi.org/10.1112/jlms.70761

Vancouver

Lau CFJ. On the number of prime factors of consecutive integers. Journal of the London Mathematical Society. 2026;114(5). doi:10.1112/jlms.70761

BibTeX
@article{Lau2026,
  author = {Lau, Cheuk Fung (Joshua)},
  title = {On the number of prime factors of consecutive integers},
  journal = {Journal of the London Mathematical Society},
  year = {2026},
  volume = {114},
  number = {5},
  doi = {10.1112/jlms.70761}
}
Kostenlos starten →