Photo AI
Question 12
Use the principle of mathematical induction to show that for all integers $n \geq 1$, $$ 1 \times 2 + 2 \times 5 + 3 \times 8 + \cdots + n(3n-1) = n^2(n + 1). $$ ... show full transcript
Step 1
Answer
To prove by induction, we first check the base case where :
LHS: RHS: .
Both sides are equal, hence the base case holds.
Now, assume it holds for :
We must show it holds for :
LHS:
1 \times 2 + 2 \times 5 + \cdots + k(3k-1) + (k + 1)(3(k + 1)-1) =& k^2(k + 1) + (k + 1)(3k + 2)\\ =& (k + 1)(k + 3k + 2)\\ =& (k + 1)(k + 1)(k + 2). \end{align*}$$ Thus, $$LHS = (k + 1)^2((k + 1) + 1),$$ verifying our induction assumption.Step 2
Step 3
Step 4
Step 5
Answer
There are exactly ways to choose 3 topics from 8. If 400 students completed the course, by the pigeonhole principle, at least:
students must have chosen the same combination of 3 topics.
Step 6
Step 7
Answer
Rearranging and separating variables gives:
Integrating both sides:
Exponentiating yields:
Using the condition that it passes through (1, 0):
Thus the equation of the curve is:
Report Improved Results
Recommend to friends
Students Supported
Questions answered