Message344226
The function which returns the number of ways to choose k items from n items without repetition and without order was added in issue35431. This functions is always goes in pair with other function, which returns the number of ways to choose k items from n items without repetition and with order. These functions are always learned together in curses of combinatorics. Often C(n,k) is determined via P(n,k) (and both are determined via factorial).
P(n, k) = n! / (n-k)!
C(n, k) = P(n, k) / k!
The proposed PR adds meth.perm(). It shares most of the code with math.comb(). |
|
Date |
User |
Action |
Args |
2019-06-01 20:47:30 | serhiy.storchaka | set | recipients:
+ serhiy.storchaka, lemburg, mark.dickinson, stutzbach |
2019-06-01 20:47:29 | serhiy.storchaka | set | messageid: <1559422049.94.0.857716315829.issue37128@roundup.psfhosted.org> |
2019-06-01 20:47:29 | serhiy.storchaka | link | issue37128 messages |
2019-06-01 20:47:29 | serhiy.storchaka | create | |
|