Related Formula
Modular arithmetic reductions for power cycles:
a ≡ b m ⇒ a^k ≡ b^k m$$a \equiv b \pmod{m} \Rightarrow a^k \equiv b^k \pmod{m}$$
Core Logic
Analyze condition p$p$: (6^m + 9ⁿ)$(6^m + 9^n)$ is divisible by 5.
6 ≡ 1 5 ⇒ 6^m ≡ 1^m ≡ 1 5$6 \equiv 1 \pmod 5 \Rightarrow 6^m \equiv 1^m \equiv 1 \pmod 5$.
9 ≡ -1 5 ⇒ 9ⁿ ≡ (-1)ⁿ 5$9 \equiv -1 \pmod 5 \Rightarrow 9^n \equiv (-1)^n \pmod 5$.
For the sum to be divisible by 5:
1 + (-1)ⁿ ≡ 0 5 ⇒ (-1)ⁿ = -1$1 + (-1)^n \equiv 0 \pmod 5 \Rightarrow (-1)^n = -1$.
This implies n$n$ must be an ODD integer.
Since m in 1, 2, , 50$m \in \{1, 2, \dots, 50\}$, m$m$ can be anything (50 choices).
Since n$n$ must be odd in 1, , 50$\{1, \dots, 50\}$, n$n$ has 25 choices.
p = 50 × 25 = 1250$p = 50 \times 25 = 1250$.
Step 1: Compute q
Analyze condition q$q$: (m + n)$(m + n)$ is the square of a prime number.
Max value of m+n = 50+50 = 100$m+n = 50+50 = 100$.
Primes whose squares are ≤ 100$\leq 100$: 2, 3, 5, 7$2, 3, 5, 7$.
Their squares are 4, 9, 25, 49$4, 9, 25, 49$.
So m+n$m+n$ can be 4, 9, 25, 49$4, 9, 25, 49$.
Match List-I with List-II:
| m+n=4$m+n=4$ | m+n=9$m+n=9$ | m+n=25$m+n=25$ | m+n=49$m+n=49$ |
|---|
| No. of ways | 3 | 8 | 24 | 48 |
Explanation for counts:
If m+n = S$m+n = S$, and m, n ≥ 1$m, n \geq 1$, the number of ways is S-1$S-1$ (since S ≤ 50$S \leq 50$).
For S=4$S=4$: 3 ways.
For S=9$S=9$: 8 ways.
For S=25$S=25$: 24 ways.
For S=49$S=49$: 48 ways.
q = 3 + 8 + 24 + 48 = 83$q = 3 + 8 + 24 + 48 = 83$.
Step 2: Final Sum
p + q = 1250 + 83 = 1333$$p + q = 1250 + 83 = 1333$$
Pattern Recognition
Modular exponentiation immediately shrinks large powers to ± 1$\pm 1$. The sum m+n=S$m+n=S$ where 1 ≤ m,n ≤ N$1 \le m,n \le N$ has exactly S-1$S-1$ solutions if S ≤ N$S \le N$, allowing instant combinatorics tallying without manual counting.
Chapter Mix
Class 11 Maths: Permutations and Combinations