solve by induction

desperaetoday

New member
Joined
Nov 16, 2019
Messages
8
Hello ,
Somebody knows how to solve it by induction?!
Thanks For you all smart guys (and ladies) !
problem.jpeg
 
Yes, I can solve this by induction.
I now have a question for you. Can you solve this by induction? What have you tried? Where are you stuck? To receive help we need to know where you are having trouble so you can get the help you need.

Do you know the steps to do an induction proof?
Step one is to show that the lhs of the equal sign equals the rhs of the equal sign for k=1. Can you do that?
Post back with your work.
 
You right. Sorry.
The problem start on Induction step..
I dont have a clue what to do next.
 

Attachments

  • not solved.jpeg
    not solved.jpeg
    134.8 KB · Views: 11
You right. Sorry.
The problem start on Induction step..
I dont have a clue what to do next.
Your 2nd step is wrong. Since you assume that it is true for all n, then you are done. Rather you should assume it is true for (just one)k =n.
So write up the equation with n for k and state that you are assuming this.

Then show (using legal mathematics and possibly you assumption) that the statement is true for k=n+1

Here is why this works. You showed that the statement is true for k=1 (so it is true for k=1).
Then you assume that it is true for k=n (this assumption is true for k=1)

Now you showed that IF it is true for k=n, then it is true for k=n+1.

You KNOW it is true for k=1 and you showed that IF it is true for some integer it is true for the next integer. So it is true for k=2.
But if it is true for k=2, then it is true for the next integer, namely k=3.

In the end the statement is true for all k>1
 
Can you at least show what you need to prove in the last step? Just replace k with n+1. Then see what you can do and post back. Even if you can just show us your work where you replaced k with n+1 that would be great.
 
You did not state your assumption.

Step 1: Show true for k=1. You did this.
Step2: Write "assume that for k=n" then write the formula but instead of k put n.
Step3: Write "must show that for k=n+1 that" then write the formula with n+1 for k.


Now with step 2 in front of you try to prove step 3.
If you write everything up as I suggested and are still stuck then you will be given a hint to prove step 3
 
I do not like the standard way that induction is presented.

First, before starting any proof, I like to work out why the proposition is true for a few numbers.

[MATH]\dfrac{x^{2^1} - 1}{x + 1} = \dfrac{x^2 - 1}{x + 1} = \dfrac{(x + 1)(x - 1)}{x + 1} = x - 1.[/MATH]
[MATH]\dfrac{x^{2^2} - 1}{x + 1} = \dfrac{x^4 - 1}{x + 1} = \dfrac{(x^2 + 1)(x^2 - 1)}{x + 1} =[/MATH]
[MATH](x^2 + 1) * \dfrac{x^2 - 1}{x} = (x^2 + 1) * (x - 1) = x^2(x - 1) + x - 1 = x^3 - x^2 + x - 1.[/MATH]
[MATH]\dfrac{x^{2^3} - 1}{x + 1} = \dfrac{x^8 - 1}{x + 1} = \dfrac{(x^4 + 1)(x^4 - 1)}{x + 1} =[/MATH]
[MATH](x^4 + 1) * \dfrac{x^4 - 1}{x + 1} = (x^4 + 1)(x^3 - x^2 + x - 1) =[/MATH]
[MATH]x^4(x^3 - x^2 + x - 1) + (x^3 - x^2 + x - 1) =x^7 - x^6 + x^5 - x^4 + x^3 - x^2 + x - 1.[/MATH]
[MATH](x^4 + 1)(x^2 + 1)(x - 1) = (x^6 + x^4 + x^2 + 1)(x - 1) =[/MATH]
[MATH]x^7 - x^6 + x^5 - x^4 + x^3 - x^2 + x - 1.[/MATH]
Now at least I understand what I am proving, and why it very well might be true for all positive k. All I have to do is find a proof, but the examples give me a huge clue.

[MATH]k = 1 \implies \dfrac{x^{2^k} - 1}{x + 1} = \dfrac{x^2 - 1}{x + 1} = x + 1 =[/MATH]
[MATH]\sum_{0}^1 (-\ 1)^j x^{(1-j)} = \sum_{0}^{2 - 1} (-\ 1)^j x^{(2 - 1- j)} = \sum_{0}^{2^k - 1} (-\ 1)^j x^{(2^k - 1 - j)}.[/MATH]
Given that we now know that the proposition is true if k = 1, it is not an assumption that there exists a non-empty set of positive integers that make the proposition true. Select an arbitrary element of the set and call it n. Because it is in that set, we know

