Searched defs:gcd (Results 1 - 5 of 5) sorted by relevance

/osnet-11/usr/src/cmd/perl/5.8.4/distrib/t/op/
H A Drecurse.t16 sub gcd { subroutine
17 return gcd($_[0] - $_[1], $_[1]) if ($_[0] > $_[1]);
18 return gcd($_[0], $_[1] - $_[0]) if ($_[0] < $_[1]);
52 is(gcd(1147, 1271), 31, "gcd(1147, 1271) == 31");
54 is(gcd(1908, 2016), 36, "gcd(1908, 2016) == 36");
/osnet-11/usr/src/lib/libmp/common/
H A Dold_mp.c29 void gcd(MINT *a, MINT *b, MINT *c) { mp_gcd(a, b, c); } function
/osnet-11/usr/src/lib/libparted/common/libparted/cs/
H A Dnatmath.c41 PedSector gcd; /* "converges" to the gcd */ member in struct:__anon2220
194 * gcd, x and y, such that:
196 * gcd = greatest common divisor of a and b
197 * gcd = x*a + y*b
206 result.gcd = a;
213 result.gcd = tmp.gcd;
258 * = A * (\p a * gcd) + B * (\p b * gcd)
[all...]
/osnet-11/usr/src/lib/libc/port/gen/
H A Dgetopt_long.c105 static int gcd(int, int);
157 gcd(int a, int b) function
188 ncycle = gcd(nnonopts, nopts);
/osnet-11/usr/src/common/mpi/
H A Dmpi.c2062 ... by computing the product, and dividing out the gcd.
2067 mp_int gcd, prod; local
2073 if((res = mp_init(&gcd, FLAG(a))) != MP_OKAY)
2080 if((res = mp_gcd(a, b, &gcd)) != MP_OKAY)
2083 res = mp_div(&prod, &gcd, c, NULL);
2088 mp_clear(&gcd);

Completed in 59 milliseconds