Hyphen and dash fixes.

[gnulib.git] / doc / gcd.texi

diff --git a/doc/gcd.texi b/doc/gcd.texi
index 6f62b99..21d6bd4 100644 (file)
--- a/doc/gcd.texi
+++ b/doc/gcd.texi
@@ -35,8 +35,8 @@ WORD_T GCD (WORD_T a, WORD_T b);
 If you need the least common multiple of two numbers, it can be computed
 like this: @code{lcm(a,b) = (a / gcd(a,b)) * b} or
 @code{lcm(a,b) = a * (b / gcd(a,b))}.
-Avoid the formula @code{lcm(a,b) = (a * b) / gcd(a,b)} because - although
-mathematically correct - it can yield a wrong result, due to integer overflow.
+Avoid the formula @code{lcm(a,b) = (a * b) / gcd(a,b)} because---although
+mathematically correct---it can yield a wrong result, due to integer overflow.
 
 In some applications it is useful to have a function taking the gcd of two
 signed numbers. In this case, the gcd function result is usually normalized