Positive dyadic density for rational weighted binary expansions
Abstract
Let \(P/Q∈ Q\), \(Q1\), and suppose \[ Σn1 n dn2-n=P/Q, dn∈\0,1\, \] has infinite support \(S=\n:dn=1\\). We prove that \(S\) has positive density on all sufficiently large dyadic blocks: there is \(cQ>0\), depending only on \(Q\), such that \[ AS(2X)-AS(X) cQX \] for every sufficiently large dyadic \(X\), where \(AS(X)=\#(S[1,X])\). Hence every increasing sequence \(a1<a2<·s\) with \(an/n∞\) gives an irrational series \(Σn1an2-an\), settling Erdős Problem~260. The proof uses only the integral carry recurrence forced by rationality. Sparse dyadic blocks give a positive lower bound for an integrated high-excess area, while a weighted stopping-time estimate gives the matching upper bound. The local carry geometry needed for that upper bound is isolated in four estimates: complete-lap mass balance, total-support summation, fixed-pin confinement, and class-one realization.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.