Ladder

Euclidean algorithm — the ladder

One essay so far against this idea. A ladder is the distinct arguments that stand against one idea, and this one has room to grow.
  1. 131385322 × 131 × 81 × 51 × 31 × 22 × 1gcd(34, 13) = 1

    The oldest algorithm, drawn as a tiling

    Euclid's method for finding a greatest common divisor is usually presented as a loop. It is also a way of tiling a rectangle with squares, and the tiling explains why it works.

    rung 1 · geometry

All ladders