Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

If $p,q$ are positive quantities and $0 \leq m\leq 1$ then Prove that $$(p+q)^m \leq p^m+q^m$$

Trial: For $m=0$, $(p+q)^0=1 < 2= p^0+q^0$

and for $m=1$, $(p+q)^1=p+q =p^1+q^1$.

So, For $m=0,1$ the inequality is true.How I show that the inequality is also true for $0 < m < 1$.

Please help.

share|cite|improve this question
up vote 27 down vote accepted

Let $m=1-n$, where $n \in [0,1]$. Then

$(p+q)^m = (p+q)^{1-n} = p (p+q)^{-n} + q (p+q)^{-n} \leq p p^{-n} + q q^{-n} = p^m + q^m$.

share|cite|improve this answer
(Conversely, if $m \geq 1$ then $(p+q)^m \geq p^m + q^m$ with the same method.) – sdcvvc Dec 23 '12 at 15:32
Great trick.Thanks for help. – Argha Dec 23 '12 at 15:36

Your Answer


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.