def _raise_mod_power(x, s, p, f):
 from sympy.polys.domains import ZZ
 f_f = gf_diff(f, p, ZZ)
 alpha = gf_value(f_f, x)
 beta = ((- gf_value(f, x)) // (p ** s))
 return linear_congruence(alpha, beta, p)

def _raise_mod_power ( x , s , p , f ) : from sympy . polys . domains import ZZ f_f = gf_diff ( f , p , ZZ ) alpha = gf_value ( f_f , x ) beta = ( ( - gf_value ( f , x ) ) // ( p ** s ) ) return linear_congruence ( alpha , beta , p )
used in gf_csolve to generate solutions of f(x) cong 0 mod(p**) from the solutions of f(x) cong 0 mod .