Processing math: 100%

Taylor's formula

Theorem

k,nN, k>n
fCk(Rn,R)
postulate f(x)=|α|k1α!f(α)(0) xα+Rk(x)

with

postulate Rk(x)=|α|=k+1k+1α!(10 (1s)k F(α)(s x) ds) xα

where we use multi-index notation for αFinSequence(N), see Multi-index power.

Discussion

fC(R,R), aR

f(x)=n=0f(n)(a)1n!(xa)n

Reference

Parents

Context

Link to graph
Log In
Improvements of the human condition