| Addition | Calculates the sum of two or more numbers. | Used in nearly all computer processes. |
| Subtraction | Calculates the difference between two numbers. | Used in tasks ranging from simple arithmetic to sophisticated scientific computation. |
| Multiplication | Calculates the product of two or more numbers. | Fundamental to many high-level tasks such as graphics rendering, audio processing, etc. |
| Division | Breaks down a large number into smaller parts. Determines how many times a number (divisor) is contained in another number (dividend). | Used in disparate applications such as finance, machine learning, digital imaging, etc. |
| Modulus (Modulo) | Determines the remainder from a division operation. | Common in cryptography, image processing, in generating pseudo random numbers, etc. |
| Exponentiation | Raises a number (base) to the power of another number (exponent). | Used in physics simulations, financial calculations, cryptography, etc. |
| Greatest Common Divisor (GCD) | Uses Euclid’s algorithm to find the greatest number that divides two numbers without a remainder. | Used in number theory, and simplifying fractions. |
| Least Common Multiple (LCM) | Finds the smallest common multiple of two numbers. | Used in solving problems and puzzles related to number theory. |
| Square root | Determines the number that, when multiplied by itself, will equal the given number. | Used in algebra, geometry, statistics, machine learning, graphics, etc. |
