1

How to prove the following prop.

Let $x \in \mathbb{R}$, such that $0 \le x \le 1$, and $m,n \in\mathbb{ N}$, with $m \ge n$. Then $x^m \le x^n$.

I don't exactly know where to begin with this proof, any guidance is appreciated.

DeepSea
  • 77,651

3 Answers3

2

Let $d=m-n$. If $d=0$, there is nothing to prove. If $d>0$, we have $$ x^m-x^n=x^n(x^d-1)=\underbrace{x^n}_{\ge 0}\underbrace{(x-1)}_{\le 0}\underbrace{(x^{d-1}+\cdots+x+1)}_{\ge 1}\leq 0. $$

Kim Jong Un
  • 14,794
  • 1
  • 24
  • 49
1

$0 \leq x^m = x^n\cdot x^{m-n} \leq x^n\cdot 1 = x^n$

DeepSea
  • 77,651
0

HINT: If $0\leq x\leq 1$ then $xB\leq B$ for any positive $B$.

Przemysław Scherwentke
  • 13,668
  • 5
  • 35
  • 56