Bounding $(x+y)^n$

Let $n$ be a natural number. Is it possible to write $$(x+y)^n \leq C(x^n + y^n)$$ for some constant $C$??

It is obvious for $n=2$ (using Young's inequality) but not obvious to me for other $n$.

Let $x$ and $y$ be positive reals.

• are x,y natural numbers? May 13, 2014 at 16:25
• No @teddybear, they can be any real positive number May 13, 2014 at 16:26
• Yes. $\frac{x^n +y^n}{2} \geq \left(\frac{x+y}{2}\right)^n.$ May 13, 2014 at 16:26
• It would be interesting to calculate the smallest constant $C$ such that $(x+y)^n\leq C(x^n+y^n)$ holds for all positive real numbers $x$ and $y$. PVAL's answer shows $C=2^{n}$ works but perhaps there is a smaller value that works. May 13, 2014 at 16:36
• Sorry, using (midpoint) convexity of $f(x)=x^n$ shows Raghav's inequality which is sharp because of $x=y=1$. May 13, 2014 at 17:04

$$(x+y)^n\leq(2\operatorname{Max}(x,y))^n\leq2^n(x^n+y^n)$$
• @SandeepSilwal: Either $\operatorname{Max}(x, y)^{n}\leq x^{n}$ or $\operatorname{Max}(x, y)^{n}\leq y^{n}$… So in any case, $\operatorname{Max}(x, y)^{n}\leq x^{n}+y^{n}$. May 13, 2014 at 17:33