Timeline for Fraction of subsets with one-third sum
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 15 at 15:49 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
added 170 characters in body
|
| Dec 27, 2023 at 9:45 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
added 55 characters in body
|
| Dec 27, 2023 at 9:32 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
added 492 characters in body
|
| Dec 27, 2023 at 9:14 | vote | accept | user139952 | ||
| Dec 27, 2023 at 9:00 | comment | added | Fedor Petrov | I say that it is correct. There are $2^{n-3}$ partitions of the three our submultisets onto pairs ($n$ is the total number of elements), each corresponds to at least 6 combinations with total sum at least $s$. | |
| Dec 27, 2023 at 8:57 | comment | added | Daniel Weber | I don't understand this answer. Are you saying the statement is wrong? Could you give a concrete example with numbers? Note that you don't have to take one number from each partition, you can take any subset. | |
| Dec 27, 2023 at 8:48 | history | answered | Fedor Petrov | CC BY-SA 4.0 |