Permutation & combination

This topic has expert replies
Senior | Next Rank: 100 Posts
Posts: 91
Joined: Fri Jan 17, 2014 7:34 am
Thanked: 7 times

Permutation & combination

by parveen110 » Fri Jan 24, 2014 9:20 am
In a convex nonagon all the diagonals are drawn. These diagonals intersect each other at p points inside the nonagon, q points on the nonagon and r points outside the nonagon. Find the maximum possible value of p.

a. 124
b. 96
c. 120
d. 126

OA d
Source: — Problem Solving |

User avatar
GMAT Instructor
Posts: 15539
Joined: Tue May 25, 2010 12:04 pm
Location: New York, NY
Thanked: 13060 times
Followed by:1906 members
GMAT Score:790

by GMATGuruNY » Fri Jan 24, 2014 11:39 am
parveen110 wrote:In a convex nonagon all the diagonals are drawn. These diagonals intersect each other at p points inside the nonagon, q points on the nonagon and r points outside the nonagon. Find the maximum possible value of p.

a. 124
b. 96
c. 120
d. 126

OA d
A nonagon is a 9-sided figure.
A diagonal is formed by connecting one vertex to a non-adjacent vertex.
We need to count the total number of interior intersections that can be yielded by these diagonals.

Image
Here, an intersection is formed by means of vertices A, B, C and D.

Image
Here, an intersection is formed by means of vertices C, E, G and I.

Image
Here, an intersection is formed by means of vertices A, E, G and H.

The cases above illustrate that EVERY COMBINATION OF 4 VERTICES can serve to yield exactly ONE INTERSECTION.
Thus, the total number of possible intersections is equal to the total number of ways to choose 4 vertices from 9 options:
9C4 = (9*8*7*6)/(4*3*2*1) = 126.

The correct answer is D.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3