GitHub / Soren2007 / algorithm-GCD-and-LCM-590
The Greatest Common Divisor (GCD) of two integers is the largest positive integer that divides both numbers without leaving a remainder.The Least Common Multiple (LCM) of two integers is the smallest positive integer that is a multiple of both numbers.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Soren2007%2Falgorithm-GCD-and-LCM-590
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: Python
Size: 0 Bytes
Dependencies parsed at: Pending
Created at: 3 months ago
Updated at: 3 months ago
Pushed at: 3 months ago
Last synced at: 3 months ago
Topics: algorithm, algorithms, gcd, lcm, python, python3