Worked Examples · Example 4
Q.For every positive integer , prove that is divisible by 4.
Kerala DhseTextbookSubjectiveImportance★★★★★est
13% · 4/32 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 →Let be the statement: is divisible by .
Base case: For ,
which is divisible by . So is true.
Inductive step: Assume is true for some , i.e. there exists an integer such that
We must show is divisible by .
Write , so
Substituting the induction hypothesis : …
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.