HCF: Finds hcf of any set of positive integers

Description Usage Arguments Details Value References Examples

View source: R/HCF.R

Description

Finds the highest common factor (hcf) of a set of integer numbers greater than zero (Euclidean algorithm).

Usage

1

Arguments

...

any set of positive integers, in any order, for which the hcf is required.

Details

Finds the hcf of any set of positive integers which can be in any order.

Value

hcf

References

Euclidean algorithm, see:https://mathworld.wolfram.com/EuclideanAlgorithm.html

Examples

1
2
3
# hcf of vectors of integers
HCF(56,77,616)
HCF(3,56,77,616) 

blocksdesign documentation built on April 8, 2021, 1:07 a.m.