Monday, September 18, 2017

modular arithmetic - Find a inverse modulo 30, 1leale30. For each a you find, find the inverse of each a that have inverse modulo 30

Find a inverse modulo 30, 1a30. For each a you find, find the inverse of each a that have inverse modulo 30



a={1,7,11,13,17,19,23,29}



They got a by the fact that relative primes are inverses. I was wondering if this rule also applied if a30?



Find the inverse of each of the integers in a that have an inverse modulo 30



Not really sure how to do this part

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...