NAME    gcd - greatest common divisor of a set of rational numbersSYNOPSIS    gcd(x1, x2, ...)TYPES    x1, x2, ... rational number    return	rational numberDESCRIPTION    If at least one xi is nonzero, gcd(x1, x2, ...) is the    greatest positive number g for which each xi is a multiple of g.    If all xi are zero, the gcd is zero.EXAMPLE    ; print gcd(12, -24, 30), gcd(9/10, 11/5, 4/25), gcd(0,0,0,0,0)    6 .02 0LIMITS    The number of arguments may not to exceed 1024.LINK LIBRARY    NUMBER *qgcd(NUMBER *x1, NUMBER *x2)SEE ALSO    lcm## Copyright (C) 1999-2006  Landon Curt Noll#### Calc is open software; you can redistribute it and/or modify it under## the terms of the version 2.1 of the GNU Lesser General Public License## as published by the Free Software Foundation.#### Calc is distributed in the hope that it will be useful, but WITHOUT## ANY WARRANTY; without even the implied warranty of MERCHANTABILITY## or FITNESS FOR A PARTICULAR PURPOSE.	 See the GNU Lesser General## Public License for more details.#### A copy of version 2.1 of the GNU Lesser General Public License is## distributed with calc under the filename COPYING-LGPL.  You should have## received a copy with calc; if not, write to Free Software Foundation, Inc.## 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.#### @(#) $Revision: 29.4 $## @(#) $Id: gcd,v 29.4 2006/06/22 23:49:22 chongo Exp $## @(#) $Source: /usr/local/src/cmd/calc/help/RCS/gcd,v $#### Under source code control:	1995/10/05 04:52:26## File existed as early as:	1995#### chongo <was here> /\oo/\	http://www.isthe.com/chongo/## Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/