Jump to content

GCD(a, b)

From Hackerpedia
Revision as of 01:42, 15 January 2026 by imported>Unknown user
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Languages: English | Français

GCD(a, b)

Greatest Common Divisor of two positive integers a and b. For example, GCD(12, 16) = 4.


Source: NIST SP 800-56B Rev. 2 | Category: