Permutations & Combinations
Mathematical Induction
Grade 11
Question:
<p>When <i>P</i> is a natural number, then <span>\(\frac{P^{n+1}-(P-1)^{2n-1}}{P}\)</span> is divisible by</p>
<p>(a) <i>P</i></p>
<p>(b) <i>P</i><sup>2</sup> − <i>P</i></p>
<p>(c) <i>P</i><sup>2</sup> − <i>P</i> − 1</p>
<p>(d) <i>P</i><sup>2</sup> − 1</p>
Step-by-Step Solution
Key Concept: Use mathematical induction by proving the base case and then assuming it holds for n=m to prove it for n=m+1.
<p><strong>Step 1:</strong> For <i>n</i> = 1, we get $\frac{P^2-(P-1)^1}{P} = \frac{P^2-P+1}{P} = P - 1 + \frac{1}{P}$, which is divisible by <i>P</i><sup>2</sup> − <i>P</i> − 1, so result is true for <i>n</i> = 1.</p><p><strong>Step 2:</strong> Let us assume that the given result is true for <i>n</i> = <i>m</i> ∈ ℕ.</p><p>i.e., $P^{m+1}-(P-1)^{2m-1} = k(P^2-P-1)$, where <i>k</i> ∈ ℕ ... (i)</p><p><strong>Step 3:</strong> Now, $P^{m+2}-(P-1)^{2m+1} = P^{m+2}-(P-1)^2(P-1)^{2m-1}$</p><p>$= P^{m+2}-(P-1)^2[k(P^2-P-1)+P^{m+1}]$ [by using Eq. (i)]</p><p>$= P^{m+1}[P-(P-1)^2]-(P-1)^2k(P^2-P-1)$</p><p>$= P^{m+1}[P-P^2+2P-1]-(P-1)^2k(P^2-P-1)$</p><p>$= -P^{m+1}[P^2-P-1]-(P-1)^2k(P^2-P-1)$</p><p>$= (P^2-P-1)[k(P-1)^2+P^{m+1}]$</p><p>which is divisible by <i>P</i><sup>2</sup> − <i>P</i> − 1, so the result is true for <i>n</i> = <i>m</i> + 1.</p><p><strong>Therefore,</strong> the given result is true for all <i>n</i> ∈ ℕ by induction.</p><p>∴ Answer is (c).</p>
Correct Answer: c