Timeline for Summing the max value of the distinct pairs in a multiset
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29, 2023 at 23:57 | vote | accept | Nick Arnold | ||
| Sep 29, 2023 at 15:53 | comment | added | Max Alekseyev | @YaakovBaruch: Indeed, thank for catching this up. There is also another issue related to the fact that we compare $a\ne a'$ by their value not position. I've posted a corrected and extended comment as an answer. | |
| Sep 29, 2023 at 15:52 | answer | added | Max Alekseyev | timeline score: 1 | |
| Sep 29, 2023 at 15:45 | history | edited | Gabe Goldberg |
edited tags
|
|
| Sep 29, 2023 at 4:30 | comment | added | Yaakov Baruch | @MaxAlekseyev: I think you left out a factor of 2. | |
| Sep 29, 2023 at 4:27 | comment | added | Yaakov Baruch | If the sums in the questions are respectively $S$ and $M$ then clearly $(n-1)S\le M \le2(n-1)S$ and nothing more can be said without more information about $A$. | |
| Sep 29, 2023 at 3:33 | history | edited | Nick Arnold | CC BY-SA 4.0 |
edited title
|
| Sep 29, 2023 at 3:31 | history | edited | Nick Arnold | CC BY-SA 4.0 |
added 18 characters in body
|
| S Sep 29, 2023 at 3:24 | review | First questions | |||
| Sep 29, 2023 at 6:39 | |||||
| S Sep 29, 2023 at 3:24 | history | asked | Nick Arnold | CC BY-SA 4.0 |