Graph Software for Scientists and Engineers

GCD(a,b)

Returns the greatest common divisor of two integers. The greatest common divisor is the largest integer that divides both numbers without a remainder. If either number is not an integer, it is truncated. The GCD function will always return a positive result, regardless of whether one or both numbers are negative.

GCD(18,84)=6

GCD(7,0)=7

GCD(36,48)=12

See also:

LCM
Trigonometric and General Math Functions

$
195.
00
 
RUNS ON
Windows 10,
Windows 8,
Windows 7, 2008,
Vista, XP, NT,
ME, 2003, 2000,
Windows 98, 95
Copyright © 2001-2019 Hydesoft Computing, LLC