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 proves claims by mathematical induction and shows every step: the base case, the inductive hypothesis, and the inductive step. It verifies each proof, so it never shows a wrong one.
Claim: Σ_{i=1}^{n} (2i) = n^2+n, for all n ≥ 1.
Proof. By induction on n.
Base case (n = 1): the left side is 2 and the right side is 2, which agree, so the claim holds for n = 1.
Inductive hypothesis: assume for some integer k ≥ 1 that Σ_{i=1}^{k} (2i) = k^2+k.
Inductive step: we show the claim for k + 1.
Σ_{i=1}^{k+1} (2i)
= Σ_{i=1}^{k} (2i) + 2(k+1)
= (k^2 + k) + (2k + 2) [by the inductive hypothesis]
= k^2 + 3k + 2
= (k+1)^2+(k+1).
This is the right side at n = k + 1, so the claim holds for k + 1.
By the principle of induction, the claim holds for all n ≥ 1. ∎
Summation identities, divisibility statements, and inequalities, for example sum of 2i equals n^2 + n, 6 divides 7^n - 1, and 2^n > n^2.
Yes. Every proof is verified before it is shown, and the base case is adjustable.
The calculator above is already loaded with this problem, edit it or type your own.