Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Theorem 2.1 of the paper: let
with integers , and . Then there is , depending
on the , such that polynomials of arbitrarily large
degree exist for which factors as a product of polynomials of
degree at most . Applied to
, a product of linear factors, the theorem
gives, for every and , a constant such that for
all large some consecutive integers in are all
-smooth: for an integer the consecutive integers
have every prime factor bounded by a polynomial value of
degree at most in , hence by once
is large, and consecutive values of are apart, so
every large has such a run in , inside
for any . This deduction was pointed
out by Wooley to the site's curator, Thomas F. Bloom, who wrote it out on the
forum on 2026-03-27 and records its conclusion in the problem's commentary.
The run lies in , so the result settles the question of
Problem 369 as written, the
formal-conjectures statement erdos_369, and both strengthenings the site
proposes: the second directly, and the first because a run of
-smooth integers above is -smooth for each
of its members . It is stronger than the result of
Yang 2026,
whose run lies in , and than that of
Balog and Wooley 1998,
which gives infinitely many . The source card is
Bober, Fretwell, Martin and Wooley 2020.
Acceptance. Published in J. Aust. Math. Soc. 108 (2020), no. 2,
245–261, a refereed journal, online 2019-02-01 in the publisher's record
(refereed); the arXiv posting of 2017-10-05 dates this page. The site's
curator labels the problem PROVED (LEAN) and credits the paper's main result,
in the problem's commentary (page last edited 2026-04-28), with the stronger
statement above (reviewed). The Lean proofs linked by formal-conjectures
formalize Yang's construction, not this theorem, so formalized is not
listed.
Depends on. Nothing in this wiki.