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

  • A
    $51$
  • B
    $40$
  • C
    $50$
  • D
    $100$

Explore More

Similar Questions

The smallest positive integer $n$,for which $n! < {\left( {\frac{{n + 1}}{2}} \right)^n}$ holds is

The number of five-digit numbers that are divisible by $6$ which can be formed by choosing digits from $\{0, 1, 2, 3, 4, 5\}$,when repetition is allowed,is

The sum of all the $4$-digit numbers formed by taking all the digits from ${2, 3, 5, 7}$ without repetition is:

Words with or without meaning are to be formed using all the letters of the word $EXAMINATION$. The probability that the letter $M$ appears at the fourth position in any such word is:

If $f(n) = n! (31-n)!$,where $n \in \{0, 1, 2, \ldots, 31\}$,then the minimum value of $f(n)$ is

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