10th Lord of the Math

Solution Booklet

Saint Stephen’s High School

January 13, 2018

10th Lord of the Math
Solution Booklet

Saint Stephen’s High School

January 13, 2018

JHS Individual Finals

JIF-1 Problem What is the coefficient of the term containing x 4 y 3 in the expansion (x +
y)7 ?

Answer 35
7
Solution Using the binomial theorem, the coefficient is ( ) = 35.
3
JIF-2 Problem Triangle ABC has lengths AB = 6, BC = 7, and AC = 8. Find the length
of the angle bisector from A to BC.

Answer 6

Solution Let AD (D ∈ BC) be the angle bisector. Let BD = x, which implies that
DC = 7 − x.

Then, from the angle bisector theorem, we have 8x = 6(7 − x) ⇒ 8x = 42 − 6x ⇒

x = 3. Therefore, BD = 3 and DC = 4.

The length of AD can now be determined using Stewart’s theorem:

AC 2 ⋅ BD + AB2 ⋅ DC = BC ⋅ (BD ⋅ DC + AD2 )

64 ⋅ 3 + 36 ⋅ 4 = 7(3 ⋅ 4 + AD2 )

192 + 144 = 7(12 + AD 2 )

AD = 6

JIF-3 Problem Convert the octal number 20178 to base ten.

4
 Answer 1039

Solution In base ten 20178 = 2 × 512 + 1 × 8 + 7 = 1039.

JIF-4 Problem If real numbers x and y satisfy (x+5)2 +(y−12)2 = 142 , find the minimum
value of x 2 + y 2 .

Answer 1

Solution The line connecting the centers of circles C1 ∶ (x + 5)2 + (y − 12)2 = 142
5 12
and C2 ∶ x 2 + y 2 = c 2 has equation 12x + 5y = 0. The line intersects C1 at ( , − ).
13 13
If c 2 is chosen to minimize x 2 + y 2 subject to C1 , then C1 , C2 and the line connecting
the centers of the two circles should concur at the point of tangency of C1 and C2 ,
5 12 5 2 12 2
i.e., ( , − ) ∈ C2 . Therefore, c 2 = ( ) + (− ) = 1.
13 13 13 13
JIF-5 Problem The mean of three numbers is 7 and the mode is 5. Find the range.

Answer 6

Solution Since 5 is the mode and the mean is greater than 5, the two smaller num-
bers are 5. Then the third number is 7 × 3 − 5 − 5 = 11. The range is 11 − 5 = 6.
π 2π 3π
JIF-6 Problem Evaluate cos − cos + cos .
7 7 7
1
Answer
2
2π
Solution From De Moivre’s theorem, x = cis is a seventh root of unity. Thus
7
x 7 − 1 = 0. Since x ≠ 1, x 6 + x 5 + x 4 + x 3 + x 2 + x + 1 = 0.
6
2π 2nπ
Substituting x = cis into the RHS gives ∑ cis = 0. The real parts of equal
7 n=0 7

5
 6
2nπ
complex numbers are also equal; thus ∑ cos = 0. However, from trigono-
n=0 7
2π 12π 4π 3π 10π 6π
metric identities, cos = cos , cos = − cos = cos and cos =
7 7 7 7 7 7
π 8π
− cos = cos .
7 7
3π 2π π
Substituting these results in, we have −2 cos + 2 cos − 2 cos + 1 = 0 ⇒
7 7 7
π 2π 3π 1
cos − cos + cos = .
7 7 7 2
JIF-7 Problem For how many integers x less than or equal to 2017 is the expression
√ √ √
x x x an integer?

Answer 3
7 √ 7 √
Solution The expression is equivalent to x 8 = ( 8 x) . Since this is an integer, 8 x
also has to be an integer. Since 38 = 6561 > 2017, and x ≥ 0, we have three possible
values for x: 08 , 18 , and 28 = 256.

JIF-8 Problem For odd integers n, define the double factorial to be n!! = 1⋅3⋅5⋯(n−2)⋅n.
Find the last three digits of 55!!.

Answer 625

Solution It is easy to see that 53 ∣ 55!!, and that 55!! is odd. Thus, it only suffices to
find 55!! mod 8 to get 55!! mod 1000 due to the Chinese remainder theorem, since
8 and 125 are two coprime numbers that multiply to 1000.

Note that the product of any four consecutive odd integers is congruent to (−3) ⋅

6
 (−1) ⋅ 1 ⋅ 3 ≡ 9 ≡ 1 (mod 8). Thus

28
55!! ≡ ∏(2i − 1) ≡ 17 ≡ 1 (mod 8).
i=1

Since 55!! ≡ 1 (mod 8) and 55!! ≡ 0 (mod 125), then 55!! ≡ 625 (mod 1000).

JIF-9 Problem Real numbers a and b satisfy 3a = 7 and 7b = 27. Find the value of ab.

Answer 3

Solution By the properties of exponents, 3ab = 7b = 27 = 33 . Therefore, ab = 3.

JIF-10 Problem Real numbers m and n satisfy m2 − 2m − 5 = 0 and n2 − 2n − 5 = 0. Find

all possible values of m3 − n3 .
√
Answer 0, ±18 6

Solution A quadratic polynomial has at most two roots. We consider two cases.

Case 1. m = n. Then m3 − n3 = 0.

Case 2. m ≠ n. Then from Vieta’s formulas, m + n = 2 and mn = −5. Now m3 − n3 =

√ √
(m − n)(m2 + mn + n2 ) = ± (m + n)2 − 4mn ⋅ ((m + n)2 − mn) = ± 4 − (−5) ⋅
√ √
(22 − 4(−5)) = ±2 6 ⋅ 9 = ±18 6. Note that the sign of m3 − n3 varies if m > n or
m < n.
√
Thus there are three possible values for m3 − n3 : 0, ±18 6.

