|
D.12.2.12 rootsModp
Procedure from library atkins.lib (see atkins_lib).
- Usage:
- rootsModp(p,P);
- Return:
- list of roots of the polynomial P modulo p with p prime
- Assume:
- p>=3
- Note:
- this algorithm will be called recursively, and it is understood
that all the operations are done in Z/pZ (excepting squareRoot(d,p))
Example:
|