dsa3 min read
Number Theory: Perfect Numbers, Abundant, and Digit Problems
Explore digit manipulation, perfect/abundant numbers, Armstrong numbers, and common math interview patterns.
Read →
All Posts
1575 articles
dsa3 min read
Combinatorics: nCr, Pascal's Triangle, and Catalan Numbers
Compute combinations nCr efficiently with precomputed factorials, Pascal's triangle for small n, and Catalan numbers for tree/parenthesis counting.
Read →
dsa3 min read
Euler's Totient Function and Applications
Compute Euler's totient phi(n) for cryptography and modular inverse applications. Sieve variant for all values up to n.
Read →
dsa3 min read
Prime Factorization: Trial Division and Pollard's Rho
Factor integers efficiently with trial division O(sqrt n), SPF sieve O(log n), and understand when each approach is optimal.
Read →
dsa4 min read
Modular Arithmetic: Fast Exponentiation and Inverse
Master modular arithmetic for competitive programming: binary exponentiation O(log n), modular inverse, and Chinese Remainder Theorem.
Read →
Page 285 of 315