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 answer. IM REPOSTING THIS QUESTION, BUT THIS TIME FOR 15 POINTS
PLEASE HELP :)

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;

the correct option is 2.

step-by-step explanation:

according to the given information triangle abc is a right angle triangle with right angle at a. segment ab is 5 and segment ac is 7. point d is on segment bc and angles adb and adc are right angles.

it is given that triangles abd, cad, and cba are similar.

two triangles are similar if their corresponding sides are proportional.

in triangle cba, using pythagoras theorem

                      )

triangle abd and cba are similar,

                            (2)

triangle cad and cba are similar,

                      )

using (1), (2) and (3), we get

hence proved.

therefore option 2 is correct.