About 400 results
Open links in new tab
  1. What is modular arithmetic? (article) | Khan Academy

    Many programming languages, and calculators, have a mod operator, typically represented with the % symbol. If you calculate the result of a negative number, some languages will give you a negative result.

  2. Congruence modulo (article) | Cryptography | Khan Academy

    A primitive root, g, that when repeatedly multiplied by itself (mod n) generates all the numbers coprime to n. It is also called a generator (mod n). If n is prime it will generate all the numbers between 1 and …

  3. Mean, median, & mode example (video) | Khan Academy

    Here we give you a set of numbers and then ask you to find the mean, median, and mode. It's your first opportunity to practice with us!

  4. Modular multiplication (article) | Khan Academy

    Let's explore the multiplication property of modular arithmetic: (A * B) mod C = (A mod C * B mod C) mod C

  5. Statistics intro: Mean, median, & mode (video) | Khan Academy

    The mean (average) of a data set is found by adding all numbers in the data set and then dividing by the number of values in the set. The median is the middle value when a data set is ordered from least to …

  6. Khan Academy

    Learn about mean, median, and mode with Khan Academy's comprehensive review of these fundamental concepts in statistics.

  7. Mean, median, and mode (practice) | Khan Academy

    Calculate the mean, median, or mode of a data set!

  8. Mean, median, and mode review (article) | Khan Academy

    Finding the mode The mode is the most commonly occurring data point in a dataset. The mode is useful when there are a lot of repeated values in a dataset. There can be no mode, one mode, or multiple …

  9. Modular addition and subtraction (article) | Khan Academy

    We ignore these complete loops around the circle by calculating each number mod 7 (as shown in the two upper modular circles). This will give us the number of clockwise steps, relative to 0, that …

  10. Fermat's little theorem (video) | Khan Academy

    "a mod p" is the remainder we get when we divide "a" by "p" If "a<p" then "a mod p = a", which means "a^p mod p = a", which means "a^p" divide by "p" will give you a remainder of "a".