JIF-11 Problem An equilateral triangle with side length 12 is divided into 144 congruent
non-overlapping equilateral triangles with side length 1. How many parallelograms

7
 are bounded by the segments of the triangles?

Answer 3003

Solution Consider first the parallelograms whose sides are not parallel to the bot-
tom side of the triangle. To find the number of such parallelograms, we construct
a bijection. First draw one extra row at the bottom of the triangle, as shown. If
we extend the four segments to intersect this extra row, four points are obtained.
It is easy to see that these four points uniquely determine a parallelogram in this
14
case. Thus the number of parallelograms here is ( ) = 1001, as there are fourteen
4
points on the extra row.

Similarly we have 1001 parallelograms whose sides are not parallel with the left side
and 1001 whose sides are not parallel with the right side of the triangle. Thus there
are 3003 parallelograms.

JIF-12 Problem An infinite sequence of inscribed semicircles with decreasing radii is drawn
such that their straight edges are all parallel. Find the area of all the regions inside

8
 an odd number of semicircles, if the radius of the largest semicircle is 100 units?
10 000π
Answer
3
Solution Consider two semicircles constructed in this fashion. If the larger semi-

√ has radius r, then by the Pythagorean theorem, the smaller one has radius
circle
r 2
.
2

√
r 2
2 √
r 2
r 2

Therefore, the area of the shaded region is

10 000π
10 000π 5000π 2500π 1250π 2 10 000π 2 10 000π
− + − +⋯= = ⋅ =
2 2 2 2 1 2 3 3
1 − (− )
2

JIF-13 Problem How many rectangles can be formed by a 4×101 grid of squares such that
the rectangles contain the square on the second column, second row?

Answer 1200

Solution Each rectangle can be determined by a pair of horizontal lines and a pair
of vertical lines. A rectangle that contains the square on the second column, second
row would have one line to the left, one to the right, one above, and one below the
said square. Thus the number of rectangles is 2 × 100 × 2 × 3 = 1200.

9
JIF-14 Problem An ordered list of 100 real numbers is such that the sum of any 9 consec-
9
utive numbers on the list are all equal, i.e., if a n is the nth term, then ∑ a i = ⋯ =
i=1
100
∑ a i , and that the sum of any 11 consecutive numbers are also all equal. Find the
i=92
largest possible value of the range of the numbers.

Answer 0

Solution From the given it is implied that if x ≡ y (mod 9) or x ≡ y (mod 11),

then a x = a y . But the list has more than 9 × 11 elements, implying that all the
numbers must be equal. Thus the range is zero.

JIF-15 Problem The sum of n consecutive integers is 192. Find the greatest possible value
for n.

Answer 384

Solution Note that (−191)+(−190)+⋯+191+192 = 192, which has 384 consecutive

integers. It is clear that a longer string off consecutive integers cannot sum up to
192. Let x be the smallest number among the consecutive integers. Then x + (x +
n(n − 1)
1) + ⋯ + (x + n − 1) = 192 ⇒ nx + = 192 ⇒ n(n + x − 1) = 384. Since
2
both n and n + x − 1 have to be integers, n ≤ 384. We have shown that n = 384 is
possible; thus it is the maximum value.

10
JHS Team Finals

JTF-1 Problem Evaluate sin(55○ ) sin(65○ ) sin(175○ ) + sin(125○ ) sin(130○ ) sin(240○ ) +

sin(35○ ) sin(95○ ) sin(115○ ) + sin(50○ ) sin(145○ ) sin(150○ ).
√ √
6− 2
Answer
4
Solution

sin(55○ ) sin(65○ ) sin(175○ ) + sin(125○ ) sin(130○ ) sin(240○ )

+ sin(35○ ) sin(95○ ) sin(115○ ) + sin(50○ ) sin(145○ ) sin(150○ )

= cos(35○ ) cos(25○ ) sin(5○ ) − cos(35○ ) cos(40○ ) cos(30○ )

+ sin(35○ ) cos(5○ ) cos(25○ ) + cos(40○ ) sin(35○ ) sin(30○ )

= cos(25○ )(cos(35○ ) sin(5○ ) + cos(5○ ) sin(35○ ))

− cos(40○ )(cos(35○ ) cos(30○ ) − sin(35○ ) sin(30○ ))

= cos(25○ ) sin(40○ ) − cos(40○ ) cos(65○ )

= cos(25○ ) sin(40○ ) − cos(40○ ) sin(25○ )

√ √
6− 2
= sin(15 ) =
○
4

JTF-2 Problem Rugged Corp is making a new tablet that can survive falls from heights
(but not from 2018 floors high). To test this the company gives John, a quality
assurance tester, two units of the said tablet on a 2017-floor skyscraper. John will
try to determine the highest floor from which a dropped tablet will survive the fall.
The company will not give John extra tablets but John can reuse a tablet that did

11
not break. What is the minimum number of drops John needs to guarantee that
he finds the highest "safe" floor?

Answer 64

Solution We denote a + ⋯ + b as the sum of all integers between a and b, inclusive.

n
n(n + 1)
First, note that 64 is the smallest integer n that satisfies ∑ i = ≥ 2017, as
i=1 2
63(64)
= 2016. This is how the drops will work:
2
We drop the first tablet on the following floors, until it breaks: floors 64, 64 + 63,
64 + 63 + 62, . . ., 64 + ⋯ + 12 = 2014, 2015, and 2016. (We know the tablet will break
on the top floor.) There are 55 floors in this sequence.

If the first tablet breaks on the 64th floor, then the maximum number of drops
needed to know the highest floor is 63 for the second tablet, as John would need
to drop his second (and last) tablet from the first floor going up, as there are no
replacements. Thus at most 64 drops are needed.

