One function that gets the greatest common divisor between two numbers.
Project description
This is a simple library with just a single algorithm that gets the greatest common divisor between two given numbers.
Function: getGCD(m, n)
Example: `print(getGCD(166,44))`
Output: `2`
Change Log
0.0.1 (2023/01/02)
First Release
0.0.2 (2023/01/02)
Second Release
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
artextest-0.0.2.tar.gz
(2.5 kB
view hashes)
