## Arial vs. Century Gothic

After reading 'Switch to Century Gothic to save the planet', I did a few experiments to see how much more paper is likely to be consumed by text written in Century Gothic font than that written in Arial font.

Software: Microsoft Office Word 2003 Page size: Letter (8.5 × 11") Margins: 1" top and bottom, 1.25" left and right

Trial 1: Text generated using =rand() function of Microsoft Word and random keystrokes.

Arial 10 pt: 1000 pages Century Gothic 10 pt: 1097 pages

Trial 2: Text from RFC 2617 repeated many times.

Arial 10 pt: 1000 pages Century Gothic 10 pt: 1077 pages

Trial 3: Text from Csh Programming Considered Harmful repeated many times.

Arial 10 pt: 1000 pages Century Gothic 10 pt: 1078

Trial 4: Text from Solving the impossible puzzle repeated many times.

Arial 10 pt: 1000 pages Century Gothic 10 pt: 1103 pages

Trial 5: Text from The value of science repeated many times.

Arial 10 pt: 1000 pages Century Gothic 10 pt: 1077 pages

## Font tests

font-family: sans-serif

From the fundamental theorem of arithmetic, we know that any integer greater than 1 can be expressed as a unique product of primes. A corollary of this theorem is:

Any positive integer N > 1 can be written uniquely in a canonical form N = p1k1p2k2 … pnkn where, each ki is a positive integer and each pi is a prime for positive integers i, 1 ≤ i ≤ n.
Euler's theorem states that if n is a positive integer and a is a positive integer coprime to n, then
aφ(n) ≡ 1 (mod n)
The integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:
ab f(x) dx = F(a) - b(a)
where ddx F(x) = f(x)
font-family: arial

From the fundamental theorem of arithmetic, we know that any integer greater than 1 can be expressed as a unique product of primes. A corollary of this theorem is:

Any positive integer N > 1 can be written uniquely in a canonical form N = p1k1p2k2 … pnkn where, each ki is a positive integer and each pi is a prime for positive integers i, 1 ≤ i ≤ n.
Euler's theorem states that if n is a positive integer and a is a positive integer coprime to n, then
aφ(n) ≡ 1 (mod n)
The integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:
ab f(x) dx = F(a) - b(a)
where ddx F(x) = f(x)
font-family: helvetica

From the fundamental theorem of arithmetic, we know that any integer greater than 1 can be expressed as a unique product of primes. A corollary of this theorem is:

Any positive integer N > 1 can be written uniquely in a canonical form N = p1k1p2k2 … pnkn where, each ki is a positive integer and each pi is a prime for positive integers i, 1 ≤ i ≤ n.
Euler's theorem states that if n is a positive integer and a is a positive integer coprime to n, then
aφ(n) ≡ 1 (mod n)
The integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:
ab f(x) dx = F(a) - b(a)
where ddx F(x) = f(x)
font-family: 'trebuchet ms'

From the fundamental theorem of arithmetic, we know that any integer greater than 1 can be expressed as a unique product of primes. A corollary of this theorem is:

Any positive integer N > 1 can be written uniquely in a canonical form N = p1k1p2k2 … pnkn where, each ki is a positive integer and each pi is a prime for positive integers i, 1 ≤ i ≤ n.
Euler's theorem states that if n is a positive integer and a is a positive integer coprime to n, then
aφ(n) ≡ 1 (mod n)
The integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:
ab f(x) dx = F(a) - b(a)
where ddx F(x) = f(x)
font-family: georgia

From the fundamental theorem of arithmetic, we know that any integer greater than 1 can be expressed as a unique product of primes. A corollary of this theorem is:

Any positive integer N > 1 can be written uniquely in a canonical form N = p1k1p2k2 … pnkn where, each ki is a positive integer and each pi is a prime for positive integers i, 1 ≤ i ≤ n.
Euler's theorem states that if n is a positive integer and a is a positive integer coprime to n, then
aφ(n) ≡ 1 (mod n)
The integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:
ab f(x) dx = F(a) - b(a)
where ddx F(x) = f(x)
font-family: monospace

From the fundamental theorem of arithmetic, we know that any integer greater than 1 can be expressed as a unique product of primes. A corollary of this theorem is:

Any positive integer N > 1 can be written uniquely in a canonical form N = p1k1p2k2 … pnkn where, each ki is a positive integer and each pi is a prime for positive integers i, 1 ≤ i ≤ n.
Euler's theorem states that if n is a positive integer and a is a positive integer coprime to n, then
aφ(n) ≡ 1 (mod n)
The integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:
ab f(x) dx = F(a) - b(a)
where ddx F(x) = f(x)
font-family: 'bistream sans vera mono'

From the fundamental theorem of arithmetic, we know that any integer greater than 1 can be expressed as a unique product of primes. A corollary of this theorem is:

Any positive integer N > 1 can be written uniquely in a canonical form N = p1k1p2k2 … pnkn where, each ki is a positive integer and each pi is a prime for positive integers i, 1 ≤ i ≤ n.
Euler's theorem states that if n is a positive integer and a is a positive integer coprime to n, then
aφ(n) ≡ 1 (mod n)
The integral of a function f over the interval [a, b] can be calculated by finding an antiderivative F of f:
ab f(x) dx = F(a) - b(a)
where ddx F(x) = f(x)