This commit is contained in:
Ata Deniz Aydın 2017-05-14 17:27:28 +03:00 committed by GitHub
parent fe4e5d3aba
commit 94fcf4a049
2 changed files with 54 additions and 11 deletions

27
modp.py Normal file
View file

@ -0,0 +1,27 @@
class ModP(int):
'Integers mod p.'
def __new__(cls, p, num):
self.p = p
return int.__new__(cls, num % p)
# arithmetic
def __add__(self, other):
return ModP(self.p, int(self) + int(other))
def __radd__(self, other):
return ModP(self.p, int(other) + int(self))
def __sub__(self, other):
return ModP(self.p, int(self) - int(other))
def __rsub__(self, other):
return ModP(self.p, int(other) - int(self))
def __mul__(self, other):
return ModP(self.p, int(self) * int(other))
def __rmul__(self, other):
return ModP(self.p, int(other) * int(self))
def __div__(self, other):
return self * other._inv()
def __rdiv__(self, other):
return other * self._inv()
def _inv(self):
'Find multiplicative inverse of self in Z mod p.'
pass

View file

@ -1,8 +1,15 @@
from fractions import Fraction
from sys import maxint
from modp import *
def padic(prime):
'Return p-adic class with given prime.'
class Res(PAdic):
p = prime
return Res
class PAdic:
p = 2
p = 2 # default
def __init__(self):
self.val = '' # current known value
self.prec = 0 # current known precision
@ -11,6 +18,17 @@ class PAdic:
def get(self, prec):
'Return value of number with given precision.'
if self.value == 0:
return '0' # * prec
while self.prec < prec:
# update val based on value
self._nextdigit()
self.prec += 1
return self.val # TODO add decimal point or trailing zeros
def _nextdigit(self):
'Calculate next digit of p-adic number.'
raise NotImplementedError
# return value with precision up to 32 bits
@ -69,13 +87,11 @@ class PAdicConst(PAdic):
value.denominator /= p
self.value = value
def get(self, prec):
'Return value of constant with given precision.'
if self.value == 0:
return self.val
while self.prec < prec:
# update val based on value
self.prec += 1
return self.val # TODO add decimal point or trailing zeros
def _nextdigit(self):
'Calculate next digit of p-adic number.'
rem = ModP(p, self.value.numerator) / ModP(p, self.value.denominator)
self.val = rem + self.val
self.value -= rem
self.value /= p