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

Home > Just Math
GCD to product (Posted on 2013-10-03) Difficulty: 3 of 5
Determine all possible pairs (x,y) of positive integers, with x ≤ y, that satisfy this equation:
           x*y = 160 + 90*gcd(x,y)

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
analytical solution | Comment 2 of 4 |

let gcd(x,y)=g
and x=a*g and y=b*g then we have
so g must be a divisor of 160
so the possible values of g are:
now we can eliminate those for which
(160/g)+90 is not divisible by g
this leaves us with:
1 and 2

g=1 gives us ab=250
for each possible value of a,b with a<=b we get
a solution with x=g*a=a and y=g*b=b
giving us the solutions:

g=2 gives us ab=85
for each possible value of a,b we get
a solution with x=g*a=2a and y=g*b=2b
giving us the solutions:

thus all solutions are:

  Posted by Daniel on 2013-10-03 16:17:54
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information