Course: Introduction to Statistics (MATH 11) · Silver Oak University (fictional sample) · Prof. Rivera
Module: Week 7 of 16 · Fall 2026 · in-person, two 75-minute sessions
Objectives covered: Objective 4 — Apply basic probability rules, including conditional probability, and work with random variables. · Objective 5 — Use normal and sampling distributions to reason about variability.

This file holds two pieces: (A) the Module 7 Overview page ("Start Here") and (B) the Welcome Announcement that drips out when the module opens. Dates below assume a Tuesday/Thursday session pattern with Week 7 meeting Tue Oct 13 and Thu Oct 15, and end-of-week work due Sunday Oct 18, 11:59 p.m. (with the discussion's initial post due Fri Oct 16). Adjust the day-of-week and times to match your section.

(A) Module 7 Overview — Start Here

Welcome to Week 7: Binomial & Normal Models

This is your home base for the week. Read it first, then work the checklist below from top to bottom. Everything you need is linked inside the module.

This week we take last week's idea — a random variable with a mean and a spread — and meet the single most useful one in all of statistics: the binomial count. It's the answer to every "how many out of n?" question: how many of 4 free throws drop, how many of 50 emails get opened, how many of 100 voters say "yes." A yes/no thing, repeated a fixed number of times. We'll learn to spot when a situation is binomial, compute the small ones by hand, find the center and spread with one-line formulas, and — the payoff — see when the bell curve is allowed to do the heavy lifting for the big ones.

The week's big question

"When a yes/no thing happens over and over, how do we predict the count — and when can the bell curve do the heavy lifting for us?"

By Friday you'll be able to look at a "how many out of n" question, decide in seconds whether it's a binomial, compute the small ones by hand, and know exactly when you're allowed to hand the big ones to the normal curve.

By the end of this week, you can…

Use this as a checklist. If you can do all four out loud, you're ready for the quiz.

• [ ] Check whether a situation is a binomial setting using the four conditions — B-I-N-S: a Binary outcome, Independent trials, a fixed Number of trials (n), and the Same probability of success (p) on every trial. Miss one and it's not binomial.
• [ ] Compute a binomial probability for a small case by hand, using P(X = k) = C(n, k) · pᵏ · (1−p)ⁿ⁻ᵏ — count the arrangements, multiply by the chance of one arrangement.
• [ ] Find the mean (np) and standard deviation (√(np(1−p))) of a binomial count — center and spread with two quick products, no listing terms.
• [ ] Decide when the normal approximation applies — the np ≥ 10 AND n(1−p) ≥ 10 check — and explain why it works (many independent yes/no trials pile up into a bell).

What's due this week, and when

Work these in order — each one gets you ready for the next.

Heads-up on the AI tutorial: you'll use a chatbot to draft, and then you judge its work against what we cover in class. Chatbots routinely stumble here — they'll quietly flip "exactly 2" into "at least 2," drift from the count to the proportion, or slap a normal approximation on a case where np < 10 isn't met. Catching the model is the point.

Late policy reminder: 10% off per day late. If life happens, reach out before the deadline — I'd much rather hear from you early.

One more heads-up — the midterm is next week. Week 8 is midterm review and the midterm, pulling together everything from Weeks 1–7. So this week's quiz, discussion, and assignment do double duty: finish them well and you've already started studying.

How to succeed this week

• Run the checklist before any formula. Every "how many out of n" question gets the four conditions first — B-I-N-S. If "same p" or "independent" fails (think dealing cards without replacement, or "flip until you get a head"), it's not binomial and the formula would give a confidently wrong answer.
• Memorize the two one-liners. Mean = np (successes-per-trial times trials). SD = √(np(1−p)) — and don't drop the (1−p): √(np) is a common, wrong shortcut.
• "Success" is just a label. It's whatever you're counting — a defect can be a "success." Don't let the everyday word fool you.
• Know the bell-curve license cold. Use the normal approximation only when np ≥ 10 AND n(1−p) ≥ 10 — both sides must clear 10. One guards the success side, the other the failure side; when p is far from ½, you need a bigger n to pass.
• Treat the chatbot as a smart intern, not an oracle. It drafts; you check — and this week you already know the right numbers (P(X=2) for B(3,0.5) is 0.375; the mean of B(100,0.5) is 50 with SD 5). That habit is the whole semester in miniature.

This week leans on Week 6 (random variables, expected value, variance) — re-skim those if they're fuzzy. Come to class ready to flip some coins and argue about whether a poll of 9 people earns a bell curve. See you Tuesday.

(B) Welcome Announcement — Module 7

Release setting: post on the module's start day (offset = 0 days), i.e., Tue Oct 13, 2026 — not before. If your platform won't preserve the scheduled date on import, post this as a draft labeled "Release: Tue Oct 13."

Subject: Week 7 — how many out of n? (and when the bell curve helps) 🎯

Hi everyone,

Quick scenario: a player who makes half her free throws shoots three. How many will she make? You can't know the exact number — but you can know the odds of each number, and that turns out to be one of the most useful tricks in all of statistics.

This week — Binomial & Normal Models — we tackle the big question: When a yes/no thing happens over and over, how do we predict the count, and when can the bell curve do the heavy lifting for us? By Friday you'll spot a "how many out of n" situation, check it against the four conditions (B-I-N-S), compute the small ones by hand, find the center (np) and spread (√(np(1−p))), and know exactly when you're allowed to hand the big ones to the normal curve (the np ≥ 10 and n(1−p) ≥ 10 check).

Three things not to miss:
1. Lecture Tutorial 7 — work through the conditions, small probabilities, mean & SD, and the normal-approximation check with one approved chatbot (Gemini, Claude, or ChatGPT) and submit the share link. You'll catch the model's mistakes, not just trust it. Due Sun Oct 18.
2. Quiz 7, Discussion 7, and Assignment 7 also close Sun Oct 18 — and the discussion's initial post is due Fri Oct 16, so start early and leave time to reply to classmates.
3. The midterm is next week (Week 8). Everything you do this week is also review — finish it well and you're ahead.

One promise, same as always: this is a course about thinking clearly, not about being a "math person." We lead with the plain-language idea — count the successes, name the four conditions, and the formula does the rest until n gets big and the bell curve takes over — and the notation comes second.

Open the Start Here / Module Overview page first — it lays out everything in order with due dates. Bring your curiosity (and maybe four coins) to class on Tuesday.

See you soon,
Prof. Rivera