Where the Formulas Come From

Study Sheet

Where the Formulas Come From

The quadratic formula, series sums, and circle power — derived

The Quadratic Formula, Derived

Tip
Derivation by completing the square
xy123456−4−224(3, −4)22
x2−6x+5=(x−3)2−4x^2 - 6x + 5 = (x - 3)^2 - 4: the roots sit 4=2\sqrt4 = 2 either side of the line x=3x = 3.

From ax2+bx+c=0ax^2 + bx + c = 0: divide by aa, move the constant, and complete the square: (x+b2a)2=b2−4ac4a2\left(x + \dfrac{b}{2a}\right)^2 = \dfrac{b^2 - 4ac}{4a^2}. Square-root both sides and solve: x=−b±b2−4ac2ax = \dfrac{-b \pm \sqrt{b^2 - 4ac}}{2a}. ■\blacksquare

In plain terms. The formula is not magic — it is completing the square ONCE, in general, so you never have to do it again.

Example. x2−6x+5=0x^2 - 6x + 5 = 0: (x−3)2=4(x-3)^2 = 4, so x=3±2x = 3 \pm 2 — the formula gives the same 55 and 11.

Tip
Proof of Vieta's formulas

If rr and ss are the roots, the quadratic factors as a(x−r)(x−s)=a(x2−(r+s)x+rs)a(x - r)(x - s) = a\left(x^2 - (r+s)x + rs\right). Matching coefficients with ax2+bx+cax^2 + bx + c: r+s=−bar + s = -\dfrac{b}{a} and rs=cars = \dfrac{c}{a}. ■\blacksquare

In plain terms. Multiply the factored form back out — the sum and product of the roots are sitting in the coefficients.

Example. x2−7x+12x^2 - 7x + 12: roots sum to 77 and multiply to 1212 (33 and 44), read off with no solving.

Reminder — Vieta's formulas:  r1+r2=−ba,r1r2=car_1+r_2=-\frac{b}{a},\qquad r_1 r_2=\frac{c}{a}
Concept
Why the discriminant decides everything

In the derivation, the only square root taken is b2−4ac\sqrt{b^2 - 4ac}. Positive: two real roots. Zero: the ±\pm collapses — one repeated root. Negative: no real square root — no real roots. The discriminant is simply WHAT SITS UNDER THE RADICAL. ■\blacksquare

In plain terms. One number tells you how many real answers exist before you solve anything.

Example. x2+x+1x^2 + x + 1: Δ=1−4=−3<0\Delta = 1 - 4 = -3 < 0, so no real roots.

The Series Formulas, Derived

Tip
Arithmetic series: proof of Sn=n2(a1+an)S_n = \tfrac{n}{2}(a_1 + a_n)

Write the series forwards and backwards and add: each column gives a1+ana_1 + a_n (what one end gains, the other loses), so 2Sn=n(a1+an)2S_n = n(a_1 + a_n). ■\blacksquare

In plain terms. Same Gauss pairing as 1+⋯+1001 + \cdots + 100, just starting anywhere and stepping by anything.

Example. 5+8+11+⋯+355 + 8 + 11 + \cdots + 35 (1111 terms): S=112(5+35)=220S = \tfrac{11}{2}(5 + 35) = 220.

Tip
Geometric series: proof of Sn=a 1−rn1−rS_n = a\,\dfrac{1 - r^n}{1 - r}

Multiply the sum by rr and subtract: Sn−rSn=a−arnS_n - rS_n = a - ar^n — every middle term appears once in each copy and cancels. Divide by 1−r1 - r. ■\blacksquare For ∣r∣<1|r| < 1, rn→0r^n \to 0 gives the infinite form S=a1−rS = \dfrac{a}{1-r}.

In plain terms. Shifting the whole series one step and subtracting wipes out everything but the two ends.

Example. 1+12+14+⋯=11−12=21 + \tfrac12 + \tfrac14 + \cdots = \dfrac{1}{1 - \tfrac12} = 2.

Circle Power, Proved

Tip
Proof of the inscribed angle theorem
xx2xBDCO
The diameter case: OB=OCOB = OC makes the base angles equal, and the exterior angle at OO is their sum.

First the case where one chord is a diameter: the triangle from the center is isosceles (two radii), so the central angle, an exterior angle of it, equals the sum of two equal base angles — twice the inscribed angle. Any other position splits (or subtracts) into two such cases. ■\blacksquare

