Formulas for Pre-Olympiad Competition Math

Eashan Gandotra
4 August 2017

This is a compilation of various formulas that are useful for competition math. I’ve ordered
them by topic (geometry, number theory, algebra, and counting/probability). It is designed to be
a reference - not a study guide. The starred (*) formulas are ones you must know for competition
math, as they are very useful and come up in nearly every competition. The others listed are good
to know, fun to learn, and are used occasionally, but aren’t necessary for scoring well. Thanks
to all the AoPSers (especially mathwiz0803) who contributed through their time and suggestions!
For more in depth explanations for each of these, visit AoPS Wiki or search for explanations on
Youtube. I hope this helps!
Page 1 eashang1

1 Geometry
1.1 Area of a Triangle*
bh
A= 2 = rs = 12 ab sin θ = abc
4R

Where A is the area, b is the base, and h is the height. In the second equation, r is the inradius
and s is the semiperimeter (which is half the perimeter). In the third equation, θ is the angle
between two sides a, b of the triangle. In the final equation, a, b, c are the sides of the triangle with
circumradius R.

1.2 Area of a Square (and kite/rhombus)*

d1 ·d2
A = bh = s2 or alternatively 2

Where A is the area, b is the base, h is the height, s is the side length, and d1,2 are the lengths
of the diagonals. The prior equation only applies to squares. The latter formula applied to any
quadrilateral with perpendicular diagonals (such as kites and rhombi).

1.3 Area of a Rectangle*

A = bh

Where A is the area, b is the base, and h is the height.

1.4 Area of a Trapezoid*

(b1 +b2 )(h)
A= 2

Where A is the area, b1 and b2 are bases, and h is the height.

1.5 Area of a Regular Hexagon*

√
3 3s2
A= 2

Where A is the area and s is the side length. Deriving this by breaking the hexagon into six
equilateral triangles and then 12 right triangles is a useful exercise.

1.6 Area of a Regular Polygon*

ap ns2
A= 2 or 4 tan( 180
n )

Where A is the area, a is the apothem, p is the perimeter, n is the number of sides, and s is the
side length.

1.7 Volume/Surface Area of a Cone*

πr 2 h
V = 3 , SA = πr2 + πrl

Where V is the volume, SA is the surface area, r is the radius of the circular base, h is the height,
and l is the slant height.
Page 2 eashang1

1.8 Volume/Surface Area of a Sphere*

4πr 3
V = 3 , SA = 4πr2

Where V is the volume, SA is the surface area, and r is the radius of the sphere (which is radius
of the central cross section/the base of the semisphere).

1.9 Volume/Surface Area of a Cube*

V = s3 , SA = 6s2

Where V is the volume, SA is the surface area, and s is the length of a side.

1.10 Volume/Surface Area of a Pyramid*

V = 31 bh, SA = 2sl + b

Where V is the volume, SA is the surface area, b is the area of the base, h is the height, l is the
slant height, and s is the length of a side of the base. Note that a pyramid can have a base of
any polygon, but if none is specified, assume a square base. A pyramid with a triangular base is
known as a tetrahedron.

1.11 Volume/Surface Area of a Cylinder*

V = πr2 h, SA = 2πr2 + 2πrh

Where V is the volume, SA is the surface area, r is the radius of the circular base, and h is the
height.

1.12 Volume/Surface Area of a Prism*

V = lwh, SA = 2(lw + lh + wh)

Where V is the volume, SA is the surface area, l is the length, w is the width, and h is the height.

1.13 Pythagorean Theorem and Right Triangles*

a2 + b2 = c2

