No history yet

Clock Math Fundamentals

Thinking in Circles

Imagine you look at a clock. It’s 10:00. If four hours pass, what time is it? You don't say it's 14:00. You say it's 2:00. Your brain automatically does the math: the hours on a clock go up to 12 and then start over from 1.

Lesson image

This “wrapping around” is the core idea of modular arithmetic. It’s a system of math for numbers that repeat after reaching a certain value. Instead of counting infinitely upwards, we count in a circle. The clock is a circle of 12 numbers. When we get to 12, the next number is 1 again.

Division and Remainders

Let’s break down our clock example. When we add 4 hours to 10:00, we get 14. To figure out the time, we see how many times 12 fits into 14. It fits once, with 2 left over.

14÷12=114 \div 12 = 1 with a remainder of 22.

That leftover number, the remainder, is our answer. The time is 2:00. This relationship between division and remainders is the foundation of modular arithmetic. Let's define the parts of this operation.

Dividend

noun

The number that is being divided.

Next up is the number we divide by.

Divisor

noun

The number by which another number is to be divided.

The main result of the division is the quotient.

Quotient

noun

The result obtained by dividing one quantity by another.

And finally, what's left over.

Remainder

noun

The amount left over after division.

The Modulo Operator

There's a formal way to talk about finding remainders. It's called the modulo operation. Using our clock example, we would write:

14(mod12)=214 \pmod{12} = 2

This is read as "fourteen modulo twelve equals two." It's just a concise way of asking, "What's the remainder when 14 is divided by 12?" The number we divide by, 12 in this case, is called the modulus.

a(modn)=ra \pmod n = r

When two numbers, say a and b, have the same remainder when divided by a modulus n, we say they are congruent modulo n. For example, 14 and 2 are congruent modulo 12 because they both have a remainder of 2 when divided by 12. (14 div 12 = 1 \text{ R } 2, and 2 div 12 = 0 \text{ R } 2)

Let's try a few more examples to get comfortable.

What is 10(mod3)10 \pmod 3? We divide 10 by 3. It goes in 3 times (3×3=93 \times 3 = 9), with a remainder of 1. So, 10(mod3)=110 \pmod 3 = 1.

What is 15(mod5)15 \pmod 5? We divide 15 by 5. It goes in 3 times perfectly (3×5=153 \times 5 = 15), with a remainder of 0. So, 15(mod5)=015 \pmod 5 = 0.

Modulo in Code

Most programming languages have a built-in way to perform the modulo operation. In C++, and many other languages like Java, Python, and JavaScript, this is done with the percent sign (%).

The remainder operator, sometimes called modulo, returns the number that remains after the right-hand number divides into the left-hand number as many times as it evenly can: 11 % 3 equals 2 because 3 fits into 11 three times, leaving 2 as the remainder.

So, to calculate 14(mod12)14 \pmod{12} in C++, you would just write 14 % 12. This expression would evaluate to 2. It's a handy tool for anything that needs to wrap around or repeat, from controlling game character animations to scheduling tasks.

#include <iostream>

int main() {
    // Clock example: 10 o'clock + 4 hours
    int result = (10 + 4) % 12;
    // result will be 14 % 12, which is 2
    std::cout << "The time is: " << result << ":00" << std::endl; 

    // Another example: 25 % 7
    // 7 goes into 25 three times (21), with 4 left over.
    int remainder = 25 % 7;
    std::cout << "25 % 7 is: " << remainder << std::endl; // Prints 4

    return 0;
}

Time to test your understanding.

Quiz Questions 1/6

Modular arithmetic is a system based on numbers that "wrap around" after reaching a certain value. What fundamental mathematical operation is this concept based on?

Quiz Questions 2/6

What is the value of the expression 15(mod5)15 \pmod 5?

Understanding this simple idea of clock math is the first step into the powerful world of modular arithmetic, a concept used everywhere from cryptography to computer science.