[MATH]n \in \mathbb Z,\ n \ge 1, \text { and } \dfrac{x^{2^n} - 1}{x + 1} = \sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n - 1 - j)}.[/MATH]
We can use any of the three preceding known facts about n.

Now we look for a way to reduce [MATH]\dfrac{x^{2^{(n+1)}} - 1}{x + 1}[/MATH]
to a useful expression that involves [MATH]\dfrac{x^{2^n} - 1}{x + 1}.[/MATH]
There is no standard recipe on how to do this. But your numerical experiments may help you find the specific recipe your need.

[MATH]x^a = x^{\{(a/2) + (a/2)\}} = x^{a/2} * x^{a/2} = x^{\{(a/2)^2\}}. [/MATH]
[MATH]a = 2^{(n+1)} \implies a/2 = 2^{(n+1)} * 2{-1} = 2^n \implies x^a = x^{(a/2)^2} = x^{(2^n)^2}.[/MATH]
[MATH]\therefore \dfrac{x^{2^{(n+1)}} - 1}{x + 1} = \dfrac{(x^{2^n} + 1)(x^{2^n} - 1}{x + 1} =[/MATH]
[MATH](x^{2^n} + 1) * \dfrac{x^{2^n} - 1}{x + 1}.[/MATH]
But wait, we know what that fraction equals. All we have to do is to keep track of exponents and play games with indices.

[MATH]\therefore \dfrac{x^{2^{(n+1)}} - 1}{x + 1} = (x^{2^n} + 1) * \sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n - 1 - j)} =[/MATH]
[MATH]\left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n - 1 - j)} \right ) + \left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n - 1 - j)} \right ) =[/MATH]
[MATH]\left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n + 2^n - 1 - j)} \right ) + \left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n - 1 - j)} \right ) =[/MATH]
[MATH]\left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2 * 2^n - 1 - j)} \right ) + \left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n - 1 - j)} \right ) =[/MATH]
[MATH]\left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)} \right ) + \left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n - 1 - j)} \right ) =[/MATH]
[MATH]\left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)} \right ) + \left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n + 2^n - 1 - j - 2^n)} \right ) =[/MATH]
[MATH]\left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)} \right ) + \left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2 * 2^n - 1 - \{j + 2^n\}} \right ) =[/MATH]
[MATH]\left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)} \right ) + \left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - \{j + 2^n\}} \right ) =[/MATH]
[MATH]\left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)} \right ) + \left (\sum_{j=2n}^{2^n + 2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j} \right ) =[/MATH]
[MATH]\left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)} \right ) + \left (\sum_{j=2n}^{2 * 2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j} \right ) =[/MATH]
[MATH]\left (\sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)} \right ) + \left (\sum_{j=2n}^{2^{(n+1)} - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j} \right ) =[/MATH]
[MATH]\sum_{j=0}^{2^{(n+1)} - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)}.[/MATH]
It's long and easy to make an error, but conceptually, the examples will see you home.
 
Wow! I liked it very much! Thank you for giving the"big picture" for me to understand it realy help.
I just dont get how you make this step? (on picture)
and how did you play with the indices like this?
basicly. All was great for me until the last part ?
 

Attachments

  • WhatsApp Image 2019-11-19 at 14.54.42.jpeg
    WhatsApp Image 2019-11-19 at 14.54.42.jpeg
    355.7 KB · Views: 3
You asked two questions in your following up.

In algebra, our expressions always stand for numbers. When we sum numbers, we get a number. I could have, and perhaps should have, used a u-substitution. Let's do the proof that way, starting here:

[MATH]\therefore \dfrac{x^{2^{(n+1)}} - 1}{x + 1} = (x^{2^n} + 1) * \sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n - 1 - j)}.[/MATH]
[MATH]\text {Set } u = \sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n - 1 - j)}.[/MATH]
We have replaced the summation notation with a single variable, but notice that, for what we want to prove, the summands in u have the wrong form (we want 2^(n + 1) rather than 2^n) and the wrong range of summation (we want 0 to 2^(n + 1) - 1 rather than 0 to 2^n - 1). So we still have work to do. But let's proceed with the substitution as a starting point.

[MATH]\therefore \dfrac{x^{2^{(n+1)}} - 1}{x + 1} = (x^{2^n} + 1) * u = (x^{2^n} * u) + u[/MATH].

Nothing complex at all if you remember that that seemingly complex summation is just a number and that you learned the distribution law the first week in algebra. And to figure out what that first product equals, we use the distribution law again. We can work with an arbitrary summand.

