Prove that for any integer

.

I am not sure where to start on this so maybe someone could give me a hint on what theorem(s) to use/where to start? thanks!

Printable View

- Nov 1st 2009, 12:17 PMnmatthies1Upper and Lower bound of the sequence log(n)
Prove that for any integer

.

I am not sure where to start on this so maybe someone could give me a hint on what theorem(s) to use/where to start? thanks! - Nov 1st 2009, 02:58 PMPlato
- Nov 1st 2009, 05:18 PMnmatthies1
I see how to observe

.

I don't quite see, however, how to observe that

is true. Could you elaborate? - Nov 2nd 2009, 04:40 AMKrizalid
Let be an antiderivative for thus

Now fix so that and then so now integrate for thus now the rest is just a matter of make-up, finally which is exactly what we wanted to prove.