L

A
T
E
X Examples
Albert Einstein
Institute for Advanced Study
Princeton University
einstein@gmail.com
Niels Bohr
Institute of Theoretical Physics
University of Copenhagen
bohr@yahoo.com
June 17, 2014
Abstract
In this paper we talk about L
A
T
E
X and give examples of nice formulas.
1 Introduction
L
A
T
E
X is the best way to write formulas. Besides, it is completely free, so
why not use it. The simplest way to get your own installation is to go to
http://tug.org/texlive and follow the instructions there.
2 Brief History of L
A
T
E
X
L
A
T
E
X was created by Leslie Lamport [1] in the early 1980s (yes, there were
computers back then), to simplify the use of Donald Knuths T
E
X typesetting
system. T
E
X had been created in the 1970s (yes, there were computers even in
the 1970s). For more history and the pronunciation guide, please see Wikipedia.
3 Greek Letters
Here is how to write some of the most commonly used Greek letters: , , , ,
, , , , . Some Greek letters have two versions: , , and , . Of course,
there are also capital letters: A, B, , , , , , , . . .
1
4 Formulas
Finally, in this section we show examples of nice formulas.
Einsteins formula [2]:
E = mc
2
Herons formula:
A =
_
s(s a)(s b)(s c) where s =
a + b + c
2
The law of cosines:
a
2
= b
2
+ c
2
2bc cos
Pythagorean theorem as a special case of the Law of cosines:
= 90
o
cos = 0 a
2
= b
2
+ c
2
Scalar product of two vectors:
x y = |x||y| cos(x, y)
Fermats little theorem
a
p1
1 (mod p)
Newtons binomial formula:
(1 + x)
n
=
_
n
0
_
x
0
+
_
n
1
_
x
1
+
_
n
2
_
x
2
+
_
n
3
_
x
3
+ . . . +
_
n
n
_
x
n
Sums:
1 + 2 + 3 + . . . + n =
n(n + 1)
2
1
2
+ 2
2
+ 3
2
+ . . . + n
2
=
n(n + 1)(2n + 1)
6
1
3
+ 2
3
+ 3
3
+ . . . + n
3
=
n
2
(n + 1)
2
4
Eulers sum:

n=1
1
n
2
=
1
1
2
+
1
2
2
+
1
3
2
+ . . . =

2
6
2
5 Exercises
Try to write these formulas yourself:
1. Stewarts formula:
a(p
2
+ mn) = mb
2
+ nc
2
2. Cute formula:
1
3
+ 2
3
+ 3
3
+ . . . + n
3
= (1 + 2 + 3 + . . . + n)
2
3. Riemanns zeta function:
(s) =

n=1
1
n
s
=
1
1
s
+
1
2
s
+
1
3
s
+ . . .
4. Binomial coecient:
_
n
k
_
=
n!
(n k)! k!
5. Golden ratio:
=
1 +

5
2
= 1.618024 . . .
6. Cassinis identity:
F
n1
F
n+1
F
2
n
= (1)
n
7. Fibonacci in Pascals triangle:
_
n
0
_
+
_
n 1
1
_
+
_
n 2
2
_
+
_
n 3
3
_
+ . . . = F
n+1
8. Sum of binomial coecients:
_
n
0
_
+
_
n
1
_
+
_
n
2
_
+
_
n
3
_
+ . . . +
_
n
n
_
= 2
n
3
9. Newton and Pascal:
(1 + x)
0
= 1
(1 + x)
1
= 1 + x
(1 + x)
2
= 1 + 2x + x
2
(1 + x)
3
= 1 + 3x + 3x
2
+ x
3
(1 + x)
4
= 1 + 4x + 6x
2
+ 4x
3
+ x
4

Pierre de Fermat (c. 1601 1665)
6 Challenges
How about this?
1. Eulers formula:
a
(n)
1 (mod n)
2. Stirlings approximation:
n!

2n
_
n
e
_
n
3. Laplace transform:
F(s) =
_

0
e
st
f(t) dt
4. Schrodingers equation:
i

t
(x, t) =

2
2m

2
(x, t) + V (x)(x, t)
7 Whats Next?
We did not demonstrate many useful tricks that often come in handy. For
example:
Picking font sizes, faces, . . . . Hint: italic, bold, LARGE, . . .
Including pictures into the text. Hint: use epsfig or some other package.
Making tables. Hint: use tabular.
4
References
[1] L. Lamport, L
A
T
E
X A Document Preparation System, Second Edition,
Addison-Wesley, Reading, MA, 1994.
[2] A. Einstein, Ist die Tragheit eines Korpers von seinem Energieinhalt
abhangig?, Annalen der Physik, Vol. 18, pp. 639643, 1905.
5
a
(n)
= 1 (mod n)
6
x
4
3x
2
y
2
+ y
4
= x
4
2
3
2
x
2
y
2
+ y
4
= x
4
2
3
2
x
2
y
2
+
_
3
2
y
2
_
2

5
4
y
4
=
_
x
2

3
2
y
2
_
2

5
4
y
4
=
_
x
2

3
2
y
2

5
2
y
2
__
x
2

3
2
y
2
+

5
2
y
2
_
=
_
x
2

3 +

5
2
y
2
__
x
2

5
2
y
2
_
7

b
(n) =
1
_
n
3
_
n = 6
8