Where c is the hypotenuse of a right triangle with legs a and b. Note that there are some “special”
right triangles. These include right triangles with angle measures 45◦ − 90◦ − 45◦ and 30◦ −
60◦ − 90◦ . The prior type of right triangle√has the property that if either leg (they are identical)
has length x, the hypotenuse has length x 2. Similarly, the latter type of right triangle has the
property√that if the side opposite the 30◦ angle has length x, the side opposite the 60◦ angle has
length x 3, and the side opposite the 90◦ angle has length 2x. You should also memorize some
common Pythagorean triples (if a triangle has these side lengths, or these side lengths multiplied
by some factor, it is a right triangle): 3 − 4 − 5, 5 − 12 − 13, 7 − 24 − 25, and 8 − 15 − 17.
Page 3 eashang1

1.14 Distance Formula*

p
d= (x2 − x1 )2 + (y2 − y1 )2

Where (x1 , y1 ) and are points a coordinate plane and d is the distance between them. This is
essentially the Pythagorean Theorem restated for points on a plane.

1.15 Heron’s Formula*

p
A = (s)(s − a)(s − b)(s − c)
Where A is the area and s is the semiperimeter of the triangle with sides a, b, c.

1.16 Cyclic Quadrilaterals*

A quadrilateral is cyclic if and only if the quadrilateral can be inscribed in a circle. Here are some
of the fundamental properties of cyclic quadrilaterals.

1. Opposite angles add to 180◦ .

2. A convex quadrilateral is cyclic if and only if the four perpendicular bisectors to the sides
are concurrent. This common point is the circumcenter.
3. In cyclic quadrilateral ABCD, 6 ABD = 6 ACD, 6 BCA = 6 BDA, 6 BAC = 6 BDC,
6 CAD = 6 CBD

1.17 Ptolemy’s Theorem*

ab + cd = ef

Where ABCD is a cyclic quadrilateral with side lengths a, b, c, d and diagonals e, f (with a opposite
b and c opposite d).

1.18 Brahmagupta’s Formula

p
K= (s − a)(s − b)(s − c)(s − d)

Where K is the area and s is the semiperimeter of the quadrilateral with sides a, b, c, d. For this
formula to work, the quadrilateral must be cyclic.
Page 4 eashang1

1.19 Power of a Point*

There are three cases for this theorem:

This theorem states that in the leftmost diagram (two intersecting internal chords), AE · EC =
2
DE · EB, in the middle diagram (a tangent and a secant that meet at a point) AB = BC · BD,
and in the last diagram (secants that intersect outside the circle) CB · CA = CD · CE. A good
exercise is to try and prove these with similar triangles.

1.20 Ceva’s Theorem

Ceva’s theorem states that in with points D, E, F on sides BC, AC, AB respectively, are concurrent
if, and only if, BD · CE · AF = 1
DC EA F B

1.21 Menelaus’ Theorem

This configuration shows up from time to time, though not often. The theorem states that given
a configuration as shown below, BP · CQ · P C = QA · RB · AR

1.22 Arcs and Angles in a Circle*

An arc is a portion of the circle’s circumference measured in degrees. The measure of an angle
formed by the center of a circle and two point on the circumference is equal to the measure of the
intercepted (subtended) arc. An angle formed by three points on the circumference of the circle is
equal to 21 the measure of the subtended arc.

1.23 Angle Bisector Theorem*

The Angle Bisector Theorem states that given 4ABC and angle bisector AD, where D is on side
c
BC, then m = nb . Likewise, the converse of this theorem holds as well
Page 5 eashang1

1.24 Trigonometric Identities*

sin θ cos θ 1 1
Note that tan θ = cos θ and cot θ = sin θ . Also sec θ = cos θ and csc θ = sin θ . Therefore, the
identities for tan, cot, sec, csc are easily derived from the identities for sin and cos.
Double Angle: sin 2θ = 2 sin θ cos θ cos 2θ = cos2 θ − sin2 θ Negative Angles: sin cos −θ =
sin cos θ cos sin −θ = cos − sin θ = cos sin θ Pythagorean Identities: sin2 θ + cos2 θ = 1 cot2 θ + 1 =
csc2 θ tan2 θ + 1 = sec2 θ Addition/Subtraction Identities: sin a ±q B = sin a cos B ± q
sin B cos a
cos a ± B = cos a cos B ± sin a sin B Half Angle Identities: sin θ2 = ± 1−cosθ
2 cos θ2 = ± 1+cosθ
2

