#'
#' Greatest common divisor (GCD)
#'
#' This is used by the Intermarket Spread objects
#' to find the largest, common contract size.
#'
#' @param a An integer
#' @param b Another integer
#' @return The greatest common divisor of \code{a} and \code{b}
#' @seealso Algorithm is descibed on
#' \href{ https://en.wikipedia.org/wiki/Euclidean_algorithm}{Wikipedia}
#' @export
#'
gcd = function(a, b) {
while (b != 0) {
t <- b
b <- a %% b
a <- t
}
return(a)
}
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.