This package will use a Euclidian Algorithm to find the Greatest Common Denominator of two numbers. It is a test package for a course in Advanced R Programming at Linköping University, Sweden.
|Author||Torrin Danner [aut],|
|Maintainer||Torrin Danner <email@example.com>|
|Package repository||View on GitHub|
Install the latest version of this package by entering the following in R:
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.