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

INFOSYS QUESTION BANKQuestion:There is an escalator and 2 persons move down it. A takes 50 steps and B takes 75 steps while the escalator is moving down. Given that the time taken by A to take 1 step is equal to time taken by B to take 3 steps. Find the number of steps in the escalator while it is stationary.Answer:100 stepsQuestion:If 5/2 artists make 5/2 paintings using 5/2 canvases in 5/2 days then...

tibuhari

 Profile Answers by tibuhari Questions by tibuhari

• Nov 25th, 2010

Answer for: Two trains starting at same time, one from Bangalore to Mysore and other in opposite direction arrive at their destination 1 hour and 4 hours respectively after passing each other. How...

suresh

• Nov 8th, 2006

Thanks

Answer Question  Select Best Answer