in Combinatory edited by
133 views
0 votes
0 votes
Let $\{a_{n}\}$ be a sequence of real numbers. The backward differences of this sequence are defined recursively as shown next. The first difference $\triangledown a_{n}$ is
$$\triangledown a_{n} = a_{n} − a_{n−1}.$$
The $(k + 1)^{\text{st}}$ difference $\triangledown^{k+1}a_{n}$ is obtained from $\triangledown ^{k} a_{n}$ by
$$\triangledown ^{k+1}a_{n} = \triangledown^{k}a_{n} − \triangledown ^{k}a_{n−1}.$$
Show that $a_{n−2} = a_{n} − 2\triangledown a_{n} + \triangledown^{2}a_{n}.$
in Combinatory edited by
by
133 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true