Question

How to find modular multiplicative inverse of a number

Answer 1

One solution is as follows:

Use the extended Euclidean algorithm to compute k−1, the modular multiplicative inverse of k mod 2w, where w is the number of bits in a word. ...

For each number in the list, multiply it by k−1 and take the least significant word of the result.

Answer 2

we will do the opposite of what exactly it was like if there is (+) then it will be (-).

hope will help you

mark me as brainlist