If positive integers and satisfy find the sum of all possible values of .
Notation: denotes the lowest common multiple function.
Bonus: Find a general solution to the equation where are positive integers.
This is part of the set Fun With Problem-Solving .
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.
Let g c d ( a , b , c ) = g
∴ let a = g x , b = g y , c = g z
Then, we have l c m ( a , b , c ) = g x y z
⇒ g x + g y + g z = g x y z
⇒ x + y + z = x y z
By symmetry, without a loss in generality, we assume that x ≤ y ≤ z
∴ x + y + z ≤ z + z + z = 3 z
∵ x + y + z = x y z
⇒ x y z ≤ 3 z
⇒ x y ≤ 3
The possible soutions for x , y are x = 1 , y = 1 and x = 1 , y = 2 and x = 1 , y = 3
When x = 1 , y = 1 ,
1 + 1 + z = z , which is impossible to hold true.
∴ x = 1 , y = 1 is unsuitable.
When x = 1 , y = 2 ,
1 + 2 + z = 2 z
⇒ z = 3
When x = 1 , y = 3 ,
1 + 3 + z = 3 z
2 z = 4
z = 2
We conclude that all the possible permutations of 1 , 2 , 3 are the solutions for x , y , z when the restriction of x ≤ y ≤ z is lifted off.
∴ a = g , b = 2 g , c = 3 g (Not to mention, the other permutations are included too.)
When a = 1 2 ,
g = 1 2
b + c = 2 g + 3 g = 5 g = 5 ( 1 2 ) = 6 0
When b = 1 2 ,
2 g = 1 2
g = 6
a + c = g + 3 g = 4 g = 4 ( 6 ) = 2 4
When c = 1 2 ,
3 g = 1 2
g = 4
b + c = g + 2 g = 3 g = 3 ( 4 ) = 1 2
Coming back to our question,
The sum of all possible a + b = 6 0 + 2 4 + 1 2 = 9 6