Exercises · Q19
Q.Using the principle of mathematical induction, prove that is divisible by for every natural number .
Puducherry TnboardTextbookSubjectiveImportance★★★★★
17% · 8/48 Questions
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →Basis step (): , which is divisible by . So is true.
Inductive step: assume is true, i.e. for some integer .
Consider . Rewrite it so that appears explicitly, by adding and subtracting :
Since is an integer, is a multiple of , so is true whenever is.
By induction, is divisible by for every natural number . …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.