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: 3.7500 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts one example | Comment 3 of 21 |

(1,2,2,5)  fits, did not look for other examples.

If there are none - then this is a proof.

If one lists  ALL   examples that fit - it is ok as well.

I have nothing to add.


  Posted by Ady TZIDON on 2013-04-28 09:24:25
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (15)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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