If c>1 then c>0 therefore multiply by c and get c^2>c>1.
Now you can do it by induction.
If c^k>c^(k-1) then c^(k+1)>c^k; we multiply by c.
How would you go about proving this:
Let c be greater than 1. Show that c^n is greater than or equal to c for all n greater than or equal to 1 and c^n is greater than c for all n greater than 1. Further than c^m is greater than c^n for all m greater than n.
Oh come Quark!
In the first post it was stated “for all n greater than or equal to 1”.
In fact, I only addressed the first of his/her questions.
However, I think it is logical to assume that in the second question that both n & m are positive integers. But again I did not give an answer to the second question.
a^n=exp( n ln a) for a>0.
exp (x) is an increasing function (look at is derivative sign) it follows that if,
n ln a > m ln a , since a>1 thus, ln a>0
exp(n ln a)> exp( m ln a) using the increasing function theorem
Just making sure all bases are covered. (Uh, no pun intended there!)