Erdős's ternary-digit problem: a conditional reduction
- Kind
- Theorem (a conditional reduction); the saving rests on an unproved bound
- Status
- Proofs held by two falsifier agents; the bound it rests on is open; unrefereed
- Prior work
- Not claimed as a priority result; the propositions use standard tools; no source in the searches states the joint law of the two ends with an error term
On this page
The statement
Erdős's conjecture: for every , the number written in base 3 contains the digit 2. Let count the for which has no digit 2. Narkiewicz's bound , with , is the best known. Lagarias asked whether one can do better than , and whether the high-order and low-order ternary digits of are "uncorrelated" in some quantifiable way.
The tail sets. Let and let be the set of whose last ternary digits of are all 0 or 1; then . For , let , with , and let be the largest .
Hypothesis (open). for some constant and every : the character sums of the tail sets save a power.
The reduction (Propositions 20 to 22).
- Proposition 20 bounds by the cross-end sums , which couple the trailing digits () to the leading digits (the angle ). Any power saving in , in mean square, gives for some , beating Narkiewicz's exponent and answering both of Lagarias's questions.
- Proposition 21 is an exact identity: the mean square of the cross-end sums is the difference count of the tail set, read at the angles .
- Proposition 22 bounds the cross-end sums by , so for any gives such a saving.
So if the trailing-digit character sums save any power, the two ends of are quantitatively independent and has a power saving. The saving rests on , which is not proved.
Check it yourself
- The three known powers. , so is (100111) in base 3, with no digit 2. The others are and .
- The next one fails. , so is (200222): four digits are 2.
- Tail and head. is (1101221) in base 3. Its tail (digits before the first 2 from the right) has length 1, its head (from the left) length 4. The conjecture says the tail and the head never meet for ; the reduction asks how independent they are.
- What would give, by the corollary of Proposition 22 as repaired: for every above 0.624740407688…, against Narkiewicz's exponent .
Worked examples
The key quantity is how far falls with . On the computed range a script found falling from 0.2772 at to 0.0493 at , close to a random set's maximum. That is data, not a proof of , and the source treats those numbers as leads until a registered rerun reproduces them; the rerun never ran.
Status and who checked it
- Proved (conditionally). A falsifier agent read the three propositions line by line: "the three propositions are proved". A second falsifier agent, grading blind, holds "the displayed inequalities and identities of Propositions 20, 21 and 22, and their symbolic conditional reduction".
- What is not cleared. Both reviewers objected to the page's numbers rather than its proofs: one corollary's rounding was overstated, and the computed numbers came from a run outside the registered process. The repair waits for both grades; the work is on hold.
- Open. for any , and with it any unconditional improvement on Narkiewicz's bound. Nothing here proves Erdős's conjecture. Unrefereed.
Prior work
Credited. The questions are Lagarias's (§1.6 of his 2009 paper on ternary expansions). The bound is Narkiewicz's (1980), whose note was read only through four later sources; Lagarias proves in a few lines. The computer check of the conjecture to is Saye's (2022). The sieve-type tools the proofs use, such as Selberg's majorant, are standard.
Searches run. The project's searches of the literature found no source that states the joint law of the two ends with an error term; Roettger and Ren (2025) were reread for this step and do not either. That covers only the sources searched.
Still owed. A logged prior-work search aimed at this reduction.