Skip to main content

Questions tagged [recurrence-relations]

Questions regarding functions defined recursively, such as the Fibonacci sequence.

Filter by
Sorted by
Tagged with
5 votes
1 answer
149 views

Question: Let $$p(\lambda) =\lambda^3 -2\lambda^2+\lambda. $$ Can $p(\lambda)$ be the characteristic polynomial of a linear difference equation? Justify. My answer: Yes, because there exists a ...
epsilon's user avatar
  • 3,235
6 votes
5 answers
314 views

I was investigating the iterated function formed by the following JavaScript code, trying to find an invariant that can prove that the system doesn't slowly diverge: ...
Bojidar Marinov's user avatar
0 votes
0 answers
43 views

Suppose I have the recurrence relation $$ f(r) = \alpha + \beta \sum_{s=1}^{r-1}f(s), \qquad r \geq 2$$ for some $\alpha, \beta > 0$ and initial condition $f(1) = \gamma > 0$. This gives a ...
Fly in the wind's user avatar
0 votes
1 answer
72 views

I am a bit rusty on the topic, and I have been presented the following exercise I am not really sure how to deal with. We have the sequence $$ \begin{cases} x_0 \geq 0 \\ x_{n+1} = 2|x_n -1| \end{...
tommy1996q's user avatar
  • 3,766
0 votes
2 answers
76 views

A permutation $p_{1}, p_{2}, p_{3}, \dots p_{n}$ For each $i = 1, 2, 3, \dots, n-1$, there exists a $j > i$ such that $\lvert p_{j} - p_{i} \rvert = 1$. For example, the orderly permutation of $n = ...
bluesquid29's user avatar
2 votes
0 answers
96 views

There was recently a question that was marked as duplicate of this question and then deleted. But the way I understood it was that the selection of the batch was done without replacement. Anyhow I'll ...
ploosu2's user avatar
  • 12.7k
3 votes
1 answer
89 views

Consider the functional-recurrence equation \begin{align}\tag{1}\label{1} \partial_x f_n(x)=f_{n-1}(x), \end{align} what conditions must we impose to guarantee a unique solution? There are several ...
Eli Bartlett's user avatar
  • 2,546
1 vote
0 answers
37 views

Reading literature related to the problem of multiplicative partitions A001055 OEIS sequence (also named "factorizatio numerorum", "Oppenheim problem", "factorizations ...
24th_moonshine's user avatar
1 vote
0 answers
173 views

Recurrence formula for $\pi$ with convergence order $2m+1$: $$ x_{n+1} = x_n + \sum_{k=1}^{m} \left[ (-1)^{m+k} \cdot \frac{1}{k} \prod_{\substack{j=1 \\ j \ne k}}^{m} \frac{j^{2}}{k^{2} - j^{2}} \...
vengy's user avatar
  • 2,603
0 votes
0 answers
47 views

In the book of sakurai Modern Quantum Mechanics they have this $$ \begin{aligned} & \sqrt{(j \mp m)(j \pm m+1)}\left\langle j_1 j_2 ; m_1 m_2 \mid j_1 j_2 ; j, m \pm 1\right\rangle \\ & =\sqrt{...
amilton moreira's user avatar
0 votes
1 answer
100 views

In the book of sakurai Modern Quantum Mechanics they have this $$ \begin{aligned} & \sqrt{(j \mp m)(j \pm m+1)}\left\langle j_1 j_2 ; m_1 m_2 \mid j_1 j_2 ; j, m \pm 1\right\rangle \\ & =\sqrt{...
amilton moreira's user avatar
6 votes
2 answers
475 views

I started with the following recurrence relation $$ s \left( n \right) = s \left( n-1 \right)^{2} - 1, \qquad s \left( 0 \right) = 2$$ and got to $$\sum_{n=0}^{\infty}s\left(n+1\right)x^{n}=\sum_{n=0}^...
user avatar
0 votes
0 answers
55 views

I know that given a linear homogeneous recurrence relation of order k: $$a_n = c_1 a_{n-1} + c_2 a_{n-2} + \cdots + c_k a_{n-k}$$ We can get the characteristic equation: $$r^n = c_1 r^{n-1} + c_2 r^{n-...
Sean's user avatar
  • 59
1 vote
2 answers
89 views

I'm looking for references for using analogies with differential equations to study recursive sequences. For example $u_{n+1} = \sin(u_n)$. It's not difficult to show that if $u_0$ is between 0 and $\...
Héhéhé's user avatar
  • 1,479
1 vote
0 answers
86 views

Compute the value of $$\sqrt{1 + F_2\sqrt{1 + F_4\sqrt{1 + F_6\sqrt{1 + F_{2n}\ldots}}}}$$ where $F_n$ denotes the $n$-th Fibonacci number with $F_0 = 0$, $F_1 = 1$. This is a problem from a sheet ...
Aklsh's user avatar
  • 51

15 30 50 per page
1
2 3 4 5
624