For integers $n$ and $r$,let $\binom{n}{r} = \begin{cases} ^{n}C_{r}, & \text{if } n \geq r \geq 0 \\ 0, & \text{otherwise} \end{cases}$. The maximum value of $k$ for which the sum $\sum_{i=0}^{k}\binom{10}{i}\binom{15}{k-i} + \sum_{i=0}^{k+1}\binom{12}{i}\binom{13}{k+1-i}$ exists,is equal to ...... .

  • A
    Not defined
  • B
    $24$
  • C
    $36$
  • D
    $20$

Explore More

Similar Questions

The number of times the digit $5$ will be written when listing the integers from $1$ to $1000$ is

Difficult
View Solution

$A$ string of letters is to be formed by using $4$ letters from all the letters of the word "$MATHEMATICS$". The number of ways this can be done such that two letters are of the same kind and the other two are of a different kind is:

The number of seven-digit numbers that can be formed by using the digits $1, 2, 3, 5,$ and $7$ such that each digit is used at least once is:

The number of even numbers greater than $1000000$ that can be formed using all the digits $1, 2, 0, 2, 4, 2, 4$ is

The number of $5$ digit telephone numbers having at least one of their digits repeated is

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