Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Prove for $n\in\mathbb{N}$: $$ \left(\frac{n^2+1}{n^2}\right)^n\ge\frac{n+1}{n}.$$ by induction.

I'm doing induction ahead of my regular classes because I need it for competition coming in few months. I've been introduced to induction before, but I've never proved inequalities with it before, so I'm pretty new to this, especially since I have $n$ in both power and base.

share|improve this question
    
I think that if you rewrite $$ \left(\frac{1+n^2}{n^2}\right)^n = \left(1+\frac{1}{n^2}\right)^n $$ and do the same with RHS, things will become easier. –  Ilya Mar 23 '12 at 17:43
    
I'm afraid I don't know how to do it even with that transformation (I've already tried it before). Could you eloborate, please? –  Lazar Ljubenović Mar 23 '12 at 17:59
    
How far have you gotten? –  Holdsworth88 Mar 23 '12 at 18:03
    
I guess what Ilya is trying to tell you is try showing $\displaystyle{\left(1+\frac{1}{n^2}\right)^n \geq 1+\frac{1}{n}}$ –  Kirthi Raman Mar 23 '12 at 18:04
1  
@Lazar Google Bernoulli's inequality. –  Pedro Tamaroff Mar 23 '12 at 18:45
add comment

2 Answers

up vote 3 down vote accepted

How about this: We prove something stronger with induction on n :
$ (1 + a)^n \geq 1+ na $ (1) for every $n \in \mathbf{N} $ and a is any fixed real number that is not less than -1.
It's true for n = 1
Suppose $ (1+a)^k\geq1+ka $
then $(1+a)^{k+1}\geq (1+ka)(1+a) $ since $ 1+a \geq 0$ which means $(1+a)^{k+1}\geq 1+ka + a + ka^2 \geq 1+(k+1)a $.
Therefore (1) is true. Every number $a = 1/n^2 $ satisfies (1)'s condition, so we have
$(1+\frac{1}{n^2})^n\geq1+\frac{1}{n}$ for every $n \in \mathbf{N} $.

share|improve this answer
    
@quartz: the answer is write for any $a$ - that means that is also be given in the form $(1+a_n)^n\geq 1+na_n$ –  Ilya Mar 23 '12 at 19:05
    
the dependence of a on n doesn't change the fact that (1) is true for $a \geq -1$, particularly it is true for every number a of the form $1/n^2$ where n is the power itself. –  Lorenz Chaos Mar 23 '12 at 19:05
    
then it is right. thanks IIya and Broskiana. –  quartz Mar 23 '12 at 19:07
    
@Ilya, still I believe that you cannot write induction step $(1+a_1)^{k+1}\geq (1+ka_2)(1+a)$, because $a_1$ and $a_2$ are different. I think answer require one more step that $1+ka_2 \geq 1+ka_1$. –  quartz Mar 23 '12 at 19:11
1  
@quartz: it was already proved by induction for a fixed $a$. When we apply it to the problem in OP we can change $a$ because we don't use an induction anymore –  Ilya Mar 23 '12 at 19:13
show 1 more comment

If you particularly want to prove it by induction, that’s certainly possible, as Broskiana Jones has just demonstrated. However, the binomial theorem will do the trick for you without induction:

$$\begin{align*} \left(\frac{1+n^2}{n^2}\right)^n&=\left(1+\frac1{n^2}\right)^n\\ &=\sum_{k=0}^n\binom{n}k\left(\frac1{n^2}\right)^k(1)^{n-k}\\ &=1+n\left(\frac1{n^2}\right)+\dots\\ &=1+\frac1n+\dots\\ &\ge 1+\frac1n\;. \end{align*}$$

share|improve this answer
1  
@quartz: Broskiana could have stated it more clearly, but since the result is proved simultaneously for all $a>-1$, the fact that $a$ is a function of $n$ in the original problem doesn’t matter; see Ilya’s response to you under the other answer. –  Brian M. Scott Mar 23 '12 at 19:08
    
I like this answer because straightforward proofs rather than inductive ones tend to be much more appreciable and elegant to me. –  000 Mar 24 '12 at 4:38
    
@user22144 But then, it is easier to prove the principle of induction than the Binomial Theorem. It depends on the ammo you want to use. –  Pedro Tamaroff Mar 24 '12 at 4:58
    
@PeterT.off, very true. I find that the binomial theorem is rather 'normal' and 'appropriate' to me, so you've got it. It's all about the ammo. –  000 Mar 24 '12 at 5:54
    
i would prefer this direct approach also, if the question doesn't require using induction ;D –  Lorenz Chaos Mar 24 '12 at 6:25
show 1 more comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.