The Universal Euclidean Algorithm: Computing RU Strings and Summation Problems
Introduction
Consider the following geometric problem: mark all vertical lines x = c and horizontal lines y = c where c ∈ ℤ on a plane. Now consider a line y = (px + r)/q where p, r ∈ ℕ and q ∈ ℕ₊. Since the residue class of r modulo q determines the behavior, we can assume r < q without loss of generality.
Imagine a moving point traveling a ...
Posted on Sun, 28 Jun 2026 18:06:32 +0000 by gli