im stuck on this :((

oh sorry D:

I run a book club with n people, not including myself. Every day, for 365  days, I invite three members in the club to review a book. What is the smallest positive integer n  so that I can avoid ever having the exact same group of three members over all   365 days?
 

You need ${n \choose 3} \ge 365$

The smallest number that satisfies this is $\color{brown}\boxed{15}$

14 C 3 = 364

15 c 3 = 455