In plain terms. An angle at the rim is always half the angle at the center over the same arc — proved with one isosceles triangle.

Example. An angle inscribed in a semicircle sits on a 180∘180^\circ arc, so it is 90∘90^\circ — Thales’ theorem for free.

Tip
Proof of Power of a Point (two chords)
ABCDP3846
The shaded triangles PACPAC and PDBPDB are similar, so 3⋅8=4⋅63 \cdot 8 = 4 \cdot 6.

Chords ABAB and CDCD meet at PP. Angles ∠PAC\angle PAC and ∠PDB\angle PDB subtend the SAME arc, so they are equal; likewise ∠PCA=∠PBD\angle PCA = \angle PBD. Hence △PAC∼△PDB\triangle PAC \sim \triangle PDB, and matching sides gives PAPD=PCPB\dfrac{PA}{PD} = \dfrac{PC}{PB}, i.e. PA⋅PB=PC⋅PDPA \cdot PB = PC \cdot PD. ■\blacksquare

In plain terms. The inscribed angle theorem hands you two similar triangles, and the product formula is just their ratio cross-multiplied.

Example. Pieces 3,83, 8 and 4,x4, x: 3⋅8=4x3 \cdot 8 = 4x gives x=6x = 6.

AM–GM, Proved

Tip
Proof: a+b2≥ab\dfrac{a + b}{2} \ge \sqrt{ab} for a,b≥0a, b \ge 0

Squares are never negative: (a−b)2≥0\left(\sqrt a - \sqrt b\right)^2 \ge 0. Expand: a−2ab+b≥0a - 2\sqrt{ab} + b \ge 0, i.e. a+b≥2aba + b \ge 2\sqrt{ab} — with equality exactly when a=b\sqrt a = \sqrt b, i.e. a=ba = b. ■\blacksquare

In plain terms. The whole inequality is one squared bracket refusing to be negative. Equality means the bracket was zero: the numbers were equal.

Example. For a+b=20a + b = 20, the product abab is largest at a=b=10a = b = 10: ab≤(202)2=100ab \le \left(\tfrac{20}{2}\right)^2 = 100.

Concept
Using the equality case on purpose

AM–GM problems are usually about WHERE equality happens: to optimize, arrange the terms so they can all be equal, then read off the extreme value.

In plain terms. The maximum or minimum almost always happens at "all parts equal."

Example. Minimize x+9xx + \dfrac{9}{x} for x>0x > 0: equality of xx and 9x\tfrac9x at x=3x = 3 gives minimum 66.

Two More Derivations Worth Knowing

Tip
Derivation: the sum of the first nn squares

12+22+⋯+n2=n(n+1)(2n+1)61^2 + 2^2 + \cdots + n^2 = \dfrac{n(n+1)(2n+1)}{6}.

Telescope the cubes: (k+1)3−k3=3k2+3k+1(k+1)^3 - k^3 = 3k^2 + 3k + 1. Summing from k=1k=1 to nn, the left side collapses to (n+1)3−1(n+1)^3 - 1, so (n+1)3−1=3∑k2+3⋅n(n+1)2+n(n+1)^3 - 1 = 3\sum k^2 + 3\cdot\tfrac{n(n+1)}2 + n. Solving gives ∑k2=n(n+1)(2n+1)6\sum k^2 = \dfrac{n(n+1)(2n+1)}{6}. ■\blacksquare Check at n=3n = 3: 1+4+9=141 + 4 + 9 = 14 and 3⋅4⋅76=14\tfrac{3\cdot4\cdot7}{6} = 14 ✓ The same telescoping with fourth powers gives the cube sum (n(n+1)2)2\left(\tfrac{n(n+1)}{2}\right)^2.

Tip
Derivation: the number of subsets is 2n2^n

A set with nn elements has 2n2^n subsets, and ∑k(nk)=2n\sum_{k}\dbinom nk = 2^n.

Build a subset by deciding IN or OUT for each element independently: 22 choices, nn times, 2n2^n subsets. Grouping those subsets by size counts the same collection a second way, giving ∑k(nk)=2n\sum_k \dbinom nk = 2^n. ■\blacksquare Counting one set two ways is the whole of combinatorial identity proving, and the binomial theorem at x=y=1x = y = 1 is this identity again.