Top
Back: HilbertClassPoly
Forward: wUnit
FastBack: aksaka_lib
FastForward: crypto_lib
Up: atkins_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

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:
 


Top Back: HilbertClassPoly Forward: wUnit FastBack: aksaka_lib FastForward: crypto_lib Up: atkins_lib Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 3-1-6, Dec 2012, generated by texi2html.