Hello all, the DeltaDelta operator on functions mathcalNtomathbbR
(where mathcalN denotes lbrace1,2,ldots,rbrace )defined by
Delta(f)(n)=f(n+1)−f(n) is well-known and
it is not very hard to show by induction that
f is a polynomial of degree leqk iff Deltak+1(f) is identically zero, where
Deltak+1 denotes Delta iterated k+1 times. Now I say that
a function f:mathcalNtomathbbR is "almost polynomial" iff
Deltak(f) is a bounded function for some k.
My question is : let lambda>0 be a non-integer, and let
f(n)=nlambda. Is it true that f is almost polynomial ?
No comments:
Post a Comment