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}$...

Consider the Euclidean algorithm (EA) as a way to measure the relative length $b/a$ of a shorter stick $b$ compared to a longer one $a$ by recursively determining $$q_i = \left\lfloor \frac{r_i}{r_{...