document.write( "Question 1204712: I run a book club with $n$ people, not including myself. Every day, for $100$ days, I invite $14$ 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 $14$ members over all $100$ days? \n" ); document.write( "
Algebra.Com's Answer #841152 by ikleyn(52794)![]() ![]() You can put this solution on YOUR website! . \n" ); document.write( "I run a book club with n people, not including myself. Every day, for 100 days, I invite 14 members in the club \n" ); document.write( "to review a book. What is the smallest positive integer n so that I can avoid ever having the exact same group \n" ); document.write( "of 14 members over all 100 days? \n" ); document.write( "~~~~~~~~~~~~~~~~~~~~~~\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " In my solution, I will assume that the person \"I\" does not participate in any group of 14 persons.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " The problem is silent about it, so I can make such assumption.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \r\n" ); document.write( "The number of all possible different groups of 14 members is\r \n" ); document.write( "\n" ); document.write( "Solved.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |