NVAMediumJEE 2023Applications of P&C

JEE Mathematics 2023 Question with Solution

Let xx and yy be distinct integers where 1x251 \leq x \leq 25 and 1y251 \leq y \leq 25. Then, the number of ways of choosing xx and yy, such that x+yx + y is divisible by 55, is _____.

Answer

Correct answer:120

Step-by-step solution

Counting by residues modulo 5

Given: xx and yy are distinct integers with 1x251 \leq x \leq 25 and 1y251 \leq y \leq 25.

Find: The number of ordered choices of xx and yy such that x+yx+y is divisible by 55.

Classify the integers from 11 to 2525 according to their residues modulo 55. Each residue class has exactly 55 elements.

For x+yx+y to be divisible by 55, we need

x+y0(mod5)x+y \equiv 0 \pmod{5}

So the possible residue pairs are

(0,0),(1,4),(2,3),(3,2),(4,1)(0,0), (1,4), (2,3), (3,2), (4,1)

Now count each case:

  • For (0,0)(0,0), both numbers are multiples of 55. Since xx and yy are distinct, the number of ways is
(52)×2=20\binom{5}{2} \times 2 = 20
  • For (1,4)(1,4), the number of ways is
5×5=255 \times 5 = 25
  • For (2,3)(2,3), the number of ways is
5×5=255 \times 5 = 25
  • For (3,2)(3,2), the number of ways is
5×5=255 \times 5 = 25
  • For (4,1)(4,1), the number of ways is
5×5=255 \times 5 = 25

Therefore, the total number of ways is

20+25+25+25+25=12020+25+25+25+25=120

Hence, the required number of ways is 120120.

Table-based case split

Given: xx and yy are distinct integers between 11 and 2525.

Find: The number of choices such that x+yx+y is divisible by 55.

Using the case split shown in the solution:

  • x=5λ,  y=5λx=5\lambda, \; y=5\lambda gives 2020 ways.
  • x=5λ+1,  y=5λ+4x=5\lambda+1, \; y=5\lambda+4 gives 2525 ways.
  • x=5λ+2,  y=5λ+3x=5\lambda+2, \; y=5\lambda+3 gives 2525 ways.
  • x=5λ+3,  y=5λ+2x=5\lambda+3, \; y=5\lambda+2 gives 2525 ways.
  • x=5λ+4,  y=5λ+1x=5\lambda+4, \; y=5\lambda+1 gives 2525 ways.

Adding all cases,

20+25+25+25+25=12020+25+25+25+25=120

Therefore, the total number of ways is 120120.

Common mistakes

  • Counting the case (0,0)(0,0) as 5×5=255 \times 5 = 25 is wrong because xx and yy must be distinct. When both are chosen from the same residue class of multiples of 55, equal pairs must be excluded. Count distinct ordered pairs instead, giving 2020.

  • Using (52)=10\binom{5}{2}=10 as the final count for the (0,0)(0,0) case is incomplete if ordered choices of xx and yy are being counted. The solutions treat (x,y)(x,y) and (y,x)(y,x) as different when residues differ, so for consistency the (0,0)(0,0) case must be doubled to 2020.

  • Missing one or more valid residue pairs modulo 55 leads to undercounting. The full set is (0,0),(1,4),(2,3),(3,2),(4,1)(0,0), (1,4), (2,3), (3,2), (4,1). Always list all residue combinations whose sum is congruent to 0(mod5)0 \pmod{5}.

Practice more Applications of P&C questions

Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.

Related questions