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: ( You must be logged in to post comments.)
  Subject Author Date
re(2): Answer and reasoningPaul2016-08-16 11:32:42
Hints/Tipsre: Answer and reasoningAdy TZIDON2016-08-16 00:31:58
re: Answer and reasoningSteve Herman2016-08-15 16:48:43
SolutionAnswer and reasoningPaul2016-08-15 13:30:32
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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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