Type a unit name or symbol; use ↑ ↓ and Enter or Tab to accept a suggestion. Compound units work too: kN*m → ft*lbf.
One letter is a variable (F, IG, μ); a word searches by name (friction, inertia). Greek names and sqrt turn into symbols as you type; Tab undoes it. ↑ ↓ pick, Enter inserts.
Search a material (aluminum, 6061, stainless, water), a property (yield, density, specific heat) or a symbol (E, cp, ρ). Click a value to put it in your line in SI units, or + line to add it as its own variable. ↑ ↓ pick, Enter inserts the first value.
Pick a topic to see how it works. Try it opens the example in a new tab. New here?
Tabacus finds gcd(a, b) and writes out the Euclidean algorithm line by line, then works back up to express the gcd as a combination of a and b, the extended Euclidean algorithm.
Euclidean algorithm, divide and keep the remainder: 252 = 2 · 105 + 42 105 = 2 · 42 + 21 42 = 2 · 21 + 0 The last nonzero remainder is 21, so gcd(252, 105) = 21. Working back up (Bezout): 21 = (-2) · 252 + 5 · 105
Divide the larger number by the smaller and keep the remainder. Repeat with the smaller number and that remainder. The last nonzero remainder is the gcd.
Writing gcd(a, b) = s·a + t·b. When the gcd is 1, s is the inverse of a modulo b, which is how modular inverses and linear congruences are solved.
The calculator above is already loaded with this problem, edit it or type your own.