BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Polygon -Geometry

Expert replies
Source: — Problem Solving |

by eagleeye » Wed Jun 27, 2012 7:23 pm
Number of a diagonals of a polygon of side n = n*(n-3)/2.

We are told that number of diagonals here is 20. Hence n(n-3)/2 = 20.
Hence n*(n-3)=40 = 8*5. Hence n = 8.

Hence E is the right answer.

Let me know if this helps :)
Join the discussion

by spartacus1412 » Wed Jun 27, 2012 7:54 pm
let usassume polygon has n sides. hence, it has n vertices.

no of ways in which any two points can be selected from these n points= nC2
(please note this gives us the total number of lines that can be formed from the given n points).

nC2 = no of sides of the ploygon + no of diagonals of the polygon.

here,no od diagonals= 20.
hence, nC2 = n +20
solve for n .

Hope this helps!
Its do or die this time!
Practise, practise and practise.
Join the discussion

by GMATGuruNY » Thu Jun 28, 2012 3:48 am
Soumita Ghosh wrote:A POLYGON HAS 20 DIAGONALS, How Many Sides Does It Have?


A) 12

B) 11

C) 10

D) 9

E) 8
A diagonal is a COMBINATION of 2 vertices.
Any combination of 2 vertices that do not form a side of the polygon can serve to form a diagonal.
We can plug in the answers, which represent the number of vertices needed to form 20 diagonals.

Answer choice C: 10

Number of combinations of 2 that can be formed from 10 options = 10C2 = 45.
But this result includes those combinations of 2 that form the sides of the polygon -- combinations that do not yield diagonals.
These bad combinations -- in other words, the number of sides of the polygon -- must be subtracted from the total:
45-10 = 35.
Too big.
Eliminate A, B and C.

Answer choice D: 9
Number of combinations of 2 that can be formed from 9 options = 9C2 = 36.
Subtracting the number of sides, we get:
36-9 = 27.
Eliminate D.

The correct answer is E.

Answer choice E: 8
Number of combinations of 2 that can be formed from 8 options = 8C2 = 28.
Subtracting the number of sides, we get:
28-8 = 20.
Success!
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
Join the discussion