SOLUTION: Identify the correct base case for a proof by induction for the following statement. 1+3+5+...+(2n-1)=n(n+1)/2

SOLUTION: Identify the correct base case for a proof by induction for the following statement. 1+3+5+...+(2n-1)=n(n+1)/2

Algebra.Com

Question 1035673: Identify the correct base case for a proof by induction for the following statement.
1+3+5+...+(2n-1)=n(n+1)/2
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
A good choice of base case is n = 1.
RELATED QUESTIONS
Identify the correct proof by induction or a counterexample to disprove the following... (answered by Fombitz)

Identify the correct proof by induction or a counterexample to disprove the following... (answered by ikleyn,Edwin McCravy)

For a proof by induction of the math statement below, identify the correct step for... (answered by stanbon)

For a proof by induction of the math statement below, identify the correct step for... (answered by JoelSchwartz)

use the principals of mathematical induction to prove the following statement... (answered by greenestamps)

Please help me with this mathematical induction question: Suppose we want to use... (answered by ikleyn)

Prove by mathematical induction that the statement below holds true for every integer... (answered by ikleyn)

Use mathematical induction to prove the following: For each natural number... (answered by Edwin McCravy,amalm06)

Prove by induction that for all n >= 1 1^ 5 +2^ 5 +3^ 5 +^ ...+ n ^ 5 = [n ^ 2 * (n +... (answered by ikleyn)