AN INDEPENDENT READING ROOMFIRST EDITION · REVIEW COPY

THREE SMALL EXPERIMENTS

The mathematics room

Historical ideas, modern tools. These interactive explanations use present-day notation and algorithms; they do not reconstruct historical software or prove historical priority.

01 / GEOMETRY & ASTRONOMY

A sine is a length

For a circle of radius r, the historical sine is a length r sin θ: half a chord subtending 2θ at the centre. Our circle has radius 1. Move θ and compare the vertical projection with the full chord.

θ = 30° · sin θ = 0.500000

cos θ = 0.866025 · Full chord = 1.000000

The modern sine is the ratio (sine length) ÷ radius, so it has no units. At 0° the chord collapses; at 90° it is a diameter. The diagram uses the same scale on both axes.

Read about Āryabhaṭa →
Sine and chord on a unit circleAt 30 degrees, the sine length is 0.5 and the full chord is 1.Or = 1
Bold vertical segment: sine length. Thin vertical line: full chord.

02 / INFINITE SERIES

How close is close enough?

Compare two series associated with the Kerala tradition. Each alternating sum approaches π, but their speed differs dramatically. We show raw partial sums, without the historical end corrections.

4 × Σ (−1)ᵏ / (2k + 1), k = 0, …, n − 1

n = 8

3.017071817072

Truncation error ≤ 0.2353

Difference from Math.PI: 0.1245

The next omitted term bounds the mathematical truncation error. Beyond about 14 decimal digits, floating-point rounding dominates; more terms cannot guarantee more displayed digits. Math.PI is a floating-point reference, not an exact value.

Read about Mādhava →

FIRST PARTIAL SUMS

First eight sums, or all sums if fewer than eight terms are chosen.
nApproximation to π
14.000000000
22.666666667
33.466666667
42.895238095
53.339682540
62.976046176
73.283738484
83.017071817

π ≈ 3.141592653589793

Slow series bound: 4/(2n + 1). Faster series bound: √12 / ((2n + 1) × 3ⁿ). Both follow from decreasing alternating terms.

03 / NUMBER & PATTERN

How many ways to make a number?

A partition writes a positive integer as a sum of positive integers, ignoring order. Thus 3 + 1 and 1 + 3 are the same partition. This modern counting algorithm makes Ramanujan’s congruence p(5k + 4) ≡ 0 (mod 5) visible in small examples.

p(4) = 5

4 = 5 × 0 + 4; p(4) = 5 is divisible by 5.

Exact integer arithmetic counts every partition. The list shows the first 32 at most, in decreasing lexicographic order. Finite examples illustrate the congruence; they do not prove it for all integers.

p(4) = 5 · p(9) = 30
p(14) = 135 · p(19) = 490

Read about Ramanujan →

ALL 5 PARTITIONS

  • 4
  • 3 + 1
  • 2 + 2
  • 2 + 1 + 1
  • 1 + 1 + 1 + 1

All diagrams and code are original to this project. Historical sources appear in the linked articles and bibliography. Attribution