In a regular 15-sided polygon with all its di | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(A) regular $n$-sided polygon has $N = \frac{n(n-3)}{2}$ diagonals.For $n = 15$,the total number of diagonals is $N = \frac{15(15-3)}{2} = \frac{15

Vedclass · Accepted Answer

$\frac{2}{3}$

Vedclass · Answer

(A) regular $n$-sided polygon has $N = \frac{n(n-3)}{2}$ diagonals.For $n = 15$,the total number of diagonals is $N = \frac{15(15-3)}{2} = \frac{15 	imes 12}{2} = 90$.Shortest diagonals connect vertices separated by one vertex (e.g.,$V_1$ to $V_3$). There are $n = 15$ such diagonals.Longest diagonals connect vertices separated by $\frac{n-1}{2}$ vertices (e.g.,$V_1$ to $V_8$). There are $n = 15$ such diagonals.The number of diagonals that are neither shortest nor longest is $90 - (15 + 15) = 90 - 30 = 60$.The probability is $\frac{60}{90} = \frac{2}{3}$.

In a regular $15$-sided polygon with all its diagonals drawn,a diagonal is chosen at random. The probability that it is neither a shortest diagonal nor a longest diagonal is

Similar Questions

Ten points are marked on a circle. The number of distinct convex polygons of three or more sides that can be drawn using some or all of the ten points as vertices is:

$A$ simple graph contains $24$ edges. The degree of each vertex is $3$. The number of vertices is:

There are $10$ points in a plane,of which no three points are collinear except $4$. Then,the number of distinct triangles that can be formed by joining any three points of these ten points,such that at least one of the vertices of every triangle formed is from the given $4$ collinear points is

Let $T_n$ be the number of all possible triangles formed by joining vertices of an $n$-sided regular polygon. If $T_{n+1} - T_n = 10$,then the value of $n$ is:

How many triangles can be formed using $5$ points on a line and $3$ points on a parallel line?

Vedclass Test Series

Exam Paper Generator

Online Exam Module