Text

In the optimal solution of the Tower of Hanoi, with the discs numbered from 11 (the smallest) upward, on move number kk you move the disc whose number is ν2(k)+1\nu_2(k)+1, where ν2(k)\nu_2(k) is the exponent of the largest power of 22 dividing kk. Which disc is moved on move 1000010000?