Permutations & Combinations
Permutation and Combination
star_batch_jee_advanced_2025
Grade 11

Question:

The number of ways to select 2 ordered numbers from $\{0, 1, 2, 3, 4\}$ such that the sum of the squares of the selected numbers is divisible by 5 ue (repetition of digits is allowed)
$^0C_1$
$^0C_8$
$9$
$7$

Step-by-Step Solution

Key Concept: Identify quadratic residues modulo 5, then count ordered pairs whose sum of squares equals $0$ modulo $5$.
We need ordered pairs $(a,b)$ from $\{0,1,2,3,4\}$ where $a^2 + b^2 \equiv 0 \pmod{5}$. First, find the quadratic residues modulo 5: $0^2 \equiv 0$, $1^2 \equiv 1$, $2^2 \equiv 4$, $3^2 \equiv 4$, $4^2 \equiv 1 \pmod{5}$. So squares modulo 5 are $\{0,1,4\}$. For $a^2 + b^2 \equiv 0 \pmod{5}$, we need: (i) both $0$: $(0,0)$ giving 1 pair; (ii) $1+4 \equiv 0$: $a \in \{1,4\}$ and $b \in \{2,3\}$ giving $2 \times 2 = 4$ pairs; (iii) $4+1 \equiv 0$: $a \in \{2,3\}$ and $b \in \{1,4\}$ giving $2 \times 2 = 4$ pairs. Total: $1 + 4 + 4 = 9$ ordered pairs. Note that $^0C_1 = ^0C_8 = 1$ and $9 = 9$ all represent valid answers in the given format.
Correct Answer: 1,2,3

Master Permutations & Combinations with Mathbee

Practice this topic under real exam conditions with strict timers, or ask our AI Mentor to explain the concepts step-by-step.

Start Practicing for Free