There R 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.

• Flight can start from 8 cities.
• 13 years agoHelpfull: Yes(3) No(5)
• plz give clear ans ....
• 13 years agoHelpfull: Yes(0) No(0)
• two-cities: (3)
  1-8
  4-8
  7-8
  
  three-cities: (10 * 2! = 20)
  1-3-8
  1-6-8
  1-9-8*
  2-5-8
  3-4-8
  3-7-8
  4-6-8
  4-9-8*
  6-7-8
  7-9-8*
  
  four-cities: (15 * 3! = 90)
  1-2-4-8
  1-2-7-8
  1-3-6-8
  1-3-9-8*
  1-4-5-8
  1-5-7-8**
  1-6-9-8*
  2-3-5-8
  2-4-7-8
  2-5-6-8**
  2-5-9-8*
  3-4-6-8
  3-4-9-8*
  4-5-7-8
  4-6-9-8*
  
  five-cities: (22 * 4! = 528)
  1-2-3-4-8
  1-2-3-7-8
  1-2-4-6-8
  1-2-4-9-8*
  1-2-6-7-8**
  1-2-7-9-8*
  1-3-4-5-8
  1-3-5-7-8
  1-3-6-9-8*
  1-4-5-6-8
  1-4-5-9-8*
  1-5-6-7-8
  1-5-7-9-8*
  2-3-4-7-8
  2-3-5-6-8
  2-3-5-9-8*
  2-4-6-7-8
  2-4-7-9-8*
  3-4-5-7-8
  3-4-6-9-8*
  4-5-6-7-8
  4-5-7-9-8*
  
  six-cities: (20 * 5! = 2400)
  1-2-3-4-6-8
  1-2-3-4-9-8*
  1-2-3-6-7-8
  1-2-3-7-9-8*
  1-2-4-5-7-8
  1-2-4-6-9-8*
  1-2-6-7-9-8*
  1-3-4-5-6-8
  1-3-4-5-9-8*
  1-3-5-6-7-8
  1-3-5-7-9-8*
  1-4-5-6-9-8*
  1-5-6-7-9-8*
  2-3-4-6-7-8
  2-3-4-7-9-8*
  2-3-5-6-9-8*
  2-4-6-7-9-8*
  3-4-5-6-7-8
  3-4-5-7-9-8*
  4-5-6-7-9-8*
  
  seven-cities: (9 * 6! = 6480)
  1-2-3-4-5-7-8
  1-2-3-4-6-9-8*
  1-2-3-6-7-9-8*
  1-2-4-5-6-7-8
  1-2-4-5-7-9-8*
  1-3-4-5-6-9-8*
  1-3-5-6-7-9-8*
  2-3-4-6-7-9-8*
  3-4-5-6-7-9-8*
  
  eight-cities: (3 * 7! = 15120)
  1-2-3-4-5-6-7-8
  1-2-3-4-5-7-9-8*
  1-2-4-5-6-7-9-8*
  
  nine-cities: (1 * 8! = 40320)
  1-2-3-4-5-6-7-9-8*
  
  TOTAL = 64961
• 13 years agoHelpfull: Yes(0) No(2)