Timeline for Seeking proof to an asymptotics of a recursion or functional equation
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 1, 2018 at 18:13 | comment | added | Hans | By the way, there is this question math.stackexchange.com/q/2611835/64809 and very impressive answer math.stackexchange.com/a/2623249/64809 of an inequality. Would you be interested in looking into whether you have a more straightforward proof? | |
| Jan 31, 2018 at 21:54 | comment | added | Iosif Pinelis | @Hans : Considerations presented in the answer by Fedor Petrov appear to suggest that the behavior of the $O(1)$ term in the asymptotic relation $a_s=\log_2 s+O(1)$ depends on arithmetic properties of $\log_2 s$. Apparently, much more powerful tools are needed to adequately describe this behavior -- I have no good idea at the moment on how to proceed here. | |
| Jan 31, 2018 at 17:30 | comment | added | Hans | Excellent! +1 Do you have any way to calculate (and prove) the smaller order terms of this sequence? | |
| Jan 31, 2018 at 3:08 | history | edited | Iosif Pinelis | CC BY-SA 3.0 |
deleted 41 characters in body
|
| Jan 30, 2018 at 19:50 | history | edited | Iosif Pinelis | CC BY-SA 3.0 |
added 35 characters in body
|
| Jan 30, 2018 at 19:41 | history | answered | Iosif Pinelis | CC BY-SA 3.0 |