perplexus.info :: Just Math : Dark Divisibility

Dark Divisibility (Posted on 2013-04-27)

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: ( You must be logged in to post comments.)

Subject	Author	Date
re: No Subject	tonny ken	2019-07-12 04:26:19
re: another	tonny ken	2019-07-12 04:24:46
re(3): Infinite examples, no proof yet.	tonny ken	2019-07-12 04:23:43
re(3): Proof	broll	2013-05-11 00:31:28
re(2): Proof	Steve Herman	2013-05-10 15:02:08
re(2): Proof	Math Man	2013-05-10 14:47:46
re: Proof	broll	2013-05-10 02:15:34
Proof	Math Man	2013-05-09 13:22:15
re(3): Infinite examples, no proof yet.	Steve Herman	2013-04-29 17:03:36
re(2): Infinite examples, no proof yet.	Jer	2013-04-29 12:49:14
Is this list exhaustive?	broll	2013-04-29 08:13:56
re: Infinite examples, no proof yet.	Charlie	2013-04-29 01:29:25
re(2): another	Ady TZIDON	2013-04-28 15:25:55
Infinite examples, no proof yet.	Jer	2013-04-28 12:41:10
re: another	broll	2013-04-28 10:37:21
re: No Subject	broll	2013-04-28 10:06:33
another	Ady TZIDON	2013-04-28 09:30:13
another	Ady TZIDON	2013-04-28 09:30:12
one example	Ady TZIDON	2013-04-28 09:24:25
No Subject	xdog	2013-04-27 14:00:07
Hmmm.	broll	2013-04-27 12:08:44

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info