Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Zeraoulia: Fixed-scale limit points for the counting function of distinct Euler totients
The retained folder-name PDF is the author's preprint, 15 pages numbered 1–15, distributed from the repository https://github.com/rafikmath15/fixed-scale-totient-limit-points (created 2026-07-29; CC BY 4.0 by its metadata) and listed in the erdosproblems.com proof-claims thread for Problem 416 as a partial proof claim posted 2026-07-29, which names a language-model system as used. Provenance: retrieved from https://raw.githubusercontent.com/rafikmath15/fixed-scale-totient-limit-points/main/Zeraoulia_Fixed_Scale_Limit_Points_Final.pdf (HTTP 200, one request; the bytes equal those of a first retrieval on 2026-09-27); 441,376 bytes; PDF metadata Author "Rafik Zeraoulia", created 2026-07-29 UTC. No arXiv identifier and no DOI were found on 2026-09-27. The file itself prints no notice; the hosting repository's README states "The paper and accompanying materials are released under the Creative Commons Attribution 4.0 International License." and its LICENSE.md sits in the repository root beside the served PDF (https://github.com/rafikmath15/fixed-scale-totient-limit-points, read 2026-10-02): the Creative Commons Attribution 4.0 license.
Rafik Zeraoulia, "Fixed-Scale Limit Points for the Counting Function of Distinct Euler Totients," preprint, July 2026.
Bears on. Problem 416: an outstanding partial claim on the doubling question, superseded for by the accepted proof recorded on the Kruer–Kohlmeyer card if that acceptance stands.
Read status. Partially read. The abstract (p. 1) and the statement of Theorem 1.1 (p. 2) were checked clause by clause against the erdosproblems.com proof-claim summary. The unconditional argument for Theorem 1.1, §§2–3 (pp. 3–5), and the dyadic renewal identity, Proposition 6.1 (p. 8), were read against the page images and are reconstructed, author-recorded, on the preprint's reconstruction page of the Problem 416 research folder, which states the versions of Ford's Theorem 1 and Chebyshev's bound it imports; §§4–8 were read in text extraction only, and no result page is extracted. The preprint is self-published and unreviewed.
Overview
With the number of distinct totient values up to and , the abstract attributes to Erdős and Hall the question whether for every fixed and says the limit remains open. The main unconditional result, Theorem 1.1 (p. 2), states that for every fixed real , ; the abstract adds that a near-hit occurs in every window for every (Theorem 3.3, p. 4) and that the limit points of fill a closed interval that contains (Theorem 3.4, p. 5), so that unless the set of limit points of has the cardinality of the continuum. The stated method combines Ford's bounded-factor estimate (, Theorem 4 of Ford (1998), cited by the preprint in Ford's corrected arXiv version, arXiv:1104.3264v2), the telescoping identity , and the fact that moves by unit jumps, so that changes by between adjacent integers. The abstract claims the same conclusions for a matched quotient of consecutive increments. It keeps these apart from conditional completion mechanisms (an exact identity for a block energy, a second-moment condition on local blocks said to imply the full limit, and for a relative-entropy recursion), which it says point to possible routes without verifying the hypotheses they need. An exact segmented computation is reported to determine through and through , as finite-range evidence that proves no asymptotic claim.
Relation to E416
The first question of Problem 416 is the case of the limit the preprint explicitly does not claim; the preprint's contribution to it would be that is a limit point of and that the set of limit points is an interval containing . The accepted 2026 Lean proof establishes the limit itself, so if that acceptance stands the interval is the single point and the preprint's statements are subsumed. For the preprint is the only claim found in the 2026-09-27 search; the Conjectures.io review of the accepted record cites it and says it leaves the interval's width uncontrolled. The computation to is the only numerical record of found, and is unverified here. Nothing in the preprint bears on the second question, an asymptotic formula for .