Hello, first time poster here. I've recently entered a Discrete course at my university and the professor does not exactly line up with my style of learning. I like to believe that I learn by example, and he's more of a "here's the rules, and now I let you go".
So I was wondering if you could assist me with this one question, and from there I'd be good. Here it is:
Prove that for any real number , if , then for all positive integers and , if , then > . Use mathematical induction.
First off, I understand the general concept that since r is a positive real number less then 1, that the larger it's exponent, the smaller the calculated number will be. I also vaguely understand the idea of a predicate, which I believe is required for the concept of mathematical induction, being that first I must prove the base case, then a general case, then the step after any general case. What confuses me however, is just the general application of all this, specifically since I think this question involves a predicate with multiple variables, something I have not dealt with yet.
If anyone were to be able to walk me through this question, I would be very grateful! Thank you.
You start with the base case k=1, where 1>r^k by the condition that 0<r<1.
Now assume that for some that , we now need to prove that this implies .
Then by the induction hypothesis and as we have:
as required. Hence we may conclude by mathematical induction that when that for any positive integer .
I appreciate the effort you have provided me, but in this particular case, the goal is to do the question only through induction, even if there is different and/or better ways of solving it.
Do the two if's found within my original statement suggest that this question is a two parter, where you have just completed the first. ie. prove both and are , then prove their relationship?
If there was a misunderstanding, it's definitely my fault, so here's the exact question I was given (I summarized earlier):
The exercise is to prove that for any real number, if , then for all positive integers and , if , then > . I want you to use mathematical induction in your solution (so for this problem, tehcniques from Calculus will not be allowed), so your first step is to find out what predicate to use.
What Captain Black is using is that, for positive r, if and only if . Since m> n, m-n is a positive integer.
Once you have proved, as Captain Black suggests,that for any positive integer k, your result follows.