Binary integers whose difference is 1
Source: 2012 AIME I Problem 5
March 16, 2012
SupportAMC
Problem Statement
Let be the set of all binary integers that can be written using exactly 5 zeros and 8 ones where leading zeros are allowed. If all possible subtractions are performed in which one element of is subtracted from another, find the number of times the answer 1 is obtained.