Inverses of modulus
Not what you're looking for? Search our solutions OR ask your own Custom question.
A: Show that the positive integers less than 11, except 1 and 10, can be split into pairs of integers such that each pair consists of integers that are inverses of each
other modulo 11.
Use part (a) to show that 10! is congruent to -1 (mod 11).
© BrainMass Inc. brainmass.com December 16, 2022, 4:23 am ad1c9bdddfhttps://brainmass.com/math/discrete-structures/inverses-modulus-348953
Solution Summary
This solution shows all the steps to solve the given problem regarding the inverses of modulus.
$2.49