Stepwise Codes
Let’s arrange all 3 digit binary codes in a list starting with 000 such that each code differs from its previous code by only 1 digit.
Let’s arrange all 3 digit binary codes in a list starting with 000 such that each code differs from its previous code by only 1 digit.
From the list of numbers 1 to n, cross out every other number starting with the smallest and repeat the process with the remaining numbers until only one number is left. What number would that be for a given n?