Timeline for Complexity of finding the maximum sum divided by product
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 12, 2015 at 19:39 | answer | added | Ruxian | timeline score: 2 | |
| Jan 12, 2015 at 16:11 | answer | added | user35593 | timeline score: 1 | |
| Jan 10, 2015 at 15:11 | history | edited | Tony Huynh | CC BY-SA 3.0 |
Improved title, fixed typos and made the problem statement cleaner.
|
| Jan 9, 2015 at 14:42 | history | edited | Ruxian | CC BY-SA 3.0 |
each $a_i$ and $b_i$ are given, strictly positive.
|
| Jan 9, 2015 at 14:31 | comment | added | Noah Stein | @BrendanMcKay: I agree and I think the MO approach is to consider your and my comments as votes against closing, so the next two people who want to vote to close should instead leave comments canceling out our votes against closing. | |
| Jan 9, 2015 at 13:53 | comment | added | Brendan McKay | @Chris: I'm guessing that the numbers $a_i$ and $b_i$ are provided and one has to find the best $S$. It doesn't seem trivial to me and I wish people voting to close would explain themselves. | |
| Jan 9, 2015 at 13:49 | comment | added | Chris Godsil | Just take $b_1=0$? | |
| Jan 9, 2015 at 2:37 | review | Close votes | |||
| Jan 9, 2015 at 18:11 | |||||
| Jan 9, 2015 at 2:07 | review | First posts | |||
| Jan 9, 2015 at 2:09 | |||||
| Jan 9, 2015 at 2:03 | history | asked | Ruxian | CC BY-SA 3.0 |