Explore More

Similar Questions

Let $P$ be a closed polygon with $10$ sides and $10$ vertices (assume that the sides do not intersect except at the vertices). Let $k$ be the number of interior angles of $P$ that are greater than $180^{\circ}$. The maximum possible value of $k$ is

Let $p_n$ denote the total number of triangles formed by joining the vertices of an $n$-sided regular polygon. If $p_{n+1} - p_n = 66$,then the sum of all distinct prime divisors of $n$ is:

Let $n > 2$ be an integer. Suppose that there are $n$ Metro stations in a city located along a circular path. Each pair of stations is connected by a straight track. Further,each pair of nearest stations is connected by a blue line,whereas all remaining pairs of stations are connected by a red line. If the number of red lines is $99$ times the number of blue lines,then the value of $n$ is:

Let $l_1$ and $l_2$ be two lines intersecting at $P$. If $A_1, B_1, C_1$ are points on $l_1$,and $A_2, B_2, C_2, D_2, E_2$ are points on $l_2$,and if none of these points coincides with $P$,then the number of triangles formed by these eight points is:

How many different (mutually non-congruent) trapeziums can be constructed using four distinct side lengths from the set $\{1, 2, 3, 4, 5, 6\}$?

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo