Mercurial > hg > octave-lyh
diff scripts/elfun/lcm.m @ 1026:9fc405c8c06c
[project @ 1995-01-11 21:17:01 by jwe]
author | jwe |
---|---|
date | Wed, 11 Jan 1995 21:17:01 +0000 |
parents | 3470f1e25a79 |
children | 611d403c7f3d |
line wrap: on
line diff
--- a/scripts/elfun/lcm.m +++ b/scripts/elfun/lcm.m @@ -1,11 +1,30 @@ +# Copyright (C) 1995 John W. Eaton +# +# This file is part of Octave. +# +# Octave is free software; you can redistribute it and/or modify it +# under the terms of the GNU General Public License as published by the +# Free Software Foundation; either version 2, or (at your option) any +# later version. +# +# Octave 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 General Public License +# for more details. +# +# You should have received a copy of the GNU General Public License +# along with Octave; see the file COPYING. If not, write to the Free +# Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. + function l = lcm (a, ...) +# usage: lcm (a, ...) +# # lcm (a) returns the least common multiple of the entries of the # integer vector a. # lcm (a1, ..., ak) is the same as lcm([a1, ..., ak]). -# Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Sep 16, 1994 -# Copyright Dept of Statistics and Probability Theory TU Wien +# Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Sep 16, 1994. if (nargin > 1) va_start; @@ -24,7 +43,7 @@ a = abs (a); l = a (1); for k = 1:(length (a) - 1) - l = l * a(k+1) / gcd(l, a(k+1)); + l = l * a(k+1) / gcd (l, a(k+1)); endfor endif