Number Theory Toolkit Skill Purpose Provide implementations and guidance for number theory algorithms commonly used in competitive programming. Capabilities - Modular arithmetic operations - Extended Euclidean algorithm - Chinese Remainder Theorem - Modular inverse and exponentiation - FFT/NTT for polynomial multiplication - Linear sieve implementations Target Processes - number-theory-algorithms - prime-algorithms - combinatorics-counting Algorithm Catalog Modular Arithmetic - Modular exponentiation (binary exp) - Modular inverse (Fermat/Extended GCD) - Modular square root (Tonelli-Shanks) G…