If n is any natural number, prove that 
is divisible by 8.
?
List the steps involved.
What will be an ideal response?
. However, 
equals 
, which is divisible by 8.Step 2: Assuming that the statement is true for 
, we must prove that it is true for 
. Let's suggest that the statement is true for 
and examine it for 
.
.
is obtained by substituting k+1 for n in 
.
.
So if 
is divisible by 8, 
is also divisible by 8 because 8 is divisible by 8.
You might also like to view...
Solve the problem.A graph with 9 vertices has an Euler path but no Euler circuit. The graph must have
A. 9 vertices of even degree. B. 2 vertices of even degree and 7 vertices of odd degree. C. 9 vertices of odd degree. D. 2 vertices of odd degree and 7 vertices of even degree. E. none of these
Graph the parabola.8y = x2
A. 
B. 
C. 
D. 
Calculate the perimeter for the given figure. Use 3.14 for ?. Round to hundredths if necessary.Right triangle
?3.5 cm
A. 9.09 cm B. 2.975 cm C. 2.60 cm D. 3.89 cm
Use U = universal set = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, A = {1, 2, 3, 5, 8}, B = {2, 3, 5, 7}, and C = {1, 4, 9} to find the set.
A. {0, 1, 4, 6, 8, 9} B. {0, 1, 4, 6, 7, 8, 9} C. {0, 1, 4, 6, 9} D. {1, 4, 6, 8, 9}