Timeline for Partitioning the integers $1$ through $n$ so that the product of the elements in one set is equal to the sum of the elements in the other
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 23, 2011 at 23:18 | comment | added | Gerhard Paseman | Using the updated results, one has partitions like {1,2,...,k-1,k, (2(k!) - 2k +1)} for the product, with n = 2(k!) - k + 1 , for k > 2. Gerhard "Ask Me About System Design" Paseman, 2011.02.23 | |
| Feb 23, 2011 at 22:54 | history | edited | Gerhard Paseman | CC BY-SA 2.5 |
Updated 02.23
|
| Feb 16, 2011 at 9:19 | comment | added | Gerhard Paseman | I had forgotten Andreas Weingartner's construction in writing the above. Still, there is hope for the notion that for most n, k cannot be in the interval [2,..., n/2 - some fudge factor]. Gerhard "Ask Me About System Design" Paseman, 2011.02.16 | |
| Feb 16, 2011 at 9:04 | history | edited | Gerhard Paseman | CC BY-SA 2.5 |
typo fix
|
| Feb 16, 2011 at 8:58 | history | edited | Gerhard Paseman | CC BY-SA 2.5 |
final tweak?
|
| Feb 16, 2011 at 8:53 | history | answered | Gerhard Paseman | CC BY-SA 2.5 |