Platonic Solid Faces Vertices Edges Composition

Tetrahedron 4 4 6 Triangles
Hexahedron/Cube 6 8 12 Squares
Octahedron 8 6 12 Triangles
Dodecahedron 12 20 30 Pentagons
Icosahedron 20 12 30 Triangles
Peter Xu’s Formula: a = b =⇒ a − b = 0
Derangements/Subfactorials: D0 = 1, D1 = 0, D2 = 1, D3 = 2,
D4 = 9, D5 = 44, D6 = 265, D7 = 1854, D8 = 14833, D9 = 133496,
n
X (−1)k
D10 = 1334961, Dn =!n = n!
k!
k=0
Prime Numbers: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,
53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137,
139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211
First Four Perfect Numbers: 6, 28, 496, 8128. The sum of reciprocals of all
the divisors of a perfect number is 2. All even perfect numbers can be expressed
as 2n−1 (2n − 1) when 2n − 1 is prime. √ √ √
Approximate
√ √ Square Roots: √ 2≈√ 1.414, 3 ≈ 1.732, 5 ≈ 2.236,
6 ≈ 2.449, 7 ≈ 2.646, 10 ≈ 3.162, 11 ≈ 3.317
Some Pythagorean Triples: (a, b, c) = {(3, 4, 5), (5, 12, 13), (7, 24, 25),
(8, 15, 17), (9, 40, 41), (11, 60, 61), (12, 35, 37), (13, 84, 85), (16, 63, 65),
(20, 21, 29), (28, 45, 53)}. All Pythagorean Triples can be expressed in the form
(a, b, c) = (k(2mn), k(m2 − n2 ), k(m2 + n2 )).
Prime Factorizations: 1991 = 11 · 181, 1993, 1997, 1999, 2000 = 24 · 53 ,
2001 = 3 · 23 · 29, 2002 = 2 · 7 · 11 · 13, 2003, 2004 = 22 · 3 · 167, 2005 = 5 · 401,
2006 = 2 · 17 · 59, 2007 = 32 · 223, 2008 = 23 · 251, 2009 = 72 · 41,
2010 = 2 · 3 · 5 · 67, 2011, 2012 = 22 · 503, 2013 = 3 · 11 · 61, 2017
Fraction Decimal
x
0.142857 and cycles
7
x
0.[9x]
11
[x]
0.[x]
9
ab − a
0.ab
90
abc − ab
0.abc
900
abc − a
0.abc
990
abcd − ab
0.abcd
9900
a1 a2 . . . am b1 b2 . . . bn − a1 a2 . . . am
0.a1 a2 . . . am b1 b2 . . . bn
|99 .{z
. . 99} |00 .{z
. . 00}
n m
1 + 3 + 5 + · · · + (2n − 1) = n2

1
2 + 4 + 6 + · · · + 2n = n(n + 1)
1 1 1 n 1
+ + ··· + = =1−
1·2 2·3 n(n + 1) n+1 n+1
1 1 1
+ + ··· +
1·2·3 2·3·4  n(n + 1)(n + 2) 
n(n + 3) 1 2
= = 1−
4(n + 1)(n + 2) 4 (n + 1)(n
 + 2) 
n m−1
X Y 1 1 
1 −  1 
= 
k + i (m − 1) · (m − 1)!  n+m−1 
k=1 i=0
m−1
2 2 2 2 2 2 n(n + 1)
n − (n − 1) + · · · + 4 − 3 + 2 − 1 =
2
2 2 2 n(n + 1)(2n + 1)
1 + 2 + ··· + n =
6
n2 (n + 1)2
1 + 2 + · · · + n = (1 + 2 + 3 + · · · + n)2 =
3 3 3
4
n(n + 1)
1 + 2 + 3 + ··· + n =
2
n(n + 1)(n + 2)
1 · 2 + 2 · 3 + · · · + n(n + 1) =
3
1·2 2·3 n(n + 1) n(n + 1)(n + 2)
+ + ··· + =
2 2 2 6
n(n + 1)(n + 2)(n + 3)
1 · 2 · 3 + 2 · 3 · 4 + · · · + n(n + 1)(n + 2) =
4
n m−1 m
X Y 1 Y
In general, (k + i) = (n + i).
i=0
m + 1 i=0
k=1
F0 = 0, F1 = 1, and Fn = Fn−1 + Fn−2 (F−n = (−1)n+1 Fn ).
gcd(F m, Fn ) =
 Fgcd(m,n)
  
