powered by
Finds the highest common factor (hcf) of a set of integer numbers greater than zero (Euclidean algorithm).
HCF(...)
any set of positive integers, in any order, for which the hcf is required.
hcf
Finds the hcf of any set of positive integers which can be in any order.
Euclidean algorithm, see:https://mathworld.wolfram.com/EuclideanAlgorithm.html
# NOT RUN { # hcf of vectors of integers HCF(56,77,616) HCF(3,56,77,616) # }
Run the code above in your browser using DataLab