Chapter 5.4 - Strong Mathematical Induction and the Well-
Ordering Princip for the Integers
1. What is strong mathematical induction ANS a technique to establish the
truth of a sequence of statements about integers
2. How does strong mathematical induction differ from ordinary mathematical
induction ANS the basis step may contain proofs for several initial values, and in
the inductive step the truth of the predicate P(n) is assumed not just for one value
of n but for all values through k, and then the truth of P(k+1) is proved.
3. A strong mathematical induction proof begins: Let P(n) be a property that
is defined for integers n, and let a and b be fixed integers with a db. Suppose
the following two statements are true.
What do you show in the basis step to prove that a property involving an inte-
ger n is true for all integers greater than or equal to some initial integer ANS
P(a), P(a+1), ... and P(b) are all true
4. A strong mathematical induction proof begins: Let P(n) be a property that
is defined for integers n, and let a and b be fixed integers with a db. Suppose
the following two statements are true.
What is the inductive step ANS For any integer k d b, if P(i) is true for all integers i
from a through k, then P(k+1) is true
1/1
Ordering Princip for the Integers
1. What is strong mathematical induction ANS a technique to establish the
truth of a sequence of statements about integers
2. How does strong mathematical induction differ from ordinary mathematical
induction ANS the basis step may contain proofs for several initial values, and in
the inductive step the truth of the predicate P(n) is assumed not just for one value
of n but for all values through k, and then the truth of P(k+1) is proved.
3. A strong mathematical induction proof begins: Let P(n) be a property that
is defined for integers n, and let a and b be fixed integers with a db. Suppose
the following two statements are true.
What do you show in the basis step to prove that a property involving an inte-
ger n is true for all integers greater than or equal to some initial integer ANS
P(a), P(a+1), ... and P(b) are all true
4. A strong mathematical induction proof begins: Let P(n) be a property that
is defined for integers n, and let a and b be fixed integers with a db. Suppose
the following two statements are true.
What is the inductive step ANS For any integer k d b, if P(i) is true for all integers i
from a through k, then P(k+1) is true
1/1