Now, if the first tablet breaks on floor 64 + ⋯ + n, 12 ≤ n ≤ 63, then we know that
the floor we want is between floors 64 + ⋯ + (n + 1) and 64 + ⋯ + n. To get to floor
64 + ⋯ + n the first tablet would have been dropped 65 − n times; the second tablet
will require a maximum of n − 1 drops from (64 + ⋯ + (n + 1)) + 1 to 64 + ⋯ + n.
We still need a maximum of 64 drops.

If the first tablet doesn’t break from the 2014th floor, we proceed with the 2015th
and 2016th floors, requiring a maximum of 55 drops.

Thus John needs to do a minimum of max(64, 64, 55) = 64 drops.

12
 Note that if the initial floor is not 64, it will not be optimal. If it is < 64, then if the
tablet will only break at the 2017th floor, more than 64 drops are needed. On the
other hand, if it is > 64, then if the tablet breaks at the 64th floor, more than 64
drops are needed.

JTF-3 Problem How many permutations of STEPHEN IAN are there such that the vow-
els are in alphabetical order?

Answer 75 600
10!
Solution There are a total of = 907 200 ways to rearrange the letters without
2!2!
any restrictions, since there are two E’s and two N’s.
4!
Consider the rearrangements of the vowels only. There are = 12 ways to arrange
2!
the vowels. This means that the 907 200 ways can be grouped into groups of 12,
such that within each group S, T, P, H and the two N’s are in the same positions.
Only one in each group have the vowels in alphabetical order.

Therefore, the number of permutations whose vowels are in alphabetical order is

907 200
= 75 600.
12
JTF-4 Problem What is the largest factor of 11! that is one more than a multiple of 6?

Answer 385

Solution The prime factorization of 11! is 28 ⋅ 34 ⋅ 52 ⋅ 7 ⋅ 11. Since the factor we

are finding is not divisible by 6, then it can be expressed as 5a1 7a2 11a3 , where a1 ∈
{0, 1, 2}, and a2 , a3 ∈ {0, 1}. Since 5 ≡ 11 ≡ (−1) (mod 6) and 7 ≡ 1 (mod 6),
the largest factor that is congruent to 1 (mod 6) is 5 × 7 × 11 = 385.

13
JTF-5 Problem How many integers x satisfy (x − 20)17 (x − 17)20 (x − 2017)2017 ≤ 0?

Answer 1999

Solution Obviously, x = 17, 20, 2017 are solutions. Note that (x − 17)20 is always
non-negative. We consider two cases:

Case 1. (x − 20)17 < 0 and (x − 2017)2017 > 0. Then x < 20 and x > 2017, which is
impossible.

Case 2. (x − 20)17 > 0 and (x − 2017)2017 < 0. Then 20 < x < 2017. There are
2016 − 21 + 1 = 1996 integers that satisfy this.

Adding x = 17, 20, 2017, there are a total of 1999 integers.

JTF-6 Problem Let a, b, c, d be four positive integers. If the LCM of a and b is 60, the
LCM of a, b, and c is 120, and the LCM of b, c, and d is 24. What is the least
possible value of the LCM of c and d?

Answer 8

Solution The LCM of c and d is at least the bigger of the two, so minimizing c and
d is a good tactic if c and d on a large scale. From the given at least one of a and
b is divisible by 4 and both are not divisible by 8. Since the LCM of a, b, and c is
120, then c is divisible by 8. This means that the LCM is at least 8.

Say c = 8. Since the LCM of b, c and d is 24, then we can choose b as a factor of 3
and d = 1, so that the LCM is equal to 8. Since this is possible with a = 20, b = 3,
c = 8, d = 1, the minimum LCM of c and d is 8.

14
JTF-7 Problem How many integers evenly divide 999 999?

Answer 128

Solution 999 999 = 33 ⋅7⋅11⋅13⋅37. Therefore we have (3+1)(1+1)4 = 64 positive

factors. If x evenly divides 999 999, −x does too; thus the total number of integers
that evenly divide 999 999 is 128.
1027 + 2
JTF-8 Problem Find the sum of the digits of the decimal expansion of .
6
Answer 158
1027 + 2 1 1027 − 1 1
Solution Note that = ⋅( + 1) = ⋅ 3⋯3 4 = 1 6⋯6 7. The sum
6 2 3 2 ± ±
26 3’s 25 6’s
of the digits is 1 + 6 × 25 + 7 = 158.

JTF-9 Problem The answers to each of the five statements below is either true or false.

1. The answers of Statement 3 and Statement 4 are different.

2. Statement 1 is true.
3. There are more False answers than True answers.
4. There are more False answers than True answers in the above statements.
5. There is an unequal amount of True and False answers in the above statements.

What are the answers to each of the five statements?

Answer False, False, True, True, False

Solution If #2 is true, then #1 is true. This means that #4 is false, in turn implying
that #3 is true. This contradicts #1 being true.

Therefore, #2 is false. Then, #1 is false, #4 is true, #3 is true, and #5 is false.

15
JTF-10 Problem There are 1007 points in the interior of a convex pentagon such that no
three of 1012 points, including the vertices of the pentagon, are collinear. The pen-
tagon is partitioned into several triangles. Each vertex of each of these triangles
is either a vertex of the pentagon or one of the 1007 points. How many triangles
result?

Answer 2017

Solution Consider the interior angles formed in the triangles. If x triangles are
formed, then the sum of the interior angles of all the triangles, in degrees, is 180x.

However, this sum is also equal to the sum of the internal angles of the pentagon
and 360○ for each point, since the sum of the internal angles that have a specific
point as vertex is 360○ . This is equal to 540 + 360 ⋅ 1007 in degrees.

Therefore, 180x = 540 + 360 ⋅ 1007 ⇒ x = 3 + 2 ⋅ 1007 = 2017.

