If a3+b3+c3=(a+b+c)3\quad a^3+b^3+c^3 = (a+b+c)^3a3+b3+c3=(a+b+c)3 ,
Prove that a2n+1+b2n+1+c2n+1=(a+b+c)2n+1\quad \large a^{2n+1}+ b^{2n+1}+ c^{2n+1} = (a+b+c)^{2n+1}a2n+1+b2n+1+c2n+1=(a+b+c)2n+1 for all n∈Nn \in Nn∈N
Nice proofs are always welcome. :)
Note by Nihar Mahajan 6 years, 1 month ago
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
_italics_
**bold**
__bold__
- bulleted- list
1. numbered2. list
paragraph 1paragraph 2
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
This is a quote
# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"
\(
\)
\[
\]
2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Well, if the first condition is met, then one of these are true, a+b=0a+b=0a+b=0, b+c=0b+c=0b+c=0, c+a=0c+a=0c+a=0, and so the next condition follows immediately.
Log in to reply
@Michael Mendrin @Calvin Lin Sir , can you extend my approach that I have written above?
I can't go anywhere with that approach either. But if I just solve it for =0=0=0, I get the condition a+b=0a+b=0a+b=0, b+c=0b+c=0b+c=0, or c+a=0c+a=0c+a=0, and so the rest becomes easy.
Well I THINK it can be proved without induction.@Nihar Mahajan @Vaibhav Prasad I will write it in short. It can easily be derived that (a+b)(b+c)(a+c)=0(a+b)(b+c)(a+c)=0(a+b)(b+c)(a+c)=0 Now we have 3 cases in first all the 3 terms are 0 , or any 2terms are 0 or only one term is 0.
Case(a+b)=0 (a+b)=0(a+b)=0
a=−ba=-ba=−b
So now just substitute a = -b in the equation (which is to be proved)
That will give c2n+1=c2n+1c^{2n+1} = c^{2n+1}c2n+1=c2n+1
See my approach:
a3+b3+c3=(a+b+c)3−3(a+b+c)(ab+bc+ac)+3abc⇒3(a+b+c)(ab+bc+ac)=3abc(a+b+c)(ab+bc+acabc)=1or(a+b+c)(1a+1b+1c)=1a^3+b^3+c^3=(a+b+c)^3-3(a+b+c)(ab+bc+ac)+3abc \\ \Rightarrow 3(a+b+c)(ab+bc+ac) = 3abc \\ (a+b+c)\left(\dfrac{ab+bc+ac}{abc}\right)=1 \quad or \quad (a+b+c)\left(\dfrac{1}{a}+\dfrac{1}{b}+\dfrac{1}{c}\right)=1a3+b3+c3=(a+b+c)3−3(a+b+c)(ab+bc+ac)+3abc⇒3(a+b+c)(ab+bc+ac)=3abc(a+b+c)(abcab+bc+ac)=1or(a+b+c)(a1+b1+c1)=1
Am not able to do more than this...
I will try using this method and tell you about it . But this method does not work when a or b or c=0 and if its right then it proves 0/0=1 (lol was it so easy)
@A Former Brilliant Member – Yeah , my method has a,b,c≠0a,b,c \neq 0a,b,c=0.
@Nihar Mahajan – I will try solving it by your method and tell you tomorrow (well If I can solve it).
@Nihar Mahajan
Take a+c=xa+c=xa+c=x Then (b+x)(bx+ac)=abc(b+x)(bx+ac) = abc(b+x)(bx+ac)=abc
Multiplying and simplifying gives us x(b2+bx+ac)=0x(b^{2}+bx+ac )= 0x(b2+bx+ac)=0substitute x Then Further factorizing gives us a+b)(b+c)(a+c)=0a+b)(b+c)(a+c) = 0a+b)(b+c)(a+c)=0
Now the method goes as usual (given in my method).
@A Former Brilliant Member – @Kalash Verma I understood your method. I am asking , can you extend my approach furthur?
@Nihar Mahajan – @Nihar Mahajan Well actually its the extension of ur approach. In the third line I have replaced a+c by x and then I have explained above.In the end both results in same factors .
@A Former Brilliant Member – Thanks for your help! :) @Kalash Verma
@Nihar Mahajan – Don't mention it.AND you have 703 followers and 703 following. Wow.congrats
Oh ,,, I got your method... Thanks!
Induction on nnn ??
Most probably .. xD
I always prefer induction... even though it's kind of a shortcut
Problem Loading...
Note Loading...
Set Loading...
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Well, if the first condition is met, then one of these are true, a+b=0, b+c=0, c+a=0, and so the next condition follows immediately.
Log in to reply
@Michael Mendrin @Calvin Lin Sir , can you extend my approach that I have written above?
Log in to reply
I can't go anywhere with that approach either. But if I just solve it for =0, I get the condition a+b=0, b+c=0, or c+a=0, and so the rest becomes easy.
Well I THINK it can be proved without induction.@Nihar Mahajan @Vaibhav Prasad I will write it in short. It can easily be derived that (a+b)(b+c)(a+c)=0 Now we have 3 cases in first all the 3 terms are 0 , or any 2terms are 0 or only one term is 0.
Case(a+b)=0
a=−b
So now just substitute a = -b in the equation (which is to be proved)
That will give c2n+1=c2n+1
Log in to reply
See my approach:
a3+b3+c3=(a+b+c)3−3(a+b+c)(ab+bc+ac)+3abc⇒3(a+b+c)(ab+bc+ac)=3abc(a+b+c)(abcab+bc+ac)=1or(a+b+c)(a1+b1+c1)=1
Am not able to do more than this...
Log in to reply
I will try using this method and tell you about it . But this method does not work when a or b or c=0 and if its right then it proves 0/0=1 (lol was it so easy)
Log in to reply
a,b,c=0.
Yeah , my method hasLog in to reply
@Nihar Mahajan
Take a+c=x Then (b+x)(bx+ac)=abc
Multiplying and simplifying gives us x(b2+bx+ac)=0substitute x Then Further factorizing gives us a+b)(b+c)(a+c)=0
Now the method goes as usual (given in my method).
Log in to reply
@Kalash Verma I understood your method. I am asking , can you extend my approach furthur?
Log in to reply
@Nihar Mahajan Well actually its the extension of ur approach. In the third line I have replaced a+c by x and then I have explained above.In the end both results in same factors .
Log in to reply
@Kalash Verma
Thanks for your help! :)Log in to reply
Oh ,,, I got your method... Thanks!
Induction on n ??
Log in to reply
Most probably .. xD
Log in to reply
I always prefer induction... even though it's kind of a shortcut