Description Usage Arguments Details Value References Examples
Finds the highest common factor (hcf) of a set of integer numbers greater than zero (Euclidean algorithm).
1 |
... |
any set of positive integers, in any order, for which the hcf is required. |
Finds the hcf of any set of positive integers which can be in any order.
hcf
Euclidean algorithm, see:https://mathworld.wolfram.com/EuclideanAlgorithm.html
1 2 3 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.