Description Usage Arguments Value References Examples

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

1 | ```
euclidean(a, b)
``` |

`a` |
shall be a numeric value and a scalar |

`b` |
shall be a numeric value and a scalar |

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

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

1 2 |

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

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.