+0  
 
0
97
2
avatar+80 

I run a book club with $n$ people, not including myself. Every day, for $365$ days, I invite four 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 four members over all $365$ days?

The answer is not 495 or 330, because I got them wrong.

 May 21, 2020
 #1
avatar
0

I'm getting n = 14.

 May 21, 2020
 #2
avatar+80 
0

The right answer is 12. 12 choose 4=495

495>365

 May 21, 2020

47 Online Users

avatar
avatar
avatar