ó \!šhoãó•SrSSjrSSjrg)có2•US:XagU[US- 5-$)Néé©Ú factorial)Úns ÚhC:\Users\julio\OneDrive\Documentos\Trabajo\Ideas Frescas\venv\Lib\site-packages\mlxtend/math/counting.pyrr s €ØˆAƒvØà”9˜Q ™UÓ#Ñ#Ð#ócóº•U(a+[X-S- 5n[U5[US- 5-nO$[U5n[U5[X- 5-nX4-nU$)a¿ Function to calculate the number of possible combinations. Parameters ---------- n : `int` Total number of items. k : `int` Number of elements of the target itemset. with_replacement : `bool` (default: False) Allows repeated elements if True. Returns ---------- comb : `int` Number of possible combinations. Examples ----------- For usage examples, please see https://rasbt.github.io/mlxtend/user_guide/math/num_combinations/ rr)rÚkÚwith_replacementÚ numeratorÚ denominatorÚcombs rÚnum_combinationsrsY€ö0ܘa™e a™iÓ(ˆ Ü “l¤Y¨q°1©uÓ%5Ñ5‰ ä˜a“Lˆ Ü “l¤Y¨q©uÓ%5Ñ5ˆ Ø Ñ #€DØ €Kr cóX•U(aX-nU$[U5n[X- 5nXE-nU$)a¨ Function to calculate the number of possible permutations. Parameters ---------- n : `int` Total number of items. k : `int` Number of elements of the target itemset. with_replacement : `bool` Allows repeated elements if True. Returns ---------- permut : `int` Number of possible permutations. Examples ----------- For usage examples, please see https://rasbt.github.io/mlxtend/user_guide/math/num_permutations/ r)rr r Úpermutr rs rÚnum_permutationsr3s9€ö0Ø‘ˆð €Mô˜a“Lˆ Ü ¡Ó&ˆ ØÑ)ˆØ €Mr N)F)rrr©r rÚrsðò$ôõDr