JTF-11 Problem How many pounds of H2 O must be evaporated from 50 pounds of a 3%

salt solution so that the remaining solution will be 5% salt?

Answer 20

Solution There are 50(0.03) = 1.5 pounds of salt in the original solution. If x
is the number of pounds of water that must be evaporated, then the remaining
solution contains 50 − x pounds. Since the amount of salt is unchanged, then (50 −
x)(0.05) = 1.5 ⇒ 50 − x = 30 ⇒ x = 20.
4034
JTF-12 Problem Find the remainder when ( ) is divided by 20172 .
2017
Answer 2

16
 Solution From the Vandermonde identity, we have

2017
4034 2017 2017
( )= ∑( )( ).
2017 i=0 i 2017 − i

2017
Note that the first and last terms in the expansion of the right-hand side, ( )⋅
2017
2017 2017
( ), each equal 1. Since 2017 is a prime, then it divides ( ) for all integers i
0 i
2017 2017
from 1 to 2016. Thus for all integers i from 1 to 2016, ( )( ) is divisible
i 2017 − i
by 20172 .
4034
Thus, the remainder when ( ) is divided by 20172 is 2.
2017
JTF-13 Problem Circle X with radius 3 contains a concentric circle Y with radius 1. Two
other circles, A and B, are congruent to Y and are tangent to both X and Y such
that the centers of circles A, B and Y form a right triangle. A smaller circle C is
tangent to circles A, B, and X. Find the radius of circle C.
√
9−3 2
Answer
7
Solution Let O Z be the center of circle Z, and r be the radius of circle C.

17
 1 OA
OC r
1
r
D
1 1
1 1
OB OX

Note that quadrilateral O A OC O B O X is a kite, as O X O A = O X O B = 2 and O B OC =

√
OC O A = r + 1. Furthermore, O A O B = 2 2 and O X OC = 3 − r. Therefore,
√
2 2(3 − r) √ √
[O A OC O B O X ] = = 3 2 − 2r,
2

and [O A O X O B ] = 2.

Let D be the midpoint of O A O B . Since △O A O B OC is isosceles, we know that

√
OC O X ⊥ O A O B . From the Pythagorean theorem, OC D = (OC O B ) − (O B D) =
2 2
¿ √ 2
Á
À(r + 1)2 − ( 2 ) = √r 2 + 2r − 1.
Á
2
√ √
2 2 r 2 + 2r − 1 √ 2
Then [O A OC O B ] = = 2r + 4r − 2. This means that
2
√ √ √
[O A OC O B O X ] = [O A O X O B ] + [O A OC O B ] = 3 2 − 2r = 2 + 2r 2 + 4r − 2
√
9 ± 3 2
. This equation simplifies to 7r 2 − 18r + 9 = 0, with roots r = .
7

18
 Note that from the question
√ circle C√with radius r is smaller
√ than the circles with
9−3 2 9+3 2 9−3 2
radius 1. Since <1< , we have r = .
7 7 7
JTF-14 Problem How many right triangles can be formed using the vertices of a cube?

Answer 48

Solution There are two kinds of right triangles that can be formed: one isosceles
√ √ √
with sides 1, 1, 2 and the other with sides 1, 2, 3, as shown. There are 24 for
each, so there are 48 right triangles in all.

Ð→
JTF-15 Problem AB is a diameter of circle O. P is a point on AB outside the circle and C
is a point on the circle such that CP is a tangent. If AP = 8 and CP = 4, find the
length of AB.

Answer 6

Solution Let the radius of the circle be x. Since CP is a tangent, OCP is a right
triangle with OP as hypotenuse. We have CP = 4, OC = x and OP = 8 − x. From
the Pythagorean theorem, we have x 2 + 16 = x 2 − 16x + 64 or x = 3. Therefore the
diameter AB has length 6.

19
SHS Elims, Part 1

SE1-E1 Problem Suppose a statistician wants to test if two standard dice are loaded or
not, using the sum of the numbers on top as a one-tailed test statistic. If he rolls
the dice and both turn up five, what is the p-value?
1
Answer
6
Solution Since the test statistic X is considered to be one-tailed, the p-value is
3
equal to P(X = 10) + P(X = 11) + P(X = 12). But P(X = 10) = , P(X = 11) =
36
2 1 1
, and P(X = 12) = . Therefore, the p-value is .
36 36 6
SE1-E2 Problem A 100×100 grid (with ten thousand cells) is drawn. The positive integers
from 1 to 10 000 are written, one each, in each cell such that the sum of the num-
bers on each row, column, or main diagonal are all equal to a certain constant.
Find this constant.

Answer 500 050

1
⋅ 10 000 ⋅
Solution The sum of all positive integers less than or equal to 10 000 is
2
10 001 = 50 005 000. Since the sum of the numbers on each row should be equal
to k, then 100k = 50 005 000. Therefore, k = 500 050.

SE1-E3 Problem Suppose f is a real function satisfying f (x + f (x)) = 4 f (x) and f (1) =
4. Find f (21).

Answer 64

Solution Substitute x = 1: f (5) = f (1 + f (1)) = 4 f (1) = 16.

20
 Substitute x = 5: f (21) = f (5 + f (5)) = 4 f (5) = 64.

SE1-E4 Problem Find the probability of drawing, without replacement, two aces from a
deck of 52 playing cards.
1
Answer
221
4 3
Solution We multiply the probabilities for each of the two draws: ⋅ =
52 51
1 1
= .
13 × 17 221
SE1-E5 Problem Find the product of all real zeros of log x + log(x + 2) − 3.
√
Answer 1001 − 1

Solution The equation log x + log(x + 2) = 3 is equivalent √to x + 2x = 10 , or

2 3

−2 ± 4004 √
x 2 + 2x − 1000 = 0. This quadratic equation has roots = −1 ± 1001.
√ 2 √
Since log(−1 − 1001) is undefined, the only real zero is −1 + 1001.

