Explore More

Similar Questions

The number of triangles that can be formed by choosing the vertices from a set of $12$ points,$7$ of which lie on the same straight line,is

$n$-digit numbers are formed using only three digits $2, 5$,and $7$. The smallest value of $n$ for which $900$ such distinct numbers can be formed is:

We wish to select $6$ persons from $8,$ but if the person $A$ is chosen,then $B$ must be chosen too. In how many ways can the selection be made?

Let $A = \{a_1, a_2, a_3, ..., a_n\}$ be a set containing $n$ elements. Two subsets $P$ and $Q$ of $A$ are formed independently. The number of ways in which these subsets can be formed such that $(P - Q)$ contains exactly $2$ elements is:

Difficult
View Solution

If $a_n = \sum_{r = 0}^n \frac{1}{^nC_r}$,then $\sum_{r = 0}^n \frac{r}{^nC_r}$ equals

Difficult
View Solution

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