PUZZLE #3603: Euclidean Algorithm (diff 7)

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

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

DATA

A	`75`
B	`20`
Hint	`While b ≠ 0: (a, b) = (b, a % b). Starting from (75, 20), it takes 3 steps. 3 % 26 = 3 → 'd'.`
Answer Format	`single lowercase letter`

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

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