How would you prove, using Newton's binomial theorem, that \[\forall (x,y) \in \mathbb{R}_{+} \times \mathbb{R}{+}, \sqrt[n]{x+y}\le \sqrt[n]{x}+\sqrt[n]{y}\]
u got 2 more clear
how?
Would a substitution like \[a=\frac{1}{n}\] work and then just working with proving that \[(x+y)^a \le x^a+y^a \] Would that be equivalent?
hmm..i dont think that would work. expanding \[(x+y)^a\] as an integer would be different than expanding it as \[(x+y)^\frac{1}{n}\]
hmm... I have no clue, that was my idea hehe but coming to think of it the binomial formula works for an exponent that's an integer...
right. im reading some random webpages online, and it seems like there is a way to use the binomial theorem with rational exponents. I have no idea how to calculate the coefficients though =/
Oh, well... How would raising both sides to the nth work? Say, having thus to prove that \[x+y \le (\sqrt[n]{x}+\sqrt[n]{y})^n\] And THEN using the binomial theorem to expand the expression with the roots... I think you'd get something like x+y+a lot of coefficients, no? Then the result would be proven! Is my logic correct?
that sounds like a good plan :)
thanks!
this looks like a fun problem but i have to go to bed :(
i have a paper to type for art history >.> i need to get off this site!
its an addiction its hard
lol >.< well, im going to log off for once, maybe that will help (i know it wont lol).
hey someone if someone doesn't give you an answer i will try to think about it tomorrow
i cant promise i will be able to do it but i will certainly try! :)
Myinin is the nest.
best*
is n a positive integer?
Yep, forgot to say n is a natural number, although being named n I think it's implied :p Here I go for what I thought as proof: Let f be the function \[f(x)=x^n\] f is an increaasing function in R+ which allows us to say \[\sqrt[n]{x+y}\le \sqrt[n]{x}+\sqrt[n]{y} \Leftrightarrow x+y \le ( \sqrt[n]{x}+\sqrt[n]{y})^n\] But \[(\sqrt[n]{x}+\sqrt[n]{y})^n=\sum_{k=0}^{n} \left(\begin{matrix}n \\ k\end{matrix}\right) \sqrt[n]x^{n-k} \sqrt[n]y^k=x+y + \sum_{k=1}^{n-1}\left(\begin{matrix}n \\ k\end{matrix}\right) \sqrt[n]x^{n-k} \sqrt[n]y^k\] And knowing that \[\forall (x,y) \in \mathbb{R}_+ \times \mathbb{R}_+ ,\sum_{k=1}^{n-1}\left(\begin{matrix}n \\ k\end{matrix}\right) \sqrt[n]x^{n-k} \sqrt[n]y^k \ge 0\] Thus \[x+y \le (\sqrt[n]{x} + \sqrt[n]{x})^n \Leftrightarrow x+y \le x+y + \sum_{k=1}^{n-1}\left(\begin{matrix}n \\ k\end{matrix}\right) \sqrt[n]x^{n-k} \sqrt[n]y^k\] Substracting x+y from both sides gives \[0 \le \sum_{k=1}^{n-1}\left(\begin{matrix}n \\ k\end{matrix}\right) \sqrt[n]x^{n-k} \sqrt[n]y^k\] Which is true, meaning the initial statement is also true. Is this correct?
The Idea you have here is pretty much what I have on paper, but I didn't write it out the way you did....it does not flow nicely. I would say something like since \[\forall (x,y) \in \mathbb{R}_+ \times \mathbb{R}_+ ,\sum_{k=1}^{n-1}\left(\begin{matrix}n \\ k\end{matrix}\right) \sqrt[n]x^{n-k} \sqrt[n]y^k \ge 0\] we have \[x+y \le x+y + \sum_{k=1}^{n-1}\left(\begin{matrix}n \\ k\end{matrix}\right) \sqrt[n]x^{n-k} \sqrt[n]y^k=\sum_{k=0}^{n} \left(\begin{matrix}n \\ k\end{matrix}\right) \sqrt[n]x^{n-k} \sqrt[n]y^k=(\sqrt[n]{x}+\sqrt[n]{y})^n\]
I did say that, although I admit my way to write it was pretty lazy hahaha, I think yours is cleaner!
Join our real-time social learning platform and learn together with your friends!