Last visit was: 03 Jun 2026, 03:48 It is currently 03 Jun 2026, 03:48
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
conocieur
Joined: 20 Mar 2005
Last visit: 21 Nov 2006
Posts: 103
Own Kudos:
Location: Colombia, South America
Posts: 103
Kudos: 38
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
hobbit
Joined: 23 Jun 2006
Last visit: 04 Jul 2012
Posts: 261
Own Kudos:
Posts: 261
Kudos: 362
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
hobbit
Joined: 23 Jun 2006
Last visit: 04 Jul 2012
Posts: 261
Own Kudos:
Posts: 261
Kudos: 362
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
kevincan
User avatar
GMAT Instructor
Joined: 04 Jul 2006
Last visit: 03 Jun 2026
Posts: 1,860
Own Kudos:
Given Kudos: 234
GRE 1: Q170 V170
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
GRE 1: Q170 V170
Posts: 1,860
Kudos: 2,800
Kudos
Add Kudos
Bookmarks
Bookmark this Post
conocieur
There is a polygon with 10 sides. A point is there in the middle of the polygon and all the vertices are joined with the point and therefore producing 10 triangles. In exactly how many ways can you select three triangles no two of which are adjacent?


If we numbered the triangles from 1 to 10 going clockwise from the top triangle, we can answer the question as follows:

There are 10C3 ways of choosing three of these triangles i.e. 720/6 =120

However, there are 10 ways of choosing 3 adjacent triangles.

Also, there are 10*6 ways of choosing 2 adjacent trangles and another non-adjacent.

Thus total = 120-60-10=50
User avatar
Andr359
Joined: 24 Nov 2006
Last visit: 29 Aug 2007
Posts: 169
Own Kudos:
Posts: 169
Kudos: 67
Kudos
Add Kudos
Bookmarks
Bookmark this Post
kevincan
conocieur
There is a polygon with 10 sides. A point is there in the middle of the polygon and all the vertices are joined with the point and therefore producing 10 triangles. In exactly how many ways can you select three triangles no two of which are adjacent?

If we numbered the triangles from 1 to 10 going clockwise from the top triangle, we can answer the question as follows:

There are 10C3 ways of choosing three of these triangles i.e. 720/6 =120

However, there are 10 ways of choosing 3 adjacent triangles.

Also, there are 10*6 ways of choosing 2 adjacent trangles and another non-adjacent.

Thus total = 120-60-10=50


Agree.
For N = 7 sides and m = 3 triangles to select:
Total = 7C3 - (N = 7) - (N * m = 21) = 35 - 7 - 21 = 7 ways of ordering 3 triangles in a 7-sided polygon.
For N = 7 and m = 2 triangles to select:
Total = 7C2 - (N = 7) = 21 - 7 = 14 ways to order 2 triangles in a 7-sided polygon.



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!