Let a , b , c be integers satisfying the equations
a + b + c + 1 = 2 0 1 4
c y c ∑ 3 a − b + 1 = 3
Find min min ( a , b , c )
Details and Assumptions
min min ( a , b , c ) means the minimum of all possible minimums of a , b , c where a , b , c ranges over all possible solutions to the equations.
c y c ∑ 3 a − b + 1 = 3 a − b + 1 + 3 b − c + 1 + 3 c − a + 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.
Problem Loading...
Note Loading...
Set Loading...
Let x = 3 a − b + 1 , y = 3 b − c + 1 , z = 3 c − a + 1 . Observe that x , y , z are real numbers such that x + y + z = 3 , x 3 + y 3 + z 3 = 3 and each of x 3 , y 3 , z 3 are integers. Now I am not sure how to solve this without first proving that x , y , z must be integers. It took me way too long to prove this, and I'll post my proof of it below if anyone wants to see it.
But for now, let's assume that x , y , z are integers. Then: ( x + y + z ) 3 − ( x 3 + y 3 + z 3 ) = 3 3 − 3 = 2 4 3 x 2 y + 3 x 2 + 3 y 2 x + 3 y 2 z + 3 z 2 x + 3 z 2 y + 6 x y z = 2 4
Luckily, the left-hand side factors nicely into 3 ( x + y ) ( y + z ) ( x + z ) = 2 4 . Now use the fact that x + y + z = 3 and we get: ( x + y ) ( 3 − x ) ( 3 − y ) = 8 If we do a little case checking, we see that the only solutions are ( x , y ) = ( 1 , 1 ) , ( 4 , 4 ) , ( 4 , − 5 ) , ( − 5 , 4 ) .
Therefore, there are essentially two possibilities: { x , y , z } = { 1 , 1 , 1 } and { x , y , z } = { 4 , 4 , − 5 } . Now it’s fairly simple to show that a = 6 7 1 + 3 x 3 − z 3 , b = 6 7 1 + 3 y 3 − x 3 , c = 6 7 1 + 3 z 3 − y 3 Therefore, in the first case, we get { a , b , c } = { 6 7 1 , 6 7 1 , 6 7 1 } , and in the second case we get { a , b , c } = { 7 3 4 , 6 7 1 , 6 0 8 } . The smallest of these is 608. Therefore, m i n { m i n { a , b , c } } = 6 0 8 .