Timeline for A question about Pascal triangle
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 30, 2017 at 20:30 | vote | accept | Secondflooroffice | ||
| Dec 30, 2017 at 19:38 | comment | added | Igor Rivin | @GerryMyerson See the edit. It is not clear that one can get the better result for ALL $t$ using this technology. | |
| Dec 30, 2017 at 19:37 | history | edited | Igor Rivin | CC BY-SA 3.0 |
added results.
|
| Dec 30, 2017 at 19:24 | comment | added | Gerry Myerson | if they're asymptotically better, then they do the trick for $a$ sufficiently large, but not necessarily for all $a$, right? | |
| Dec 30, 2017 at 19:21 | comment | added | Igor Rivin | @GerryMyerson The results in the wikipedia link are asymptotically better, so they definitely do the trick. I did not notice the plus vs minus, mea culpa. | |
| Dec 30, 2017 at 19:14 | comment | added | Gerry Myerson | The proof gives $N(a)\le2+2\log_2a$, and OP wants $N(a)\le2k-2$ when $a<2^k$, which is a little bit stronger (but maybe the improved results in the wikipedia essay give what's needed). | |
| Dec 30, 2017 at 18:05 | history | answered | Igor Rivin | CC BY-SA 3.0 |