0
Add your answer:
Earn +20 pts
How many diagonals does a hexagon have one vertex?
None. By definition a diagonal goes from one vertex to another vertex and so each diagonal MUST have two vertices.
A hexagon can be divided into how many triangles by drawing all of the diagonals from one vertex?
A hexagon (six-sided polygon) can be divided into 4 triangles by drawing all of the diagonals from one vertex (only three lines can be drawn in this case, since each vertex already connects to two others on the edges of the form). If you instead drew lines from the center to each vertex, you would get 6 triangles.
If a circle is inscribed in a hexagon which of the following must be true?
A. The hexagon is circumscribed about the circle . D. Each vertex of the hexagon lies outside the circle . E. The circle is tangent to each side of the hexagon .
How many diagonals can be drawn from each vertex of an octagon?
it really isn't hard 5
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
Has three diagonals at each vertex?
Hexagon (6 sides)
How many diagonals does a hexagon have?
A hexagon has 9 diagonals. Each vertex of a n-sided polygon can be connected to n - 3 others with diagonals. Thus n(n - 3) possible diagonals. However, when Vertex A is connected to vertex C, vertex C is also connected to vertex A, thus each diagonal is counted twice. Thus: number_of_diagonals = n(n - 3)/2 = 6(6-3)/2 = 6x3/2 = 9
How many diagonals does a hexagon have one vertex?
None. By definition a diagonal goes from one vertex to another vertex and so each diagonal MUST have two vertices.
A hexagon can be divided into how many triangles by drawing all of the diagonals from one vertex?
A hexagon (six-sided polygon) can be divided into 4 triangles by drawing all of the diagonals from one vertex (only three lines can be drawn in this case, since each vertex already connects to two others on the edges of the form). If you instead drew lines from the center to each vertex, you would get 6 triangles.
If a circle is inscribed in a hexagon which of the following must be true?
A. The hexagon is circumscribed about the circle . D. Each vertex of the hexagon lies outside the circle . E. The circle is tangent to each side of the hexagon .
How many diagonals does each vertex have in an octagon?
5
What is a diagonal vertex of a square?
The diagonals of a square bisect each corner or vertex of the square.
How do you draw lines of symmetry lines in a regular hexagon?
From each vertex to its opposite vertex. These will be centered on a shared point at the center of the hexagon. Each complete line will be a line of symmetry for the hexagon.
How many diagonals are in a regular hexagon Why?
There are 9 diagonals in every hexagon.To see why, select any one of the 6 vertices. There are 5 other vertices to which it can be joined. But the lines joining it to the two adjacent vertices (one on each side) are not diagonals but sides of the hexagon. So, from each vertex, you get 3 diagonals.The first vertex can be selected in 6 ways so it would seem that you have 6*3 = 18 diagonals. However, you will then be counting each diagonal twice: once from each end. So the correct answer is 18/2 = 9.In general, a polygon with n sides has n*(n-3)/2 diagonals. Also, whether or not it is regular is totally irrelevant.
How many diagonals can be drawn fron a vertex of an n-gon?
n-3 from each vertex.
Are the diagonals of an isosceles triangle perpendicular?
There are no 'diagonals' in a triangle. Each vertex is connected to both of the other vertices, by the sides.
How many diagonals can be drawn from one vertex of a polygon of 50 sides?
47 sides. Take a vertex of an n-sided polygon. There are n-1 other vertices. It is already joined to its 2 neighbours, leaving n-3 other vertices not connected to it. Thus n-3 diagonals can be drawn in from each vertex. For n=50, n-3 = 50-3 = 47 diagonals can be drawn from each vertex. The total number of diagonals in an n-sided polygon would imply n-3 diagonals from each of the n vertices giving n(n-3). However, the diagonal from vertex A to C would be counted twice, once for vertex A and again for vertex C, thus there are half this number of diagonals, namely: number of diagonals in an n-sided polygon = n(n-3)/2.
