COSMO · STUDY + TEACHING DECK

Counting

October 15, 2025

A question worth sharing

Inclusion-Exclusion

Add overlapping counts, then repair the overcount systematically.

ThinkCompareExplain

Today’s route

A question becomes an explanation.

Try

Enter through a problem. A partial attempt counts.

Connect

Use union, intersection, overcount 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

How many integers from 1 to 100 are divisible by 2 or 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.

union

objects in at least one set

intersection

objects shared by sets

overcount

counting one object too many times

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

The core idea

Keep the idea. Explain the conditions.

|A\cup B|=|A|+|B|-|A\cap B|

The idea

Add overlapping counts, then repair the overcount systematically.

What to remember

Overlap correction is bookkeeping: add, subtract duplicates, and restore what was removed too often.

What information does this method keep?

Worked example

One route, one decision at a time

The problem

Count students taking algebra or geometry when 22 take algebra, 18 geometry, and 7 both.

Predict each next step

Add the two course counts: 40.
Students in both were counted twice.
Subtract the overlap once.
The union contains 33 students.

Which step needs a reason, not just a calculation?

See the structure

The structure behind inclusion-exclusion

|A\cup B|=|A|+|B|-|A\cap B|

Subtract the shared region once because the first sum counted it twice.

Read the representation

Add overlapping counts, then repair the overcount systematically.

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 inclusion-exclusion

Your shared task

Teams draw Venn diagrams for survey counts and annotate how often each region appears in the formula.

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

Overlap correction is bookkeeping: add, subtract duplicates, and restore what was removed too often.
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

How many integers from 1 to 60 are divisible by 2, 3, or 5?

Predict each next step

Singles: 30 + 20 + 12.
Subtract pair overlaps: 10 + 6 + 4.
Add the triple overlap: 2.
The result is 44.

Which step needs a reason, not just a calculation?

Convince a skeptic

Turn a pattern into a proof.

The claim

For two sets, |A union B| = |A| + |B| - |A intersection B|.

Build the argument

Objects in only one set appear once in the sum.
Objects in both appear twice.
Subtracting the intersection removes exactly one extra copy.

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

Stretch together

Take the idea somewhere new.

Transfer challenge

How many length-four decimal digit strings contain at least one 0 or at least one 1? Leading zeros are allowed.

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

Inclusion-exclusion appears in probability, database queries, schedules, and forbidden-pattern counts.

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

How many integers from 1 to 100 are divisible by 2 or 5?

Question 2

Explain why this claim is true: For two sets, |A union B| = |A| + |B| - |A intersection B|.

Question 3

How many length-four decimal digit strings contain at least one 0 or at least one 1? Leading zeros are allowed.

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

Overlap correction is bookkeeping: add, subtract duplicates, and restore what was removed too often.

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

A good question belongs to everyone in the room.