Last updated on: 2021-08-04.

Under Development

A collection of classical geometry in computable formats along with code and diagrams.

Computable Euclid

Theorems

The primes are infinite. This is a theorem because Euclid proves it (Book 9, Proposition 20). A proof usually requires some earlier definitions, postulates or axioms, such as the definition of an integer or a prime. In science, facts proven true are usually called scientific laws, such as Newton’s Laws of Motion.