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

View source: R/domain.R

gcdR Documentation

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)

Arguments

a

An integer.

b

An integer.

Value

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

Examples

gcd(1, 2)
gcd(1, -2)
gcd(12, -18)
gcd(-12, 18)
gcd(15, 0)
gcd(0, -15)
gcd(0, 0)

genscore documentation built on May 31, 2023, 6:28 p.m.