class Fraction:
"""Class for performing fraction arithmetic.
Each Fraction has two attributes: a numerator, n and a deconominator, d.
Both must be integer and the deonominator cannot be zero."""
def __init__(self,n,d):
"""Performs error checking and standardises to ensure denominator is
positive"""
if type(n)!=int or type(d)!=int:
raise TypeError("n and d must be integers")
if d==0:
raise ValueError("d must be positive")
elif d<0:
self.n = -n
self.d = -d
else:
self.n = n
self.d = d
def __str__(self):
"""Gives string representation of Fraction (so we can use print)"""
return(str(self.n) + "/" + str(self.d))
def __add__(self, otherFrac):
"""Produces new Fraction for the sum of two Fractions"""
newN = self.n*otherFrac.d + self.d*otherFrac.n
newD = self.d*otherFrac.d
newFrac = Fraction(newN, newD)
return(newFrac)
def __sub__(self, otherFrac):
"""Produces new Fraction for the difference between two Fractions"""
newN = self.n*otherFrac.d - self.d*otherFrac.n
newD = self.d*otherFrac.d
newFrac = Fraction(newN, newD)
return(newFrac)
def __mul__(self, otherFrac):
"""Produces new Fraction for the product of two Fractions"""
newN = self.n*otherFrac.n
newD = self.d*otherFrac.d
newFrac = Fraction(newN, newD)
return(newFrac)
def __truediv__(self, otherFrac):
"""Produces new Fraction for the quotient of two Fractions"""
newN = self.n*otherFrac.d
newD = self.d*otherFrac.n
newFrac = Fraction(newN, newD)
return(newFrac)
As code showed above, how can I print
Fraction(1,3) == Fraction(2,6)
As example:
Fraction(1,2) + Fraction(1,3)
Fraction(1,2) - Fraction(1,3)
Fraction(1,2) * Fraction(1,3)
Fraction(1,2) / Fraction(1,3)
They are all work for calculation every time. And when I try to print fraction(1,3) == fraction(2,6), it come out as False
. How can I let it calculate as True
?
How can I do it without using import fraction
.
Try this:
def __eq__(self, other):
return self.n*other.d == self.d*other.n
As pointed out in the comments, there is no need to implement the __ne__
.
EDIT: As requested in the comments to this answer, here is a method for simplifying fractions.
The simplification of fraction implies dividing both numbers by the greatest common divisor. As posted in here the code is rather simple
# return the simplified version of a fraction
def simplified(self):
# calculate the greatest common divisor
a = self.n
b = self.d
while b:
a, b = b, a%b
# a is the gcd
return Fraction(self.n/a, self.d/a)
I hope it helps.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With