SE1-E6 Problem Let f (n) denote the sum of the distinct prime factors of positive integer
n. Let g(k) be the kth smallest integer mn (m, n ∈ Z+ ), such that f (m + n) =
f (mn). What is g(1) + g(2) + g(3)?

Answer 15

Solution We check for smaller numbers.

mn = 2 ∶ 2 = f (2) = f (2 ⋅ 1) ≠ f (2 + 1) = f (3) = 3

mn = 3 ∶ 3 = f (3) = f (3 ⋅ 1) ≠ f (3 + 1) = f (4) = 2

mn = 4 ∶ 4 = f (4) = f (2 ⋅ 2) = f (2 + 2) = f (4) = 4

21
 mn = 5 ∶ 5 = f (5) = f (5 ⋅ 1) = f (5 + 1) = f (6) = 5

mn = 6 ∶ 5 = f (6) = f (2 ⋅ 3) = f (2 + 3) = f (5) = 5

Therefore, g(1) = 4, g(2) = 5, g(3) = 6; g(1) + g(2) + g(3) = 4 + 5 + 6 = 15.

7
SE1-E7 Problem If sin θ = , find sin 2θ.
25
336
Answer ±
625
24
Solution From the Pythagorean identity, cos θ = ± , the sign dependent on the
25
7 24 336
quadrant where θ belongs. Thus sin 2θ = 2 sin θ cos θ = ±2 ⋅ ⋅ =± .
25 25 625
SE1-E8 Problem There are one thousand lockers and one thousand students in a school.
The principal asks the first student to go to every locker and open it. Then he has
the second student go to every second locker and close it. The third goes to every
third locker and, if it is closed, he opens it, and if it is open, he closes it. The fourth
student does this to every fourth locker, and so on. After the process is completed
with the thousandth student, how many lockers are closed?

Answer 969

Solution A locker is closed if it is handled by an even number of students. We

know that only perfect squares have an odd number of factors. Since there are 31
perfect squares from 1 to 1000, there are 1000 − 31 = 969 closed lockers.

SE1-E9 Problem Find the amplitude of the graph of the function f (x) = 3 sin x + cos x.
√
Answer 10

22
 √ f (x) 3 1
Solution Divide by 10 on both sides to get √ = √ sin x + √ cos x. Now
10 10 10
1 3 f (x) 1
cos sin−1 √ = √ , so we can rewrite this as √ = sin (x + sin−1 √ ).
10 10 √ 10 10
Therefore the amplitude of the function is 10.
1 15
SE1-E10 Problem Positive integers a, b, and c satisfy a+ 1 = . Find (a−2b−4c)2017 .
b+ c 2
Answer 1
15 1 1
Solution Since =7+ =7+ , a = 7 and b = c = 1. Therefore, (a − 2b −
2 2 1 + 11
4c)2017 = 12017 = 1.
99
k+1
SE1-A1 Problem Evaluate the sum ∑
k=1 (k − 1)! + k! + (k + 1)!

1
Answer 1 −
100!
Solution Simply the summand first:

k+1 k+1
=
(k − 1)! + k! + (k + 1)! (k − 1)!(1 + k + k(k + 1))
k+1 1
= =
(k − 1)!(k + 1)2 (k − 1)!(k + 1)
k (k + 1) − 1 1 1
= = = −
(k + 1)! (k + 1)! k! (k + 1)!

1 1 1
Thus, the sum telescopes to − =1−
1! 100! 100!
SE1-A2 Problem Six circles of radius 1 unit are centered at the points (0, 0), (0, 2), (0, −2),
(0, −4), (2, 0), (−2, 0). If a rubber band is wrapped around this figure, find the
area of the region inside the rubber band.

23
 √ √
Answer 12 + 4 2 + 4 5 + π

Solution

90○○
90
A
90○○
90

α D(180−α)
(180−α)○○○○ (180−α)○○○○
(180−α)
Bα

(180−β)○○○○
(180−β)

CC
ββ

Note that 90 + 2(180 − α) + (180 − β) = 360 ⇒ 2α + β = 270. Thus, the area

inside the rubber band is equal to the sum of the areas of kite ABCD, the four
rectangles (which share a side with kite ABCD), and a circle with radius 1, since
the central angles 90○ , α, α and β add up to 360○ .

The kite has diagonals 4 and 6; thus it has area 12. Also, from the Pythagorean
√ √
theorem, AB = AD = 2 2, and CD = CB = 2 5. Therefore, the four rectangles
√ √
have a total area of 4 2 + 4 5. Finally, a circle with radius 1 has area π.
√ √
Thus, the area of the interior is 12 + 4 2 + 4 5 + π.

SE1-A3 Problem If for some acute angle θ, tan θ + cot θ = 4, what is sin θ?

24
 √ √
6± 2
Answer
4
Solution From the original equation multiply both sides by sin θ cos θ (since
sin θ =/ 0 and cos θ =/ 0) to get sin2 θ + cos2 θ = 4 sin θ cos θ. But the left-hand
side of this equation is 1 and the right hand side is precisely
√ 2 sin√ 2θ. Thus we
1 6 − 2
have sin 2θ = or 2θ = 30○ , 150○ . If θ = 15○ , sin θ = ; if θ = 75○ ,
√ √ 2 √ √ 4
6+ 2 6± 2
sin θ = . Thus the values for sin θ are .
4 4
SE1-A4 Problem Eight equally-spaced points are on the perimeter of the circle. What is
the probability that if three of the points are connected, it forms an acute triangle?
1
Answer
7
Solution We first calculate the number of triangles that can be chosen from these
8
eight points. This is equal to ( ) = 56 triangles.
3
A right triangle is always formed by choosing two diametrically opposite points
and one of the six remaining points. There are four pairs of diametrically opposite
points; therefore, there are 24 right triangles that can be formed.

