List questions from recurrence-relations

Published on 07 Oct 2016 - 11:54

65

Views

How to solve this equation with recurrence

Published on 09 Apr 2026 - 2:41

8k

Views

Tiling a $2×N$ rectangle with $1×1$ and $2×1$ tiles

Published on 26 Mar 2026 - 16:05

106

Views

How to solve this type of recursive formula?

Published on 10 Apr 2026 - 3:58

103

Views

Master Theorem: How can $ 2^m *2^.5 = m/2?$

Published on 08 Oct 2016 - 17:33

203

Views

Trying to simplify a logarithmic exponent

Published on 09 Apr 2026 - 4:55

40

Views

How to solve recurrence relations?

Published on 09 Apr 2026 - 19:46

44

Views

Find the limit of the sequence given by $a_{n+1}=3-\frac{1}{a_n}$ with $a_1=1$

Published on 08 Oct 2016 - 20:37

76

Views

How to find $n$-th term of a recursive sequence without matrix exponentiation?

Published on 09 Apr 2026 - 23:43

103

Views

Prove that $\forall n\in \mathbb{N},\:\left[n+\left(-1\right)^n\right]\in \mathbb{N}$

Published on 09 Oct 2016 - 15:45

772

Views

How do I solve the recurrence relation $A_n=2A_{n-1}+3 | A_0=1$

Published on 09 Oct 2016 - 16:17

41

Views

A Question on the paper "A Simple Computation of Zeta 2k"

Published on 02 Apr 2026 - 0:36

88

Views

How to get $a_{n+2}-a_{n+1}=\frac{a_n-a_{n+1}}{2}$ from $a_{n+2} = \frac{a_n + a_{n+1}}{2}$

Published on 10 Oct 2016 - 6:14

114

Views

$\gcd(a_n ,a_{n+k})< \frac{a_k}2$ for a sequence such that $a_{k+2}=a_{k+1}+a_k$ and $\gcd(a_1,a_2)=1$

Published on 30 Mar 2026 - 5:38

199

Views

Can we recursively define all possible cardinalities of infinite sets?

Published on 11 Apr 2026 - 18:14

List Question

Solve $a_n - 4a_{n-1} + 4a_{n-2} = 2^n$

How to solve this equation with recurrence

Tiling a $2×N$ rectangle with $1×1$ and $2×1$ tiles

How to solve this type of recursive formula?

Master Theorem: How can $ 2^m *2^.5 = m/2?$

Trying to simplify a logarithmic exponent

How to solve recurrence relations?

Find the limit of the sequence given by $a_{n+1}=3-\frac{1}{a_n}$ with $a_1=1$

How to find $n$-th term of a recursive sequence without matrix exponentiation?

Prove that $\forall n\in \mathbb{N},\:\left[n+\left(-1\right)^n\right]\in \mathbb{N}$

How do I solve the recurrence relation $A_n=2A_{n-1}+3 | A_0=1$

A Question on the paper "A Simple Computation of Zeta 2k"

How to get $a_{n+2}-a_{n+1}=\frac{a_n-a_{n+1}}{2}$ from $a_{n+2} = \frac{a_n + a_{n+1}}{2}$

$\gcd(a_n ,a_{n+k})< \frac{a_k}2$ for a sequence such that $a_{k+2}=a_{k+1}+a_k$ and $\gcd(a_1,a_2)=1$

Can we recursively define all possible cardinalities of infinite sets?

Trending Questions

Popular # Hahtags

Popular Questions