n n−1 n−2
Fn = + + + ···
0 1 2
F0 + F1 + F2 + · · · + Fn = Fn+2 − 1
F1 + F3 + · · · + F2n−1 = F2n
F0 + F2 + · · · + F2n = F2n+1 − 1
0F0 + 1F1 + 2F2 + · · · + nFn = nFn+2 − Fn+3 + 2
F02 + F12 + F22 + · · · + Fn2 = Fn · Fn+1
Fn−1 · Fn+1 = Fn2 + (−1)n
Fm+n+1 = Fm+1 · Fn+1 + Fm · Fn
2 2
F2n = Fn+1 − Fn−1
The quantity Fn+1 is the number of ways to tile a 2 × n checkerboard with 1 × 2
tiles. It is also the number of ways to go up n steps if one can take 1 or 2 steps
at a time.
The number of ways to not get 2 heads in a row in n consecutive flips is Fn+2 .
a + (a + d) + (a + 2d) + · · · + (a + (n − 1)d) = a1 + a2 + · · · + an
n(a1 + an ) n(2a + (n − 1)d)
= =
2 2

2
 a1 − ran a(1 − rn+1 )
a + ar + ar2 + · · · + arn−1 = a1 + a2 + · · · + an = =
1−r 1−r
a
a + ar + ar2 + · · · =
1−r
Define an arithmetico-geometric sequence as a, (a+d)r, (a+2d)r2 , . . . , (a+
(n − 1)d)rn−1 , . . ..
a − r(a + (n − 1)d) rd(1 − rn−1 )
Sum of a Finite Series: +
1−r (1 − r)2
a rd
Sum of an Infinite Series: +
1 − r (1 − r)2
To convert a fraction to a decimal, multiply both the numerator and the
denominator by the smallest 10n such that the denominator has no more factors
1 1 25 1
of 2 or 5, and the rest is clear. For example, = · = · 2.7 = 0.027.
36 100 9 100
To convert a repeating decimal to various bases, first write the decimal as a sum
of digit bundles.
Denote t(k) as the number √ of factors of k, so that t(mn) = t(m)t(n).
Product of Factors: nt(n)
Wilson’s Theorem: p ∈ P =⇒ (p − 1)! ≡ −1 (mod p)
Fermat’s Little Theorem: p ∈ P, gcd(a, p) = 1 =⇒ ap−1 ≡ 1 (mod p)
Euler’s Totient Function: The number  of integers
  less than
 or  equal to  n
1 1 1
that are coprime to n is φ(n) = ϕ(n) = n 1 − 1− ··· 1 − .
p1 p2 pm
φ(n)
Euler’s Totient Theorem: gcd(a,  p)= 1 =⇒ a ≡ 1 (mod n)
1 2n
Catalan Numbers: Cn =
n+1 n
Cn−2 is the number of ways to triangulate a n-gon into n − 2 triangles.
The Ballot Problem: If A and B are two candidiates for a political office
and there are 2n voters, ultimately n voting for a and n voting for b, then the
number of ways to order the votes such that B is never ahead of A is Cn . In
general, if A gets a votes and B gets b votes and a ≥ b then the probability that
a−b+1
A is always not behind B is .
a+1
Every number can be expressed as the sum of four perfect squares.
An n-gon always has n lines of symmetry.
Chicken McNugget Theorem: the largest number you can’t get by repeat-
edly adding 2 coprime numbers m and n is mn − m − n. In this case, there are a
(mn − m − n) + 1 (m − 1)(n − 1)
total of = numbers that can’t be obtained.
2 2
gcd(a, b) lcm(a, b) = ab
gcd(a, b, c) lcm(ab, bc, ac) = abc
gcd(ca, cb) = c gcd(a, b)
Euclidean Algorithm: gcd(a, b) = gcd(a − b, b)
If I(n)◦ denotes the interior angle measure of a regular n-gon, then
900 4
I(3) = 60, I(4) = 90, I(5) = 108, I(6) = 120, I(7) = = 128 , I(8) = 135,
7 7
1620 3
I(9) = 140, I(10) = 144, I(11) = = 147 , I(12) = 150.
11 11

3
Any line passing through the center of a rectangle bisects its area.
In any two-dimensional figure, the number of vertices minus the number of short
segments plus the number of interior areas the figure is dissected into is equal
to 1.
A convex polygon with more than 4 sides can’t have more than 3 right angles.
In an isosceles triangle, the centroid, incenter, orthocenter, and circumcenter all
lie on the same line, and in an equilateral triangle, they all coincide.
The lateral area of a prism is the perimeter of the base times the altitude.
The lateral area of a pyramid is half the product of the perimeter of the base
and the slant height.
Sum of the Interior Angles of a Star Formed by Extending the Sides
of a Regular Polygon: 180◦ n − 720◦
1 1 1
Pole Formula: + =
m n x
Clock Angle Formula (without the second hand): |5.5m − 30h|◦
Clock Angle Formula (with the ◦ second hand):
 11m 11s 
180◦ − 180 − 30h + + 
2 120 
In a parallelogram with sides s1 , s2 and diagonals d1 , d2 , 2(s21 + s22 ) = d21 + d22
d1 d2 sin α
Area of a Parallelogram: A = = s1 s2 sin β
2
The sum of any two adjacent sides of an equiangular hexagon is equal to the
sum of the two opposite sides.
p abc ab sin C
Area of a Triangle: A = s(s − a)(s − b)(s − c) = rs = =
√ 4R 2
2a2 + 2b2 − c2
Length of a Median of a Triangle: mc =
2
2[ABC]
Inradius of a Triangle: r =
a+b+c
a+b−c
Inradius of a Right Triangle: r =
2
abc
Circumradius of a Triangle: R =
4[ABC]
a b c
Extended Law of Sines: = = = 2R
sin A sin B sin C
Perpendicular bisectors are equidistant from endpoints of the segment bisected.
Angle bisectors are equidistant from the sides adjacent to the angle.
πs2
Area of the Incircle of an Equilateral Triangle: A =
12
πs2
Area of the Circumcircle of an Equilateral Triangle: A =
√ √3
s2 3 √ 3R 2
3
Area of an Equilateral Triangle: A = = 3r2 3 =
√ 4 √4
3s2 3 √ 9R2 3
Area of a Regular Hexagon: A = = 18r2 3 =
2 √ √ 2 √
Area of a Regular Octagon: A = 2s2 (1 + 2) = 8( 2 − 1)r2 = 2R2 2

4
 p √
5a2 5+2 5
Area of a Regular Decagon: A =
2 √ √
Area of a Regular Dodecagon: A = 3(2 + 3)a2 = 12(2 − 3)r2 = 3R2
nlr
Area of a Regular Polygon: A =
2
In an orthodiagonal trapezoid ABCD with bases AB and CD, AC 2 + BD2 =
(AB + CD)2 .
The altitude of an isosceles orthodiagonal trapezoid is equal to the length of the
median.
Quadrilateral ABCD has an incircle if and only if AB + CD = BC + AD.
If quadrilateral ABCD is orthodiagonal, then AB 2 + CD2 = BC 2 + AD2 .
Areapof a Cyclic Quadrilateral/Brahmagupta’s Formula:
A = (s − a)(s − b)(s − c)(s − d)
In cyclic quadrilateral ABCD, m∠ACB = m∠ADB.
Isosceles trapezoids, squares, and rectangles are cylic.
Ptolemy’s Theorem: The product of the diagonals of a quadrilateral is equal
to the sum of the products of the two pairs of its opposite sides if and only if
the quadrilateral is cylic (i.e. ac + bd = ef where a, b, c, d are sides taken in
order and e, f are diagonals). √
s3 2
Volume of a Regular Square Pyramid: V =
6 √
Surface Area of a Regular Square Pyramid:√SA = s2 (1 + 3)
s 2
Height of a Regular Square Pyramid: h =
√2
s3 2
Volume of a Regular Tetrahedron: V =
12 √
Surface Area of a Regular Tetrahedron:√SA = s2 3
a 6
Height of a Regular Tetrahedron: h =
3
In tetrahedron ABCD with volume V , inradius r, and K1 , K2 , K3 , K4 as areas
3V
of the 4 sides, r = .
K1 + K2 + K3 + K4 √
s3 2
Volume of a Regular Octahedron: V =
3 √
Surface Area of a Regular Octahedron: SA = 2s2 √ 3
s3 (15 + 7 5)
Volume of a Regular Dodecahedron: V =
4 p √
2
Surface Area of a Regular Dodecahedron: SA = √ 3s 25 + 10 5
5s3 (3 + 5)
Volume of a Regular Icosahedron: V =
12 √
Surface Area of a Regular Icosahedron: SA = 5s2 3
A frustum has n + 2 faces, 3n edges, and 2n vertices.
h √
Volume of a Frustum: V = (B1 + B2 + B1 B2 ) where h is the height and
3
B1 , B2 are the area of the bases.
1
Volume of a Conical Frustum: V = πh(R12 + R1 R2 + R22 )
3

