And so on. The assumption in ii that S is true for some integer n n 1 is called the hypothesis of induction . Note that it doesn't assume that S is true for all integers n n 1 . Assume that S is true for some n n 1 . To Top Of Page 2.
Factorials Let n be a positive integer.
To Top Of Page 4. Then use mathematical induction to prove your guess. Then use mathematical induction to prove your guess. It follows that, by induction, it's valid for all n 1. Consequently, by induction, it's correct for all n 2.