Toolbox

Tools

Interactive calculators and step-by-step explanations, grouped by subject.

Discrete Structures

Number theory, algebra and combinatorics — the mathematical foundations of computer science.

Extended Euclidean Algorithm
Computes the greatest common divisor of two integers together with the Bézout coefficients λ and μ — optionally in ℤ_p to find a modular inverse.

Computer Engineering

Digital logic and computer architecture — how hardware performs computation.

Adder Networks
Adds two 4-bit numbers with the von Neumann, parallel or serial adder and shows the bit/decimal step table with carry/overflow u.