1.25 Triangle Inequality*

The Triangle Inequality says that in nondegenerate 4ABC: AB + BC > AC, BC + AC > AB,
AC + AB > BC

1.26 Pick’s Theorem

A = I + 12 B − 1 Where A is the area, I is the number of lattice points in the interior, and B is the
number of lattice points on the boundary of a figure in the coordinate plane.

1.27 Stewart’s Theorem*

Take 4ABC with sides of length a, b, c opposite vertices A, B, C respectively. If cevian AD is
drawn so that BD = m, DC = n, AD = d we have that man + dad = bmb + cnc, which can
be remembered using the mnemonic device, “A man and his dad put a bomb in the sink.” This
theorem isn’t used very often in competition math, but it can trivialize otherwise difficult problems
when it does come up.

1.28 (Extended) Law of Sines*

a
sin A= sinb B = sinc C = 2R Where a, b, c are sides of a triangle, each opposite its respective angle
A, B, C. R is the circumradius.

1.29 Law of Cosines*

For a triangle with sides a, b, c and opposite angles A, B, C respectively, the Law of Cosines states
c2 = a2 + b2 − 2ab cos C
Page 6 eashang1

1.30 Shoelace Theorem*

Shoelace Theorem Suppose the polygon has vertices (a1 , b1 ), (a2 , b2 ), ..., (an , bn ) listed in clockwise
order. Then the area of P is 21 |(a1 b2 + a2 b3 + ... + an b1 ) − (b1 a2 + b2 a3 + ... + bn a1 )| The Shoelace
Theorem gets its name because if one lists the coordinates in a column and marks the pairs of
coordinates to be multiplied, the resulting image looks like laced-up shoes.
(a1 , b1 )
(a2 , b2 )
...
(an , bn )
(a1 , b1 )

2 Number Theory
2.1 Sum of an Arithmetic Series*
n
Sn = 2 (a1 + an ) Where n is the number of terms, Sn is the sum, and a1 is the first term.

2.2 Sum of the first n terms of a Geometric Series*

a1 (1−r n )
S= 1−r Where S is the sum, a1 is the first term, and r is the common ratio with |r| < 1.

2.3 Sum of an Infinite Geometric Series*

a1
S = 1−r Where r is the common ratio, S is the sum, and a1 is the first term. Note that |r| < 1
for this formula to work (otherwise the sum doesn’t converge).

2.4 Sum of an Arithmetic Series*

n(n+1)
The sum of the first odd numbers is simply n2 . The sum of the first n numbers 2 . The sum
of the first n even numbers is n(n + 1).

2.5 Sum of the First n (Even/Odd/Both) Integers*

The sum of the first n odd positive integers is simply n2 . The sum of the first n even positive
integers is n(n + 1). The sum of the first n positive integers is given by n(n+1)
2 .

2.6 Number/Sum of Divisors*

Let px1 py2 ...pnm be the prime factorization of sum number a. The number of divisors a has is given
by (x + 1)(y + 1)...(n + 1). Similarly, the sum of the divisors of a is given by (p01 + p11 ...px1 )(p02 +
p12 ...py2 )...(p0m + p1m ...pnm ).

2.7 Chinese Remainder Theorem

The Chinese Remainder Theorem (or CRT) allows you to solve a system of linear congruences. Let
m1 , m2 , ..., mr be a collection of pairwise relatively prime integers. Then the system of simultane-
ous congruences x ≡ a1 ( mod m1 ), x ≡ a2 ( mod m2 ), ..., x ≡ ar ( mod mr ) has a unique solution
modulo M = m1 m2 , ∆∆∆mr , for any given integers a1 , a2 , ..., ar . This is easier to understand in an
example and is very well explained in this video: https://www.youtube.com/watch?v=Y5RcMWiUyyE
Page 7 eashang1

