# Pre-Calculus

What makes a mathematical induction true? I know how to solve both steps in the proof, but how do you reach this conclusion?

1. 👍 0
2. 👎 0
3. 👁 115
1. You show that it is true for n=1.

Then you show that if it is true for n=k, then it must also be true for n=k+1.

That means that the assertion is true for all values of n, starting with n=1, and thus for n=2,3,4,...

For instance, a common proof is that the sum of the first n odd numbers is n^2.

1 = 1= 1^2
1+3 = 4 = 2^2
1+3+5 = 9 = 3^2
But we want to show that it is true no matter how many odd numbers we add up.

So, assume it is true for the first k odd numbers:

1+3+5+...+(2k-1) = k^2

Now, assuming that's true, what if we add the next odd number to both sides?

1+3+5+...+(2k-1)+(2k+1) = k^2+2k+1
But notice that the right side is just (k+1)^2

So, what we have shown is that if the sum of the first k odd numbers is k^2, then the sum of the first (k+1) odd numbers is (k+1)^2.

Since it was shown to be true for k=1, it must be true for all values of k.

1. 👍 0
2. 👎 0
posted by Steve

## Similar Questions

1. ### precalculus

Find Pk + 1 if Pk = 7 + 13 + 19 + ...+[6(k - 1)+1] + (6k + 1) 7 + 13 + 19 + …+[6(k - 1) + 1] + (6k + 1) + [6(k + 1) + 1] 8 + 14 + 20 + …+[7(k - 1) + 1] + (7k + 1) 7 + 13 + 19 + …+(6k + 1) 7 + 13 + 19 + ...+[6(k - 1) + 1] +

asked by sally on December 14, 2016
2. ### Algebra ASAP

so this is a fill in on a worksheet and I am having difficulty as the ones I inserted are incorrect can anybody help me how to do it all, sorry it's a long problem. Show that 3^2n − 1 is divisible by 8 for all natural numbers n.

asked by Briane Mendez on August 12, 2015
3. ### precalculus

can you check my answers? Find Pk + 1 if Pk = 7 + 13 + 19 + ...+[6(k - 1)+1] + (6k + 1) 7 + 13 + 19 + …+[6(k - 1) + 1] + (6k + 1) + [6(k + 1) + 1] 8 + 14 + 20 + …+[7(k - 1) + 1] + (7k + 1) 7 + 13 + 19 + …+(6k + 1) 7 + 13 +

asked by Anonymous on December 14, 2016
4. ### can you check my answers precalculus

can you check my answers? Find Pk + 1 if Pk = 7 + 13 + 19 + ...+[6(k - 1)+1] + (6k + 1) 7 + 13 + 19 + …+[6(k - 1) + 1] + (6k + 1) + [6(k + 1) + 1] 8 + 14 + 20 + …+[7(k - 1) + 1] + (7k + 1) 7 + 13 + 19 + …+(6k + 1) 7 + 13 +

asked by Anonymous on December 14, 2016
5. ### precalculus

Can you please check my answers? 1.Find Pk + 1 if Pk=2^K-1/k! answer: 2^k+1/(k+1)! 2.Find Pk + 1 if Pk = 7 + 13 + 19 + ...+[6(k - 1)+1] + (6k + 1) answer: 7+13+9...(6k-1+1)+6k+1 +(6k+2) 3.What is the first step when writing a

asked by Anonymous on December 14, 2016
1. ### precalculus

How would you describe a proof by mathematical induction?

asked by sally on December 16, 2016
2. ### Algebra II

In an induction proof of the statement 4+7+10+...+(3n-1)=n(3n+5)/2 the first step is to show that the statement is true for some integers n. Note:3(1)+1=1[3(1)+5]/2 is true. Select the steps required to complete the proof. A)Show

asked by Jon on December 15, 2007
3. ### computer sciece(Computation Theory)

Find the error in the following proof that all horses are the same color. CLAIM: In any set of h horses, all horses are the same color. PROOF: By induction on h. Basis: For h = 1. In any set containing just one horse, all horses

asked by Alex on September 26, 2011
4. ### science,technology and the environment

describe,compare and contrast induction and deduction as methods of science.using examples where appropriate.Identify and solve a problem using both induction and deduction.where appropriate illustrate why and how one would use