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.

How do I prove that $\min A = \frac{1}{3}$ for: $$\left\{m,n\in\mathbb{N}:\frac{mn}{1+m+n}\right\}$$

share|improve this question
add comment

2 Answers 2

up vote 13 down vote accepted

It is same as proving $1+m+n \leq 3mn$

Same as proving $\frac{1}{m}+\frac{1}{n}+\frac{1}{mn} \leq 3$

Since $m,n \geq 1$,

$\Rightarrow \frac{1}{m} \leq 1, \frac{1}{n} \leq 1, \frac{1}{mn} \leq 1$

Thus the result follows. Equality holds when $m=n=1$.

share|improve this answer
add comment

Another approach is the following:

$\frac{mn}{1+m+n}=\frac{2+mn}{1+m+n}-\frac{2}{1+m+n}\geq1-\frac{2}{1+m+n}\geq 1-\frac{2}{3}=\frac{1}{3} $

Note that the first inequality follows since $(1-m)(1-n)\geq 0$ for $n$ and $m$ greater (or equal) than $1$.

Equality is obtained when $m=n=1$, thus the minimum is $1/3$.

share|improve this answer
add 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.