We follow Euclid from the elementary idea of division with remainder to unique prime factorization in the natural numbers, by way of the Euclidean algorithm. We also glimpse some more general concepts - algebraic integers, rings, and fields - that throw more light on ordinary integers. In particular, we show how the Pell equation can be solved with the help of quadratic integers.