Navigation:  Reference > Functions >

GCD function

 Print this Topic Previous pageReturn to chapter overviewNext page

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

Functions

 

Page url: https://www.dplot.com/help/index.htm?gcd.htm