0
What else can I help you with?
How many diagonals can be drawn from one vertex of a seven sided polygon?
There can be 14 lines in a seven side shape * * * * * That is the total number of diagonals from ALL vertices. Not what the question asked, though. From one vertex, there can be 4. One to every other vertex except for itself and one each on either side.
Is a pentagon convex?
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.
How do you draw a dodecagon?
A dodecagon can be drawn by drawing a polygon with 12 sides and 12 angles. All sides and angles have to be equal. * * * * * The first sentence is correct, the second is utter nonsense. There is no reason for a dodecagon - or a polygon with any number of sides - to have equal sides or equal angles.
What are axioms?
axioms are statements which cannot be proved.but these statements are accepted universally.we know that any line can be drawn joining any two points.this does not have a proof
How many diagonals can be drawn from one angle of a polygon with 64 sides?
64 sides = 64 angles From one angle you can draw (64 - 2) diagonals = 62. Lines from an angle to the immediately adjacent angles are sides, not diagonals.
How many heptagons can be drawn by joining the vertices of a 10 sided polygon?
To determine how many heptagons can be formed by joining the vertices of a 10-sided polygon, we can use the combination formula. Specifically, we need to choose 7 vertices from the 10 available. This is calculated as ( \binom{10}{7} ), which is equal to ( \binom{10}{3} ) (since choosing 7 vertices to include is the same as choosing 3 vertices to exclude). Thus, ( \binom{10}{3} = \frac{10!}{3!(10-3)!} = 120 ). Therefore, 120 heptagons can be drawn by joining the vertices of a 10-sided polygon.
How many pentagons can be drawn by joining the vertices of a polygon with ten sides?
10c5
How many diagonal can be drawn from a regular hexagon from one vertex?
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.
What is this a line drawn between 2 vertices which are not next to each other?
This is a diagonal line. The definition of a diagonal is a line that joins two nonconsecutive vertices or corners of a polygon.
How many diagonals can be drawn from one vertex of a 12 sided polygon?
10 ... any polygon it is 2 less than the number of sides or vertices wince they are the same.
What is the number of diagonals that can be drawn from one vertex in a convex polygon that has n vertices?
N-2 according to yahoo answers
What is the number of diagonls which can be drawn by joining the angular points of a polygon of 100 sides?
It consists of 98 triangles and has 4850 diagonals
What is the line segment joining the opposite vertices of quadrilateral?
The line segment joining the opposite vertices of a quadrilateral is known as a diagonal. Each quadrilateral has two diagonals, which can be drawn by connecting pairs of non-adjacent vertices. Diagonals help in analyzing the properties of the quadrilateral, such as area and symmetry, and can also be used in various geometric calculations.
How many diagonals can be drawn from a vertex of an n gon?
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.
What is the formula for the number of diagonals in a polygon?
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
How do you find diagonals in a polygon?
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
What is a frequency polygon graph?
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.
