Let x and y be positive integers such that
2 ( x + y ) = lcm ( x , y ) + gcd ( x , y )
Find gcd ( x , y ) lcm ( x , y ) .
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.
It looks there is a problem to jump to lcm ( x , y ) = x ′ y ′ h .
e.g. h = 5 , x = 9 ( 5 ) , y = 1 2 ( 5 ) , then lcm ( x , y ) = lcm ( x ′ , y ′ ) × h = 3 6 × 5 = 1 8 0
Log in to reply
I think you've misread the solution. h is the gcd of x and y . In the example you wrote, x = 4 5 and y = 6 0 , whose gcd is 1 5 , not 5 . In full, if x = 4 5 , y = 6 0 , then h = 1 5 ; x ′ = 3 , y ′ = 4 and lcm ( x , y ) = 1 8 0 = 3 ⋅ 4 ⋅ 1 5 = x ′ y ′ h .
The problem with your counter-example is that, if x' = 9 and y' = 12, then h (the gcd of x and y) would no longer be 5. Since 9 and 12 share the factor 3 in common, the true gcd should be 15, meaning that x = 3 * 15 (x' = 3) and y = 4 * 15 (y' = 4). Since x' and y' are relatively prime, claiming lcm(x, y) = x' * y' * h is valid. Perhaps it should have been stated in the solution that x' and y' do not share any factors in common in order for the jump to be made.
Log in to reply
Thanks, I've now pointed out that x ′ and y ′ are coprime in the solution (I'd thought that was clear but then, I use this substitution a lot for problems like these).
It is clear that no solution for x = y
L H S = 2 ( x + y ) = 2 ( x + x ) = 4 x
R H S = x + x = 2 x
WLOG, assume x < y
L H S = 2 ( x + y ) = 2 x + 2 y < 4 y ⟹ lcm ( x , y ) = y , 2 y , 3 y
There is no solution for lcm ( x , y ) = y , 2 y
2 ( x + y ) = lcm ( x , y ) + gcd ( x , y ) ⟹ 2 x + 2 y − lcm ( x , y ) = gcd ( x , y ) ⟹ gcd ( x , y ) > x ⟹ contradiction
For lcm ( x , y ) = 3 y
2 ( x + y ) = 3 y + gcd ( x , y ) ⟹ gcd ( x , y ) = 2 x − y = a
For some integer k 1 < k 2 , let gcd ( x , y ) = 2 x − y = a
x = k 1 a , y = k 2 a
2 x − y = a ⟹ 2 k 1 − k 2 = 1
⟹ k 2 = 2 k 1 − 1
Since k 1 and k 2 = 2 k 1 − 1 are relatively prime,
lcm ( x , y ) = k 1 k 2 a = 3 y = 3 k 2 a ⟹ k 1 = 3 , k 2 = 5 ⟹ lcm ( x , y ) = 1 5 a
∴ gcd ( x , y ) lcm ( x , y ) = a 1 5 a = 1 5
You can use the \text{lcm} command in latex to get lcm .
Problem Loading...
Note Loading...
Set Loading...
Let gcd ( x , y ) = h , and let x = x ′ h , y = y ′ h (note that x ′ and y ′ share no common factors). Then lcm ( x , y ) = x ′ y ′ h . The quantity we want to find is now x ′ y ′ and the equation becomes 2 h ( x ′ + y ′ ) x ′ y ′ − 2 ( x ′ + y ′ ) + 1 x ′ y ′ − 2 ( x ′ + y ′ ) + 4 ( x ′ − 2 ) ( y ′ − 2 ) = x ′ y ′ h + h = 0 = 3 = 3
The only solution to this in positive integers is ( x ′ , y ′ ) = ( 3 , 5 ) (or ( 5 , 3 ) ), and it's easy to verify these satisfy the original equation; hence the answer we need is 1 5 .