5


Surface Area of a Conical Frustum: SA = π r12 + r22 + s (r1 + r2 ) , where
r1 are the radii of the bases and s is the slant height.
1
Shoelace Alogrithm: A = |(x1 y2 + x2 y3 + · · · + xn−1 yn + xn y1 )
2
−(x2 y1 + x3 y2 + · · · + xn yn−1 + x1 yn )| where An = (xn , yn )
are the points taken clockwise or counterclockwise.
Given parent function y = f (x) and every point on that graph expressed as
(x, f (x)), we have that every point
 on the graph of y = af (bx + c) + d can be
x−c
expressed as , af (x) + d .
b
Inverse functions are reflections of each other over the line y = x.
Rotation of (a, b) about (c, d) by 90◦ : (c+b−d, d+a−c) for a clockwise rotation
and (c − b + d, d + a − c) for a counterclockwise rotation.
|Ax + By + C|
Point-Line Distance: √ .
A2 + B 2
Reflection
 of a Point over a Line: (x0 , y 0 ) =
2A|Ax + By + C| 2B|Ax + By + C|
x+ 2 2
,y + if the point (x, y) is below the
A +B A2 + B 2
0 0
line
 Ax + By + C = 0 for nonnegative A and (x, y ) =
2A|Ax + By + C| 2B|Ax + By + C|
x− ,y − if the point is above the line.
A2 + B 2 A2 + B 2
Standard Circle Formula: (x − h)2 + (y − k)2 = r2
A
Standard Line Equation: Ax + By = C =⇒ m = −
B
y
Slope-Intercept Form: y = mx + b or x = + c where b is the y coordinate
m
of the y-intercept and c is x coordinate of the x-intercept.
Point-Slope Form: y − y1 = m(x − x1 )
General Quadratic Equation: ax2 + bx + c = 0
Standard Form:y = a(x − h)2+ k
b b2
Vertex: (h, k) = − , c −
2a 4a
Vieta’s Formulas: the sum of the roots of P (x) = an xn + an−1 xn−1 + · · · +
an−1 a0
a1 x + a0 is − and the product of the roots is (−1)n ; in general, the k th
an an
an−k
symmetric sum is σk = (−1)k .
an
f −1 (f (x)) = f (f −1 (x)) = x
a2 − b2 = (a + b)(a − b)
a3 − b3 = (a − b)(a2 + ab + b2 )
a3 + b3 = (a + b)(a2 − ab + b2 )
(a + b)2 = a2 + 2ab + b2
(a − b)2 = a2 − 2ab + b2
(a + b)3 = a3 + 3a2 b + 3ab2 + b3 = a3 + b3 + 3ab(a + b)
(a − b)3 = a3 − 3a2 b + 3ab2 − b3 = a3 − b3 − 3ab(a − b)
an − bn = (a − b)(an−1 + an−2 b + · · · + abn−2 + bn−1 )
an + bn = (a + b)(an−1 − an−2 b + an−3 b2 − an−4 b3 ± · · · − abn−2 + bn−1 )

6
(a + b + c)2 = a2 + b2 + c2 + 2(ab + bc + ca)
(a + b + c)3 = a3 + b3 + c3 + 3(a + b)(b + c)(c + a)
(a + b + c)5 = a5 + b5 + c5 + 5(a + b)(b + c)(c + a)(a2 + b2 + c2 + ab + bc + ca)
a3 + b3 + c3 − 3abc = (a + b + c)(a2 + b2 + c2 − ab − bc − ca)
a1 a2 an c1 a1 + c2 a2 + · · · + cn an
= = ··· = =
b1 b2 bn c1 b1 + c2 b2 + · · · + cn bn
a c a+b c+d
= =⇒ =
b d a−b c−d
1 1 1 σ(n − 1)
+ + ··· + =
a1 a2 an σ(n)
Factor Theorem: x − a is a factor of P (x) if and only if P (a) = 0.
n  
X n k n−k
Binomial Theorem: (a + b)n = a b
k
k=0
n
Multinomial Theorem:
 (x1 +x2 + · · · + xm ) =
