We have 23 naughty students. You have to pick two of them to give them a punishment. How many pairs of naughty students are there?
Note: The pairs Andy, Boby and Boby, Andy are NOT different.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The formula for finding the possibilities is:
( Q u a n t i t y o f p i c k e d i t e m s ) ! ( T h e Q u a n t i t y l e f t ) ! ( Q u a n t i t y o f i t e m s ) !
Let's plug this question in this formula:
2 ! 2 1 ! 2 3 !
= 2 2 2 ∗ 2 3
= 11 * 23
= 253
The problem is solved with ( K N ) where N is 23(the naughty students) and K(the number of students we need to pick).
( K N ) = (23 22)/2 = 23 11 = 2 5 3
It's not K N , it's ( K N ) .
Log in to reply
But how to change it?
Log in to reply
Use { N \choose K} code in Latex.
Log in to reply
@Nikola Alfredi – Ok. Thanks!
Not calculus, Combinatorics...{Extended part of probability}.
Log in to reply
Ok. Thanks!
Problem Loading...
Note Loading...
Set Loading...
The required number of pairs is 2 3 C 2 = 2 2 3 × 2 2 = 2 5 3 .