10c5
This is a diagonal line. The definition of a diagonal is a line that joins two nonconsecutive vertices or corners of a polygon.
n-3 diagonals. Of the n vertices of the polygon, you cannot draw diagonals to the two adjacent vertices since these are sides of the polygon and so not diagonals. And you cannot draw a diagonal from a vertex to itself. So those are three vertices that are ruled out, leaving n-3.
The line is called a diagonal if it is drawn between two nonadjacent angles.
The altitude is usually drawn from the base.
The line drawn from the center of a regular polygon and perpendicular to a side.
120
10c5
A regular pentagon is convex. By taking a regular pentagon and shortening or lengthening one or more sides, an infinite number of possible convex pentagons can be created. A convex polygon is defined as a polygon such that all internal angles are less than or equal to 180 degrees, and a line segment drawn between any two vertices remains inside the polygon. It is possible to have non-convex (concave) pentagons; there are infinite number possible ways to do this, too.
5 diagonals * * * * * That is not correct since two of these would be lines joining the vertex to adjacent vertices (one on either side). These are sides of the polygon, not diagonals. The number of diagonals from any vertex of a polygon with n sides is n-3.
This is a diagonal line. The definition of a diagonal is a line that joins two nonconsecutive vertices or corners of a polygon.
10 ... any polygon it is 2 less than the number of sides or vertices wince they are the same.
N-2 according to yahoo answers
It consists of 98 triangles and has 4850 diagonals
n-3 diagonals. Of the n vertices of the polygon, you cannot draw diagonals to the two adjacent vertices since these are sides of the polygon and so not diagonals. And you cannot draw a diagonal from a vertex to itself. So those are three vertices that are ruled out, leaving n-3.
Suppose a polygon has n vertices (and sides). From each vertex, a diagonal can be drawn to all vertices, excluding itself and the two adjacent vertices. So n-3 diagonals can be drawn from each vertex. Multiplying by the full complement of n vertices gives n(n-3). However, as things stand we have counted each diagonal twice: once at both ends. Dividing by two gives the actual number of diagonals. number of diagonals = n(n-3)/2
Suppose a polygon has n vertices (and sides).From each vertex, a diagonal can be drawn to all vertices, excluding itself and the two adjacent vertices. So n-3 diagonals can be drawn from each vertex.Multiplying by the full complement of n vertices gives n(n-3). However, as things stand we have counted each diagonal twice: once at both ends. Dividing by two gives the actual number of diagonals.number of diagonals = n(n-3)/2
In a Frequency Polygon, a line graph is drawn by joining all the midpoints of the top of the bars of a histogram. A frequency polygon gives the idea about the shape of the data distribution. The two end points of a frequency polygon always lie on the x-axis.