How many diagonals can be constructed from one vertex of an n-gon? State your answer in terms of n and, of course, justify your
1 answer:
Answer:
Step-by-step explanation:
A diagonal is defined in geometry as a line connecting to two non adjacent vertices.
Therefore, the minimum number of sides a polygon must have in order to have a diagonal n - 3 sides as the 3 comes from the originating vertex and the other two adjacent vertices
Given that the polygon has n sides, the number of diagonals that can be drawn from each of those n sides gives the total number of diagonals as follows;
Total possible diagonals = n × (n - 3)
However, half of the diagonals drawn within the polygon are the same diagonals drawn in reverse. Therefore, the total number of distinct diagonals that can be drawn in a polygon is given as follows;
You might be interested in
Option C:
x = 30
Solution:
The given image is a triangle.
angle 1, angle 2 and angle 3 are interior angles of a triangle.
angle 4 is the exterior angle of a triangle.
m∠4 = 2x°, , m∠3 = 20°
Exterior angle theorem:
<em>In triangle, the measure of exterior angle is equal to the sum of the opposite interior angles.</em>
By this theorem,
m∠4 = m∠2 + m∠3
Subtract on both sides of the equation.
To make the denominator same and then subtract.
Multiply by on both sides of the equation.
x° = 30°
x = 30
Hence option C is the correct answer.