Module TryExcept body ImportFrom alias handlers ExceptHandler type NameLoad body Assign NameStore NameLoad FunctionDef arguments args NameParam NameParam defaults body Expr Str If BoolOpOr CompareLt NameLoad Num CompareLtE NameLoad NameLoad body Assign NameStore BinOpMod NameLoad NameLoad Assign TupleStore NameStore NameStore TupleLoad NameLoad NameLoad Assign TupleStore NameStore NameStore NameStore NameStore TupleLoad Num Num Num Num While CompareNotEq NameLoad Num body Assign TupleStore NameStore NameStore NameStore BinOpAdd Call NameLoad NameLoad NameLoad TupleLoad NameLoad Assign TupleStore NameStore NameStore NameStore NameStore TupleLoad BinOpSub NameLoad BinOpMult NameLoad NameLoad BinOpSub NameLoad BinOpMult NameLoad NameLoad NameLoad NameLoad Assert CompareEq NameLoad Num If CompareGt NameLoad Num body Return NameLoad orelse Return BinOpAdd NameLoad NameLoad decorator_list If NameLoad body Assign NameStore AttributeLoad NameLoad attr FunctionDef arguments args NameParam NameParam defaults body Expr Str If CompareNotEq Call NameLoad NameLoad NameLoad Num body Return Num orelse If CompareEq NameLoad Num body Return Num orelse If CompareEq NameLoad Num body Return NameLoad orelse If CompareEq BinOpMod NameLoad Num Num body Return Call NameLoad NameLoad BinOpFloorDiv BinOpAdd NameLoad Num Num NameLoad Assign NameStore BinOpSub NameLoad Num Assign NameStore Num While CompareEq BinOpMod NameLoad Num Num body AugAssignDiv NameStore Num AugAssignAdd NameStore Num Assign NameStore Num While CompareNotEq Call NameLoad NameLoad NameLoad Num body AugAssignAdd NameStore Num Assign NameStore Call NameLoad NameLoad BinOpFloorDiv BinOpAdd NameLoad Num Num NameLoad Assign NameStore Call NameLoad NameLoad NameLoad NameLoad Assign NameStore Call NameLoad NameLoad NameLoad NameLoad Assign NameStore NameLoad While NameLoad body Assign NameStore NameLoad Assign NameStore Num For NameStore Call NameLoad NameLoad body If CompareEq NameLoad Num body Break Assign NameStore Call NameLoad NameLoad Num NameLoad If CompareEq NameLoad Num body Return NameLoad Assign NameStore Call NameLoad NameLoad BinOpLShift Num BinOpSub BinOpSub NameLoad NameLoad Num NameLoad Assign NameStore BinOpMod BinOpMult NameLoad NameLoad NameLoad Assign NameStore BinOpMod BinOpMult NameLoad NameLoad NameLoad Assign NameStore BinOpMod BinOpMult NameLoad NameLoad NameLoad Assign NameStore NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str Assign NameStore Call NameLoad NameLoad BinOpFloorDiv BinOpSub NameLoad Num Num NameLoad Return IfExp CompareEq NameLoad BinOpSub NameLoad Num Num NameLoad decorator_list
N/A N/A N/A native.library NATIVE_LIBRARY N/A N/A N/A ImportError N/A N/A NATIVE_LIBRARY None inverse_mod N/A N/A a m N/A N/A N/A Inverse of a mod m. N/A N/A N/A a 0 N/A m a N/A N/A a N/A a m N/A N/A c d N/A a m N/A N/A uc vc ud vd N/A 1 0 0 1 N/A N/A c 0 N/A N/A N/A q c d N/A N/A divmod d c N/A c N/A N/A uc vc ud vd N/A N/A ud N/A q uc N/A vd N/A q vc uc vc N/A N/A d 1 N/A N/A ud 0 N/A N/A ud N/A N/A N/A ud m N/A N/A NATIVE_LIBRARY N/A N/A inverse_mod N/A NATIVE_LIBRARY inverse_mod modular_sqrt N/A N/A a p N/A N/A N/A  Find a quadratic residue (mod p) of 'a'. p
    must be a prime.

    Solve the congruence of the form:
    x^2 = a (mod p)
    And returns x. Note that p - x is also a root.

    0 is returned if no square root exists for
    these a and p.

    The Tonelli-Shanks algorithm is used (except
    for some simple cases in which the solution
    is known from an identity). This algorithm
    runs in polynomial time (unless the
    generalized Riemann hypothesis is false).
     N/A N/A N/A legendre_symbol a p 1 N/A N/A 0 N/A N/A N/A a 0 N/A N/A 0 N/A N/A N/A p 2 N/A N/A a N/A N/A N/A N/A p 4 3 N/A N/A N/A pow a N/A N/A p 1 4 p N/A s N/A p 1 N/A e 0 N/A N/A N/A s 2 0 N/A N/A s 2 N/A e 1 N/A n 2 N/A N/A N/A legendre_symbol n p -1 N/A N/A n 1 N/A x N/A pow a N/A N/A s 1 2 p N/A b N/A pow a s p N/A g N/A pow n s p N/A r e N/A True N/A N/A t b N/A m 0 N/A m N/A xrange r N/A N/A N/A t 1 N/A N/A N/A t N/A pow t 2 p N/A N/A m 0 N/A N/A x N/A gs N/A pow g N/A 1 N/A N/A r m 1 p N/A g N/A N/A gs gs p N/A x N/A N/A x gs p N/A b N/A N/A b g p N/A r m N/A legendre_symbol N/A N/A a p N/A N/A N/A  Compute the Legendre symbol a|p using
    Euler's criterion. p is a prime, a is
    relatively prime to p (if p divides
    a, then a|p = 0)

    Returns 1 if a has a square root modulo
    p, -1 otherwise.
     N/A ls N/A pow a N/A N/A p 1 2 p N/A N/A N/A ls N/A p 1 -1 ls N/A