All Questions
Tagged with computability-theory closed-form-expressions
2 questions
1
vote
1
answer
67
views
Recursive formula for divided differences
In general, a function $f(\cdot)$ defined at points $x_1,x_2,\dots, x_k$, the $(k − 1)$th-order
divided difference is defined by the recurrence relation:
$$
f[x_1,x_2,\dots...x_k]=\frac{f[x_2,\dots......
1
vote
0
answers
95
views
Derive a closed-form expression of this recursive formula
$$\begin{equation}
S(r,k) = f(r)S(0,k-1) + g(r)S(r+1,k-1)
\end{equation}\ ,$$
where $r=0,1,2,\dots$ and $k=1,2,3,\dots$ . Also, $0<f(r)<1$ is an increasing function and $0<g(r)<1$ is a ...