a , b , and c are real numbers such that a 1 + b 1 + c 1 = a + b + c 1 . Does the following equation hold for all odd integers n ? a n 1 + b n 1 + c n 1 = a n + b n + c n 1
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This states that for these equation, it is only the solution (a,b,c) which at least two of them add up to zero.
Thank you! There is a typo: In step 2, it should be “+ab“, not “+2b“
I tried even simpler variables than you did in your 'intermezzo'. I just tried a = 1 and b = 1. This gave me c = -1. Plugging this into the equation with odd powers always worked, much like your final, much more general equation with the x's and y's.
Let f ( x ) = x 3 + m x 2 + n x + p be a polynomial which has the roots a , b , c . The given equality can be written as ( a + b + c ) ( a b + b c + a c ) = a b c .
So, we get p = m n . Thus f ( x ) = x 3 + m x 2 + n x + m n = ( x + m ) ( x 2 + n ) . We see that one of the roots, say a , is − m = a + b + c , hence c = − b . In that case a n 1 + b n 1 + ( − b ) n 1 = a n + b n + ( − b ) n 1 holds true for all odd integers n .
explanation not understood
How does the polynomial shown relate to equation? How did you determine that one of the roots is -m? How does that make c = -b? Lastly, how did you determine that the last statement always holds true?
Log in to reply
Just create a polynomial with a , b and c as the 3 roots (zeroes of f ( x ) ), f ( x ) = ( x − a ) ( x − b ) ( x − c ) . Thus f ( x ) = x 3 − ( a + b + c ) x 2 + ( b c + a c + a b ) x − a b c . Since a b c = ( a + b + c ) ( b c + a c + a b ) , f ( x ) = ( x − ( a + b + c ) ) ( x 2 + ( b c + a c + a b ) ) . The roots (zeroes) are now: x = a + b + c and x = ± − ( b c + a c + a b ) . We already know that a , b and c are the roots. Choose, without loss of generality, that a = a + b + c and that b and c are the plus and minus versions of the square root respectively. This implies b = − c . Finally b 2 k + 1 + c 2 k + 1 = 0 for all k ∈ Z , so all the b-terms and c-terms vanish.
A creative solution!
Re-arrange the equation to get x + y + z 1 − x 1 − y 1 − y 1 = 0 . The algebra is tedious but the left hand side can be written in a productive way, yielding x y z ( x + y + z ) − ( x + y ) ( x + z ) ( y + z ) = 0 . For this equation to be true, the numerator has to be 0 and this is only the case if x = − y or y = − z or z = − x . And remember that none of them can 0. Without loss of generality let's suppose that x = − y and z is some non-zero real number. Then x n 1 + y n 1 + z n 1 = x n 1 − x n 1 + z n 1 = z n 1 = x n − x n + z n 1 = x n + y n + z n 1 . As long as n is odd, obviously.
I'll bite. Why is n obviously odd?
Log in to reply
I did not mean to say that n is obviously odd, but that what I was saying obviously only holds as long as n is odd. And n being odd is given by the problem so I was implicitly using that all along but only mentioned it at the end.
See,
a
1
+
b
1
+
c
1
=
a
+
b
+
c
1
⇒
(
a
+
b
+
c
)
(
a
b
+
a
c
+
b
c
)
=
a
b
c
⇒
(
a
+
b
)
(
b
+
c
)
(
c
+
a
)
=
0
We have now shown that all solutions are of the form (a, b, c) = (x, -x, y), (y, x, -x) or (x, y , -x).
It can be easily checked that this satisfies the given equation, for all or odd n, as checked by others.
Multiply across by a 1 + b a + c a = a + b + c a = 1 + a b + a c 1
Let x = a b and y = a b for simpler algebra. Multiply out: ( 1 + x 1 + y 1 ) ( 1 + x + y ) = 1 ( x y + y + x ) ( 1 + x + y ) = x y 3 x y + x + y + x 2 + y 2 + x 2 y + x y 2 = x y x 2 ( y + 1 ) + x ( y 2 + 2 y + 1 ) + ( y 2 + y ) = 0 x 2 ( y + 1 ) + x ( y + 1 ) 2 + y ( y + 1 ) = 0 ( y + 1 ) ( x 2 + x ( y + 1 ) + y ) = 0 ( y + 1 ) ( x + 1 ) ( x + y ) = 0
So we get
y
=
−
1
⇒
c
=
−
a
, or
x
=
−
1
⇒
b
=
−
a
, or
x
=
−
y
⇒
b
=
−
c
.
Assume WLOG b = − a . Then for odd n , a n 1 + b n 1 + c n 1 = a n 1 − a n 1 + c n 1 = c n 1 while, a n + b n + c n 1 = a n − a n + c n 1 = c n 1 .
This holds regardless of the choice of a , b , c .
The condition we rewrite in the following way: c 2 ( a 1 + b 1 ) + c ( b a + a b + 2 ) + a + b = 0 . Solving this equation in c , we obtain c = − a or c = − b . Thus, for any positive odd integer n , there holds c n = − a n or c n = − b n . So, taking, for instance, c = − a , we have a n 1 + b n 1 + c n 1 = a n 1 + b n 1 + − a n 1 = b n 1 = a n + b n − a n 1 = a n + b n + c n 1 .
Clearing denominators, we find that ( a + b ) ( b + c ) ( c + a ) = 0 . Clearing denominators of the second equation, we get ( a n + b n ) ( b n + c n ) ( c n + a n ) = 0 . But this equation is true because since n is odd, we can factor out ( a + b ) ( b + c ) ( c + a ) .
Answer: Yes.
Assume: a 1 + b 1 + c 1 = a + b + c 1
Multiplying by the denominators gives ( b c + c a + a b ) ( a + b + c ) = a b c
Expanding gives 3 a b c + a 2 ( b + c ) + b 2 ( c + a ) + c 2 ( a + b ) = a b c
One can see that ( a + b ) ( b + c ) ( c + a ) = ( a + b ) ( a b + a c + b c + c 2 ) = a 2 ( b + c ) + b 2 ( c + a ) + c 2 ( a + b ) + 2 a b c
Hence ( a + b ) ( b + c ) ( c + a ) = 0 .
Replacing a with a n etc. we can see that a n 1 + b n 1 + c n 1 = a n + b n + c n 1 if and only if ( a n + b n ) ( b n + c n ) ( c n + a n ) = 0 .
With n odd, ( a + b ) is a factor of ( a n + b n ) , so ( a + b ) ( b + c ) ( c + a ) is a factor of ( a n + b n ) ( b n + c n ) ( c n + a n ) .
Therefore a 1 + b 1 + c 1 = a + b + c 1 implies ( a n + b n ) ( b n + c n ) ( c n + a n ) = 0 (for n odd)
Thus implying a n 1 + b n 1 + c n 1 = a n + b n + c n 1 .
to make 1/a+1/b+1/c=1/(a+b+c) possible a,b,c one is negative (for e.g. a) one is same as negative number but x(-1) (for e.g. b) the remaining one can be anything(for e.g. c)
so no matter what power u add to them, if the power is the same, a^n+ b^n =0 so answer will always be c^n
Problem Loading...
Note Loading...
Set Loading...
The answer is yes. I proved this by searching for all solutions of a 1 + b 1 + c 1 = a + b + c 1 and checking whether they are also solutions of a n 1 + b n 1 + c n 1 = a n + b n + c n 1
Step 1: Remove the fractions in the equation.
Fractions are not so nice. So, my first step is to multiply the equation by a b c ( a + b + c ) . Then we get ( a + b + c ) ( a b + a c + b c ) = a b c .
Intermezzo: How I found the solution..
This is not part of the proof, but it is always nice to show how you find the answer. In this case I simply wanted to find some small solutions. So, I tried a = 1 and b = 2 and looked which c would work. In this case I got the equation ( 3 + c ) ( 2 + 3 c ) = 2 c . This gave me the quadratic equations 3 c 2 + 9 c + 6 = 0 , which simplifies to (c+2)(c+1)=0. So, the solutions are c = -1 (= -a) or c = -2 ( =-b). After that, I also tried a = 2 and b = 3 which gave me a similar quadratic equation which simplifies to (c+2)(c+3)=0. So, my conjecture was that I would get (c+a)(c+b) = 0 for general a and b. That is what I started to prove.
Step 2: Solve ( a + b + c ) ( a b + a c + b c ) = a b c for c .
I remove the brackets: a 2 b + a 2 c + b 2 a + b 2 c + c 2 a + c 2 b + 3 a b c = a b c . I can rewrite this equation as a quadratic equation in the variable c . That is ( a + b ) c 2 + ( a 2 + 2 a b + b 2 ) c + ( a 2 b + b 2 a ) = 0 . When a = − b , we can divide this equation by ( a + b ) . This gives us c 2 + ( a + b ) c + a b . So, ( c + a ) ( c + b ) = 0 . So, the solutions are of the form c = − a or c = − b .
We have now shown that all solutions are of the form (a, b, c) = (x, -x, y), (y, x, -x) or (x, y , -x).
Step 3: Checking whether (a, b, c) = (x, -x, y) satisfies a n 1 + b n 1 + c n 1 = a n + b n + c n 1
Filling in (a, b, c) = (x, -x, y) gives x n 1 + ( − x ) n 1 + y n 1 = ? x n + ( − x ) n + y n 1 . For odd n , we have ( − x ) n = − x n . Due to this the equation simplifies to x n 1 − ( x ) n 1 + y n 1 = ? y n 1 . Which is true for all nonzero x , y .