Want this question answered?
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.
10 ... any polygon it is 2 less than the number of sides or vertices wince they are the same.
It consists of 98 triangles and has 4850 diagonals
A dodecagon is a regular polygon that can be drawn using rotations. These are normally drawn in a Geometer's Sketchpad.
An apothem is a line drawn perpendicular to a side of a regular polygon from the center of the polygon. A polygon is not a circle so it cannot have a radius. The radius of a circle is drawn from the center to any point in the circumference of the circle. You can draw a circle which encloses the regular polygon touching all vertices. The polygon is said to be inscribed in the circle. The apothem will be less than the radius because the radius is not perpendicular to any side, it can be drawn to a vertex but the apothem is perpendicular to a side, so it is shorter. Ex: draw a square with a circle which inscribes it. You can see that the apothem will be less than the radius.
120
10c5
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.
A dodecagon is a regular polygon that can be drawn using rotations. These are normally drawn in a Geometer's Sketchpad.