.net - BigInteger ModInverse

Question

Is this VB calculation

Dim s As BigInteger = (BigInteger.ModPow(k,q - 2,q) * (m + x * r)) Mod q

a proper implementation of this written calculation

I'm basing my calculation of the fact that

can be computed by

as per this Wikipedia article on Digital Signature Algorithm

Answer 1

我可以确认这个等式是正确的。