Suppose a , b , c are pairwise coprime positive integers such that a ∣ b + c , b ∣ c + a , c ∣ a + b . Find the maximum possible value of a b c .
This problem is part of the set Easy Problems
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.
If a ∣ b + c , b ∣ c + a and c ∣ a + b then: a ∣ a + b + c b ∣ a + b + c c ∣ a + b + c Therefore: a b c q = a + b + c For some q ∈ N . The maximum value for a b c occurs when q = 1 , hence: a b c = a + b + c Assume that a < b < c , therefore a + b + c < 3 c . Thus: a b c < 3 c a b < 3 The only possible values for ( a , b ) are ( 0 , 1 ) , ( 0 , 2 ) and ( 1 , 2 ) . Hence, the only possible solution is ( a , b , c ) = ( 1 , 2 , 3 ) ⇒ a b c = 6
I just guessed a b and c were 1, 2, and 3, and then multiplied them together and got the answer right, hahaha
Problem Loading...
Note Loading...
Set Loading...
If a < b < c then since c ∣ a + b and ( a + b ) < 2 c we must have a + b = c .
This means that a ∣ b + c ⟹ a ∣ 2 b + a ⟹ a ∣ 2 b
and that b ∣ c + a ⟹ b ∣ 2 a + b ⟹ b ∣ 2 a .
This means that (i) a ∣ 2 or a ∣ b , and (ii) b ∣ 2 or b ∣ a . But we require that a , b are coprime and assumed that a < b , which implies that a = 1 , b = 2 , and thus c = 3 . This gives us a value of a b c = 6 .
Now we can't have b = c unless a = b = c = 1 , for otherwise c would not divide a + b . Also, if a = b < c then for a , b to be coprime we would require that a = b = 1 , implying that c = 2 in order to have c ∣ a + b with c > b = 1 .
Thus the maximum possible value of a b c is 6 .