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.
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.
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. $$
HINT: If $0\leq x\leq 1$ then $xB\leq B$ for any positive $B$.