In a maThematic there are 1,2,3,....9 cities and each number corresponds to a city. Now an airflight route is to be established between two cities such that the numeral formed is divisible by 3. (eg. if 1 and 2 are connected then it satisfies the condition). Find out the number of cities which are connected to city 8, either directly or indirectly.
RE: In a maThematic there are 1,2,3,....9 cities and each number corresponds to a city. Now an air...
1-8 4-8 7-8 2-1-8 5-4-8 The divisiblity of 3 will be only for 2 no. and not three. so according to the above routes 1 4 7 2 5 are connected either directly or indirectly.