X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=doc%2Fgcd.texi;h=4384a708df7da1e3dfe672a7f14e13fdae77fdd6;hb=7422b7ede18016dea87d207cbb7535428afba3ec;hp=51f40352b5d8da8bd8176516dfab86f53fb990cf;hpb=a897449aaae8e6c051f3b9daaf984de5c5e092f3;p=gnulib.git

diff --git a/doc/gcd.texi b/doc/gcd.texi
index 51f40352b..4384a708d 100644
--- a/doc/gcd.texi
+++ b/doc/gcd.texi
@@ -2,10 +2,10 @@
 @section gcd: greatest common divisor
 @findex gcd
 
-@c Copyright (C) 2006 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.2 or
+@c under the terms of the GNU Free Documentation License, Version 1.3 or
 @c any later version published by the Free Software Foundation; with no
 @c Invariant Sections, with no Front-Cover Texts, and with no Back-Cover
 @c Texts.  A copy of the license is included in the ``GNU Free
@@ -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