List questions from recurrence-relations

Published on 28 Mar 2026 - 12:55

60

Views

The convergence of a recurrcively defined sequence.

Published on 23 Nov 2014 - 6:13

2.4k

Views

Solving a recurrence with diagonalization?

Published on 28 Mar 2026 - 20:50

995

Views

Solve the recurrence $T(n)=aT(n-1)+bn$

Published on 28 Mar 2026 - 22:26

755

Views

If the average of 2 successive years’ production 1/2($a_n + a_{n-1}$) is 2n + 5 and $a_0=3$, find $a_n$.

Published on 23 Nov 2014 - 20:05

1.3k

Views

Solve the recurrence relation $a_n=3a_{n-1}+n^2-3$, with $a_0=1$.

Published on 23 Nov 2014 - 21:10

4.2k

Views

Find and solve a recurrence relation for the number of n-digit ternary sequences in which no 1 appears to the right of any 2.

Published on 23 Nov 2014 - 23:13

102

Views

Show that it is the solution of the recurrence

Published on 24 Nov 2014 - 0:28

51

Views

Second Order Recurrence Relation with Exogenous Forcing Sequence

Published on 24 Nov 2014 - 14:46

57

Views

Define a sequence of integers $H(n)$ by $H(0) = 1$, $H(1) = 3$ and $H(n+1) = H(n) + H(n-1)$?

Published on 24 Nov 2014 - 15:08

78

Views

A second order problem on recurrence relation equals 3^n

Published on 24 Nov 2014 - 16:42

28

Views

Tips on effectively representing this recurrence relation in a generalized form.

Published on 24 Nov 2014 - 22:22

707

Views

Concrete Mathematics Josephus Problem: How to prove 1.17 & 1.18

Published on 25 Nov 2014 - 16:48

42

Views

Solution Verification: turning recurrence relation into asymptotic bound with master theorem

Published on 29 Mar 2026 - 3:21

224

Views

Closed Form Solution for Recurrence Relation

Published on 29 Mar 2026 - 22:12

List Question

Solution of recurrence

The convergence of a recurrcively defined sequence.

Solving a recurrence with diagonalization?

Solve the recurrence $T(n)=aT(n-1)+bn$

If the average of 2 successive years’ production 1/2($a_n + a_{n-1}$) is 2n + 5 and $a_0=3$, find $a_n$.

Solve the recurrence relation $a_n=3a_{n-1}+n^2-3$, with $a_0=1$.

Find and solve a recurrence relation for the number of n-digit ternary sequences in which no 1 appears to the right of any 2.

Show that it is the solution of the recurrence

Second Order Recurrence Relation with Exogenous Forcing Sequence

Define a sequence of integers $H(n)$ by $H(0) = 1$, $H(1) = 3$ and $H(n+1) = H(n) + H(n-1)$?

A second order problem on recurrence relation equals 3^n

Tips on effectively representing this recurrence relation in a generalized form.

Concrete Mathematics Josephus Problem: How to prove 1.17 & 1.18

Solution Verification: turning recurrence relation into asymptotic bound with master theorem

Closed Form Solution for Recurrence Relation

Trending Questions

Popular # Hahtags

Popular Questions