MathDB

3

Part of 2009 Silk Road

Problems(1)

a tourist visits Complant (silk road combo)

Source: SRMC 2009

9/2/2018
A tourist going to visit the Complant, found that: a) in this country 10241024 cities, numbered by integers from 00 to 10231023 , b) two cities with numbers mm and nn are connected by a straight line if and only if the binary entries of numbers mm and nn they differ exactly in one digit, c) during the stay of a tourist in that country 88 roads will be closed for scheduled repairs. Prove that a tourist can make a closed route along the existing roads of Complant, passing through each of its cities exactly once.
combinatorics