number_gcd Number number_isdivisor

Number >> Number > number_inversemod

number_inversemod

Computes the modular multiplicative inverse.

Calling Sequence

x = number_inversemod ( a , n )

Parameters

a :

a 1x1 matrix of floating point integers, must be positive

n :

a 1x1 matrix of floating point integers, must be positive

x :

a 1x1 matrix of floating point integers

Description

Returns the multiplicative inverse of a modulo n, i.e. returns x such that .

Uses number_solvelinmod.

Examples

number_inversemod ( 3 , 11 ) // 4

Bibliography

"Introduction to algorithms", Cormen, Leiserson, Rivest, Stein, 2nd edition

Authors

number_gcd Number number_isdivisor