Timeline for Minimal possible cardinality of a $(a_1, ..., a_k)$-distributable multiset
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 13, 2018 at 3:03 | comment | added | Gerry Myerson | On multiplying everything by 30 to get whole numbers, the 11-part $(4,5,6)$ solution above is $[1,1,2,2,4,5,7,8,10,10,10]$. Another 11-part solution is given by $[1,2,3,4,5,5,6,7,8,9,10]$. | |
| Dec 6, 2015 at 1:12 | history | edited | Max Alekseyev | CC BY-SA 3.0 |
added 1164 characters in body
|
| Dec 5, 2015 at 5:37 | comment | added | Gerhard Paseman | Not original, but worth repeating: not minimal, but you can get a good start with S - m cuts where S is the sum of the set of numbers, and m the number of members. (Maybe could be tweaked for multisets). Cut 1 into the largest number a_1 of pieces, and then stack all but a_2 of these pieces and make a_2 - 1 cuts of this stack, and the stack them on the a_2 pieces. Now stack all but a_3 of these equal stacks and divide this tall stack into a_3 equal sized pieces. This should give a good stat on the optimization. Gerhard "Start Simply, End With Frosting" Paseman, 2015.12.04 | |
| Dec 5, 2015 at 1:38 | history | edited | Max Alekseyev | CC BY-SA 3.0 |
added 10 characters in body
|
| Dec 5, 2015 at 1:31 | history | answered | Max Alekseyev | CC BY-SA 3.0 |