Published April 1, 2026 | Version v1

Proof of Erdős Problem #369: Consecutive Smooth Integers Near N

Authors/Creators

  • 1. EDMO icon University of Maryland

Description

This Zenodo record contains the manuscript and source files for “Proof of Erdos Problem 369: Consecutive Smooth Integers Near N”. The paper studies strings of consecutive smooth integers near N and proves that for every ε > 0 and every integer k >= 2, every sufficiently large N admits a block of k consecutive N^ε-smooth integers in [N/2, N]. The main tools are cyclotomic factorization, Euler-totient estimates, and a multiplicative covering argument based on powers of 2ᴸ and 3ᴸ.

Files

Files (12.0 kB)

Name Size
md5:1af08fc9065365a70cc405287e7a9b5f
12.0 kB Download

Additional details

References

  • A. Balog and T. D. Wooley, "On strings of consecutive integers with no large prime factors," Journal of the Australian Mathematical Society (Series A) 64 (1998), 266–276.
  • T. F. Bloom, "Erdős Problem #369," https://www.erdosproblems.com/369, accessed March 30, 2026.
  • A. Granville, "Smooth numbers: computational number theory and beyond," in Algorithmic Number Theory, MSRI Publications 44, Cambridge University Press, 2008, pp. 267–323.