Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap

greatest common divisor

You are here: irt.org | FOLDOC | greatest common divisor

<mathematics> (GCD) A function that returns the largest positive integer that both arguments are integer multiples of.

See also Euclid's Algorithm. Compare: lowest common multiple.


Nearby terms: gray-scale « GRE « greater than « greatest common divisor » greatest lower bound » Great Renaming » Great Runes

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb