COSMO · STUDY + TEACHING DECKNumber Theory
September 29, 2025
C. A question worth sharingPrime Factorization
Break a number into prime building blocks and use exponents to compare divisibility.
ThinkCompareExplain
Today’s routeA question becomes an explanation.
Try
Enter through a problem. A partial attempt counts.
Connect
Use prime, factorization, valuation to name what you notice.
Convince
Build an argument a partner can check.
The goal is a method someone else can use.
The openerStart with a question.
Opening problem
How many trailing zeros does 25! have?
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 checkingPut 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 conversationNotice before naming.
Look for structure
- 01Try a small case and record every step.
- 02Separate what changes from what stays fixed.
- 03State 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 languageNow the language has a job.
prime
integer above 1 with two positive divisors
factorization
product representation
valuation
exponent of a chosen prime
Use one of these words to explain something you already noticed.
The core ideaKeep the idea. Explain the conditions.
n=p∣n∏pvp(n) The idea
Break a number into prime building blocks and use exponents to compare divisibility.
What to remember
Prime exponents turn divisibility into organized bookkeeping.
What information does this method keep?
Worked exampleOne route, one decision at a time
The problem
Find the prime factorization of 756.
Predict each next step
- 01756 = 2(378) = 22(189).
- 02189 = 3(63) = 33(7).
- 03Seven is prime.
- 04So 756 = 22 * 33 * 7.
Which step needs a reason, not just a calculation?
See the structureThe structure behind prime factorization
Read the representation
Break a number into prime building blocks and use exponents to compare divisibility.
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 approachesCompare the reasoning.
Structural method
- 01Name the objects and conditions.
- 02Use a reusable relationship.
- 03Explain why the method must work.
Brute force
- 01May help with a small test case.
- 02Can hide the general reason.
- 03Becomes unreliable when the scale grows.
Which route can you justify? What would you test first?
Reasoning clinicFind the step that needs repair.
Investigate these concerns
- 01May help with a small test case.
- 02Can hide the general reason.
- 03Becomes 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 togetherInvestigate prime factorization
Your shared task
Students create factor trees for the same number and compare why different trees reach the same prime leaves.
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 → connectWhat did the room discover?
Bring your evidence
Share a conjecture, a useful example, or a route that changed.
Connections to investigate
- 01Prime exponents turn divisibility into organized bookkeeping.
- 02A complete solution names the condition that makes the method valid.
- 03A counterexample is useful when it exposes a missing condition.
Which observation explains the mechanism?
Try → explain → checkYour turn to build the route
The problem
Find gcd(360, 504) from prime exponents.
Predict each next step
- 01360 = 23 * 32 * 5.
- 02504 = 23 * 32 * 7.
- 03Take the smaller exponent of each shared prime.
- 04The gcd is 23 * 32 = 72.
Which step needs a reason, not just a calculation?
Convince a skepticTurn a pattern into a proof.
The claim
Every integer greater than 1 has a unique prime factorization apart from order.
Build the argument
- 01Existence follows by repeatedly splitting composite factors.
- 02For uniqueness, a prime dividing a product divides at least one factor.
- 03Cancel shared primes until both factorizations agree.
What does each step rely on? Where are the conditions used?
Stretch togetherTake the idea somewhere new.
Transfer challenge
Find the smallest n for which 720 divides n!.
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 reviewCheck 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 problemWhere might this idea help?
A connection
Prime exponents control gcd, lcm, divisor counts, factorial zeros, and cryptographic key sizes.
Discuss the model
- 01What objects or quantities are represented?
- 02Which relationship from today is preserved?
- 03What assumption would you check before trusting it?
Invent one more situation with the same structure.
Exit ticketLeave with an explanation.
Question 1
How many trailing zeros does 25! have?
Question 2
Explain why this claim is true: Every integer greater than 1 has a unique prime factorization apart from order.
Question 3
Find the smallest n for which 720 divides n!.
Choose one. Write an answer with a reason, then compare with a partner.
Reflect togetherMake 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 keepPrime exponents turn divisibility into organized bookkeeping.
Use the matching practice sets to move from direct examples to proof and transfer.
A good question belongs to everyone in the room. 1 / 21
← → to navigate and reveal · N for notes · F to present · Esc to exit