def reModulo(self, num, div, modby):
[_, remain] = poly.divPoly(num, div)
return poly.modPoly(remain, modby)
b = q.multPoly(c1, c2)
if (a != b):
print "Failed on Case:"
print "a * b"
print "a", a
print "b", b
break
# TESINGING DIVISION FUNCTION
if q.trim(c2) == [0]:
continue
try:
[a1, a2] = P.polydiv(c1, c2)
a1 = q.trim(a1.tolist())
a2 = q.trim(a2.tolist())
[b1, b2] = q.divPoly(c1, c2)
b1 = map(float, b1)
b2 = map(float, b2)
a1 = map(lambda x: round(x, 5), a1)
a2 = map(lambda x: round(x, 5), a2)
b1 = map(lambda x: round(x, 5), b1)
b2 = map(lambda x: round(x, 5), b2)
except:
print "BREAKING ON EXCEPTION"
print "Failed on Case:"
print "C1", c1
print "C2", c2
print "a / b"
print "a", a1, a2
print "b", b1, b2
break
b=q.multPoly(c1,c2) if(a!=b): print "Failed on Case:" print "a * b" print "a",a print "b",b break # TESINGING DIVISION FUNCTION if q.trim(c2)==[0]: continue try: [a1,a2]=P.polydiv(c1,c2) a1=q.trim(a1.tolist()) a2=q.trim(a2.tolist()) [b1,b2]=q.divPoly(c1,c2) b1=map(float,b1) b2=map(float,b2) a1=map(lambda x: round(x,5),a1) a2=map(lambda x: round(x,5),a2) b1=map(lambda x: round(x,5),b1) b2=map(lambda x: round(x,5),b2) except: print "BREAKING ON EXCEPTION" print "Failed on Case:" print "C1",c1 print "C2",c2 print "a / b" print "a",a1,a2 print "b",b1,b2 break
def reModulo(self,num,div,modby): [_,remain]=poly.divPoly(num,div) return poly.modPoly(remain,modby)