Isaac’s Condition (TU)
Let be a positive real number with a binary expansion, and let be the corresponding binary expansion. Isaac's Condition asserts that, for every subsequence of digit positions, the upper frequency of the digit in the corresponding subsequence of is determined solely by the tail of the binary expansion of ; equivalently, changing only finitely many initial binary digits of does not change any such upper frequency for . The proposed condition is intended to apply in particular to the values relevant to binary expansions of for nonsquare natural numbers .
References
- Isaac's Condition (TU) is false — arXiv — Ralf Stephan
Source: arXiv
Progress summary
A new unrefereed preprint claims to disprove the condition, but the claim has not been independently checked.
Isaac introduced the condition as a proposed sufficient route to simple normality of the binary expansion of for nonsquare . His 2011 paper gave a direct proof claiming that the condition holds.
Known results
- Isaac, 2005: the condition was claimed to imply simple normality of for every nonsquare natural number .
- Isaac, 2011: a simpler proof claimed that the condition holds for the relevant partial differences.
October 15, 2026 counterexample claim
The preprint is unrefereed, so the claimed refutation remains unverified.
Current status (as of October 2026): A preprint claims that Isaac's Condition is false, but the counterexamples have not received independent mathematical verification.
Sources
Solutions 0
No solutions have been posted yet.