euclidean: Takes the euclidian algorithm

Description Usage Arguments Value References Examples

View source: R/euclidean.R

Description

An algorithm that computes the greatest common divisor (GDC) of two numeric numbers.

Usage

1
euclidean(a, b)

Arguments

a

shall be a numeric value and a scalar

b

shall be a numeric value and a scalar

Value

Returns a numeric scalar that is the greatest common divisor of a and b.

References

The info about the algorithm can be found at this link wikepedia.

Examples

1
2
euclidean(123612, 13892347912)
euclidean(100, 1000)

vasterlund/Lab3_Albin_Eric documentation built on Oct. 9, 2017, 8:20 p.m.