Let a , b , c be positive integers such that a 1 + b 1 + c 1 + a b c 2 4 = 1 . Find the sum of all possible values of a b c .
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.
same here :)
a 1 + b 1 + c 1 + a b c 2 4 = 1
a b + a c + b c + 2 4 = a b c
a + b + c + 2 3 = a b c − a b − a c − b c + a + b + c − 1 = ( a − 1 ) ( b − 1 ) ( c − 1 )
A = ( a − 1 ) , B = ( b − 1 ) , C = ( c − 1 ) , A ≤ B ≤ C
A + B + C + 2 6 = A B C . Casework:
A = 1 , B = 2 ⟹ C = 2 9 ; A = 1 , B = 3 ⟹ C = 1 5 ; A = 2 , B = 2 ⟹ C = 1 0
( A C − 1 ) ( B C − 1 ) = C ( C + 2 6 ) + 1
C < 1 0 ; C = 8 ⟹ A = 1 , B = 5 ; C = 4 ⟹ A = B = 3
Problem Loading...
Note Loading...
Set Loading...
Without loss of generality, assume that a ≤ b ≤ c . Thus, we have a 1 + b 1 + c 1 + a b c 2 4 = 1 ≤ a 3 + a 3 2 4 , which gives a 3 − 3 a 2 − 2 4 ≤ 0 . Thus, we have a ≤ 4 and because a = 1 , we have a ∈ { 2 , 3 , 4 } . We then do the casework:
Case 1: If a = 2 , then the given Diophantine equation becomes b 1 + c 1 + b c 1 2 = 2 1 ⟹ b c = 2 b + 2 c + 2 4 , which, using Simon's Favorite Factoring Trick (SFFT), transforms to ( b − 2 ) ( c − 2 ) = 2 8 . Since b ≤ c means that b − 2 ≤ c − 2 , we deduce that ( b − 2 , c − 2 ) ∈ { ( 1 , 2 8 ) , ( 2 , 1 4 ) , ( 4 , 7 ) } , so we have ( a , b , c ) ∈ { ( 2 , 3 , 3 0 ) , ( 2 , 4 , 1 6 ) , ( 2 , 6 , 9 ) } .
Case 2: If a = 3 , then the given Diophantine equation becomes b 1 + c 1 + b c 8 = 3 2 ⟹ 2 b c = 3 b + 3 c + 2 4 . By SFFT, we have ( 2 b − 3 ) ( 2 c − 3 ) = 5 7 . Since b ≤ c means that 2 b − 3 ≤ 2 c − 3 and b ≥ 3 ⟹ 2 b − 3 ≥ 3 , we deduce that ( 2 b − 3 , 2 c − 3 ) ∈ { ( 3 , 1 9 ) } , so we have ( a , b , c ) ∈ { ( 3 , 3 , 1 1 ) } .
Case 3: If a = 4 , then the given Diophantine equation becomes b 1 + c 1 + b c 6 = 4 3 ⟹ 3 b c = 4 b + 4 c + 2 4 . By SFFT, we have ( 3 b − 4 ) ( 3 c − 4 ) = 8 8 . Since b ≤ c means that 3 b − 4 ≤ 3 c − 4 and b ≥ 4 ⟹ 3 b − 4 ≥ 8 , we deduce that ( 3 b − 4 , 3 c − 4 ) ∈ { ( 8 , 1 1 ) } , so we have ( a , b , c ) ∈ { ( 4 , 4 , 5 ) } .
Therefore, the solutions of the given Diophantine equation are ( a , b , c ) ∈ { ( 2 , 3 , 3 0 ) , ( 2 , 4 , 1 6 ) , ( 2 , 6 , 9 ) , ( 3 , 3 , 1 1 ) , ( 4 , 4 , 5 ) } and the sum of all possible values of a b c is 1 8 0 + 1 2 8 + 1 0 8 + 9 9 + 8 0 = 5 9 5 .