|
__init__(self,
value)
Initialize the integer to the given value. |
|
|
|
|
|
|
|
|
|
to_bytes(self,
block_size=0)
Convert the number into a byte string. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
__floordiv__(self,
divisor) |
|
|
|
|
|
inplace_pow(self,
exponent,
modulus=None) |
|
|
|
__pow__(self,
exponent,
modulus=None) |
|
|
|
|
|
sqrt(self)
Return the largest Integer that does not
exceed the square root |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
get_bit(self,
n)
Return True if the n-th bit is set to 1.
Bit 0 is the least significant. |
|
|
|
|
|
|
|
size_in_bits(self)
Return the minimum number of bits that can encode the number. |
|
|
|
size_in_bytes(self)
Return the minimum number of bytes that can encode the number. |
|
|
|
|
|
fail_if_divisible_by(self,
small_prime)
Raise an exception if the small prime is a divisor. |
|
|
|
multiply_accumulate(self,
a,
b)
Increment the number by the product of a and b. |
|
|
|
set(self,
source)
Set the Integer to have the given value |
|
|
|
inplace_inverse(self,
modulus)
Compute the inverse of this number in the ring of
modulo integers. |
|
|
|
|
|
gcd(self,
term)
Compute the greatest common denominator between this
number and another term. |
|
|
|
lcm(self,
term)
Compute the least common multiplier between this
number and another term. |
|
|
|
|
Inherited from object :
__delattr__ ,
__format__ ,
__getattribute__ ,
__hash__ ,
__new__ ,
__reduce__ ,
__reduce_ex__ ,
__setattr__ ,
__sizeof__ ,
__subclasshook__
|