+0  
 
0
275
3
avatar

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?

 

Thanks in advance for anyone who helps ^0^

 Feb 28, 2020

Best Answer 

 #1
avatar+6196 
+1

\(\text{What you need is $n \ni \dbinom{n}{4} \geq 365$}\\ \text{Whipping out our pocket Pascal's Triangle we see that}\\ \dbinom{11}{4} = 330\\ \dbinom{12}{4} = 495\\ \text{So a group of 12 people and you're good to go}\)

.
 Feb 28, 2020
 #1
avatar+6196 
+1
Best Answer

\(\text{What you need is $n \ni \dbinom{n}{4} \geq 365$}\\ \text{Whipping out our pocket Pascal's Triangle we see that}\\ \dbinom{11}{4} = 330\\ \dbinom{12}{4} = 495\\ \text{So a group of 12 people and you're good to go}\)

Rom Feb 28, 2020
 #2
avatar+111433 
0

"Pocket Pascal's Triangle  "  ⇒  LOL!!!!

 

 

cool cool cool

CPhill  Feb 28, 2020
 #3
avatar
0

Thank you ^0^ 

 

I haven't learned about Pascal's Triangles yet, so I'll go and search them up and see if I can do my other homeworks by myself.

Guest Feb 28, 2020

27 Online Users

avatar
avatar
avatar