CTS - 9 Cities Numbered 1 to 9

GeekInterview.com > Placement Papers > CTS

Go To First | Previous Question |

CTS | Question 86 of 86

9 Cities Numbered 1 to 9

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.

Total Answers and Comments: 3

Last Update: December 19, 2009 Asked by: rajatsona

Sponsored Links

Best Rated Answer

—

No best answer available. Please pick the good answer available or submit your answer.

July 17, 2009 14:07:32

anand3186

Member Since: July 2009 Contribution: 12

RE: 9 Cities Numbered 1 to 9

9 cities.
1 - 8 (1+8 9)
2-5-8(2+5+8 15)
3-4-8
4-(3 or 6)-8
5-2-8
6-(4 or 1)-8
7-8
8-2-8
9-1-8

Is this answer useful? Yes | No

0 3

Overall Rating: -3

December 09, 2009 23:41:00

m_manic

Member Since: September 2008 Contribution: 106

RE: 9 Cities Numbered 1 to 9

It can strart from 8 cities. 1 2 3 4 5 6 7 9

Is this answer useful? Yes | No

December 19, 2009 01:49:38

rajkumar03939

Member Since: December 2009 Contribution: 1

RE: 9 Cities Numbered 1 to 9

8+1

8+3

8+1+3+6

8+3+6

8+3+6+9

8+2+5

8+3+4

8+3+7

8+4+3

8+4+6

8+4+9

8+5+2

8+6+1

8+6+4

8+6+7

8+6+1+3

8+6+1+5+4

8+7+1+2

8+7+3

8+7+6

8+7+3+2+1

8+9+1

8+9+1+3

8+9+1+3+6

8+1+3+6+9

8+9+2+5

These are the ways that find to reach the 8 city in direct and indirect ways.

Is this answer useful? Yes | No

Go To Top

User Name		Remember Me?
Password

Question Bank