Explore More

Similar Questions

Let $S = \{0, 1, 2, 3, \ldots, 100\}$. The number of ways of selecting $x, y \in S$ such that $x \neq y$ and $x + y = 100$ is

An envelope has space for at most $3$ stamps. If you are given three stamps of denomination $1$ and three stamps of denomination $a$ (where $a > 1$),what is the least positive integer for which there is no possible stamp value?

There are $4$ notes of Rs. $100$ and $5$ other notes of denominations Rs. $1$,Rs. $2$,Rs. $5$,Rs. $20$,and Rs. $50$. These $9$ notes are to be distributed among $3$ children such that each child receives at least one note of Rs. $100$. Find the total number of ways of distribution.

Difficult
View Solution

The number of ways to distribute $30$ identical candies among four children $C_{1}, C_{2}, C_{3}$ and $C_{4}$ such that $C_{2}$ receives at least $4$ and at most $7$ candies,and $C_{3}$ receives at least $2$ and at most $6$ candies,is equal to

For all $n \in N$,the product $(n+24)(n+25)(n+26)(n+27)$ is always divisible by:

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