Skip to content

adding a proper fractions algorithm #11224

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 10 commits into from
Mar 20, 2024
42 changes: 42 additions & 0 deletions maths/numerical_analysis/proper_fractions.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,42 @@
def gcd(numerator: int, denominator: int) -> int:
"""
>>> gcd(12, 18)
6
>>> gcd(20, 25)
5
>>> gcd(20, 0)
Traceback (most recent call last):
ValueError: The Denominator cannot be 0
"""
if denominator == 0:
raise ValueError("The Denominator cannot be 0")
while denominator:
numerator, denominator = denominator, numerator % denominator
return numerator


def proper_fractions(denominator: int) -> list[str]:
"""
this algorithm returns a list of proper fractions, in the
range between 0 and 1, which can be formed with the given denominator
>>> proper_fractions(10)
['1/10', '3/10', '7/10', '9/10']
>>> proper_fractions(5)
['1/5', '2/5', '3/5', '4/5']
>>> proper_fractions(-15)
Traceback (most recent call last):
ValueError: The Denominator Cannot be less than 0
>>>
"""

if denominator < 0:
raise ValueError("The Denominator Cannot be less than 0")
fractions: list[str] = []
for numerator in range(1, denominator):
if gcd(numerator, denominator) == 1:
fractions.append(f"{numerator}/{denominator}")
return fractions


if __name__ == "__main__":
__import__("doctest").testmod()