PUZZLE #3596: Euclidean Algorithm (diff 4)

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

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

DATA

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

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

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