Get the latest tech news
Covering All Birthdays
Quantifying how likely each birthday is present (covered) in some large group of people.
I recently got nerd sniped by a fascinating post on Hacker News titled Every day is an Owl’s Birthday! For the theory part you’ll need a good understanding of counting methods and how the binomial coefficient$n \choose k$ (read as “n choose k”) is used in combinatorics. Because the numbers get very large very quickly, I’ll also work with the simpler case of covering 4 seasons with 5 people: spring 🌱, summer ☀️, autumn 🍂 and winter ❄️.
Or read this on Hacker News