List questions from recurrence-relations

Published on 07 Dec 2019 - 4:01

990

Views

Solve the recurrence relation $a_n = -a_{n-1} + n^2,\ n \geq 1$, $a_{0}$ = 3

Published on 07 Dec 2019 - 7:55

177

Views

proof : even nth Fibonacci number using Mathematical Induction

Published on 28 Mar 2026 - 17:00

96

Views

Comparing asymptotics in the constant/nonconstant case for linear recurrence of order 2

Published on 07 Dec 2019 - 14:30

51

Views

solve the following using generating function

Published on 01 Apr 2026 - 3:58

475

Views

recurrence relations and closed form

Published on 08 Dec 2019 - 5:23

2.4k

Views

The monster continued fraction

Published on 26 Mar 2026 - 14:40

78

Views

Find a closed form recurrence relation $T(n) = 3T(n - 2) + 2T(n - 3) + 4$; $T(0) = 0$, $T(1) = 0$, $T(2) = 5$.

Published on 08 Dec 2019 - 10:25

157

Views

Solving recurrence relation with non-constant coefficient.

Published on 02 Apr 2026 - 6:14

767

Views

Find the solution to the recurrence relation $a_n=4a_{n-1}-5a_{n-2}+(-1)^n$, where $a_0 = 1, a_1 = 1, n \geq 2$

Published on 08 Dec 2019 - 15:30

77

Views

Prove that a recurrence for Rule 30 is: B2=MOD(A1+B1+(1+B1)*C1,2)

Published on 23 Feb 2026 - 2:57

27

Views

Solving recurrent sequences.

Published on 08 Dec 2019 - 22:08

324

Views

Recurrence relation and permutations

Published on 01 Apr 2026 - 5:24

623

Views

Find the recurrence relation solution. $a_n$ = $a_{n-1} + 3n - 5$

Published on 09 Dec 2019 - 4:07

45

Views

Is there a solution for this non-linear recurrence relation?

Published on 09 Dec 2019 - 17:06

List Question

Show that n! is equal to the recursive derangement.

Solve the recurrence relation $a_n = -a_{n-1} + n^2,\ n \geq 1$, $a_{0}$ = 3

proof : even nth Fibonacci number using Mathematical Induction

Comparing asymptotics in the constant/nonconstant case for linear recurrence of order 2

solve the following using generating function

recurrence relations and closed form

The monster continued fraction

Find a closed form recurrence relation $T(n) = 3T(n - 2) + 2T(n - 3) + 4$; $T(0) = 0$, $T(1) = 0$, $T(2) = 5$.

Solving recurrence relation with non-constant coefficient.

Find the solution to the recurrence relation $a_n=4a_{n-1}-5a_{n-2}+(-1)^n$, where $a_0 = 1, a_1 = 1, n \geq 2$

Prove that a recurrence for Rule 30 is: B2=MOD(A1+B1+(1+B1)*C1,2)

Solving recurrent sequences.

Recurrence relation and permutations

Find the recurrence relation solution. $a_n$ = $a_{n-1} + 3n - 5$

Is there a solution for this non-linear recurrence relation?

Trending Questions

Popular # Hahtags

Popular Questions