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: ( You must be logged in to post comments.)
  Subject Author Date
re(3): Proofbroll2013-05-11 00:31:28
re(2): ProofSteve Herman2013-05-10 15:02:08
re(2): ProofMath Man2013-05-10 14:47:46
Some Thoughtsre: Proofbroll2013-05-10 02:15:34
SolutionProofMath Man2013-05-09 13:22:15
Some Thoughtsre(3): Infinite examples, no proof yet.Steve Herman2013-04-29 17:03:36
re(2): Infinite examples, no proof yet.Jer2013-04-29 12:49:14
Is this list exhaustive?broll2013-04-29 08:13:56
re: Infinite examples, no proof yet.Charlie2013-04-29 01:29:25
Some Thoughtsre(2): anotherAdy TZIDON2013-04-28 15:25:55
Some ThoughtsInfinite examples, no proof yet.Jer2013-04-28 12:41:10
re: anotherbroll2013-04-28 10:37:21
re: No Subjectbroll2013-04-28 10:06:33
Hints/TipsanotherAdy TZIDON2013-04-28 09:30:13
Hints/TipsanotherAdy TZIDON2013-04-28 09:30:12
Some Thoughtsone exampleAdy TZIDON2013-04-28 09:24:25
No Subjectxdog2013-04-27 14:00:07
Hmmm.broll2013-04-27 12:08:44
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 (4)
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