Lines Matching refs:n
19 def invmod(a: int, n: int) -> int:
26 while n:
27 q, r = divmod(a, n)
28 a, b, c, n = n, c, b - q*c, r
34 def invmod_positive(a: int, n: int) -> int:
36 inv = invmod(a, n)
37 return inv if inv >= 0 else inv + n
83 n = ((1 << (len(val) * 4)) - 1)
84 l = limbs_mpi(n, bits_in_limb)
377 yield from ((n, a, "0") for a, n in cls.input_cases)
379 yield from ((n, a, b) for a, b, n in cls.input_cases)
390 test_objects = (cls(n, a, b, bits_in_limb=bil)
391 for n in cls.moduli
398 test_objects = (cls(n, a, b)
399 for n in cls.moduli