Problem

Source: I International Festival of Young Mathematicians Sozopol 2010, Theme for 10-12 grade

Tags: combinatorics



Let $A$ be the set of all sequences from 0’s or 1’s with length 4. What’s the minimal number of sequences that can be chosen, so that an arbitrary sequence from $A$ differs at most in 1 position from one of the chosen?