math_gcd

math_gcd-method

math_gcd,numeric,numeric-method

Computes the greatest common divisor (GCD) of two integer using the Euclidean
algorithm.

A dependency-free collection of simple functions for cleaning
rectangular data. This package allows to detect, count and replace
values or discard rows/columns using a predicate function. In
addition, it provides tools to check conditions and return informative
error messages.

Nicolas Frerebeau

arkhe

Tools for Cleaning Rectangular Data

Brice Lebrun

Université Bordeaux Montaigne 

CNRS 

math_gcd function

<dl><dt>x, y</dt>
<dd>A <code><a href="/link/numeric?package=arkhe&version=1.10.0" data-mini-rdoc="arkhe::numeric">numeric</a></code> vector.</dd></dl>

Arguments

Author

Greatest Common Divisor — math_gcd

<dl>

<dt>x, y</dt>
<dd>A <code><a href='https://rdrr.io/r/base/numeric.html'>numeric</a></code> vector.</dd>

</dl>

math_gcd: Greatest Common Divisor

Description

Usage

Value

Arguments

Author

See Also