Claims · 7 dated claims on The even digits, each with its tag and its witness; newest 2026-10-05.
Proved On the even digits at an odd base the prime sum sum_(n in S_E, n <= x) Lambda(n) is at most log x, while the last-digit constant of the coprime prime count reads kappa_E = base/(base + 1), so that prime count read on E is false at every odd base; the Mobius sum is the non-trivial variant. Witness: mobius.md, The even digits, Parity kills the primes.
Verified At every odd base 3..41 and at 99, 101, 103, 105, 1001, 1003, 94939, 94941, all six classes of (base mod 4, base mod 3), on six shifts, the even-digit grid sum equals Sigma_i(2s) to 2.2 * 10^-12, stays at most 0.775356 of (3/2) lambda^i and at least 1.154700 of base^i; at every grid point of five designs at bases 3, 5, 7, 9, 11 the re-cut regions sum to the exact meter, the d = 2e points carry 3.374999 fill^k to 5.799374 fill^k of the even-digit l^1 mass against at most 0.001722 fill^k of the half interval's, 1950 progression identities hold as integers, Lemma A' through the halving holds at 6000 seeded draws with log margin at least 11.9560, and the witness limit at d = 2 reads 0.466274 at base 3 and 0.636613 at 94939. Witness: lab/py/even-digits, verbs transfer and regions.
Proved At every odd base, the even digits E = {0, 2, .., base-1} = 2F carry the half interval's shifted-grid certificate unchanged: sum_(a < base^i) abs(hat E_i(s + a/base^i)) = Sigma_i(2s) <= (3/2) lambda^i at every level i and every real s, since hat E_i(t) = hat F_i(2t) and a -> 2a permutes the residues mod base^i; the grid sum sum_a abs(hat F_i(a/base^i + 1/2)) of the twisted transform is Sigma_i(1/2) = (T^i 1)(1/2). Witness: mobius.md, The even digits, The certificate transfers.
Proved For e dividing a power of an odd base, max_(u <= x, r) abs(M(u; 2e, r)) <= (1 + log_2 x) max_(v <= x, r') abs(M(v; e, r')), by mu(2n) = -mu(n) at odd n and the unrolled identity O(v; e, r) = sum_(j <= log_2 v) M(v/2^j; e, r 2^(-j)), so the Mobius progression input at modulus 2 base reduces to the one at base with no new character, conductor or exceptional zero. Witness: mobius.md, The even digits, The arithmetic at 2 base is the arithmetic at base.
Proved At every odd base, for a/y = l/d + eta in lowest terms with d carrying a prime outside base and abs(eta) < y^(-2/3)/(8 base (base - 1)), halving gives abs(hat E_k(a/y)) <= fill^k c'^(floor(2k/(3 m_(d/(2,d))))) except at d = 2e, e dividing a power of base; and at a = (y - 1)/2, y = base^k, abs(hat E_k(a/y)) = fill^k prod_(m <= k) abs(hat F(base^(-m)))/fill, which falls in k to a positive limit, so no digit bound of shape fill^k c^k, c < 1, holds at d = 2. Witness: mobius.md, The even digits, Where the pair is missing.
Proved At every odd base >= 94939, with E = {0, 2, .., base-1}, there are C, c > 0 computable from base with abs(M_E(x)) <= C A_E(x) exp(-c sqrt(log x)) at every x >= 2; the half-interval meter twisted by e(k/2) obeys the same bound, so the Mobius function cancels on the odd and on the even members of {k : p does not divide C(2k,k)} separately at every prime p >= 94939. Witness: mobius.md, The even digits, The theorem on the even digits.
Proved Under GRH, at every odd base >= 3789, abs(M_E(x)) <<_(base, eps) A_E(x)^(1 - delta + eps) on the even digits with the half interval's delta, since the GRH chain reads the set only through its mass A_E(x) = A_F(x/2), comparable to the half interval's, and its unshifted l^1 mass, equal to the half interval's. Witness: mobius.md, The even digits, The theorem on the even digits.