Question

algorithms - When not to assume $n$ is a power of 2, while solving recurrences?

score 1.1k · Answer 1 · 2019-05-23 01:01:46

1.1k

Views

algorithms - When not to assume $n$ is a power of 2, while solving recurrences?

Published on 23 May 2019 - 1:01

score 93 · Answer 2 · 2019-05-25 13:38:04

93

Views

Solution to non-homogeneous second order difference equation

Published on 25 May 2019 - 13:38

score 66 · Answer 3 · 2019-05-25 14:32:43

Solve recurrence with characteristic polynomial $a_n=7\cdot a_{n-1} -7\cdot a_{n-2}+175\cdot a_{n-3}+450\cdot a_{n-4}+(5+13\cdot n)\cdot9^n $

score 58 · Answer 4 · 2026-03-30 01:53:11

58

Views

Solving this inhomogenous system of two linear recurrence relations

Published on 30 Mar 2026 - 1:53

score 87 · Answer 5 · 2019-05-25 15:06:48

87

Views

Showing that generating function coefficients agree with recurrence relation

Published on 25 May 2019 - 15:06

score 36 · Answer 6 · 2026-03-26 22:17:45

36

Views

Need proof/explanation for a problem involving factorials

Published on 26 Mar 2026 - 22:17

score 440 · Answer 7 · 2026-03-26 19:17:15

440

Views

Recurrence $f_{n+2}=af_{n+1}+bf_n$

Published on 26 Mar 2026 - 19:17

score 281 · Answer 8 · 2026-03-25 19:07:22

281

Views

Show that the $n$-th Fibonacci number is given by $\frac{\cosh na}{\cosh a}$ or $\frac{\sinh na}{\cosh a}$, where $\sinh a=1/2$

Published on 25 Mar 2026 - 19:07

score 79 · Answer 9 · 2019-05-26 17:52:16

79

Views

how to find the $n^{th}$ term of the recurrence relation $a_n = a_{n - a_{n-1}} + a_{n-1 - a_{n-2}}$?

Published on 26 May 2019 - 17:52

score 233 · Answer 10 · 2026-03-25 06:39:04

233

Views

Recurrence relations and power series solution

Published on 25 Mar 2026 - 6:39

score 29 · Answer 11 · 2026-03-25 20:41:31

29

Views

Recurrence for A000670

Published on 25 Mar 2026 - 20:41

score 1.6k · Answer 12 · 2019-05-28 19:35:43

1.6k

Views

How can I create this formula for number of moves in the FROG game?

Published on 28 May 2019 - 19:35

score 48 · Answer 13 · 2019-05-28 21:33:53

48

Views

Prove recurrence relation for sum $\ R_k (q,n) = \sum_{i=1}^n i^k*q^i$

Published on 28 May 2019 - 21:33

score 62 · Answer 14 · 2019-05-29 09:09:27

62

Views

How to obtain general terms

Published on 29 May 2019 - 9:09

score 183 · Answer 15 · 2019-05-29 14:05:22

183

Views

Simplest way to prove uniqueness of solution to recurrence relation

Published on 29 May 2019 - 14:05

List Question

algorithms - When not to assume $n$ is a power of 2, while solving recurrences?

Solution to non-homogeneous second order difference equation

Solve recurrence with characteristic polynomial $a_n=7\cdot a_{n-1} -7\cdot a_{n-2}+175\cdot a_{n-3}+450\cdot a_{n-4}+(5+13\cdot n)\cdot9^n $

Solving this inhomogenous system of two linear recurrence relations

Showing that generating function coefficients agree with recurrence relation

Need proof/explanation for a problem involving factorials

Recurrence $f_{n+2}=af_{n+1}+bf_n$

Show that the $n$-th Fibonacci number is given by $\frac{\cosh na}{\cosh a}$ or $\frac{\sinh na}{\cosh a}$, where $\sinh a=1/2$

how to find the $n^{th}$ term of the recurrence relation $a_n = a_{n - a_{n-1}} + a_{n-1 - a_{n-2}}$?

Recurrence relations and power series solution

Recurrence for A000670

How can I create this formula for number of moves in the FROG game?

Prove recurrence relation for sum $\ R_k (q,n) = \sum_{i=1}^n i^k*q^i$

How to obtain general terms

Simplest way to prove uniqueness of solution to recurrence relation

Trending Questions

Popular # Hahtags

Popular Questions