An exercise for the reader

An exercise for the reader

Take the following two large numbers:

• $(a)$ Apply the Euclidean algorithm to compute $\gcd(p,q)$.
• $(b)$ Let $q_0, q_1, \ldots, q_n$ denote the successive quotients obtained in $(a)$. Determine $n$.
• $(c)$ Let $\Sigma$ denote the set of printable ASCII characters and let $f \colon \{0,\ldots,127\} \to \Sigma$ be the function mapping each integer to the character with that code point. Evaluate the string $f(q_0)\, f(q_1) \cdots f(q_n)$.

# use this python oneliner
f=lambda p,q:[p//q]+f(q,p%q)if q else[];print(''.join(map(chr,f(5213436955487338931744369,72398891673349755598314))))