From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,f6ac3b009d5334ec
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-04-27 02:03:28 PST
Path: archiver1.google.com!postnews1.google.com!not-for-mail
From: gautier_niouzes@hotmail.com (Gautier)
Newsgroups: comp.lang.ada
Subject: Re: source code for lcm or gcd
Date: 27 Apr 2002 02:03:28 -0700
Organization: http://groups.google.com/
Message-ID: <17cd177c.0204270103.6ed1194a@posting.google.com>
References: <4hiy8.62$EE5.70008@news.uswest.net>
NNTP-Posting-Host: 217.162.107.126
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 8bit
X-Trace: posting.google.com 1019898208 1196 127.0.0.1 (27 Apr 2002 09:03:28
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: 27 Apr 2002 09:03:28 GMT
Xref: archiver1.google.com comp.lang.ada:23167
Date: 2002-04-27T09:03:28+00:00
List-Id: <comp.lang.ada>

> Does anyone know of Ada source code for least common multiple or greatest
> common divisor?  If you've got source code for gcd, that's great, since
> lcm (a, b) = (a * b) / gcd (a, b).

You may be interested by the generic GCD in Euclidean_Ring_Tools
(biblio/eurintoo.ad*) of mathpaqs.zip on the page below.
There are 3 or more applications, one using long_long_integer
(tests/test_ert.adb), one with multi-precision integers
(tests/test_rsa.adb) and one with polynomials (tests/teflopol.adb)

HTH
________________________________________________________
Gautier  --  http://www.mysunrise.ch/users/gdm/gsoft.htm

NB: For a direct answer, address on the Web site!