Learn R Programming

genscore (version 1.0.2.2)

gcd: Finds the greatest (positive) common divisor of two integers.

Description

Finds the greatest (positive) common divisor of two integers; if one of them is 0, returns the absolute value of the other number.

Usage

gcd(a, b)

Value

The greatest (positive) common divisor of two integers; if one of them is 0, returns the absolute value of the other number.

Arguments

a

An integer.

b

An integer.

Examples

Run this code
gcd(1, 2)
gcd(1, -2)
gcd(12, -18)
gcd(-12, 18)
gcd(15, 0)
gcd(0, -15)
gcd(0, 0)

Run the code above in your browser using DataLab