Line-wrap euclid description

Author: simonlindholm

content/number-theory/euclid.h

@@ -2,7 +2,9 @@
  * Author: Unknown
  * Date: 2002-09-15
  * Source: predates tinyKACTL
- * Description: Finds the Greatest Common Divisor to the integers $a$ and $b$. Euclid also finds two integers $x$ and $y$, such that $ax+by=\gcd(a,b)$. If $a$ and $b$ are coprime, then $x$ is the inverse of $a \pmod{b}$.
+ * Description: Finds the Greatest Common Divisor to the integers $a$ and $b$.
+ * Euclid also finds two integers $x$ and $y$, such that $ax+by=\gcd(a,b)$.
+ * If $a$ and $b$ are coprime, then $x$ is the inverse of $a \pmod{b}$.
  */
 #pragma once