Timeline for Paritioning a set of numbers A into two sets B,C so that abs(prod(B) - prod(C)) is minimal
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 3, 2012 at 12:31 | vote | accept | Jernej | ||
| Dec 2, 2009 at 3:20 | answer | added | Suresh Venkat | timeline score: 2 | |
| Dec 2, 2009 at 1:47 | history | edited | Harrison Brown | CC BY-SA 2.5 |
prettied up the formatting
|
| Dec 2, 2009 at 1:44 | answer | added | Harrison Brown | timeline score: 2 | |
| Dec 2, 2009 at 1:39 | comment | added | Jernej | You are right. I knew I missed something when writing down the problem.. Thanks | |
| Dec 2, 2009 at 1:39 | history | edited | Jernej | CC BY-SA 2.5 |
added 5 characters in body; edited title
|
| Dec 2, 2009 at 1:31 | comment | added | Harrison Brown | I assume you want the absolute value of prod(B) - prod(C)? Otherwise (at least for positive integers) it's trivial. | |
| Dec 2, 2009 at 1:14 | history | edited | Jernej | CC BY-SA 2.5 |
edited title
|
| Dec 2, 2009 at 1:04 | history | asked | Jernej | CC BY-SA 2.5 |