Problem #PRU-30417

Problems Discrete Mathematics Graph Theory

Problem

There are 9 cities in the country Number with the names 1, 2, 3, 4, 5, 6, 7, 8, 9. The traveller discovered that two cities are connected by an airline if and only if a two-digit number made up of the digit-names of these cities, is divisible by 3. Is it possible to get from city 1 to city 9?