X n 2
xk11 xk2 · · · xkmm
k1 , k2 , ..., km
k1 +k2 +···+km =n
Total amount after interest for n years, a $k investment, an r% interest rate, m
compounding periods per year, and $p paid off each compounding period:
Simple Interest: A = k(1 + nr)
r nm
Compounded Interest: A = k 1 +
m
Continuously Compounded Interest: A = kern
FV
Present Value Formula: P V =  r nm
1+
m 
1 − rnm

nm
Compounded with Payments: kr −p
1−r
1 1 1 1
Rate Formula: + + ··· + =
r1 r2 rn roverall
Simon’s Favorite Factoring Trick: xy + xk + yj + jk = (x + j)(y + k)
X n
(a1 + 1)(a2 + 1) · · · (an + 1) = σ(k)
    k=1
n n
=
k n−k      
n−1 n−1 n
Pascal’s Identity: + =
    k−1 k k
n n n−1
=
r r r−1
r     
X m n m+n
Vandermonde’s Identity: =
k r−k r
k=0
       
r r+1 n n+1
Hockeystick Identity: + + ··· + =
r r r r+1
      X n  
n n n n
+ + ··· + = = 2n
0 1 n k
k=0

7
       
n n n n
− + − · · · + (−1)n =0
0 1 2 n
3n − 1
At least n weighings are needed to find a bad coin among coins.
2
The number of weighings needed to find a bad coin among n coins is
dlog3 2n + 1e.
Number of Ways to Get a Certainj Number ofCoins from Pennies,
n k j n k
−1
Nickels, Dimes, and Quarters: 3 + 5 5 where 10 ≤ n ≤ 49.
2
Number of Ways to Arrange Things around a Table: (n − 1)!  
l+w
Number of Pathways on a Grid from One Point to Another:
l, w
Number of Ways to Get a Word in a Diamond: 2n+1 − 4, where there
are n letters in the word.  
s s(s − 3)
Number of Diagonals in a Convex Polygon: −s=
2 2
s−1
Probability of Rolling a Sum with Two Dice: p = for s ≤ 7 and
36
13 − s
p= for s ≥ 8.
36
6s2 1
Probability that One Rolls a Painted Face of a Painted Cube: 3 =
6s n
Probablility that No Two People in a Group of People Have Matching
d!
Birthdays from Equally Possible Birthdays:
(d − n)!dn
Number
   of Rectangles with Sides Parallel to the Edges in a Grid:
m n
2 2
Number of Squares with Sides Parallel to the Edges in a Grid:
n(n − 1)(3m − n − 1)
6
Number of Squares in a Square Grid with all Four Vertices on the
2 2
n (n − 1)
Grid:
12
Number of Squares in a Rectangular Grid with all Four Vertices on
m(m2 − 1)(2n − m)
the Grid: where m ≤ n
12
Number of Tiles in a Rectangle a Diagonal Crosses: x + y − gcd(x, y)
Number of Cubes in a Rectangular Prism that a Diagonal Crosses:
x + y + z − gcd(x, y) − gcd(y, z) − gcd(x,
 z)
+ gcd(x, y, z)
n+1
Triangular Numbers Formula:
2
n(3n − 1)
Pentagonal Numbers Formula:
2
Hexagonal Numbers Formula: n(2n − 1)
n(5n − 3)
Heptagonal Numbers Formula:
2
Octagonal Numbers Formula: n(3n − 2)

8
 n(7n − 5)
Nonagonal Numbers Formula:
2
Decagonal Numbers Formula: n(4n − 3)
n(9n − 7)
Undecagonal Numbers Formula:
2
Dodecagonal Numbers Formula: n(5n − 4)
n((s − 2)n − (s − 4))
Polygonal Numbers Formula:
p 2
8(s − 2)x + (s − 4)2 + (s − 4)
Given a polygonal number x, n =
  2(s − 2)
n+2
Tetrahedral Numbers Formula:
  3
