It's not just numbers: Journeys into exploratory and proof-based mathematics
SAT Score Range
•
29 sessions
•
AC
RS
IR
+23
About
I believe everyone should be given a space to practice their proof-based math skills, since it teaches you to think logically on your feet, explore, and build/challenge arguments.
PREREQUISITES: This series is meant to be accessible to a broad audience. In reality, much of what we consider to be "college-level math" is completely reachable for students with just a basic proficiency with high school algebra. If any of these sessions require any more advanced prerequisites, I will say so in the description. If you don't have the background knowledge, I encourage you to attend anyway, but also feel free to ask for an excused absence.
Each session, we will explore a different topic in mathematics. These topics are likely unlike any math you've seen before. With this series, I hope to help expand your horizons of what math really is, outside of the classroom. Topics include, but are not limited to, set theory, combinatorics, graph theory, geometry, and more.
These sessions will be proof- and discussion-based, so I would like all participants to engage as much as they are comfortable with! I will provide the basic definitions, pose motivating questions, and provide hints as needed, but the exploration is entirely up to you.
I will add more sessions to this series as we go, so if you have any ideas for future sessions, please feel free to suggest them!
Also, if you're interested in this series but the current set time doesn't work for you, feel free to suggest a better time period that works for you, and if there's enough interest, I can see if I can switch times.
Tutored by
✋ ATTENDANCE POLICY
Each session will be mostly independent from the others, so don't worry if you need to miss a few. However, if you do, please give me as much advance notice as possible.
SESSION 29
22
Mar
SESSION 29
Even More Math
Even More Math
Sun 3:00 PM - 4:30 PM UTCMar 22, 3:00 PM - 4:30 PM UTC
Title: Random friend groups
We've studied graphs before, but in the past, we always specified exactly how the graph looks. What if we forget about that, and instead just say "let G be a random graph on n vertices, where there is a certain probability that any two vertices are connected?" Random graphs are very useful tools that can allow us to prove many interesting ideas in Graph Theory, including the probability that if you choose an n-vertex graph randomly, you will find a "clique" of vertices that are all connected to each other.
Though they have not been scheduled yet, I plan to host more sessions in this series. If you're interested, register for the series to keep up to date on session timings and express your preferences, and feel free to suggest ideas for future sessions!