News

GitHub2y
A python program that will find the GCD (Greatest Common Divisor) and LCM (Least Common Multiple) of two integer numbers.
Since 0 <= r < B < A, the largest number of the pair (B, r) is smaller than the largest number of the pair (A,B). Repeat the process in (2), but use B instead of A and r instead of B. The repetitions ...
GitHub2y
A simple Python function to take the GCF(greatest common factor) of any number of numbers. Useful as a module to plug into other programs and includes an extra function for ...
fraction_simplify is a program that only takes two numbers, a numerator and denominator, and simplifies the fraction into the most basic integer format using the getGCF() function from gcf.py. Another ...