About This File
An introduction into modular arithmetics and where to use it. This is the last essay about modular arithmetics, about the Extended Euclidean Algorithm for modular multiplicative inverse calculation and finally about the Chinese Remainder Rheorem (CRT).
There are no comments to display.
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!Register a new account
Already have an account? Sign in here.Sign In Now