All Questions

Let $a,b \in \mathbb{N} \ \ s.t. \ \ a > b$ have $\gcd(a,b) =1$. We can define the Hirzebruch-Jung modified euclidean algorithm as follows: Let $e_i \in \mathbb{N} >2$, and $ r_k \in \mathbb{N}$...