Proving x^n<y^n with Michael Spivak's Calculus

  • Thread starter Thread starter Einherjer
  • Start date Start date
  • Tags Tags
    Calculus
Einherjer
Messages
4
Reaction score
0
Just started on Michael Spivaks Calculus, going fine so far, but generalizing to n always messes me up.

Homework Statement


prove that If 0≤x<y, then x^n<y^n, n=1,2,3,...

The Attempt at a Solution


I have managed to to prove that x^2<y^2. But I'm i don't quite get how to generalize to n.

First time posting a question here, so tell me if I've done something wrong.
 
Physics news on Phys.org
Are you using a proof by induction? Then x^{n+1}= x(x^n)&lt; x(y^n)&lt; y(y^n)= y^{n+1}

But I would think that x^n- y^n= (x- y)(x^{n-1}+ x^{n-2}y+ x^{n-3}y^2+\cdot\cdot\cdot+ x^2y^{n-3}+ xy^{n-2}+ y^{n-1}) would prove it directly.
 
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