Use the Principle of Mathematical Induction to show that the given statement is true for all natural numbers n.
$9n^2 - 9n + 6$ is divisible by 2.
What is the first step in an induction proof?
A. Show that the statement is true for n = k + 1.
B. Show that the statement is true for n = 0.
C. Show that the statement is true for n = 1.
D. Show that the statement is true for n = k.
Complete the steps to show that the given statement is true for the appropriate value of n.
$9n^2 - 9n + 6$ is divisible by 2
$9\boxed{ }^2 - 9\boxed{ } + 6$ is divisible by 2
$\boxed{ }$ is divisible by 2
(Simplify your answer.)
What is the next step in an induction proof?
A. Assume that the given statement holds for k = 1, and determine whether it holds for k = 2.
B. Determine whether the given statement holds for any number k + 1.
C. Determine whether the given statement holds for some k.
D. Assume that the given statement holds for some k, and determine whether it then holds for k + 1.
Write the given statement for k + 1.