+0  
 
0
92
1
avatar

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?

 Jan 31, 2022
edited by Guest  Jan 31, 2022
 #1
avatar
0

The smallest positive integer n that works is 13.

 Jan 31, 2022

7 Online Users