Why does one `elif` branch handing back an int instead of a Fraction quietly break multiplication for the whole class?
Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.
The helper from the lecture is about to run on n = 84 and d = 36:
while d != 0: (d, n) = (n%d, d) return n
Work the loop through on paper. Assign to gcd_trace a list holding the pair (n, d) as it stands after each tuple assignment, in order — one tuple per pass of the loop, and nothing else in the list.