Use the Principle of Mathematical Induction to show that the statement is true for all natural numbers n.
is divisible by 2
What will be an ideal response?
First, we show that the statement is true when n = 1.
For 
This is a true statement and Condition I is satisfied.
Next, we assume the statement holds for some k. That is,
is divisible by 2 is true for some positive integer k.
We need to show that the statement holds for 
. That is, we need to show that
is divisible by 2.
So we assume 
is divisible by 2 and look at the expression for n = k + 1.
Since 
is divisible by 2, then 
for some integer m. Hence,
Condition II is satisfied. As a result, the statement is true for all natural numbers n.
You might also like to view...
Use simple probability to complete the exercises.Use the spinner below to answer the question. Assume that it is equally probable that the pointer will land on any one of the five numbered spaces. If the pointer lands on a borderline, spin again. Find the probability that the arrow will land on 1 or 5. 
A. 1
B. 3
C. 
D. 
Determine whether the fractions are equal.
and 
A. Yes B. No
Solve.
(4x - 
) - 
= 
A. {
}
B. {
}
C. {
}
D. {
}
Answer the question.Choose the expression that is equivalent to the following: (4x + 7y)(8y + 5x)
A. 9x + 15y B. (4x + 7y)(5y + 8x) C. (4x + 5x)(7y + 8y) D. (4x + 7y)(5x + 8y)