All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
lcm divided by gcd (Posted on 2023-08-30) Difficulty: 3 of 5
Let x and y be positive integers such that 2(x+y)=gcd(x,y)+lcm(x,y). Find lcm(x,y)/gcd(x,y).

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution Comment 1 of 1
Let f be the gcd of x and y.  Then let x=f*g and y=f*h.  g and h will necessarily be coprime positive integers.
Then our given equation becomes 2*(fg+fh)=f+fgh and the expression to evaluate becomes gh.

Working on 2*(fg+fh)=f+fgh:
3f = fgh-2fg-2fh+4f
3f = f*(g-2)*(h-2)
3 = (g-2)*(h-2)

g and h can be in either order, and there is only one factorization of 3 that will keep g and h in positive integers.  Then wlog g-2=1 and h-2=3.
Then g=3 and h=5 and gh=15.

  Posted by Brian Smith on 2023-08-30 12:01:27
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information