Timeline for How many steps do I have tto complete? Recursive sequence
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 3, 2016 at 17:30 | history | reopened |
Anthony Quas Alexey Ustinov Yemon Choi Jan-Christoph Schlage-Puchta András Bátkai |
||
| Nov 3, 2016 at 16:18 | comment | added | Anthony Quas | The idea is that if you solve the differential equation $\dot x=-x^{2/3}$, then in one time step, $x$ changes by approximately $-x^{2/3}$ (not exactly because the differential equation slows down, but this is a good approximation). That means that $x(t+1)\approx x(t)-x(t)^{2/3}$. This is the same thing as the difference equation. | |
| Nov 3, 2016 at 15:50 | review | Reopen votes | |||
| Nov 3, 2016 at 17:30 | |||||
| Nov 3, 2016 at 15:48 | history | edited | Bruno Brogni Uggioni | CC BY-SA 3.0 |
added 6 characters in body
|
| Nov 3, 2016 at 15:43 | comment | added | Bruno Brogni Uggioni | Dear Professor @AnthonyQuas, as I'm not so familiar with the kind of question I asked, I couldn't see how your differential equation's approach would answer it, for the sequence case. Could you explain this point, please? Thanks for your attention. | |
| Nov 3, 2016 at 15:31 | history | edited | Bruno Brogni Uggioni | CC BY-SA 3.0 |
added 516 characters in body
|
| S Nov 1, 2016 at 13:25 | history | suggested | Takahiro Waki |
remove tag
|
|
| Nov 1, 2016 at 13:08 | review | Suggested edits | |||
| S Nov 1, 2016 at 13:25 | |||||
| Nov 1, 2016 at 8:16 | comment | added | Martin Sleziak | Your question was put on hold, the message above (and possibly comments) should give an explanation why. If you have some ideas how to improve the post, the next edit should put it into reopen review queue, where users can vote whether to reopen it or leave it closed. (In fact, it went in the queue at least once already, probably based on somebody casting a reopen vote.) | |
| Oct 31, 2016 at 22:29 | comment | added | Anthony Quas | I don't see why this question was closed. I think it's a perfectly reasonable question for this site. Basically "Given a recurrence equation, what are some techniques for estimating asymptotics of the solution?" I think this is more of a research question than a general mathematics question. | |
| Oct 31, 2016 at 21:52 | review | Reopen votes | |||
| Nov 1, 2016 at 0:42 | |||||
| Oct 31, 2016 at 17:26 | history | closed |
András Bátkai Wolfgang Franz Lemmermeyer coudy Stefan Kohl♦ |
Not suitable for this site | |
| Oct 31, 2016 at 15:27 | comment | added | Anthony Quas | The way I like to approach questions like this (not unlike one of the answers in the post in Serguei Popov's answer) is to approximate the difference equation by the differential equation $\dot x=-x^{2/3}$. For this d.e., it's easy to answer your question. | |
| Oct 31, 2016 at 13:56 | review | Close votes | |||
| Oct 31, 2016 at 17:26 | |||||
| Oct 31, 2016 at 13:30 | answer | added | Serguei Popov | timeline score: 2 | |
| Oct 31, 2016 at 12:33 | history | asked | Bruno Brogni Uggioni | CC BY-SA 3.0 |