There are 9 cities numbered 1 to 9. From how many cities the flight can start so as to reach the city 8 either directly or indirectly such the path formed is divisible by 3.

Dipronil Dey

• Aug 16th, 2017

8*((7C1*1!)+(7C2*2!)+(7C3*3!)+(7C4*4!)+(7C5*5!)+(7C6*6!)+(7C7*7!))

SAIKIRAN

• Sep 17th, 2011

3 and 6 are the cities divisible by 3

Answer Question  Select Best Answer