Timeline for Solving unusual recurrence with two variables
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 26, 2020 at 11:53 | comment | added | plop | @OfirGordon That's right. For $n>2C$ there are terms in the formula in which the second entry is larger than $C$. Those are equal to $1$ and don't continue to be expanded. | |
| Aug 26, 2020 at 11:50 | history | edited | plop | CC BY-SA 4.0 |
added 301 characters in body
|
| Aug 26, 2020 at 11:26 | comment | added | Ofir Gordon | @polp. Another thing, when placing $k=n-C$ you ignore the other possible boundary condition - $T(n,0)=1$. If $n-k>>C$ than the equation will converge must faster, giving a tighter bound. Is it possible to take the other condition into consideraion as well? | |
| Aug 25, 2020 at 11:32 | comment | added | plop | @OfirGordon You can see it in the second-to-last equation. The purpose is to get to the boundary conditions $T(C,i)=1$. | |
| Aug 25, 2020 at 7:14 | vote | accept | Ofir Gordon | ||
| Aug 25, 2020 at 6:57 | comment | added | Ofir Gordon | Thanks that looks good. Can you please explain why you're applying $k=n-C$? | |
| Aug 24, 2020 at 15:06 | history | edited | plop | CC BY-SA 4.0 |
added 2 characters in body
|
| Aug 24, 2020 at 15:00 | history | edited | plop | CC BY-SA 4.0 |
added 2 characters in body
|
| Aug 24, 2020 at 14:36 | history | answered | plop | CC BY-SA 4.0 |