Timeline for Simple variation on factorial --- upper bound
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 21, 2011 at 19:02 | vote | accept | David Harris | ||
| Jun 21, 2011 at 18:54 | answer | added | Gerhard Paseman | timeline score: 1 | |
| Jun 21, 2011 at 18:27 | comment | added | David Harris | @Emil, this was an error. I meant "polynomially tight" | |
| Jun 21, 2011 at 18:26 | history | edited | David Harris | CC BY-SA 3.0 |
added 90 characters in body
|
| Jun 21, 2011 at 18:17 | comment | added | Emil Jeřábek | What do you mean by an “exponentially tight” upper bound? Your bound (as well as the trivial bound $m!/n!$) is tight up to a factor of $2^{O(m)}$, isn’t it? | |
| Jun 21, 2011 at 18:14 | comment | added | Gerhard Paseman | You could pretend it is the product of m-n terms, half of them like m+k+sqrt(d) +1/2, the rest with a -sqrt(d) instead of +. Gerhard "Email Me About System Design" Paseman, 2011.06.21 | |
| Jun 21, 2011 at 17:58 | history | asked | David Harris | CC BY-SA 3.0 |