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?
A classic divisibility proof by induction: 3 divides n^3 − n for all n ≥ 1. Tabacus shows the base case, the inductive hypothesis and the algebra that closes the step.
Claim: 3 | n^3-n, for all n ≥ 1.
Proof. By induction on n.
Base case (n = 1): 1^3-1 = 0 = 3·0, which is divisible by 3.
Inductive hypothesis: assume 3 | k^3-k for some integer k ≥ 1; that is, k^3-k = 3r for some integer r.
Inductive step: we show 3 | (k+1)^3-(k+1).
(k+1)^3-(k+1) = (k^3-k) + 3k^2 + 3k [since (k+1)^3-(k+1) − (k^3-k) = 3k^2 + 3k]
= 3r + 3k^2 + 3k [by the inductive hypothesis]
= 3(r + (k^2 + k)),
which is divisible by 3 because r + (k^2 + k) is an integer.
By the principle of induction, 3 | n^3-n for all n ≥ 1. ∎
Yes: n^3 − n = (n − 1)·n·(n + 1), a product of three consecutive integers, and one of any three consecutive integers is a multiple of 3.
(k+1)^3 − (k+1) = (k^3 − k) + 3k^2 + 3k. The first part is divisible by 3 by hypothesis and the rest is 3(k^2 + k).
The calculator above is already loaded with this problem, edit it or type your own.