Three
Depends on the shape.
n-3 from each vertex.
17
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.
If all of the diagonals are drawn from a vertex of an octagon, how many triangles are formed
The number of Diagonals in one vertex of a Triangle is 0 (zero)..
Number of sides minus two equals number of diagonals drawn from one vertex.
In a polygon with n sides, the number of diagonals that can be drawn from one vertex is given by the formula (n-3). Therefore, in a 35-sided polygon, you can draw (35-3) = 32 diagonals from one vertex.
No.
There are 10 possible diagonals drawn from one vertex of the 13-gon which divide it into 11 nonoverlapping triangles.
13 The correct answer is 12. From any one vertex, you can draw a diagonal to all but 3 vertices: the vertex itself and the next vertex on either side of your vertex (these would be sides of your shape, not diagonals).
It is 18 diagonals
In a 54-sided polygon, 53 possible diagonals can be drawn from one vertex to another. These diagonals will not intersect. Therefore, the interior will be divided into 54 regions by the 53 diagonals plus the two sides of the original polygon that adjoin the vertex from which the diagonals are drawn.
3
Three
Depends on the shape.