Modular Arithmetic

• What it means for two integers to be congruent modulo n, written a ≡ b (mod n).
• How to add, subtract and multiply congruences just like equations — the "clock arithmetic" toolkit olympiad problems rely on.
• How to find the last digit(s) of huge powers without a calculator, using repeating remainder cycles.

1. Definition — a ≡ b (mod n) means n divides (a − b); equivalently, a and b leave the same remainder when divided by n.
2. Arithmetic rules — if a ≡ b (mod n) and c ≡ d (mod n), then a+c ≡ b+d, a−c ≡ b−d, and ac ≡ bd (all mod n). You can also raise both sides to the same power.
3. Cycles of remainders — the remainders of 2¹, 2², 2³, … mod 10 repeat as 2, 4, 8, 6, 2, 4, 8, 6, … with period 4. Every "powers mod n" problem is really "find the cycle length, then use it".
4. Fermat's Little Theorem (stated, not proved here) — if p is prime and p does not divide a, then a^(p−1) ≡ 1 (mod p). This shortcuts huge exponent problems instantly.

Find the remainder when 7¹⁰⁰ is divided by 5.

Step 1 — list remainders of powers of 7 mod 5: 7 ≡ 2 (mod 5)
Step 2 — so 7^100 ≡ 2^100 (mod 5)
Step 3 — cycle of 2^k mod 5: 2,4,3,1,2,4,3,1,... period 4
Step 4 — 100 ÷ 4 = 25 exactly, so 2^100 ≡ 2^4 ≡ 1 (mod 5)
Answer — remainder is 1

• Forgetting that congruence rules allow multiplication/addition but not division unless you know the divisor is coprime to the modulus.
• Miscounting the cycle length — always list enough terms until the remainder repeats, don't guess.
• Confusing "remainder when divided by n" with "quotient" — a ≡ b (mod n) is about remainders only.

• Find the remainder when 3¹⁵ is divided by 7 (cycle of 3 mod 7 has period 6; 15 mod 6 = 3, so answer is 3³ mod 7 = 27 mod 7 = 6).
• Explain why a² ≡ 0 or 1 (mod 4) for every integer a.
• Show that the sum of any two consecutive integers is always odd, using mod 2.

Open the Practice tab for graded questions on Modular Arithmetic.

• Clock-face simulator: drag a pointer around a 12-hour or n-hour clock to see additions "wrap around" — a live picture of modular addition.
• Mirror / body / home activity: use a real analogue clock to compute "8 hours after 9 o'clock" and connect it to mod 12 arithmetic.
• Voice or text reflection with AI Mentor: explain why computers use modular arithmetic for things like hashing and check digits (ISBN, Aadhaar-style checksums).

• "Explain modular arithmetic to a Class 6 student using a 12-hour clock and a real Indian daily routine."
• "What is one common mistake students make when finding remainders of large powers, and how would you catch yourself making it?"
• Stretch: "How does modular arithmetic connect to cryptography, UPI security, or bar-code check digits?"

• Complete the core practice + one extension activity (photo, table, short reflection, or mini-project) for base XP + topic badge.
• 5-7 day streak or family discussion note = multiplier + visible artifact in parent/principal dashboard.
• Best real-world application stories (anonymised) featured on class or national leaderboard.

• One hands-on project or measurement using the Drishti kit or household items that makes the concept physical.
• Direct link to at least one Future Skill track (Money Management, Green Tech, Cyber Defenders, Micro-Entrepreneurship, AI Mastery, Sustainable Living, Personality Development).
• Coding extension where relevant (simple script, simulation, or data logging).

This material emphasises experiential "learning by doing", competency (apply/create/analyse), vocational exposure, critical thinking, and multidisciplinary connections. Designed to feed live worlds, AI Mentor (with memory), gamification, robotics, parent analytics, and future skills — not just exam prep.

Portfolio Evidence Idea: Your photo/table/reflection/project + one sentence on "How this helps me in real life or a possible future path."

Open the Practice tab for aligned questions (easy/medium/hard + case-based) with full AI scaffolding.

See curriculum for cross-links and the full future-skills/robotics chapters.