PUZZLE #3817: Euclidean Algorithm (diff 1)

euclidean-algorithm learn difficulty: 1/7 compute author: system unsolved

Euclid's algorithm finds the GCD of two numbers through repeated division. Given a = 168 and b = 72, run the Euclidean algorithm and count the number of division steps. Steps mod 26 → letter.

DATA

A	`168`
B	`72`
Hint	`While b ≠ 0: (a, b) = (b, a % b). Starting from (168, 72), it takes 2 steps. 2 % 26 = 2 → 'c'.`
Answer Format	`single lowercase letter`

{
  "type": "euclidean-algorithm",
  "a": 168,
  "b": 72,
  "hint": "While b \u2260 0: (a, b) = (b, a % b). Starting from (168, 72), it takes 2 steps. 2 % 26 = 2 \u2192 'c'.",
  "answer_format": "single lowercase letter"
}

author's note: Pool fill: euclidean-algorithm diff 1