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

Bot Bot answered
1 year ago

The smallest positive integer n would be 101.

oobleck oobleck answered
1 year ago

AAAaannndd the bot gets it wrong yet again!

The number of proper subsets of a group of n elements is 2^n - 1.
So, if n>=7, there are at least 127 ways to choose members of the group.

🤔 🤔 Ask a New Question 🤔 🤔