Problem

Source: Tournament of Towns Spring 2004 Junior O #5

Tags: combinatorics unsolved, combinatorics



Two 10-digit integers are called neighbours if they differ in exactly one digit (for example, integers $1234567890$ and $1234507890$ are neighbours). Find the maximal number of elements in the set of 10-digit integers with no two integers being neighbours.