From 4485f1ca1e1995f459245bd65ad67a93de0c042e Mon Sep 17 00:00:00 2001 From: phoebe Date: Tue, 20 Jun 2023 13:31:04 +0200 Subject: [PATCH] math.big: fix documentation for mod_inverse (#18494) --- vlib/math/big/integer.v | 1 - 1 file changed, 1 deletion(-) diff --git a/vlib/math/big/integer.v b/vlib/math/big/integer.v index 2264acdce3..b30749541a 100644 --- a/vlib/math/big/integer.v +++ b/vlib/math/big/integer.v @@ -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]