COSMO · STUDY + TEACHING DECK

Number Theory

October 22, 2025

A question worth sharing

Chinese Remainder Theorem

Reconstruct one number from compatible remainder clues.

ThinkCompareExplain

Today’s route

A question becomes an explanation.

Try

Enter through a problem. A partial attempt counts.

Connect

Use residue, coprime, simultaneous congruence to name what you notice.

Convince

Build an argument a partner can check.

The goal is a method someone else can use.

The opener

Start with a question.

Opening problem

Find the smallest positive n with n = 2 mod 3 and n = 3 mod 5.

Think · 2 min

Sketch, test a small case, or make a first guess.

Pair · 3 min

Compare methods. Find one thing you agree on and one question.

Be ready to share your route, even if it is unfinished.

Compare before checking

Put two attempts in conversation.

Explain

Tell a partner how you started. Let them finish before responding.

Question

Which step feels certain? Which step still needs evidence?

Build

Combine one useful idea from each attempt into a new route.

Can you explain your partner’s method in your own words?

Board conversation

Notice before naming.

Look for structure

Try a small case and record every step.
Separate what changes from what stays fixed.
State the pattern in a sentence before naming the theorem.

Make a conjecture

We think ___ because ___. A case that might break this is ___.

What changed? What stayed the same?

Useful language

Now the language has a job.

residue

remainder class

coprime

gcd equal to 1

simultaneous congruence

several remainder conditions at once

Use one of these words to explain something you already noticed.

The core idea

Keep the idea. Explain the conditions.

x\equiv a\pmod m,\quad x\equiv b\pmod n,\quad\gcd(m,n)=1\quad\Longrightarrow\quad x\text{ unique mod }mn

The idea

Reconstruct one number from compatible remainder clues.

What to remember

Several small clocks can identify one position on a much larger clock.

What information does this method keep?

Worked example

One route, one decision at a time

The problem

Solve x = 1 mod 4 and x = 2 mod 5.

Predict each next step

Write x = 1 + 4k.
Then 1 + 4k = 2 mod 5.
So 4k = 1 mod 5 and k = 4 mod 5.
Thus x = 17 mod 20.

Which step needs a reason, not just a calculation?

See the structure

The structure behind chinese remainder theorem

x\equiv a\pmod m,\quad x\equiv b\pmod n,\quad\gcd(m,n)=1\quad\Longrightarrow\quad x\text{ unique mod }mn

Two coprime clocks identify one residue class on their product clock.

Read the representation

Reconstruct one number from compatible remainder clues.

Look together

Point to the part that explains the relationship. Change one input and predict what changes.

What can you see here that was harder to see in words?

Two approaches

Compare the reasoning.

Structural method

Name the objects and conditions.
Use a reusable relationship.
Explain why the method must work.

Brute force

May help with a small test case.
Can hide the general reason.
Becomes unreliable when the scale grows.

Which route can you justify? What would you test first?

Reasoning clinic

Find the step that needs repair.

Investigate these concerns

May help with a small test case.
Can hide the general reason.
Becomes unreliable when the scale grows.

Repair together

Name the missing condition. Try a small counterexample. Rewrite one step so it is justified.

A useful correction explains why the original step fails.

Work together

Investigate chinese remainder theorem

Your shared task

Teams encode secret numbers as remainder clues and trade clues with another team for reconstruction.

Explore

4 min - test cases

Compare

5 min - form a rule

Defend

4 min - defend the rule

Everyone should be able to explain the group’s final claim.

Share → connect

What did the room discover?

Bring your evidence

Share a conjecture, a useful example, or a route that changed.

Connections to investigate

Several small clocks can identify one position on a much larger clock.
A complete solution names the condition that makes the method valid.
A counterexample is useful when it exposes a missing condition.

Which observation explains the mechanism?

Try → explain → check

Your turn to build the route

The problem

Solve x = 2 mod 3, x = 3 mod 4, x = 1 mod 5.

Predict each next step

Combine the first two to get x = 11 mod 12.
Write x = 11 + 12k.
Then k = 0 mod 5.
So x = 11 mod 60.

Which step needs a reason, not just a calculation?

Convince a skeptic

Turn a pattern into a proof.

The claim

Pairwise coprime moduli determine one residue class modulo their product.

Build the argument

Each modulus has an inverse modulo every other modulus.
Build a term that is 1 for one modulus and 0 for the others.
Add the terms; uniqueness follows because any two solutions differ by every modulus.

What does each step rely on? Where are the conditions used?

Stretch together

Take the idea somewhere new.

Transfer challenge

A number leaves remainders 4, 2, and 1 when divided by 5, 7, and 8. Find the least positive value.

Choose a route

Name the objects, the conditions, and a relationship that might help. Start with one test case.

What transfers from the earlier example? What is different?

Peer review

Check the argument together.

Restate

Explain the other person’s route before evaluating it.

Test

Try a small case or boundary case. Does every step still make sense?

Revise

Fix an assumption, add a reason, or find a second method.

Where did your thinking change?

Beyond this problem

Where might this idea help?

A connection

Remainder reconstruction appears in calendars, distributed computation, and modular data storage.

Discuss the model

What objects or quantities are represented?
Which relationship from today is preserved?
What assumption would you check before trusting it?

Invent one more situation with the same structure.

Exit ticket

Leave with an explanation.

Question 1

Find the smallest positive n with n = 2 mod 3 and n = 3 mod 5.

Question 2

Explain why this claim is true: Pairwise coprime moduli determine one residue class modulo their product.

Question 3

A number leaves remainders 4, 2, and 1 when divided by 5, 7, and 8. Find the least positive value.

Choose one. Write an answer with a reason, then compare with a partner.

Reflect together

Make your thinking visible.

I used to think…

Name a claim or approach that changed.

Now I can explain…

Give the reason, not only the result.

I still wonder…

Write a question worth bringing to the next circle.

Share one sentence. Ask one follow-up question.

The idea to keep

Several small clocks can identify one position on a much larger clock.

Use the matching practice sets to move from direct examples to proof and transfer.

A good question belongs to everyone in the room.