Function smallbitset::nb_combinations

pub fn nb_combinations(k: usize, among_n: usize) -> usize

This will count the number of possible cases. Given that we want to draw k items among a set of n, without considering the repetitions and without considerations for the order, we are computing the number of possible combinations $C^n_k = \frac{n!}{k! (n-k)!}$.