These new files are fictional and public by URL. They are not secure or formal school instruments. Try each without the separate worked teacher key; the first response helps choose the next lesson. Ask for neutral reading, larger text, tactile cards, a quiet version or more time as needed. The teacher logs content prompting separately from access support. Show what each number counts and why the operation fits. No real classmate data is requested.
Day 5 Check A · File G
New File G. In a fictional 36-person community maker day, 19 choose a drawing station (D), 14 choose a coding station (C), and 6 choose both. Separately, a person books exactly one of 2 distinct indoor sessions or 3 distinct outdoor sessions. No session appears in both booking lists.
- How many maker-day people chose at least one of D or C? How many chose neither? Show a two-set calculation and the four disjoint region values.
- How many one-session bookings are available? Explain why multiplying 2×3 would answer a different question.
- A peer says, “Because the word or appears in both stories, just add the two given numbers in each.” Write one sentence that explains why the maker-day count needs a different operation from the booking count.
Self-audit: Count every person or booking once; keep the two stories separate.
Day 10 Check B · Files H and I
New File H. A fictional 36-person open day records interests in art (A) 15, coding (C) 14 and music (M) 12. Pairwise counts are |A∩C|=6, |A∩M|=5, |C∩M|=4; 2 people chose all three. Every pairwise count includes the all-three people.
New File I. For a separate fictional outreach task, a person chooses exactly one exclusive route. Poster route: 3 layouts and 2 fonts, every pairing allowed. Audio bulletin route: 2 narrations and 3 lengths, every pairing allowed. No finished route is both poster and audio in this model.
- For H, calculate the number in at least one interest and the number in none. Show the three-set inclusion–exclusion expression. Give either all seven exact-region counts or a clear check using one pair-only region, one single-only region and the total universe.
- For I, count all complete routes. Show the products inside the branches and the operation between branches. Explain what a single product of all four given numbers would count instead.
- In one or two sentences, state a reasonableness check for each answer: a nonnegative region/union bound for H, and an explicit small-branch count for I.
Self-audit: A pair count includes the centre; a route's stages are joined by “and,” while the two finished routes are alternatives.