How Can I Correctly Apply Induction to Solve My Discrete Math Homework?

phenom01
Messages
12
Reaction score
0

Homework Statement



20za978.png


Homework Equations



I need to prove this by using induction. I need help with the induction step.

The Attempt at a Solution

.

Basis step: let n=0; 2^0 = 2^(0+1) - 1 -----> 1=1
 
Physics news on Phys.org
So, what did you try for the induction step?
 
micromass said:
So, what did you try for the induction step?

i tried sum(2^k+1) = 2^n+1 + sum(2^k)

sum(2^k) = (2^n+1) -1 by our inductive hypothesis

(2^n+1)-1 + 2^n+1

2^n+1 + 2^n+1 = 2^n+2 which gives (2^n+2)-1

I think this is wrong
 
phenom01 said:
i tried sum(2^k+1) = 2^n+1 + sum(2^k)

sum(2^k) = (2^n+1) -1 by our inductive hypothesis

You can't use what you're trying to prove inside your proof.

Try starting out let this: suppose God has told you that the hypothesis holds for n-1. Based off this assumption, can you prove that it also holds for n?

That's your induction step.
 
It's not exactly wrong in fact you seem to have got more or less the right result, but you have set out a series of formulas and math is not a series of formulas, even when they're the right formulas, it's an argument.

Once you start the formulas you haven't mentioned sum and k any more.

Look up in your textbook how an induction argument is set out and do it the same way rather rigidly and it should work (the algebraic formula calculation part of it is quite simple).
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top