
What is modular arithmetic? (article) | Khan Academy
A modular circle of size -3 wouldn't make much sense. However, if we wanted to find out the remainder of A/B when B is negative, we can simply multiply A/B by -1/-1 to make B positive.
Modular addition and subtraction (article) | Khan Academy
Understanding the proofs can help one to understand when the math will work, and when it won't. It can also help develop mathematical intuition, and make understanding more advanced math easier.
Modular multiplication (article) | Khan Academy
Most modern cryptography relies on modular arithmetic. Two notable example are RSA and Diffie Hellman. Older ciphers like the Caesar cipher, Vigenere cipher, and Affine ciphers use it too.
Modular inverses (article) | Cryptography | Khan Academy
What is a modular inverse? In modular arithmetic we do not have a division operation. However, we do have modular inverses.
Algebra 1 | Math | Khan Academy
Khan Academy's Algebra 1 course is built to deliver a comprehensive, illuminating, engaging, and Common Core aligned experience! **Teaching this course? Check out our [teacher resources] …
Modular exponentiation (article) | Khan Academy
Use fast modular exponentiation as described in the next lesson. Right after that lesson there is a calculator for modular exponents, so you can check your calculations.
Congruence modulo (article) | Cryptography | Khan Academy
I have an additional method I use for understanding modulus, not sure how useful it would be for others. Its a matrix format which is hard to illustrate here. We start with a static column consisting of (n+1...) …
Math - Khan Academy
Explore key 7th‑grade math skills aligned with New York’s Next Generation standards, including ratio reasoning, proportional relationships, integer operations, expressions, equations, and geometry.
SAT Math | Test prep | Khan Academy
Looking for SAT Reading and Writing? This course covers Math on the SAT. You can practice the Reading and Writing portion of the exam in our SAT Reading and Writing course.
Fast modular exponentiation (article) | Khan Academy
This has given us a method to calculate A^B mod C quickly provided that B is a power of 2. However, we also need a method for fast modular exponentiation when B is not a power of 2.