Permutation and CombinationHard
Question
A road network as shown in the figure connect four cities. In how many ways can you start from any city (say A) and come back to it without travel ling on the same road more than once ?
Options
A.8
B.12
C.9
D.16
Solution
Paths are shown as : -
Similarly if we start from A towards B we get another 4 paths.
Similarly if we start from A towards B Again 4 paths
∴ Total different paths = 4 × 3 = 12
II Method → 3C1 ×; 2C1 × 2C1 = 12
Similarly if we start from A towards B we get another 4 paths.
Similarly if we start from A towards B Again 4 paths
∴ Total different paths = 4 × 3 = 12
II Method → 3C1 ×; 2C1 × 2C1 = 12
Create a free account to view solution
View Solution FreeMore Permutation and Combination Questions
A student has to answer 10 out of 13 questions in an examination. The number of ways in which he can answer if he must a...The number of five digit numbers that can be formed using all the digits 0, 1, 3, 6, 8 which are -...All possible two factors products are formed from numbers 1, 2, 3, 4, ........, 200. The number of factors out of the to......There are 13 players of cricket out of which 4 are bowlers. In how many ways a team of eleven be selected from them so a...