X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;ds=sidebyside;f=doc%2Fgcd.texi;h=4384a708df7da1e3dfe672a7f14e13fdae77fdd6;hb=a2d14e0a98bd1ccaed9f860c4988e59581293a0b;hp=ea4b4e76499bf3433d07e79fa37c775af1d37f49;hpb=d60f3b0c6b0f93a601acd1cfd3923f94ca05abb0;p=gnulib.git

diff --git a/doc/gcd.texi b/doc/gcd.texi
index ea4b4e764..4384a708d 100644
--- a/doc/gcd.texi
+++ b/doc/gcd.texi
@@ -2,7 +2,7 @@
 @section gcd: greatest common divisor
 @findex gcd
 
-@c Copyright (C) 2006, 2009-2011 Free Software Foundation, Inc.
+@c Copyright (C) 2006, 2009-2014 Free Software Foundation, Inc.
 
 @c Permission is granted to copy, distribute and/or modify this document
 @c under the terms of the GNU Free Documentation License, Version 1.3 or
@@ -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