2.8 Chicken McNugget Theorem

The Chicken McNugget Theorem states that for any two relatively prime positive integers, m, n,
the greatest integer that cannot be written in the form am + bn (the greatest number that can
not be expressed as a sum of the two numbers) where a, b are positive integers is mn − m − n. It
follows that there are (m−1)(n−1)
2 positive integers which cannot be expressed as the sum of some
number of s and s.

2.9 Euler’s Totient/Phi Function

φ(n) = n(1 − p11 )(1 − p12 )...(1 − p1n ) Where n is any positive integer and pn are prime divisors of n.
This gives the number of relatively prime positive integers less than or equal to some number n.
This is often used in modular arithmetic problems since Euler’s Theorem states aφ(n) ≡ 1 mod n.

2.10 Wilson’s Theorem

Wilson’s Theorem is rather uncommon, but it is very powerful when you use it since it’s a bijection.
Also, note that Wilson’s Theorem provides a primality test. However, there is no quick way to
compute p!. It states that for any prime p, (p − 1)! ≡ −1 mod p

2.11 Trivial Inequality

Yes, this is a real thing. It states that x2 ≥ 0 for all real x (now you know why it is called “trivial”).
You don’t really need this for anything, but many other well known theorems and inequalities are
based on this.

2.12 Fibonacci Numbers

Define a sequence Fn such that F0 = 1, F1 = 1, Fn = Fn−1 + Fn−2 . The first few terms look √
like
1+ 5
0, 1, 1, 2, 3, 5, 8, . . . The quotient of two consecutive terms approaches the golden ratio: 2

2.13 Pigeonhole Principle

If we distribute n balls into k boxes such that n > k then at least one box must have multiple
balls.

3 Algebra
3.1 Logarithm Rules*
Logarithmic to Exponential: loga b = x ⇒ ax = b
Addition: loga b + loga c = loga bc
Subtraction: loga b − loga c = loga cb
Exponent Reducing: loga bn = n loga b
logc b
Change of Base: loga b = log
ca
Reciprocals: loga b = log1 a
b

3.2 Vieta’s Formulas*

Vieta’s formulas relate the coefficients of a polynomial to its roots. This set of formulas is one
of the most useful in competition math. These state that the sum of the roots for a quadratic
polynomial ax2 + bx + c is −b c
a and that the product of the roots is a . This extends to higher
degree polynomials as well. For example, if the cubic polynomial ax + bx2 + cx + d has roots r, s, t,
3

r + s + t = −b −d c
a , rst = a , and rs + rt + st = a . Notice the signs alternate (with b being negative
and alternating thereafter). This takes some practice to get used to and I recommend you visit
the AoPS page on Vieta’s Formulas for further details.
Page 8 eashang1

3.3 Common Factorizations and SFFT*

a2 − b2 = (a + b)(a − b)
a3 − b3 = (a − b)(a2 + ab + b2 )
a3 + b3 = (a + b)(a2 − ab + b2 )
ab + a + b + 1 = (a + 1)(b + 1)
ab − a − b + 1 = (a − 1)(b − 1)
SFFT, or Simon’s Favorite Factoring, refers to the strategy of adding some number to both sides
of a polynomial so that it will factor and then breaking the side that is an integer into its prime
factors to find posible solutions.

3.4 Quadratic Formula and Discriminant*

√
−b± b2 −4ac
x= 2a d = b2 − 4ac

Where a, b, c are the coefficients of the x2 , x1 , x0 terms respectively. If the discriminant is , the
quadratic will have one real solution. If the discriminant is negative, the quadratic will have no
real solutions. If the discriminant is positive, the quadratic will have two real solutions.

3.5 RMS-AM-GM-HM*
√
q
x21 +...+xn x1 +...xn n
n
n
≥ n ≥ n x1 ...xn ≥ 1
+...+ x1n
x1

