Theoretical Computer Science Cheat Sheet

Series Escher’s Knot

Expansions:
∞    −n ∞  
1 1 X n+i i 1 X i
n+1
ln = (Hn+i − Hn ) x, = xi ,
(1 − x) 1−x i=0
i x i=0
n
∞   ∞  
X n i X i n!xi
xn = x, x
(e − 1) n
= ,
i=0
i i=0
n i!
n ∞   ∞
i n!xi (−4)i B2i x2i

1 X X
ln = , x cot x = ,
1−x i=0
n i! i=0
(2i)!
∞ 2i 2i 2i−1 ∞
i−1 2 (2 − 1)B2i x 1
X X
tan x = (−1) , ζ(x) = x
,
i=1
(2i)! i=1
i
∞ ∞
1 X µ(i) ζ(x − 1) X φ(i)
= x
, = ,
ζ(x) i=1
i ζ(x) i=1
ix
Y 1
ζ(x) = , Stieltjes Integration
p
1 − p−x
∞
If G is continuous in the interval [a, b] and F is nondecreasing then
X d(i) Z b
ζ 2 (x)
P
= where d(n) = d|n 1,
xi G(x) dF (x)
i=1 a
∞
X S(i) P exists. If a ≤ b ≤ c then
ζ(x)ζ(x − 1) = where S(n) = d|n d, Z c b c
xi
Z Z
i=1 G(x) dF (x) = G(x) dF (x) + G(x) dF (x).
2n−1
2 |B2n | 2n a a b
ζ(2n) = π , n ∈ N, If the integrals involved exist
(2n)! Z b Z b Z b
∞
x (4i − 2)B2i x2i


X G(x) + H(x) dF (x) = G(x) dF (x) + H(x) dF (x),
= (−1)i−1 , a a a
sin x i=0
(2i)! Z b Z b Z b
√ n ∞



1 − 1 − 4x X n(2i + n − 1)! G(x) d F (x) + H(x) = G(x) dF (x) + G(x) dH(x),
= xi , a a a
2x i=0
i!(n + i)! Z b Z b

Z b
∞ i/2 iπ c · G(x) dF (x) = G(x) d c · F (x) = c G(x) dF (x),
x
X 2 sin 4 i a a a
e sin x = x, b b
i!
Z Z
i=1 G(x) dF (x) = G(b)F (b) − G(a)F (a) − F (x) dG(x).
√
s
∞ a a
1− 1−x (4i)!
If the integrals involved exist, and F possesses a derivative F ′ at every
X
= √ xi ,
x i=0
i
16 2(2i)!(2i + 1)! point in [a, b] then
2 ∞ Z b Z b
4i i!2

arcsin x X
= x2i . G(x) dF (x) = G(x)F ′ (x) dx.
x i=0
(i + 1)(2i + 1)! a a

Cramer’s Rule Fibonacci Numbers

00 47 18 76 29 93 85 34 61 52
If we have equations: 86 11 57 28 70 39 94 45 02 63
a1,1 x1 + a1,2 x2 + · · · + a1,n xn = b1 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, . . .
95 80 22 67 38 71 49 56 13 04
a2,1 x1 + a2,2 x2 + · · · + a2,n xn = b2 59 96 81 33 07 48 72 60 24 15
Definitions:
.. .. .. 73 69 90 82 44 17 58 01 35 26 Fi = Fi−1 +Fi−2 , F0 = F1 = 1,
. . . 68 74 09 91 83 55 27 12 46 30 F−i = (−1) Fi , i−1

an,1 x1 + an,2 x2 + · · · + an,n xn = bn 37 08 75 19 92 84 66 23 50 41

 
14 25 36 40 51 62 03 77 88 99
Fi = √15 φi − φ̂i ,
Let A = (ai,j ) and B be the column matrix (bi ). Then 21 32 43 54 65 06 10 89 97 78 Cassini’s identity: for i > 0:
there is a unique solution iff det A 6= 0. Let Ai be A
with column i replaced by B. Then
42 53 64 05 16 20 31 98 79 87
Fi+1 Fi−1 − Fi2 = (−1)i .
det Ai Additive rule:
xi = . The Fibonacci number system:
det A Every integer n has a unique Fn+k = Fk Fn+1 + Fk−1 Fn ,
representation F2n = Fn Fn+1 + Fn−1 Fn .
Improvement makes strait roads, but the crooked n = Fk1 + Fk2 + · · · + Fkm , Calculation by matrices:
roads without Improvement, are roads of Genius. where ki ≥ ki+1 + 2 for all i,
   n
Fn−2 Fn−1 0 1
– William Blake (The Marriage of Heaven and Hell) 1 ≤ i < m and km ≥ 2. = .
Fn−1 Fn 1 1