MathCastle
Proof WritingChallengeExistence, Uniqueness and Counterexamples

Existence, Uniqueness and Counterexamples · Challenge problem

Every integer has exactly one representation ∑di(−2)i\sum d_i (-2)^i with digits di∈{0,1}d_i \in \{0, 1\} (base −2-2). How many digits does the representation of 1010 have?