This essentially states that the root-mean square is greater than or equal to the arithmetic mean
is greater than or equal to the geometric mean is greater than or equal to the harmonic mean. The
most important part of this inequality is AM-GM, which states that the arithmetic mean is greater
than or equal to the geometric mean. Equality holds when all the s are the same. It is often used
for maximization and minimization problems. Here is an interesting “proof” for this from AoPS
Proofs Without Words gallery:

3.6 Location of Roots (DeMoivre’s Theorem*

Let cos(θ) + i sin θ = cis(θ). DeMoivre’s Theorem allows complex numbers in polar form - that
is r · cis(θ) - to be raised to raised to a power. It states that for a rational x and integral n,
cis(x)n = cis(nx). This can be used to find the nth root of a number/polynomial. See here for more
information: https://www.ck12.org/book/CK-12-Trigonometry—Second-Edition/section/6.7/

4 Counting and Probability

4.1 Permutations*
n!
n Pk= (n−k)! Where n is the total number of objects from which you are choosing k objects (order
does matter).
Page 9 eashang1

4.2 Combinations*
n n!


k = k!(n−k)! Where n is the total number of objects from which you are choosing k objects (order
doesn’t matter).

4.3 Pascals Identity

n
= n−1


n−1

k k−1 + k Where n is the total number of objects from which you are choosing k objects.
Note that this can be easily observed from Pascal’s Triangle. This identity can be extended to
sums of three or more binomial coefficients

4.4 Binomial Theorem and Sum of Row in Pascal’s Triangle*

n
n


The binomial theorem states that (a + b)n = an−k bk . This is easier to understand by doing
P
k
k=0
practice expansions. The coefficients of the powers of a and b are given in Pascals Triangle. The
sum of the nth row in the triangle is 2n−1 (as shown below).

4.5 Fundamental Theorem of Counting*

If one event has n possible outcomes and another event has m possible outcomes, the total number
of events if both events occur is m × n. We can recursively prove this for multiple events.

4.6 Burnside’s Lemma

Burnside’s Lemma is a way to count objects if you need to account for rotations and reflections.
It has appeared on Olympiads and even AMCs (it can be used for a variety of problems, though it
may not always be the fastest method). The video below provides a great explanation and example
for this lemma and I recommend you watch it. https://www.youtube.com/watch?v=pheASxiQk2I

4.7 Stars and Bars*

The number of ways to distribute n indistinguishable items into k distinguishable boxes, where
each box must receive at least one item, is n−1


k−1 Alternatively, the number of ways to distribute
indistinguishable balls in distinguishable boxes, where some box(es) may remain empty, is n+k−1


k−1 .

4.8 Expected Value*

P
If the expected value is E(X), E(X) = i P (Xi )V (Xi ),where P (Xi ) is the probability of event Xi
occurring, and V (Xi ) is the value of outcome Xi . If X1 , X2 , ...Xk are several events (independent
or not), then E(X1 + X2 + ... + Xk ) = E(X1 ) + E(X2 ) + ... + E(Xk ). Basically, you can sum
expected values (weighted averages). For clarity, here is an example: You roll two dice. What
is the expected sum? We can compute the expected value of a dice roll. Since all outcomes are
equally likely, the weighted average for one roll of a dice is simply the average, or 3.5. Since we
can sum expected values, the expected value of the sum is 3.5 + 3.5 = 7
Page 10 eashang1

Resources/Practice Recommendations
-AoPS Volumes 1+2 for AMC and AIME preparation
-EGMO by Evan Chen for AIME to Olympiad geometry
-For AMC/AIME/USA(J)MO practice, visit the AoPS past competitions pages
-AoPS community/forums, videos, and AoPS Wiki for reference (make an AoPS account!!!)
-This may seem redundant, but the best way to improve is to practice problems from the
competitions you want to improve for
-Handouts by Evan Chen (for very high level AIME to Olympiad): http://web.evanchen.cc/olympiad.html
-Shameless self advertising:) https://artofproblemsolving.com/community/c476370