Learn the standard algorithm for multi-digit multiplication with this Khan Academy video tutorial.

Learn the concept of multi-digit multiplication. Watch and learn how to break down the process into understandable steps, using two different methods. Skip to main content

If you're seeing this message, it means we're having trouble loading external resources on our website. If you're behind a web filter, please make sure that the domains *.kastatic.org and …

Thus, you need to first find the inverse of b, then multiply it by a. The modular inverse of a number is the integer that, when multiplied with the original number, becomes 1 mod n. It can be found …

To solve for x we would multiply both sides by the modular inverse of A mod C A * A^-1 * x ≡ B * A^-1 mod C But A * A^-1 mod C = 1 1 * x ≡ B * A^-1 mod C And 1 * x mod C = x x ≡ B * A^-1 …

If you're seeing this message, it means we're having trouble loading external resources on our website. If you're behind a web filter, please make sure that the domains *.kastatic.org and …

- [Instructor] In a previous video, we figured out a way to multiply a two-digit number times one-digit number. What we did is we broke up the two-digit numbers in terms of its place value, so …

Learn modular exponentiation, a fundamental concept in cryptography, on Khan Academy.

Let's say we need to figure out how many times 16 goes into 1,388. And what I want to do is first think about how we traditionally solve a problem like this and then introduce another method …

Multiply tenths like 0.6 x 0.4