**Unformatted text preview: **for n>=2, i.e. use n0 = 2 as a base point. this way you can avoid certain logical mistake that I think some of you could easily made otherwise. ...] In all problems for inductive proofs it's a good idea that you clearly state two things at the beginning of your solution to the problem: First, what's the predicate P(n) that you'll be proving. Second, what's the base case, n0, that you need to show this for. And then clearly mark in your solution two parts of the inductive proof: The base part, where you show that P(n0) is true, and the inductive part, where you show that for all n>=n0 the *implication* (P(n)=>P(n+1)) is true. . ..ocuments/Dolores/UC%20Irvine-Harvest/ICS%206D/hmw4.htm [1/30/2008 12:06:35 PM]...

View
Full Document

- Fall '07
- Jarecki
- Mathematical Induction, Inductive Reasoning, Mathematical logic, Mathematical proof, certain logical mistake