Find the inverse modulo m of each integer n below: a) n=8 and m=35 b) n=51 and m=99
Follow Math Help Forum on Facebook and Google+
The answer to a is 22.
Originally Posted by icemanfan The answer to a is 22. could u give more details to that??
Hello, Originally Posted by rmpatel5 Find the inverse modulo m of each integer n below: a) n=8 and m=35 Find p such that Euclidian division : Therefore So the inverse is , that is to say b) n=51 and m=99 Try to do it...
Originally Posted by rmpatel5 b) n=51 and m=99 Okay, there was a trap here... You're looking for q such that But this is not possible since 51 and 99 are not coprime. So 3 must divide 1, which is not possible.
View Tag Cloud