Now we have to calculate the number of obtuse triangles. Refer to the figure
below.

25
 First we have to choose a point among the eight. This accounts for 8 ways. Let’s say
we chose the bigger point shown in the figure. Then, we draw a line to the point
3 points away from the first point, moving clockwise (to avoid double-counting).
If we choose any two of the three points, the resulting triangle is always obtuse.
3
Therefore there are ( ) ways to choose these two points. In general, there are
2
3
8( ) = 24 obtuse triangles.
2
This means that there are 56 − 24 − 24 = 8 acute triangles. The probability, then,
8 1
is = .
56 7
SE1-A5 Problem Find the greatest common factor of F2017 and F2016 , where Fn is defined
as F1 = F2 = 1, Fn = Fn−1 + Fn−2 for integers n > 2.

Answer 1

Solution For two integers a > b, the GCF of a and b is equal to the GCF of a − b
and b. Therefore gcf(F2017 , F2016 ) = gcf(F2017 − F2016 , F2016 ) = gcf(F2015 , F2016 ) =
⋯ = gcf(F2 , F1 ) = gcf(1, 1) = 1.

SE1-A6 Problem The value of the function f (x) = ax + b for all integers x is a positive
integer that leaves a remainder of 3 when divided by 4. Find all possible values

26
 for a.

Answer 0

Solution Note that f (x) > 0 for all integers x. The only linear function that
satisfies this is the constant function. Thus a = 0 and b is any positive integer that
leaves a remainder of 3 when divided by 4.

SE1-A7 Problem Let −1 < x < 1. Find the value of the infinite series S = 1 + 22 x + 32 x 2 +
⋯ + n2 x n−1 + ⋯.
1+x
Answer
(1 − x)3
n(n + 1)
Solution Since n2 = 2 ⋅ − n, then
2

n(n + 1) n−1
S = 2 (1 + 3x + 6x 2 + ⋯ + x + ⋯ ) − (1 + 2x + 3x 2 + ⋯ + nx n−1 + ⋯ )
2
2 1 1+x
= − = .
(1 − x)3 (1 − x)2 (1 − x)3

SE1-D1 Problem There are 432 seats in a cinema and 432 moviegoers with tickets mark-
ing their respective assigned seats. The moviegoers line up to enter the cinema.
The first moviegoer did not know that the ticket shows an assigned seat, and thus
chooses a random seat and sits there. The remaining moviegoers sit on their seat
if it is empty — otherwise he/she chooses a random open seat to sit. What is the
probability that the 432nd moviegoer sits at his/her assigned seat?

Answer 50%

Solution The last unoccupied seat is either the seat meant for the last moviegoer

27
 or the seat of the first moviegoer. If any other seat is vacant when the last movie-
goer enters, then it was also vacant when the moviegoer who is supposed to sit
there entered the cinema — a contradiction.

But since it is equally likely that the last moviegoer goes to either of the two possi-
ble seats (the first moviegoer’s seat and the last moviegoer’s seat), the probability
1
is .
2
10
20
SE1-D2 Problem The sum ∑ ( )92i−1 721−2i can be expressed in the form 2x + 2 y ,
i=1 2i − 1
where x and y are distinct positive integers. Find x + y.

Answer 98
10
20
Solution Let S1 be the above sum. Consider S2 = ∑ ( )92i 720−2i .
i=0 2i

Then, from the binomial theorem,

20
20
1620 = (9 + 7)20 = ∑ ( )9i 720−i = S1 + S2
i=0 i
20
20
220 = (9 − 7)20 = ∑ ( )9i (−7)20−i = S1 − S2 ,
i=0 i

20 20
since if i is even then ( )9i 720−i = ( )9i (−7)20−i = S1 + S2 .
i i
1620 + 220
Adding the two equations together and dividing by two results in S1 = =
2
280 + 220
= 279 + 219 . The required answer is 79 + 19 = 98.
2
SE1-D3 Problem Define the omega function ω(x) as the real number that satisfies x =

28
 ω(x ⋅ e x ), for real numbers x. Simplify

√
⋯ √
√
2
2
2

in terms of the omega function.

Answer e ω(ln 2)
√
Solution Let x be the given quantity. Then x
2 = x ⇒ 21/x = x ⇒ x x = 2 ⇒
x ln x = ln 2. Let a = ln x, or e x = a. The equation becomes e a ⋅ a = ln 2 ⇒
ω(e a ⋅ a) = ω(ln 2) ⇒ a = ω(ln 2). Substituting back the expression for x, we get
ln x = ω(ln 2) ⇒ x = e ω(ln 2) .

SE1-D4 Problem How many terms on the 2017th row of the Pascal triangle, whose first
row has the terms 1 and 1, are not divisible by 3?

Answer 162

Solution This question is equivalent to finding the number of coefficients in the

expansion of (1 + x)2017 that are not divisible by 3. Note that (1 + x)3 ≡ 1 + x 3
(mod 3). Similarly, for k a power of 3, (1 + x)k ≡ 1 + x k (mod 3).

But 2017 = 729 × 2 + 243 × 2 + 27 × 2 + 9 × 2 + 1. Thus

2 2 2
(1 + x)2017 ≡ ((1 + x)729 ) ((1 + x)243 ) ((1 + x)27 ) ⋅
2
((1 + x)9 ) (1 + x) (mod 3)

≡ (x 1458 + 2x 729 + 1)(x 486 + 2x 243 + 1)⋅

(x 54 + 2x 27 + 1)(x 18 + 2x 9 + 1)(x + 1) (mod 3)

29
 There are 34 × 2 = 162 terms in this expansion; it is easy to see that these terms
are not like terms.

SE1-D5 Problem Find

