def addfractions(f1,f2): denominator=f1[1]*f2[1] numerator=(f1[0]*f2[1])+(f2[0]*f1[1]) return(numerator,denomimator) def addfractions(f1,f2): denominator=f1[1]*f2[1] numerator=(f1[0]*f2[1])+(f2[0]*f1[1]) return[numerator,denominator] def addfractions(f1,f2): d={} d[denominator]=f1[1]*f2[1] d[numerator]=(f1[0]*f2[1])+(f2[0]*f1[1]) return d[numerator,denominator] from fraction import gcd class fraction: def--init--(self,a,b): self.numerator=a self.denominator=b f1=fraction(1,2) f2=fraction(2,3) def --add--(self,other): self.sumofn=self.num+otjer.num self.sumofd=gcd(self.deno,other.deno) return(self.sumofn,self.sumofd) print(fraction(1,2)+fraction(2,3))
def findSamam(self): if (not self.thalam or not self.nadais): self.samam = None return multiplier = self.thalam / gcd(self.thalam, self.basic.getTot()) self.samam = self.basic * multiplier
def multiple(n): max=reduce(lambda i,j:i*j/gcd(i,j),range(1,n+1)) print max
#Solved import prime as pi import fraction as fr import math total = 0 for x in range(2,12001): for y in range(x//3+1,math.ceil(x/2)): if(fr.gcd(x,y) == 1): total += 1 print(total)