Max Alekseyev on Fri, 18 May 2007 04:13:51 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

square root modulo power of prime


What is the best way to compute square roots modulo power of prime?
sqrt() function does not like such modules:

? sqrt(Mod(1,5^2))
 *** sqrt: composite modulus in Fl_sqrt: 25.

btw, is there any reason why this rather basic function is not
implemented in pari?

Similar question about znlog() function. Why it does not work modulo
power of prime?
Again, what is the best workaround for that?