Competitive Programming - Calculating the Binomial Coefficient using Modular Arithmetic and Fermat's Little Theorem
Combinatorics problems are very often used in programming contests. Fundamental knowledge for some of the harder problems is how to quickly and properly count combinations with the help of modular arithmetic to avoid calculations with big numbers.