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

Home > Just Math
Divisibility with lcm and gcd (Posted on 2016-08-15) Difficulty: 3 of 5
Each of X and Y is a positive integer such that:
lcm(X,Y) + gcd(X,Y) = X+Y

Is one of X and Y always divisible by the other?

Provide adequate reasoning for your answer.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Hints/Tips re: Answer and reasoning | Comment 3 of 4 |
(In reply to Answer and reasoning by Paul)

Although the answer seems obvious,- the elegance of your proof vis amazing. 

Many happy returns!


  Posted by Ady TZIDON on 2016-08-16 00:31:58
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 (1)
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