Number Theory & Discrete Math
Integer arithmetic, modular systems, combinatorics, and Boolean logic tools for cryptography and discrete algorithms.
Prime Factorization & Modular Suite
Factorization, GCD, LCM, modular inverse, and basic modular arithmetic operations.
Open Tool →Chinese Remainder Theorem
Solve systems of simultaneous congruences. Shows constructive solution steps.
Open Tool →Combinatorics Calculator
Permutations, combinations, multinomial coefficients, and integer partitions.
Open Tool →Modular Exponentiation
Fast modular exponentiation (binary method) for large exponents — essential for RSA-style calculations.
Open Tool →Boolean Algebra Simplifier
Simplify Boolean expressions and visualize with Karnaugh maps for small numbers of variables.
Open Tool →