1 1 vote A, B, C and Dare four towns, any three of which are non-collinear. The number of ways to construct three roads each joining a pair of towns so that the roads do not form a triangle is: 7 8 9 more than 9 Quantitative Aptitude cat1995 quantitative-aptitude collinier + – Misbah Ghaya 8.6k points 3.1k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote Assume the four towns are at vertices of a square. There are 4C2 = 6 different roads, and so 6C3=20 ways to build 3 roads. A triangle of roads would need to have one road be a diagonal of the square, and for each of the 2 diagonals 2 triangles can be formed, so 4 triangles and number of ways to construct three roads each joining a pair of towns so that the roads do not form a triangle is 20 - 4 = 16 constructions satisfying the conditions. Option D is the Correct Answer. Shubham Sharma 2 answered Sep 28, 2017 Shubham Sharma 2 3.9k points comment Share Follow 0 reply Please log in or register to add a comment.