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: ( You must be logged in to post comments.)
  Subject Author Date
Solutioncomputer solutionCharlie2013-10-04 11:48:37
Small correctionTristan2013-10-03 22:42:14
analytical solutionDaniel2013-10-03 16:17:54
Some Thoughtsa start ?Ady TZIDON2013-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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:

blackjack

flooble's webmaster puzzle

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