n+k−1
Balls and Urns:
n, k − 1
Reverse Balls and Urns: the  number of ways to choose k things from n
n+k−1
things if duplicates are allowed is .
k, n − 1  
n−1
The number of ways to add k positive integers to get n is .
k−1
Definition of Expected Value: if the possibilities of all possible mutually
exclusive events are p1 , p2 , . . . , pn which sum up to 1, then the expected value
with values of respective possibilities x1 , x2 , . . . , xn is E = p1 x1 + · · · + pn xn .
The expected number of fair coin flips needed to get n consecutive heads is
En = 2n+1 − 2.
The expected number of coin flips needed to get nconsecutive  heads given that
1 1 − pn
the probability of getting heads is p is En,p = n .
p 1−p
The expected number of coin flips needed to get n heads given that the proba-
n
bility of getting heads is p is En,p = .
p
Coupon Collector’s Problem: the expected number of times one needs to
n
X 1
get a coupon from n equally likely coupons to get all n coupons is En = n .
k
k=1
Basic Graph Theory: given a figure which you are asked to draw in one
stroke, count the number of lines connected to each point. Each point is an odd
point if an odd number of lines meet at it and an even point if an even number
of lines meet at it. If there are 0 or 2 odd points, then it can be drawn in one
stroke. If there are 0 odd points then you can start anywhere, and if there are
2 odd points then you can only start and end on odd points.
In a river with cross sections, the area of the cross sections times the rate of
flow at these cross sections is constant.
Probability that Three Randomly Chosen Points on a Circle Lie
2
a2

240 − a (a − 120)(360 − a)
within an Arc: for 0 ≤ a ≤ 180, 1 − =
43200 120 1202
for 180 ≤ a ≤ 240, and 1 for 240 ≤ a ≤ 360.

9
  
n
Maximum Number of Points Determined by Hyperplanes:
d
Maximum Number of Regions in the Plane Produced by Lines:
(n2 + n + 2)
       
n n n n+1
+ + =1+ =
0 1 2 2 2
Maximum
    Number of Regions in Space Produced by Planes:
(n + 1)(n2 − n + 6)
  
n n n n
+ + + =
0 1 2 3 6
Generalization: in the dth dimension, the maximum number of regions that
d  
th
X n
n things of (d − 1) dimension can cut it into is , where if n < i, we
i=0
i
 
n
have = 0.
i
MaximumNumber    of Regions of the Plane Produced by Intersecting
n n
Circles: 2 +2 = n2 − n + 2
0 2
Maximum Number of Regions   in Space Produced by Intersecting
n(n2 − 3n + 8)

n n
Spheres: =2 +2
3 3 1
Generalization:
   for n d-spheres in the (d + 1)th dimension, there are at most
n n
2 +2 regions.
d+1 d−1
MaximumNumber   of  Regions of the Plane Produced by Intersecting
n n
Ellipses: 2 +4 = 2(n2 − n + 1)
0 2
th
Generalization:
 inthe (d+ 1) dimension where we have n d-ellipsoids, there
n n
are at most 4 +2 regions.
d+1 d−1
Maximum Number  of
 Regions of a Crescent Moon Produced by
n+2 (n + 1)(n + 2)
Straight Cuts: =
2 2
Given a circle and
      n-gon,
its inscribed regular the number of regions formed by
n n n n4 − 6n3 + 23n2 − 18n + 24
the diagonals is + + = .
0 2 4 24

10
N N2 N3 2n N!
0 0 0 1 1
1 1 1 2 1
2 4 8 4 2
3 9 27 8 6
4 16 64 16 24
5 25 125 32 120
6 36 216 64 720
7 49 343 128 5040
8 64 512 256 40320
9 81 729 512 362880
10 100 1000 1024 3628800
11 121 1331 2048 –
12 144 1728 4096 –
13 169 2197 8192 –
14 196 2744 16384 –
15 225 3375 32768 –
16 256 4096 65536 –
17 289 4913 – –
18 324 5832 – –
19 361 6859 – –
20 400 8000 – –
21 441 9261 – –
22 484 – – –
23 529 – – –
24 576 – – –
25 625 – – –
26 676 – – –
27 729 – – –
28 784 – – –
29 841 – – –
30 900 – – –
31 961 – – –
32 1024 – – –
33 1089 – – –
34 1156 – – –
35 1225 – – –
36 1296 – – –
37 1369 – – –
38 1444 – – –
39 1521 – – –
40 1600 – – –
41 1681 – – –

11