mirror of
https://github.com/vlang/v.git
synced 2023-08-10 21:13:21 +03:00
math.big: fix documentation for mod_inverse (#18494)
This commit is contained in:
parent
c657384f72
commit
4485f1ca1e
@ -1008,7 +1008,6 @@ fn gcd_binary(x Integer, y Integer) Integer {
|
||||
|
||||
// mod_inverse calculates the multiplicative inverse of the integer `a` in the ring `ℤ/nℤ`.
|
||||
// Therefore, the return value `x` satisfies `a * x == 1 (mod m)`.
|
||||
// -----
|
||||
// An error is returned if `a` and `n` are not relatively prime, i.e. `gcd(a, n) != 1` or
|
||||
// if n <= 1
|
||||
[inline]
|
||||
|
Loading…
Reference in New Issue
Block a user