Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. For every and the limit
exists, where is the measure of the with for some coprime with . This is the existence half of Problem 1001. The paper is H. Kesten and V. T. Sós, On two problems of Erdős, Szüsz and Turán concerning diophantine approximations, Acta Arith. 12 (1966), 183--192, received by the journal on 1966-03-25 and published in 1966 (the page's date is the volume's year, with the day set to its first); the volume's journal header gives the year 1966, which the card of Kesten's paper in the same issue (kesten_1966_bounded_remainder) also records, where the problem page's record gives 1966/67; the card kesten_1966_two_problems_erdos_szusz_turan records the paper. Theorem 1 gives the explicit limiting measure of a set defined by consecutive continued-fraction denominators around , and Theorem 2 in Section 3, the existence statement, deduces from it, through a limiting distribution for the smallest over the admissible denominators, that the limit in the problem exists. The authors say their method finds no explicit value in general, though it would in principle allow one to compute it for particular and . Section 3 presents the existence proof as an indication rather than in full: the paper says that, since the method finds no explicit value, it restricts itself to an indication of the proof; Lemma 4 there is stated without proof, and the step from the limiting distribution of Theorem 1 to the discontinuous functions involved is justified by calling those functions "sufficiently nice" and the limiting distribution "sufficiently smooth". Theorem 2 of [[problems/irrationality/E1001/claims/2006_01_01_xiong_zaharescu|Xiong and Zaharescu]] gives a complete second proof of existence.
Covers. The existence of for all and . It does not give the explicit form of , the problem's second question, which the pages of Xiong and Zaharescu and Boca address. Before this paper the limit had been evaluated for , as the paper's introduction notes: Erdős, Szüsz and Turán had the value for (Theorem III of Colloq. Math. 6 (1958), claim page Erdős, Szüsz and Turán, card erdos_1958), and Kesten had closed forms for (Theorem 2 of Trans. Amer. Math. Soc. 103 (1962), claim page Kesten).
Acceptance. The refereed evidence is the journal publication cited
above. The reviewed evidence is the documented acceptance by the catalog
erdosproblems.com, whose page for the problem (the discussion link)
carries the label SOLVED and whose curator, Thomas Bloom, credits Kesten and
Sós with the proof that the limit exists, noting that their argument gives
no way to compute it (accessed; the page shows no last-edited
date). No independent check of the proof is recorded. The claim value is
proved because the part it settles, whether the limit exists, is a yes-or-no
question answered yes.
Formalization. A third party formalized the result: erdos_1001 in
src/latest/ErdosProblems/Erdos1001.lean of Boris Alexeev's repository
https://github.com/plby/lean-proofs (the formalization link, added 2026-08-17
and pinned at the commit of 2026-09-04 that last touched the file). The file's
header names Kesten and Sós as informal authors and Codex and GPT-5.6 Sol as
formal authors, so it is a link on this page rather than an independent claim.
Its theorem erdos_1001 states, for every and , that ,
the measure of the site's set with strict inequalities (which differs from the
paper's set, defined with weak ones, by a countable set), converges to
erdosSzuszTuranLimit A c, defined as times a finite alternating
inclusion-exclusion sum of integrals over the Farey triangle with cutoff
, which the file calls the finite BCZ formula and says its
definitions transcribe the finite integral formula of Xiong and Zaharescu and of
Boca, so the formalized statement is the formula whose mathematics the page of
[[problems/irrationality/E1001/claims/2006_01_01_xiong_zaharescu|Xiong and
Zaharescu]] carries; it therefore states existence together with an explicit
formula, more than the paper proves, and refers for the mathematical proof to a
write-up tex/1001.tex in the repository. A side theorem, erdos_1001_sparse,
gives the value for . The file contains no
sorry. The community database records the problem as
unformalized. No build or axiom audit of the development is recorded in this
repository, so the claim lists no formalized evidence.
Depends on. Nothing in this wiki.