Ask your own question, for FREE!
Mathematics 72 Online
OpenStudy (anonymous):

Prove the following proposition using the principle of mathematical induction

OpenStudy (anonymous):

zepdrix (zepdrix):

\[\large\rm \sum_{i=1}^n (2i-1)=n^2,\qquad\forall n\in\mathbb Z^+\] Ok so we start with our base case: \(\large\rm n=1\)

zepdrix (zepdrix):

\[\large\rm (2\cdot 1-1)=2-1=1\]Which is equal to \(\large\rm 1^2\), so our base case is satisfied, ya?

OpenStudy (anonymous):

yes

zepdrix (zepdrix):

We'll assume it's true for \(\large\rm n=k\). Which means we assume \(\large\rm \color{orangered}{1+3+...+(2k-1)=k^2}\) is true.

zepdrix (zepdrix):

We call this the Induction Hypothesis ^

OpenStudy (anonymous):

yeah

OpenStudy (anonymous):

okay

zepdrix (zepdrix):

Then for our Induction Step: \(\large\rm n=k+1\) Let's see if we can get our formula set up correctly :d

OpenStudy (anonymous):

to equal n^2?

zepdrix (zepdrix):

Well, notice that our last number in the sum will be \(\large\rm k+1\) So we won't end up with \(\large\rm n^2\), we'll end up with \(\large\rm (k+1)^2\) on the right. But setting up the left side is going to be a little tricky. Hopefully you can follow what I'm doing here.

OpenStudy (anonymous):

is it not k+2?

zepdrix (zepdrix):

Your summation is giving you a bunch of terms like this:\[\large\rm (2\cdot\color{royalblue}{1}-1)+(2\cdot\color{royalblue}{2}-1)+...+(2\color{royalblue}{k}-1)+(2\color{royalblue}{(k+1)}-1)=(k+1)^2\]

zepdrix (zepdrix):

I'll simplify the first few terms like I did the last time.\[\large\rm 1+3+...+(2k-1)+(2(k+1)-1)=(k+1)^2\]

zepdrix (zepdrix):

k+2? what? :o

OpenStudy (anonymous):

i dont get the part (2(k+1)−1)

OpenStudy (anonymous):

i dont get where k+1 came from

OpenStudy (anonymous):

wait i get it

OpenStudy (anonymous):

i get it

zepdrix (zepdrix):

XD

zepdrix (zepdrix):

So in the Induction Hypothesis, we let \(\large\rm k\) be the largest number in the sequence. We replaced n by k. In our Induction Step, we're letting \(\large\rm k+1\) be the largest number in the sequence. It's the number that comes after k. So our summation grows a little bit, by one more term. And it should be equivalent to (k+1)^2 now, instead of k^2.

OpenStudy (anonymous):

yup

zepdrix (zepdrix):

If you scroll up, you'll notice I colored our Induction Hypothesis in orange. We need to relate this back to that orange thing.

OpenStudy (anonymous):

1+3+...+(2k−1)=k^2

OpenStudy (anonymous):

this?

zepdrix (zepdrix):

Yes, that entire left side is contained within our Induction Step formula.

zepdrix (zepdrix):

\[\large\rm \color{orangered}{1+3+...+(2k-1)}+(2(k+1)-1)=(k+1)^2\]Do you see it? :)

OpenStudy (anonymous):

yeah

zepdrix (zepdrix):

Since our Induction Hypothesis tells us that the orange stuff is k^2, we can make the switch,\[\large\rm \color{orangered}{k^2}+(2(k+1)-1)=(k+1)^2\]

OpenStudy (anonymous):

ohhhhh oh kay

zepdrix (zepdrix):

From there, you need to turn the left side into (k+1)^2 somehow. Do some Algebra steps expand out the stuff, then try to factor it down.

OpenStudy (anonymous):

thank yyou!

zepdrix (zepdrix):

np \c:/

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!