iπ
sin
∞
(i + 1)!
∑ π π .
i=3 cos cos
i! (i + 1)!
√
3
Answer
3
Solution

iπ π π
sin sin ( − )
∞
(i + 1)! ∞ i! (i + 1)!
∑ π π =∑ π π
i=3 cos cos i=3 cos cos
i! (i + 1)! i! (i + 1)!
π π π π
∞ sin cos − cos sin
i! (i + 1)! i! (i + 1)!
=∑ π π
i=3 cos cos
i! (i + 1)!
∞
π π
= ∑ (tan − tan )
i=3 i! (i + 1)!

√
π 3
Therefore, the series telescopes to tan = .
3! 3

30
SHS Finals
π π π
sin + sin + sin
SF-1 Problem Evaluate 12 6 4 .
π π π
cos + cos + cos
12 6 4
√
3
Answer
3
Solution

π 3π π 3π
π 2π 3π 2π + −
sin + sin + sin sin + 2 sin 12 12 cos 12 12
12 12 12 = 12 2 2
π 2π 3π π 3π π 3π
cos + cos + cos + −
12 12 12 cos 2π + 2 cos 12 12 cos 12 12
12 2 2
2π 2π −π
sin + 2 sin cos
= 12 12 12
2π 2π −π
cos + 2 cos cos
12 12 12
2π −π √
sin (1 + 2 cos )
12 12 π 3
= = tan =
2π −π 6 3
cos (1 + 2 cos )
12 12

SF-2 Problem Find the sum of the reciprocals of all positive integers that can be ex-
pressed in the form 3a ⋅ 4b , where a and b are positive integers such that a + b is
odd.
7
Answer
120

31
 Solution Either a is odd and b is even, or a is even and b is odd. Thus the sum is

1 1 1 1 1
∑ = ∑ a⋅ ∑ b+ ∑ a⋅ ∑ b
a+b odd 3a ⋅4 b
a even 3 b odd 4 a odd 3 b even 4
1 1 1 1
= 9 ⋅ 4 + 3 ⋅ 16
1 − 91 1 − 16
1 1 − 19 1 − 16 1
1 4 3 1 7
= ⋅ + ⋅ =
8 15 8 15 120

SF-3 Problem Let f ∶ Z+ ↦ Z+ be a piecewise function such that

⎧
⎪
⎪
⎪
⎪ 1 n=1
⎪
⎪
⎪
⎪
⎪ √
f (n) = ⎨ f ( n) n a perfect square .
⎪
⎪
⎪
⎪
⎪
⎪
⎪
⎪
⎪ f (n − 1) + 1 otherwise
⎩

What is the smallest n such that f (n) = 100?

Answer 2024

Solution We start with a few lemmas.

Lemma 1. For all integers n ≥ 4, f (n) < n.

Proof. We proceed by strong induction. Note that f (4) = f (2) = 2 < 4. Assume
for the sake of induction that f (k) < k is true for all integers k from 4 to an integer
m ≥ 4. By definition, if m+1 is not a perfect square, then f (m+1) = f (m)+1 < m+1,
and we are done.
√
On the other hand, if m + 1 is a perfect square, then f (m + 1) = f ( m + 1). How-

32
 √
ever, since m ≥ 4, m2 − m − 1 > 0. This means that m > m + 1. Therefore,
√ √
f (m + 1) = f ( m + 1) < m + 1 < m < m + 1, and we are done. The inductive
step is complete.

Thus, for all integers n ≥ 4, f (n) < n.

Lemma 2. For any positive integer n that can be expressed in the form x 2 + y, where
x 2 ≤ n < (x + 1)2 , x ∈ Z+ , and 0 ≤ y ≤ 2x, y ∈ Z≥ , f (n) = f (x) + y.

Proof. We proceed by induction on y. Note that if y = 0 f (n) = f (x 2 ) = f (x) =

f (x) + 0. Assume for the sake of induction that if n = x 2 + k for some integer k
between 0 and 2x − 1, then f (n) = f (x) + k. Then, since n + 1 is not a perfect
square, f (n + 1) = f (n) + 1 = f (x) + (k + 1), which completes the proof.

Lemma 3. For any positive integer n that can be expressed in the form x 2 + y, where
x 2 ≤ n < (x + 1)2 , x ∈ Z+ , and 0 ≤ y ≤ 2x, y ∈ Z≥ , f (n) ≤ 3x.

Proof. From Lemma 1 and Lemma 2, f (n) = f (x) + y ≤ x + 2x = 3x.

From Lemma 3, we see that for all n ≤ 332 + 2 ⋅ 33 = 1155, f (n) ≤ 3 ⋅ 33 = 99. Thus,
if f (n) = 100, and n = x 2 + y (with x and y as in Lemma 2), then x ≥ 34.

Consider all n = 492 + y = 2401 + y, where y is an integer from 0 to 98, inclusive.

Then f (n) = f (49) + y = f (7) + y = 5 + y = 100 ⇒ y = 95. This means that x = 49
is possible. Thus, if f (n) = 100, then 34 ≤ x ≤ 49.

However, if x = 34 or 35, then f (n) = f (x)+y ≤ 13+70 = 83 < 100, since 0 ≤ y ≤ 70,
f (34) = f (5) + 9 = 3 + 9 = 12 and f (35) = f (34) + 1 = 13. Thus no n exists for this

33
 case.

If x ≥ 36, let x = 36 + p where p ∈ Z≥ . To minimize n, we need to minimize x, and

in turn, p.

We have f (n) = f (x) + y = f (36 + p) + y = f (6) + p + y = 4 + p + y = 100, due to

Lemma 2. To minimize p, we maximize y. (Note that increasing x by a unit amount
leads to a greater increase in n than increasing y by a unit amount.) The maximum
possible y is y = 2x = 2(36 + p). Then,

