Greatest number of diagonals

Expert replies

gmattesttaker2: Legendary Member; Posts: 641; Joined: Tue Feb 14, 2012 3:52 pmFollowed by: 8 members; Thanked: 11 times

by gmattesttaker2 » Wed Feb 19, 2014 6:31 pm

Hello,

Is there a formula that can be used for the kind of question given below? Is the following formula correct for finding the total number of diagonals:

The number of diagonals of a polygon of side x = x(x-3)/2

The greatest number of diagonals that can be drawn from one vertex of a regular 6-sided polygon is

(A) 2
(B) 3
(c) 4
(D) s
(E) 6

OA: B

Thanks,
Sri

Like this post

Source: Beat The GMAT — Problem Solving | Wed Feb 19, 2014 6:31 pm

Patrick_GMATFix: GMAT Instructor; Posts: 1052; Joined: Fri May 21, 2010 1:30 amFollowed by: 98 members; Thanked: 335 times

by Patrick_GMATFix » Wed Feb 19, 2014 10:27 pm

A diagonal goes from one vertex to any other vertex except itself and the two vertices adjacent to it. As a result, the max number of diagonals that can be drawn from any vertex in a polygon with x sides (x vertices) is x-3. This question is about a 6-sided polygon, so the answer is 6-3 = 3.

The number of diagonals can be found using combinations. A diagonal is a link between two vertices, so we can think of the number of diagonals as the number of ways to pick 2 vertices. However, since the links between adjacent vertices make up the sides (not the diagonals), we must subtract these from the total.

Let's test it with familiar figures

Eg: how many diagonals in a square?
Ways to pick 2 vertices from 4 = 4C2 = 4!/(2!2!) = 6 links.
Subtract the 4 links that are sides rather than diagonals and you end up with 6-4 = 2 diagonals.

Eg: how many diagonals in a triangle?
Ways to pick 2 vertices from 3 = 3C2 = 3!/(2!1!) = 3 links.
Subtract the 3 links that are sides rather than diagonals and you end up with 6-4 = no diagonals in a triangle

Eg: how many diagonals in a hexagon (6 sides) ?
Ways to pick 2 vertices = 6C2 = 6!(2!4!) = 15 links.
Subtract the 6 links that are sides rather than diagonals and you end up with 15-6 = 9 diagonals (see figure)

Thus we can derive a general formula: # of diagonals in an n-sided polygon is n!/((n-2)!*2!) - n

The formula you provided, # of diagonals = x(x-3)/2, is the simplified version of what I derived above, so it is correct

-Patrick

Check out my site: GMATFix.com

To prep my students I use this tool >> (screenshots, video)

Ask me about tutoring.

Like this post

GMAT/MBA Expert

Brent@GMATPrepNow: GMAT Instructor; Posts: 16207; Joined: Mon Dec 08, 2008 6:26 pmFollowed by: 1268 members; Location: Vancouver, BC; Thanked: 5254 times; GMAT Score:770

by Brent@GMATPrepNow » Thu Feb 20, 2014 9:37 am

gmattesttaker2 wrote:Hello,

Is the following formula correct for finding the total number of diagonals:

The TOTAL number of diagonals of a polygon of side x = x(x-3)/2

Patrick's approach is great. Here's another approach.

Choose any vertex.
There are x vertices, so this step can be accomplished in x ways.

Choose a second vertex to create the diagonal.
If we want to create a diagonal, the second vertex CANNOT be the same as the first vertex we chose AND the second vertex cannot be one of the two ADJACENT vertices. So, among the n vertices, 3 of them are "off limits." So this step can be accomplished in x - 3 ways.

So, the number of ways to complete BOTH steps (and get a diagonal) = (x)(x - 3)

IMPORTANT: We have inadvertently counted each diagonal TWICE. For example, if we chose vertex A in the first step and vertex G in the second step, we get the EXACT SAME diagonal as choosing vertex G in the first step and vertex A in the second step.

Since we have counted each diagonal TWICE, we'll take (x)(x - 3) and divide it by 2 to get: (x)(x - 3)/2

