Q34.
Question
Prove that for all positive integers n.
Step-by-Step Solution
Verified Answer
By mathematical induction, is true for all positive integers n.
1Step 1. Given Information.
Given, to prove that the statement is true for all positive integers n.
2Step 2. Calculation .
When n=1, the statement is written as:
Hence the statement is true for n = 1.
Let the statement be true for n = k. Hence,
Checking the statement when n = k + 1:
Plugging the value from the previous assumptions:
Hence, the statement is true for n = k +1.
Hence by mathematical induction, the given statement is true for all positive integers n.
3Step 3. Conclusion .
Hence, by mathematical induction, is true for all positive integers n.
Other exercises in this chapter
Q32.
Suppose a graph has 26 vertices and each pair of vertices is connected by exactly one edge. Find the number of edges in the graph. (Hint: If you use the Fundame
View solution Q33.
TRANSPORTATIONThe table shows the distances in miles of the roads between some towns. Draw a graph in which the vertices represent the towns and the edges are l
View solution Q35.
Find the indicated term of each expansion. Third term of x+y8
View solution Q36.
Find the indicated term of each expansion. Fifth term of 2a-b7
View solution