# Revision history [back]

Thanks!

and is there a way to work around the use of the integermodring? I'm writing an algorithm in which I have to succesively compute different functions e.g.

s_j g_j + t_j h_j ? 1 modulo p^2^j
s_j g_j + t_j h_j ? 1 modulo p^2^(j+1)


Would it be best to redefine

R=PolynomialRing(IntegerModRing(p^2^j),'x') every time?

Thanks!

and is there a way to work around the use of the integermodring? I'm writing an algorithm in which I have to succesively compute different functions e.g.

s_j g_j + t_j h_j ? = 1 modulo p^2^j
s_j g_j + t_j h_j ? = 1 modulo p^2^(j+1)


Would it be best to redefine

R=PolynomialRing(IntegerModRing(p^2^j),'x') every time?