For positive integers n, denote by D(n) the number of pairs of different adjacent d...
Check the final answer first, then review the worked steps.
Check the final answer first, then review the worked steps.
A number with $k$ blocks of identical bits has $D(n) = k-1$. We need $k-1=2 \implies k=3$ blocks. For $n \le 97$ ($1100001_2$), we count patterns $1^a 0^b 1^c$ or $1^a 0^b 1^c 0^d...$ (but only 3 blocks). Patterns are $1...10...01...1$ or $1...10...0$ (if $D(n)=1$). For $D(n)=2$, we count combinations of block lengths summing to total bits.
D(n) counts the number of bit flips in the binary representation of n. For n <= 97 (binary 1100001), we count integers with exactly 2 bit flips. This corresponds to numbers with 3 blocks of identical bits.