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

Home > Just Math
Dark Divisibility (Posted on 2013-04-27) Difficulty: 3 of 5
The natural numbers a,b,c,d are such that their least common multiple equals a+b+c+d. Prove that abcd is divisible by 3 or by 5.

No Solution Yet Submitted by Danish Ahmed Khan    
Rating: 5.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re(3): Proof Comment 18 of 18 |
(In reply to re(2): Proof by Steve Herman)

I agree that it is a splendid result.

I started out with just the same idea, but failed to complete the connection between the sets. It seems I was looking through the wrong end of the telescope!

Bravo indeed, Math Man! 

Edited on May 11, 2013, 12:35 am
  Posted by broll on 2013-05-11 00:31:28

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 (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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