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.)
Some Thoughts a start ? | Comment 1 of 4
if x=1  y=250,
if x=2  y=170,
if x=3  no integer  y
if x=4  no integer  y
...
if x=10  y=34 

etc

Someone to continue..

  Posted by Ady TZIDON on 2013-10-03 14:18:17
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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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