# Administrative Information - **Class Meeting**: Wednesday, October 7, 2026, 1:00–1:50pm — **Coolbaugh 212** - Previous meeting: [[MATH310F26(Day 17) - The central limit theorem, and a heavy tail]] - 📄 [[Teaching/MATH310/MATH310F26/Administration/MATH310_F26_Syllabus_1.0.pdf|MATH 310 F26 Syllabus, v1.0]] > [!info]- Admin. Notes > Expect an LR and WB for each lecture. WBs target 15-minute engagements (longer early on); LRs are short, ~5 minutes. > > - 🎯 **[LR] Day 17 Reflection Questions** — 4 questions drawn from Monday's material, unlimited attempts, highest kept — *Canvas link TK* — due **Wednesday 10/7, 11:59pm** > - 🎯 **[LR] Day 17 Reflection Statement** — one free response, no wrong answers — *Canvas link TK* — due **Wednesday 10/7, 11:59pm** > - 📝 **[MP2 — Variables and Equations](https://elearning.mines.edu/courses/81632/assignments/588666)** · [[MATH310F26-MP2-VariablesEquations.pdf|guide]] — due **today, Wednesday 10/7, 11:59pm** > - 📝 **[MA1 — Model Selection](https://elearning.mines.edu/courses/81632/assignments/588667)** · [[MATH310F26-MA1-ModelSelection.pdf|guide]] — due **Friday 10/9, 11:59pm** > - ✍️ **Workbook check-in, in person — Friday 10/9, first 15 minutes**: blank sheet, any one workbook problem of your choice > - 🎯 **[WB] [Workbook 11](https://elearning.mines.edu/courses/81632/assignments/588368)** · [[MATH310F26_WB11.pdf|blank]] · [[MATH310F26(Workbook 11 Companion) - Three outcomes, two moments|companion]] — due **Friday 10/30, 11:59pm** > - 🗺️ **[[MATH310F26 - Project Work]]** — checkpoint calendar, rubric, [[MATH310F26-AudienceCard.pdf|audience card]] > - 🎬 [[MATH310F26 - Random numbers, two videos]] — the guided videos for this unit, if you haven't yet > [!example]- 🗃️ COMAP Corner — three from the archive > *TK — three picks (one stat, one computational, one weird) from the catalog land here.* > [!warning] Skeleton — this is the pre-class page > Day 18 has not met yet (title provisional). Monday answered two of the three side-board questions — *does it generalize?* (yes) and *what is the distribution of walkers?* (normal, by the central limit theorem, when the steps have a mean and a variance) — and closed with "additional properties next time." The third question is **dynamics**: what the walk remembers. Slide 16's parked key point says the covariance of $S_{n}$ with $S_{n+k}$ leads back to the step statistics just as the mean and variance did, so the walk's **autocorrelation** comes for free; after that the deck turns to recurrence ("a drunk man will find his way home, but a drunk bird may get lost forever"), gambler's ruin, and the continuum limit. The transcript and any captures fill in after Wednesday's class.