[MATH]x^{2^n} * (-\ 1)^j x^{(2^n - 1 - j)} = (-\ 1)^j x^{(2^n + 2^n - 1 - j)} =[/MATH]
[MATH](-\ 1)^j x^{(2 * 2^n - 1 - j)} = (-\ 1)^j x^{(2^{n+1)} - 1 - j)}.[/MATH]
So now we use a second substitution:

[MATH]\text {Set } v = x^2 * u = \sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)} \implies \dfrac{x^{2^{(n+1)}} - 1}{x + 1} = v + u.[/MATH]
So I hope that addresses your first question. We can see the logic better if we use u and v instead of those two complex summations, but of course u and v can be replaced by the summations at any time. Any concerns remaining?

Notice that, in terms of where we want to get, v expanded has exactly the right expression as a summand, but still has the wrong range of summation, and u is wrong in both respects. Where we are now is:

[MATH]\dfrac{x^{2^{(n+1)} - 1}{x + 1} = x^2u + u = v + u = v + \sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^n - 1 - j)}.[/MATH]
Let's start getting the summands in u into the form that we need: we want 2^(n + 1) rather than 2^n. So we pick an arbitrary summand.

[MATH](-\ 1)^j x^{(2^n - 1 - j)} =(-\ 1)^j x^{(2^n + 2^n - 1 - j - 2^n)} = (-\ 1)^j x^{(2 * 2^n - 1 - \{j + 2^n\})} =[/MATH]
[MATH](-\ 1)^j x^{(2^{(n+1)} - 1 - \{j + 2^n\})}.[/MATH]
Great, we have the exponent we want and we can say

[MATH]u = \sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - \{j + 2^n\})}.[/MATH]
The summand is closer to what we want, but we want to subtract j rather than (j + 2^n). But, if each summand contains only a linear function of j, we can always adjust that function by making a compensating adjustment to j's limits of summation. Unfortunately, this summand contains both a linear function of j and (-1)^j, which is definitely not linear. Is there anyway to adjust j so that (-1)^j is not affected? Yes, easily.

[MATH]j \text { and } j' \text { both even} \implies (-\ 1)^j = 1 = (-\ 1)j'.[/MATH]
[MATH]j \text { and } j' \text { both odd} \implies (-\ 1)^j = -\ 1 = (-\ 1)j'.[/MATH]
So any transformation that preserves parity is fine. Now let's look at dealing with the linear function in j: we want

[MATH]j + 2^n = j'[/MATH], which preserves parity and substitutes a term with j' for one with j + 2^n. Furthermore,

[MATH]j + 2^n = j' \implies j' = 2^n \text { if } j = 0,\ j'= 2^n + 1 \text { if } j = 1,\ ...\ \text { and }[/MATH]
[MATH]j' = 2^n + 2^n - 1 = 2 * 2^n - 1 = 2^{(n+1)} - 1 \text { if } j = 2^n - 1.[/MATH]
That looks very encouraging because it gets us to the 2^(n+1) - 1 upper bound on summation that we want. In short

[MATH]u = \sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - \{j + 2^n\})} = \sum_{j'=2^n}^{2^{(n+1)} - 1} (-\ 1)^{j'} x^{(2^{(n+1)} - 1 - j')}.[/MATH]
So we can drop the prime from the j prime.

[MATH]u = \sum_{j=2^n}^{2^{(n+1)} - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)}.[/MATH]
Now it is just tidying up and eliminating the substitutions

[MATH]\dfrac{x^{2^{(n+1)}} - 1}{x + 1} = v + u \implies[/MATH]
[MATH]\dfrac{x^{2^{(n+1)}} - 1}{x + 1} = \sum_{j=0}^{2^n - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)} + \sum_{j=2^n}^{2^{(n+1)} - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)} \implies[/MATH]
[MATH]\dfrac{x^{2^{(n+1)}} - 1}{x + 1} = \sum_{j=0}^{2^{(n+1)} - 1} (-\ 1)^j x^{(2^{(n+1)} - 1 - j)}.[/MATH]
Lots to learn from this problem though I'd not call it easy.

(1) If you do not see an inductive proof right away, run some low numbers and see if that gives you clues as to why the proposition is true.

(2) Utilize substitution of variables to avoid long cumbersome expressions and the errors that come with them.

(3) Learn how to manipulate indices.

PS I apologize for any typos. I have tried to find them, but my eyes and brain are getting tired.
 
Nothing to soory about haha
Wish my teacher write clearly like that. I go it.
The TIPS are great. Thank you again
 
Top