Chapter 5: Q31E (page 330)
Prove that 2 divides whenever n is a positive integer.
Short Answer
2 divides whenever n is a positive integer
Chapter 5: Q31E (page 330)
Prove that 2 divides whenever n is a positive integer.
2 divides whenever n is a positive integer
All the tools & learning materials you need for study success - in one app.
Get started for freeLet P(n)be the statement that for the positive integer .
a) What is the statement P(1)?
b) Show that P(1) is true, completing the basis step of
the proof.
c) What is the inductive hypothesis?
d) What do you need to prove in the inductive step?
e) Complete the inductive step, identifying where you
use the inductive hypothesis.
f) Explain why these steps show that this formula is true wheneveris a positive integer.
Use strong induction to show that when a simple polygon P with consecutive vertices is triangulated into n-2 triangles, the n-2 triangles can be numbered so that is a vertex of triangle i for .
(a) Find the formula for by examining the values of this expression for small values of n.
(b) Prove the formula you conjectured in part (a).
There are infinitely many stations on a train route. Sup-
pose that the train stops at the first station and suppose that if the train stops at a station, then it stops at the next station. Show that the train stops at all stations.
Prove that whenever n is a positive integer.
What do you think about this solution?
We value your feedback to improve our textbook solutions.