0% found this document useful (0 votes)
13 views1 page

Theoretical Computer Science Cheat Sheet

The document provides an overview of theoretical computer science concepts including Taylor series, expansions, power series, binomial theorem, and summation formulas. Key points include: - Taylor series can be used to represent functions as infinite sums of terms involving derivatives evaluated at a specific point. - Common functions like exponential, logarithm, trigonometric can be expressed as power series expansions involving infinite sums. - Ordinary, exponential, and Dirichlet power series are defined by the type of coefficients in the infinite sum representation. - The binomial theorem and difference of like powers formulas relate sums involving powers of added or subtracted terms. - Formulas are provided for operations on and integrals of power series representations of functions.

Uploaded by

marvinmartes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views1 page

Theoretical Computer Science Cheat Sheet

The document provides an overview of theoretical computer science concepts including Taylor series, expansions, power series, binomial theorem, and summation formulas. Key points include: - Taylor series can be used to represent functions as infinite sums of terms involving derivatives evaluated at a specific point. - Common functions like exponential, logarithm, trigonometric can be expressed as power series expansions involving infinite sums. - Ordinary, exponential, and Dirichlet power series are defined by the type of coefficients in the infinite sum representation. - The binomial theorem and difference of like powers formulas relate sums involving powers of added or subtracted terms. - Formulas are provided for operations on and integrals of power series representations of functions.

Uploaded by

marvinmartes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Theoretical Computer Science Cheat Sheet

Series
Taylors series:

(x a)i
(x a)2
f (x) = f (a) + (x a)f (a) +
f (a) + =
f (i) (a).
2
i!
i=0
Expansions:

1
xi ,
= 1 + x + x2 + x3 + x4 +
=
1x
i=0

1
= 1 + cx + c2 x2 + c3 x3 +
=
ci xi ,
1 cx
i=0

1
n
2n
3n
=
1
+
x
+
x
+
x
+

=
xni ,
1 xn
i=0

x
2
3
4
= x + 2x + 3x + 4x +
=
ixi ,
(1 x)2
i=0

n { }

n
k!z k
n 2
n 3
n 4
=
x
+
2
x
+
3
x
+
4
x
+

=
in xi ,
k (1 z)k+1
i=0
k=0

xi
=
,
ex
= 1 + x + 12 x2 + 16 x3 +
i!
i=0

xi
ln(1 + x)
= x 12 x2 + 13 x3 14 x4
=
(1)i+1 ,
i
i=1

i
x
1
ln
= x + 12 x2 + 13 x3 + 14 x4 +
=
,
1x
i
i=1

x2i+1
1 3
1 5
1 7
sin x
= x 3! x + 5! x 7! x + =
(1)i
,
(2i + 1)!
i=0

x2i
1 2
1 4
1 6
cos x
= 1 2!
x + 4!
x 6!
x + =
,
(1)i
(2i)!
i=0

x2i+1
tan1 x
= x 13 x3 + 15 x5 17 x7 +
=
(1)i
,
(2i + 1)
i=0
( )

n i
2
x
+

=
(1 + x)n
= 1 + nx + n(n1)
x,
2
i
i=0
)
(

(n+2) 2
1
i+n i
= 1 + (n + 1)x + 2 x + =
x,
(1 x)n+1
i
i=0

Bi xi
x
1
1 2
1
4
=
1

x
+
x

x
+

=
,
2
12
720
x
e 1
i!
i=0
( )

1
2i i
1
2
3
(1 1 4x)
= 1 + x + 2x + 5x +
=
x,
2x
i+1 i
i=0
( )

1
2i i

= 1 + 2x + 6x2 + 20x3 +
=
x,
i
1 4x
i=0

(
)n
)
(

(4+n) 2
1 1 4x
2i + n i
1

= 1 + (2 + n)x + 2 x + =
x,
2x
i
1 4x
i=0

1
1
3 2
11 3
25 4
ln
= x + 2 x + 6 x + 12 x + =
Hi xi ,
1x 1x
i=1
(
)2

Hi1 xi
1
1
4
x
+

=
ln
= 12 x2 + 34 x3 + 11
,
24
2
1x
i
i=2

x
2
3
4
=
x
+
x
+
2x
+
3x
+

=
Fi x i ,
1 x x2
i=0

Fn x
2
3
=
F
x
+
F
x
+
F
x
+

=
Fni xi .
n
2n
3n
1 (Fn1 + Fn+1 )x (1)n x2
i=0

Ordinary power series:

A(x) =
ai xi .
i=0

Exponential power series:

xi
A(x) =
ai .
i!
i=0
Dirichlet power series:

ai
A(x) =
.
ix
i=1
Binomial theorem:
n ( )

n nk k
(x + y)n =
x
y .
k
k=0

Dierence of like powers:


n1

xn y n = (x y)
xn1k y k .
k=0

For ordinary power series:

A(x) + B(x) =
(ai + bi )xi ,
i=0

xk A(x) =
A(x)

k1
i=0
xk

aik xi ,

i=k
i

ai x

A(cx) =

ai+k xi ,

i=0

ci ai xi ,

i=0

A (x) =
(i + 1)ai+1 xi ,
i=0

xA (x) =

iai xi ,

i=1

A(x) dx =

ai1
i=1

A(x) + A(x)
=
2
A(x) A(x)
=
2

xi ,

a2i x2i ,

i=0

a2i+1 x2i+1 .

i=0

i
Summation: If bi = j=0 ai then
1
B(x) =
A(x).
1x
Convolution:

A(x)B(x) =
aj bij xi .
i=0

j=0

God made the natural numbers;


all the rest is the work of man.
Leopold Kronecker

You might also like