gcd: Greatest common divisor

Description Usage Arguments Examples

View source: R/prime.R

Description

Find the largest integer, that when two numbers are divided by it, returns an integer in both cases

Usage

1
gcd(x, y)

Arguments

x, y

integers whose greates common divisor is to be found

Examples

1
gcd(sequence(10:16), rep(10:16, 10:16))

AkselA/R-ymse documentation built on March 21, 2020, 9:52 a.m.