From: gautier_niouzes@hotmail.com (Gautier)
Subject: Re: source code for lcm or gcd
Date: 27 Apr 2002 02:03:28 -0700
Date: 2002-04-27T09:03:28+00:00 [thread overview]
Message-ID: <17cd177c.0204270103.6ed1194a@posting.google.com> (raw)
In-Reply-To: 4hiy8.62$EE5.70008@news.uswest.net
> 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!
prev parent reply other threads:[~2002-04-27 9:03 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
2002-04-26 19:55 source code for lcm or gcd Terry Westley
2002-04-27 9:03 ` Gautier [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox