Fast computation of the binomial coefficients

The algorithm is based on the Borwein trick (the prime factoring of the factorial) with some simpler fallbacks for smaller numbers and k<<2n or (n-k)<<2n respectively