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 details)
File details
Details for the file artextest-0.0.2.tar.gz.
File metadata
- Download URL: artextest-0.0.2.tar.gz
- Upload date:
- Size: 2.5 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.2 CPython/3.9.1
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 0b03b71a13c775b92195053091d3a49715d78364fdd25a86f5081d723d277fd0 |
|
| MD5 | 2c516f9da963f80ab4fad25ecea7b6d2 |
|
| BLAKE2b-256 | 5afe291262a050f1e1581ad441bc5a5e2b651dc5f63fab3ce9a2a2a708823811 |
