Number System¶

Number systems are mathematical ways of representing numbers. In competitive programming and algorithms, understanding number system properties and related algorithms is crucial for efficiency.

Topics¶

• Greatest Common Divisor (GCD) - Understanding and implementing the Euclidean Algorithm.
• Sieve of Eratosthenes - Efficiently finding all prime numbers up to \(n\).
• Pascal's Triangle - Understanding binomial coefficients and triangular arrays.
• Prime Numbers - Primality testing and factorization.
• Factorial - Computing \(n!\) and related properties.
• Fast Exponentiation - Calculating \(a^n\) in logarithmic time.