4 + p + 2(36 + p) = 100 ⇒ 3p + 76 = 100 ⇒ p = 8

This implies that x = 36 + p = 36 + 8 = 44, y = 2x = 88, and n = x 2 + y = 442 + 88 =

2024.
i−1
i=0 to be a sequence of sets such that S0 = {0}, and S i = ⋃ {S k },
SF-4 Problem Define {S i }∞
k=0
the union of the set containing S0 , the set containing S1 , until the set containing
S i−1 . How many opening braces { are needed to write down the power set of S6 in
expanded form, if the empty set ∅ is to be written as { }?

Answer 2081

Solution Note that S0 = {0}, S1 = {S0 } = {{0}}, S2 = {S0 , S1 } = {{0}, {{0}}}, and
so on.

First, we show by strong induction that S i has exactly 2i opening braces. It is easy to
see that S0 has 1 opening brace and that S1 has 2. Now say that for all i between 0 to n,
S i uses 2i opening braces. Then for S n+1 = S0 , S1 , S2 , . . . , S n , we need one outermost

34
 opening brace, then add the number of opening braces for S0 up to S n . Thus the
number of opening braces needed for S n+1 is 1+(1+2+. . .+2n ) = 1+2n+1 −1 = 2n+1 .
Thus, we conclude that for all non-negative integers i, S i has exactly 2i opening
braces.

The power set of S6 , denoted as 2S6 , is the set of all subsets of S6 . Thus

2S6 = {{}, {S0 }, . . . , {S5 }, {S0 , S1 }, . . . , {S4 , S5 }, . . . , {S0 , . . . , S5 }}.

2S6 has 26 elements, since each element of S6 can either be in a subset or not. First,
there are 1 + 26 = 65 opening braces used before expanding the S i ’s, since one out-
ermost opening brace is used, and for every subset of S6 , another opening brace is
used.

Since each S i are either in a subset or not, there is an equal number of subsets with
S i and of subsets without S i , for all i. Thus, each S i appears 25 = 32 times. Since S i
has exactly 2i+1 opening braces, the total number of opening braces in 2S6 is 65 +
32(1 + 2 + 4 + 8 + 16 + 32) = 65 + 32(63) = 65 + 2048 − 32 = 2081.

SF-5 Problem Prove that for all positive integers n and m, Fmn is divisible by Fm . Fk is the
kth Fibonacci number, defined by F1 = F2 = 1, Fk = Fk−1 + Fk−2 for integers k ≥ 3.

Solution

Proof. Extending the sequence, we see that F0 = 0. We first show, by inducting on

b, that Fa+b = Fa Fb+1 + Fa−1 Fb for positive integers a and b.

It is easy to see that Fa+1 = Fa + Fa−1 = Fa F2 + Fa−1 F1 .

35
Say for some positive integer k, Fa+x = Fa Fx+1 + Fa−1 Fx is true for all x ≤ k. Then

Fa+x+1 = Fa+x + Fa+x−1

= Fa Fx+1 + Fa−1 Fx + Fa Fx + Fa−1 Fx−1

= Fa (Fx + Fx+1 ) + Fa−1 (Fx−1 + Fx )

= Fa Fx+2 + Fa−1 Fx+1

Thus Fa+b = Fa Fb+1 + Fa−1 Fb for all positive integers a and b.

Next, we show by induction on n that Fm divides Fmn .

It is clear that Fm divides Fm .

For the inductive step, say for some positive integer i, Fi divides Fim . We first sub-
stitute a = m and b = im in the previous identity. Then we have

F(i+1)m = Fim+m = Fm Fim+1 + Fm−1 Fim .

Thus, F(i+1)m is also divisible by Fm . Thus for all positive integers m and n, Fmn is
divisible by Fm .

36
Mathematical Results

Angle Bisector Theorem

If D is a point on BC of △ABC such that AD is an angle bisector of the triangle,

then AC ⋅ BD = AB ⋅ CD. (p 4)

Binomial Theorem

For integer n,
n
n
(x + y)n = ∑ ( )x k y n−k .
k=0 k

(p 4, 28)

Chinese Remainder Theorem

If r and s are coprime positive integers, then for all integers x and y, there exists an
integer N such that N ≡ x (mod r) and N ≡ y (mod s). Furthermore there exists
only one N that satisfies this and is between 1 and rs. (p 6)

De Moivre’s Theorem

For any complex number z = r cis θ and integer n, z n = r n cis(nθ). (p 5)

Pythagorean Identity

For all θ, sin2 θ + cos2 θ = 1. (p 22)

37
Pythagorean Theorem

△ABC is a right triangle with right angle at B iff AB2 + BC 2 = AC 2 . (p 9, 18, 19, 24)

Stewart’s Theorem

If D is a point on side BC in △ABC, then

AC 2 ⋅ BD + AB2 ⋅ DC = BC ⋅ (BD ⋅ DC + AD2 ).

(p 4)

Vandermonde Identity

For non-negative integers m, n, and r,

n+m r
m n
( ) = ∑ ( )( ).
r k=0 k r−k

(p 16)

Vieta’s Formulas

Let x1 , ⋯, x n be the n roots of the polynomial a n x n + a n−1 x n−1 + a n−2 x n−2 +⋯+ a1 x +
a0 = 0. Also, let s i be the sum of all possible products of i x k terms where the k’s are
distinct. This means that s1 = x1 + ⋯ + x n , s2 = x1 x2 + x1 x3 + ⋯ + x1 x n + ⋯ + x n−1 x n ,
and so on until s n = x1 x2 ⋯x n . Then for all i = 1, 2, . . . , n,

(−1)i a n−i
si = .
an

38
 (p 7)

Disclaimer: Not all of the problems here are original. Some are lifted from, or based on,
other material. All information provided here is for educational purposes only.

39