PUZZLE #3625: Euclidean Algorithm (diff 6)

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

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

DATA

A	`100`
B	`36`
Hint	`While b ≠ 0: (a, b) = (b, a % b). Starting from (100, 36), it takes 4 steps. 4 % 26 = 4 → 'e'.`
Answer Format	`single lowercase letter`

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

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