Last active
October 12, 2019 19:03
-
-
Save Brandonmchu/c77a70b9fdb309f2728d to your computer and use it in GitHub Desktop.
Number of possible meetings in a 20-person company
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
1,048,555 | |
“The greatest shortcoming of the human race is our inability to understand the exponential function.” — Al Bartlett | |
##Math | |
General Formula: http://stats.stackexchange.com/questions/27266/simplify-sum-of-combinations-with-same-n-all-possible-values-of-k | |
In this case we deviate from the general formula ∑k=1n(nck)=2^n−1 by also subtracting an additional nc1(20c1), since there are no meetings of one. | |
So 2^20 - 1 - 20c1 = 1,048,555 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment