euclidean: Euclidian

Description Usage Arguments Value References Examples

Description

Given 2 values (x and y), the function choose the greatest (for example x) one and replace it with modular of the other (x mod y) until remainer is equal to zero.

Usage

1
euclidean(x, y)

Arguments

x

first number

y

second number

Value

returns greater common divisor of two value

References

wikipedia page

Examples

1
euclidean(100, 1000) 

rubicco/AdvRProgramming documentation built on May 9, 2019, 7:37 a.m.