Cheers,
Brent

Last edited by Brent@GMATPrepNow on Thu Feb 20, 2014 9:51 am, edited 1 time in total.

Brent Hanneson - Creator of GMATPrepNow.com

Like this post

Patrick_GMATFix: GMAT Instructor; Posts: 1052; Joined: Fri May 21, 2010 1:30 amFollowed by: 98 members; Thanked: 335 times

by Patrick_GMATFix » Thu Feb 20, 2014 9:48 am

Brent, that's really elegant. I'm jealous not to have thought of it.

Check out my site: GMATFix.com

To prep my students I use this tool >> (screenshots, video)

Ask me about tutoring.

Like this post

GMAT/MBA Expert

Brent@GMATPrepNow: GMAT Instructor; Posts: 16207; Joined: Mon Dec 08, 2008 6:26 pmFollowed by: 1268 members; Location: Vancouver, BC; Thanked: 5254 times; GMAT Score:770

by Brent@GMATPrepNow » Thu Feb 20, 2014 9:52 am

Thanks Patrick

Cheers,
Brent

Brent Hanneson - Creator of GMATPrepNow.com

Like this post

gmattesttaker2: Legendary Member; Posts: 641; Joined: Tue Feb 14, 2012 3:52 pmFollowed by: 8 members; Thanked: 11 times

by gmattesttaker2 » Thu Feb 20, 2014 11:17 am

Patrick_GMATFix wrote:A diagonal goes from one vertex to any other vertex except itself and the two vertices adjacent to it. As a result, the max number of diagonals that can be drawn from any vertex in a polygon with x sides (x vertices) is x-3. This question is about a 6-sided polygon, so the answer is 6-3 = 3.

The number of diagonals can be found using combinations. A diagonal is a link between two vertices, so we can think of the number of diagonals as the number of ways to pick 2 vertices. However, since the links between adjacent vertices make up the sides (not the diagonals), we must subtract these from the total.

Let's test it with familiar figures

Eg: how many diagonals in a square?
Ways to pick 2 vertices from 4 = 4C2 = 4!/(2!2!) = 6 links.
Subtract the 4 links that are sides rather than diagonals and you end up with 6-4 = 2 diagonals.

Eg: how many diagonals in a triangle?
Ways to pick 2 vertices from 3 = 3C2 = 3!/(2!1!) = 3 links.
Subtract the 3 links that are sides rather than diagonals and you end up with 6-4 = no diagonals in a triangle

Eg: how many diagonals in a hexagon (6 sides) ?
Ways to pick 2 vertices = 6C2 = 6!(2!4!) = 15 links.
Subtract the 6 links that are sides rather than diagonals and you end up with 15-6 = 9 diagonals (see figure)

Thus we can derive a general formula: # of diagonals in an n-sided polygon is n!/((n-2)!*2!) - n

The formula you provided, # of diagonals = x(x-3)/2, is the simplified version of what I derived above, so it is correct

-Patrick

Hello Patrick,

Thanks for the detailed explanation and for the excellent diagram. It is clear now. Thanks again.

Best Regards,
Sri

Like this post

Post new topic Post Reply

• Page 1 of 1

GMAT Course Reviews

559 reviews

1168 reviews

431 reviews

359 reviews

147 reviews

5/5

5 Star (560 Reviews)

"Target Test Prep is the closest to the official version of the GMAT exam, about 99% accuracy in terms of the quality and quantity of information. The course has excellently created singular sets of focused lessons and tests for every possible topic that one could come across in the official GMAT exam."

"The TTP course maximizes the efficiency of the time you spend studying. It will take time and effort but I could almost guarantee that if you complete the course exactly as it is laid out you will get an amazing score. They also have a very responsive team willing to help with any questions you might have."

"TTP has two things that I think no other test prep company offers: A teaching approach that reinforces understanding and an attitude that will give you the mental preparedness needed to succeed on the test. TTP gives you a deep understanding of the concept you need to know while teaching you how to think."

Write a Review