Roland2rule wrote:A polygon has 12 edges. How many different diagonals does it have?
(A) 54
(B) 66
(C) 108
(D) 132
(E) 144

Here's another approach.

The polygon in question has 12 vertices.

Let's focus on ONE VERTEX, which we'll call vertex A
How many diagonal can be drawn from vertex A?
We'll there are 11 other vertices to connect to, HOWEVER the vertices on either side of vertex A are out of contention, since joining two adjacent points will not create a diagonal.
So, we can create a diagonal with vertex A by connecting to any of the 9 eligible vertices.

Using the same logic, we can conclude that we can create a diagonal with vertex B by connecting to any of the 9 eligible vertices.

And we can create a diagonal with vertex C by connecting to any of the 9 eligible vertices.

There are 12 vertices, so the TOTAL number of diagonals = (12)(9) = 108
HOWEVER, this is not the final answer, since we have counted each diagonal TWICE.
For example, in the first step, we counted the diagonal created by joining vertex A with vertex B, and in the second step, we counted the diagonal created by joining vertex B with vertex A

To account for this duplication, we must take 108 and divide it by 2 to get: 54

Answer: A

Cheers,
Brent

BTGmoderatorRO wrote: ↑

Sat Sep 30, 2017 7:14 pm

A polygon has 12 edges. How many different diagonals does it have?
(A) 54
(B) 66
(C) 108
(D) 132
(E) 144
oa is a

What is the best approach to solve this question. Why is the answer C and not E?

Recall that the number of diagonals of an n-sided polygon n(n - 3)/2. So the number of diagonals of a 12-sided polygon is 12(12 - 3)/2 = 6(9) = 54.

Answer: A