Computes the exponentiation of two big integers, with optional modular reduction.
If the modulus z is not provided, returns x raised to the power of y (x ** y).
If the modulus z is provided, computes (x ** y) % z efficiently using modular exponentiation.
Parameters
x: bigint
The base as a bigint.
y: bigint
The exponent as a bigint.
Optionalz: bigint
(Optional) The modulus as a bigint. If provided, the result is computed modulo z.
Returns bigint
The result of x ** y if z is undefined, otherwise (x ** y) % z.
Computes the exponentiation of two big integers, with optional modular reduction.
If the modulus
zis not provided, returnsxraised to the power ofy(x ** y). If the moduluszis provided, computes(x ** y) % zefficiently using modular exponentiation.