FARML 2017

Introduction

Welcome to FARML 2017!1 The following problems are meant to approximate the level of diculty and distribution of
topics usually seen in the three question-and-answer rounds. If possible, try to complete these problems in their event-
appropriate settings.

All problems by Andy Niedermaier.

agnieder@gmail.com
aniedermaier@janestreet.com2

F F
1 for ake
2ping me if you have questions about Jane Street! (or internships, or Harvey Mudd College, or or or...)

1
 FARML 2017

TEAM EVENT
T1 Determine all ordered pairs of integers (x, y) for which x + xy + xy = 2017.

T2 Compute the smallest possible area for octagon ABCDEF GH , whose interior angles are all 90◦ or 270◦ , and
whose side lengths are the integers 1 through 8 (in some order).

T3 Sequence {an }n≥0 is dened by setting

√
a0 = 0 and for n ≥ 1 setting an to be the number of values k between 0
and n−1 for which ak < n. Compute the value of a2 a1 − a3 a2 + a4 a3 − a5 a4 + · · · − a2017 a2016 .

T4 In the town of Farmlville, postage stamps are available in 19-cent, 11-cent, and (−2)-cent denominations. (It's a
weird economy.) Van has 4 of each type of stamp. How many dierent positive postages can he create using one
or more of his stamps?

T5 Let R be the region in the complex plane enclosed by the lines Re z = 20, Im z = 17, and 2 Im z + Re z = 2017.
Let S be the set of complex numbers w for which |w| = 1 and the region wR has one edge parallel to the real
axis. Compute the product of the elements of S.

T6 Compute the area of the equilateral 18-gon with sides of length 2 and interior angles 120◦ , 120◦ , 240◦ , 120◦ ,
120◦ , 240◦ , . . ..

T7 Complete the number puzzle

a below.

Row 1: 14-digit palindrome when written in base 2

Row 2: 6a + b4
Row 3: multiple of 64 when written backwards

Row 4: a square

√
T8 Determine, in radians, all acute angles α for which 8 cos2 α = 2 + 2 + 2 cot2 α + 2 cot α csc α.

T9 For a positive integer n, dene f (n) to be the dierence between n and the largest proper divisor of n. Compute
the smallest n for which f (f (f (n))) = 2017.

T10 For how many values x between 17 and 20 does {x} + {x2 } = 20
17
?

aCells inside a region must all contain the same digit, and dierent regions must contain dierent digits. Answers may not begin with a
0. The unknowns in the clues are integers.
 FARML 2017

INDIVIDUAL EVENT

I1 The graph of y = f (x) is a straight line which passes through (20, 17) and does not pass through Quadrant III.
The graph of y = f (x) + f (f (x)) passes through the origin. Compute the slope of y = f (x).

I2 Acute triangle ABC is drawn in the plane with AB = 20 and BC = 17. D is on AC such that ABD is isosceles
and BCD is similar to ABC (but not necessarily in that vertex-order). Compute the length of side AC .

I3 Andy and Van are both initially at point P along a circular track. At noon, they start running in opposite
directions along the track. Andy can complete a lap in 7 minutes and Van can complete a lap in 5 minutes.
Every time the two meet, Van reverses direction. How many minutes will it take, from the moment they start
running, until they are both again at P?

I4 Compute the product of the 4 smallest real numbers x for which 4⌊x⌋ = x4 .

I5 For a positive integer n, let d(n) denote the number of divisors of n. Find all ordered pairs of primes (p, q) for
which
p · d(pq) + q · d(17p) = 77.

I6 2 2 2
Compute the smallest possible value for a +b +c , if a, b, and c are integers for which the set of points satisfying
x + y < 10y lies entirely within a bounded region determined by the lines y = 0 and y = ax2 + bx + c.
2 2
 FARML 2017

max S
I7 For how many non-empty subsets S of {1, 2, 3, 4, 5, 6, 7, 8, 9} is it true that the number is an element of S?
min S
I8 Isosceles triangles ABC and ABD have the same area. If cot ACB = 2
11
, compute the smallest possible value
for cot BAD.

I9 For a positive real number b > 1, let Kb denote the square that can be formed by taking two points each
on the lines y = logb x and y = log(1/b) x. Determine the area of the square Kc that is bisected by the line x = 5.

I10 Compute the largest value for a · b, provided that a, b, and loga (a2 + 217
b
) are integers.
 FARML 2017

RELAY & TIEBREAKER EVENTS

R1/1 Compute the perimeter of the region

( )2 ( )2
16 16 9
|x| − + |y| − ≤ .
9 9 16

R1/2 Let T = T N Y W R, and let K= T

π
. Compute the perimeter of the region
2
x + (|y| − K) ≤ 4K .
2 2

R1/3 Let T = T N Y W R, and let K= T

π
. Compute the perimeter of the union of the regions

x + y 2 ≤ K 2 and x2 + (|y| − K)2 ≤ K 2

2

R2/1 What is the smallest integer T >0 for which cos 4T ◦ and sin 5T ◦ are both negative?

R2/2 Let T = T N Y W R. How many terms in the sequence

tan(T + 0) tan(T − 0), tan(T + 1) tan(T − 1), tan(T + 2) tan(T − 2), . . . , tan(T + 90) tan(T − 90)
are nite and positive? (Angles here are in degrees.)

R2/3 Let T = T N Y W R. How many terms in the sequence

cos(T − 0) − sin(T + 0), cos(T − 1) − sin(T + 1), cos(T − 2) − sin(T + 2), . . . , cos 0 − sin 2T
are positive? (Angles here are in degrees.)

Tiebreaker Triangle ABC is drawn in the plane. Point D is on BC such that AB = AD. The incircle of ABD
meetsAD at P . There exists a point E on AC and a circle centered at E AD at P and tangent to
which is tangent to
BC at Q. Given that tan B = 125
, compute tan C .
 FARML 2017

ANSWER KEY
T1 (1, 2015), (2016, 0), (−1, −2019)
T2 20
T3 −17480
T4 98
T5 3+4i
5√
T6 42 3
T7 The rows, from top to bottom: 8721, 8401, 8801, and 9801
T8 π π
,
7 5
T9 8069
T10 93

I1 −2
√
I2 629
I3 105
I4 −8
I5 (11, 11), (17, 3)
I6 962
I7 310
I8 − 117
44
I9 96
I10 −112

R1/1 6π
R1/2 32π
R1/3 320π
3

R2/1 37
R2/2 74
R2/3 29

TB 9
20
 FARML 2017

TEAM EVENT
SOLUTIONS
T1 If y = 0, then we have 1 + 0 + x = 2017, (2016, 0). If y is negative, then in order
which gives one solution pair:
to avoid fractional values on the left-hand side we need only consider |x| = 1, which yields another solution pair:
(−1, −2019). Finally, if y is positive then the left-hand side will be a multiple of x, which means x must be a
divisor of 2017. There are only a few values to try, and we see that (1, 2015) is the only solution pair we get from

this case. In total the solution set is (1, 2015), (2016, 0), and (−1, −2019)

T2 Pick's Theorem states that the area of a lattice polygon equals

B
2
− 1, where I+ I equals the number of interior
lattice points and B equals the number of lattice points on the boundary. We have B = 1+2+3+4+5+6+7+8 =
36, so the area is simply I + 17. One can show that I is minimized at 3 when we choose either an S shape or a
3
C shape for the polygon , as shown below. In either case we achieve the minimum area of 20
4

4 2

2 3

3
6 8
5

7 6
1 1
8 7

T3 If we compute the rst few terms, we get a1 = 1, a2 = a3 = a4 = 2, and a5 = a6 = · · · = a25 = 5. One can show
that an is constant at a value K up until aK 2 , and then aK 2 +1 = K 2 + 1. Thus a26 = · · · = a262 = a676 = 26,
and a677 = · · · = a6772 = 677. When we go to calculate the alternating sum, we see that almost all the products
cancel out: since the distinct values of {an } alternate between even and odd, there are an odd number of terms
of any one value K, and so in the alternating sum there are an even number of instances of K 2 . They cancel
each other over the course of alternating + and − terms, and so the only pairwise products that remain are those
between diering values of the sequence. (And we should check that the alternating product stops after an odd
number of terms of value an = 677, so the alternating 677 · 677's cancel out.) We get

a2 a1 − a3 a2 + a4 a3 + · · · − a2017 a2016 = 2 · 1 − 5 · 2 + 26 · 5 − 26 · 677 = −8 − 26 · 672 = −17480

T4 There are 53 = 125 choices for how many of each type of stamp we might choose to use, but we need to ac-
count for non-positive total postages as well as duplicates. There is one way to get a postage of zero and 4
ways to get a negative postage. One way to get duplicate postages between two sets of stamps is if we have a
{19, −2, −2, −2, −2} ↔ {11} situation. There are 4 · 4 = 16 pairs of sets that have this property, since there are
4 choices on the left-hand side for the number of 19-cent stamps to use (between 1 and 4) and 4 choices for the
number of 11-cent stamps to use (between 0 and 3).

Another way to get duplicate postages is if we have an {11, 11, 11, 11, −2, −2, −2} ↔ {19, 19} situation. There
are 2·3=6 ways for this to happen, since the left-hand side can contain 3 or 4 negative stamps, and between 0
and 2 19-cent stamps.

One can check that there are no other ways to duplicate values, and so in total there are 125−1−4−16−6 = 98
distinct positive postages that can be attained.

T5 Let H, V, and D denote the horizontal, vertical, and diagonal sides of the region |w| = 1 R. Choosing a w with
is equivalent to rotating R about the origin by Arg(w). If we choose w = 1, the
H will region is unchanged and
◦
remain parallel to the real axis. If we choose w = −1, this will rotate R 180
about the origin, and again H
◦ ◦
will be parallel to the real axis. In order to get V parallel to the real axis, we can rotate by either 90 or 270 .
This corresponds to w = i and w = −i. Finally, we need to consider D . The slope of D is − 2 . If we choose w
1
1
such that the slope of the ray from the origin to w is 2 , then wD will be parallel to the real axis. One complex

3proof left as an exercise to the reader  perhaps condition on the relative locations of the sides of length 1 and 2?
 FARML 2017
2+i
number with that argument is 2 + i, but we need a magnitude-1 complex number, so we must have w = √ .
5
−2−i
The sixth and nal value of w is just √ . (Note that these 6 values come in pairs that are negatives of each other.)
5
 ‹2
2+i 3 + 4i
The product of the members of S is then (−1)3 · 12 · i2 · √ =
5 5
T6 Obviously, this is all about guring out what the picture looks like. And here it is:

By extending the six outermost sides, we see that the 18-gon is what we get when we ring 6 regular hexagons
√ €
√ Š
of side length 2 around a central hexagon. Thus the area is 7 · 6 · 2 · 4
2 3
= 42 3

Alternatively, we can view the 18-gon as a hexagon of side length 6 with 12 equilateral triangles of side length
2 removed along the boundary, resulting in an area of:
√ √ √
3 2 3 2 (216 − 48) 3 √ √ √
6· · 6 − 12 · ·2 = = 54 3 − 12 3 = 42 3
4 4 4
T7 a 4
When 1A is converted it binary, it begins and ends in 1. Thus 1A is odd. In order for 6 + b to be odd, either
4
a = 0 and b is even; or a > 0 and b is odd. Note that if b is even, b ends in 6 or 0. But b cannot be 10 (too
large), nor can it be 0 (that would lead to 2A equalling0001); so if a = 0 then 2A must end in 7. And since no
a > 0 and b is odd. 6a will end in a 6, and a4 will end in 1
square ends in 7 (see 4A), this case is ruled out. So
a 4 a
or 5. Again, 4A is helpful: we cannot have a square ending in 7, so b = 5 and 2A equals 6 + 5 = 6 + 625; this
4 5 4
limits us to 6 + 625 = 1921 or 6 + 5 = 8401. 3A is not compatible with 1921, so 2A is 8401; 3A is 8801; the
only square ending in 801 is 9801, so 4A is 9801. Finally, 1A ends in 1 and is a 14-digit palindrome in binary.
Its rst digit is 8 and its middle two digits come from {2, 3, 5, 6, 7}. The smallest 14-digit binary palindrome is
213 + 1 = 8193. Other 14-digit binary palindromes can be obtained by adding one or more numbers from the list
26 + 27 , 25 + 28 , 24 + 29 , . . .. These rst few values are 192, 288, 528. Other values in the list are too large to add
without pushing the sum out of the 8000's. Trial and error shows that only adding 528 satises these criteria;

hence the rows from top to bottom are 8721, 8401, 8801, and 9801

T8 Let's start munging and see what happens:

√
8 cos2 α = 2 + 2 + 2 cot2 α + 2 cot α csc α
É
1 + cot2 α + cot α csc α
4 cos2 α − 1 =
2
É
sin2 α + cos2 α + cos α
=
2 sin2 α
É
1 1 + cos α
=
| sin α| 2
α
4 cos2 α sin α − sin α = cos (note: | sin α| = sin α, because α is acute)
2
α
4(1 − sin2 α) sin α − sin α = cos
2
α
3 sin α − 4 sin3 α = cos
2
α
sin 3α = cos
2
 FARML 2017

We can get acute solutions α to sin 3α = cos 2 in the case where 3α + 2 = 2 ⇒ α = 7 ; and also in the case
α α π π

where 3α − 2 = 2 ⇒ α = 5 . (It is left as an exercise to the reader to verify that these are the two ways to obtain
α π π

π π
an acute-angled solution α.) The solutions are then α= and α=
7 5
T9 If an integer n n
is even, then f (n) = 2 . If n is not even but is a multiple of 3, then f (n) = 2n
3
. And so on. In
n(p−1)
general, f (n) equals p
, where p is the smallest prime divisor of n. A few facts follow:

 If n is prime, f (n) = n − 1.
 The only way for n and f (n) to be relatively prime is if n is prime.
 The only way f (n) can equal a prime p is if n = 2p.
 f (n) is divisible by p − 1, where p is the smallest prime divisor of n.

Armed with these facts, we can start working backward from 2017. Since 2017 is prime, we must have
f (f (n)) = 4034. Let's look for values m for which f (m) = 4034. 4035 is not prime, so m's smallest prime divisor
must be 2 or 3. That is, we must have m = 2 · 4034 = 8068 or m = 2 · 4034 = 6051.
3

Let's look at 6051 = 3 · 2017 rst. Using the rules outlined above, we can conclude that the only value r for
which f (r) = 6051 is 2 · 6051 = 12102. Look at 8068. Since 8069 is prime4, 8069 is the answer.

T10 Let f (x) = {x} + {x2 }, and consider values of x between 17 and 18. That is, let x = 17 + r, where r ∈ [0, 1).
Then f (x) = r + {(17 + r)2 } = r + {34r + r2 }. Since the function 34r + r2 is continuous and increasing on [0, 1),
we can deduce that {34r + r } will comprise 35 disjoint pieces, i.e. one piece for when 0 ≤ 34r + r < 1, one
2 2

for when 1 ≤ 34r + r < 2, etc., up to when 34 ≤ 34r + r < 35. (Equivalently, we could state that these pieces
2 2

correspond to 17 ≤ x < 17 + 1, 17 + 1 ≤ x < 17 + 2, . . . , 17 + 34 ≤ x < 17 + 35 = 18 .)

2 2 2 2 2 2 2 2 2 2

The lower bounds for f (x) in those pieces will all be less than 1, since they will occur at the values of r for
√ √
√ {34r + r } = 0. √ The least upper bounds for f (x) of those pieces will be { 172 + 1} + 1, { 172 + 2} +
2
which
1, { 172 + 3} + 1, . . . , { 172 + 34} + 1, 2. (Can you gure out why the nal piece's least upper bound is not
√ 20
172 + 35 + 1?) The pieces for which the least upper bounds are too low for the piece to intersect the line y = 17
√
are those corresponding to { k} + 1, where k < (17 + 17 ) = 295 289 . That means the rst 6 pieces on the list
3 2 9
20
above don't intersect y = 17 , and the remaining 29 do.

Now move to 18√ ≤ x < 19. It's the same idea. There are now 37 pieces, and we need to toss out those
corresponding to { k} + 1, where 182 < k ≤ 192 and x < (18 + 173 2
) . This amounts to 6 pieces, namely 325
20
through 330. So the other 31 do intersect y = 17 .

√
Finally we look at 19 ≤ x < 20. There are 39 pieces, and we need to toss out those corresponding to { k} + 1,
where 19 < k ≤ 20 . This again amounts to 6 pieces, namely 362 through 367, so we get an additional 33
2 2

intersections. In total there are 29 + 31 + 33 = 93 intersection points:

2.0

1.5

1.0

0.5

17.5 18.0 18.5 19.0 19.5 20.0

4not easy to check, but it's the Team Event! division of labor!
 FARML 2017

INDIVIDUAL EVENT
SOLUTIONS

I1 Let f (x) = ax + b. Then f (x) + f (f (x)) = ax + b + (a(ax + b) + b) = x(a + a2 ) + (ab + 2b). We are told that
f (0) + f (f (0)) = 0, hence ab + 2b = 0 ⇒ (a + 2)b = 0. So either a = −2 or b = 0. If b = 0 then f (x) passes
through (0, 0) and (20, 17), which implies that it also passes through Quadrant III. But since we are told that

f (x) does not pass through that Quadrant, we must instead conclude that the slope of y = f (x) is −2

I2 As BCD and ABC are similar, ∠BDC = ∠B and ∠CBD = ∠A. Since ABC is acute, ∠ADB = 180◦ − ∠BDC =
180◦ − ∠B > 90◦ , and so in order for ABD to be isosceles it must be true that ∠ABD = ∠A. Thus
∠B = 2∠A, and BD is a bisector of ∠B . Let AC = k. Then AD = 20k 37
17k
and CD = 37 . By similar trian-
√
gles, BC = AC ⇒ 37 /17 = k ⇒ k =
CD BC 17k 17
629

20 17

A D C
I3 1 1 35
When Andy and Van run in opposite directions, they meet every 1/( 5 + 7 ) = 12 minutes. When they run in
the same direction, they meet every 1/( 5 − 7 ) = 2 minutes. Thus their meeting times are at 12 , 12 + 2 , 12 +
1 1 35 35 35 35 35
35 35 35 35 35 35
2
+ 12 , 12 + 2 + 12 + 2 , . . .. We need to nd the rst meeting time that is an integer multiple of 5, since Andy
never reverses directions and is only at P when the time is a multiple of 5 minutes. For convenience one may
divide this sequence of values by 35 and simply look for the rst integer value:

1 7 8 14 15 21 22 28 29 35 36
, , , , , , , , , ,
12 12 12 12 12 12 12 12 12 12 12
Thus it will take 35 · 36
12
= 105 minutes until both Andy and Van are at P at the same time.

I4 We're looking for the 4 smallest solutions, so start by looking for negative ones. If −1 ≤ x < 0, the left-hand side
√
equals 4 , and we get a solution for x = 4 ⇒ x = − 2 . For x < −1, the left-hand side is clearly smaller than 1
1 4 1 2
√
while the right-hand side is larger. So − 2 is the only negative solution.
2

0 ≤ x < 1, the left-hand side equals 1, but the right-hand side is√less than
If
√ 1. If 1 ≤ x < 2, the left-hand side
equals 4 and the right-hand side ranges between 1 and 16. So x = 4 4 = 2 is one solution. If 2 ≤ x < 3 then
we have another solution, at x = 2. If 3 ≤ x < 4 then the left-hand side equals 64 while the right-hand side is at
least 81. If 4 ≤ x < 5 then we have another solution, at x = 4. Thus the product of the 4 smallest solutions is
5
√ √
− 2 · 2 · 2 · 4 = −8
2

I5 If p = q, d(pq) = d(p2 ) = 3. Otherwise, d(pq) = 4. If p = 17, then d(17p) = 3, otherwise d(17p) = 4. So we

then
have a few cases to check. If p = q and p ̸= 17, we have 3p + 4p = 77 ⇒ p = 11 ⇒ (p, q) = (11, 11). If p = q
and p = 17, the left-hand side is a multiple of 17 and equality is not achieved. If p ̸= q and p ̸= 17 then we have
4p + 4q = 77, which has no solutions. If p ̸= q and p = 17, we have 4 · 17 + 3q = 77 ⇒ q = 3 ⇒ (p, q) = (17, 3).
Thus the solutions are (11, 11) and (17, 3)

I6 The region x2 +y 2 < 10y is the open disc of radius 5 centered at (0, 5). Thus we need a downward-facing parabola.
shown that if a < 0 and b ̸= 0 and ax + bx + c is entirely
2
It can be ax2 + c is also above
above this disc, then
the disc. (That is, if the parabola is downward-facing and not centered about the y -axis, then sliding it so that
it is centered about the y -axis will not cause it to suddenly fail to bound the disc.) Thus, since we are seeking to

5can you nd the complete set of solutions to the equation?

 FARML 2017

minimize a2 + b2 + c2 , we must choose b = 0.

Also, notice that as |a|

increases, we must choose ever-larger values of c in order for the parabola to stay
above the disc. So choose a = −1. We are looking for the smallest positive c such that y = −x2 + c does not
2
intersect the circle x + y = 10y . Look at (c − y) + y 2 = 10y ⇒ y 2 − 11y + c = 0, which has a discriminant of
2

121 − 4c. The smallest positive c that makes this negative is 31, so the minimum possible value for a2 + b2 + c2
2 2 2
is (−1) + 0 + 31 = 962

I7 Call the original set T. min S . If min S = 1, then S may also contain any subset (empty
We can condition on
of not) of the remaining elements of T. 28 = 256 subsets. If min S = 2, then we look at max S . We
This gives
1 2 4
must have max S = 4, 6, or 8. In these cases there are 2 , 2 , and 2 valid subsets S . If min S = 3, we must
5
have max S = 9, and in this case there are 2 valid subsets S . No larger minima will work, so in total we have
28 + (21 + 22 + 24 ) + 25 = 256 + 22 + 32 = 310 valid subsets.

I8 Let's start with triangle ABC . 2

As we are given cot C = 11 , we can compute cos C = √
2
125
and sin C = √
11
125
.
This determines the measure of ∠ACB , so we know that C must lie on a circle through A and B that allows such
an angle; that ABC is isosceles limits C to just 3 possible locations on the circle:

C2

C1 C3

A B

Suppose AB = 1. Let us nd the height of the triangle from AB , call it h. Then h = sin A. If we choose C3 :
AB = AC3 soA = 180◦ − 2C3 ⇒ sin A = sin 2C3 = 2 sin C3 cos C3 ⇒ h = 12544
. If we choose C2 : AC2 = BC2 , so
È √ √
C2 1+cos C2 50+4 5
sin A = sin B = cos 2 = 2
= 10
.

Now let's think about ABD and cot BAD . [ABC] = [ABD], both triangles must have the
In order to get
same height h. If ∠BAD cot BAD to be negative. Furthermore, the more obtuse
were obtuse, that would cause
◦
the angle, the more negative the cotangent will be. So we need to choose D such that ∠BAD is as close to 180
as possible. We have two choices for the height of triangle ABD (as measured from AB ), and depending on the
assignment of isosceles sides, we have ten choices for the location of D :

C2

C1 C3

A B

To maximize ∠BAD we should take the leftmost point from the shorter height option:
 FARML 2017

A B

√ √ √
1252 −442
Taking this option, we get sin BAD = 44
125
and cos BAD = − 1 − sin2 BAD = − 125
=− 81·169
125
=
117
− 117
125
, and so cot BAD = −
44
I9 Let c > 1 be the base of the logarithm, and let h and k be the x-coordinates of the left-hand and right-hand
pairs of vertices of Kc , respectively. Then h+k2
= 5 ⇒ h + k = 10. Also, by symmetry, logc k = 5 and
logc h = −5 ⇒ k = c , h = c−5 ⇒ hk = 1 ⇒ h = k1 . So we have k + k1 = 10, but also note that the side length of
5

the square is just k−h=k− 1

k
. Thus [Kc ] = (k − k1 )2 = (k + k1 )2 − 4 = 96

Though it's not necessary to determine c to solve this problem, we certainly could: k + k1 = 10 ⇒ k2 −10k +1 =
√ √ √ √ √
0 ⇒ k = 5± 24 = 5 ± 2 6.
5
Thus the upper-right corner of the square is at (5 + 2 6, 5) and so c = 5 + 2 6.
 FARML 2017

I10 We want to nd triples of integers (a, b, n) for which a2 +

we can only consider values of
to be positive.
217
b
= an . Note that as a is the base of a logarithm,
a larger than 1. However, there is not necessarily a restriction on b or n needing

If b > 0, then we must have n > 2. Looking for solutions with n = 3, we would need to have a − a dividing
3 2

217 = 7 · 31. But a3 − a2 = a2 (a − 1) is always even, so it cannot ever equal a divisor of 217, regardless of the
value for a. Trying larger exponents n yields a similar conundrum: we need a − a to be a divisor of 217, but
n 2

a − a = a (a
n 2 2 n−2
− 1), which will be even for any n > 2 and any integer a.

So let's try looking at negative values b.

This means we would have n < 2. If n = 1, then a − a must be a
2

divisor of 217, and again we have no solutions because a − a = a(a − 1) is always even. If n = 0, then we need
2

a2 − 1 to be a divisor of 217. The divisors of 217 are 1, 7, 31, and 217; one can check that there are no values a
for which a − 1 divides into 217.
2

So now we must try negative exponents, i.e. n < 0. We have − 217

b
a2−n −1
= a2 − an =
a−n
. Note that the
fraction on the right-hand side is a quotient of relatively prime integers, so any solution must have b be of the form
−k·a−n , where k is a positive integer. Substituting, we get 217k
= a2−n −1. This yields two ordered triples (k, a, n)
that work: (7, 2, −3) and (31, 2, −1). Working backwards, these ordered pairs translate to (a, b) = (2, −56) and

(2, −62). Thus the largest possible value for a·b is −112
 FARML 2017

RELAY / TIEBREAKER EVENTS

SOLUTIONS
( )
R1/1 This region comprises 4 non-overlapping circular discs, centered at ± 16
9
, ± 16
9
3
, each of radius 4 . Its total perime-

ter is 4 · 2π · 3
4
= 6π

R1/2 T = 6π , so K = 6. This region comprises two overlapping circular discs of radius

√ 2K . Their centers are at
◦
(0, ±K), and their boundaries intersect at (±K 3, 0). Thus the total boundary of the region comprises two 240
perimeter is 2 · 3 · 2π · 2K =
2 16Kπ
arcs, one from each disc. The total 3
= 32π

R1/3 T = 32π , so This graph comprises 3 overlapping circular discs of radius K , centered at (0, −K), (0, 0),
K = 32.
◦
and (0, K).
In terms of perimeter, the top and bottom discs contribute 240 worth of their perimeter to the
◦
region's boundary, and the middle disc contributes 120 worth its perimeter. This means the region's bound-
5 5 10Kπ 320π
ary has a perimeter qual to of the perimeter of a circle of radius K , so the answer is · 2π · K = =
3 3 3 3

3 60

15

2 40
10

1 20
5

0 0 0

-5
-1 -20

-10
-2 -40

-15
-3 -60

-3 -2 -1 0 1 2 3 -10 -5 0 5 10 -30 -20 -10 0 10 20 30

R2/1 cos 4T is negative if 4T > 90 ⇒ T ≥ 23, whilst sin 5T is negative if 5T > 180 ⇒ T ≥ 37. As cos 148◦ is negative,

37 is the answer.

R2/2 T = 37. We have a series of products of angles that are being pushed apart, one towards quadrant II and the
other towards quadrant IV. The product will be positive if both angles are in quadrant I or if one each is in II
◦ ◦
and IV. The rst condition is true for the rst 36 terms (the ±0 through ±36 terms); the second is true for
◦ ◦
terms ±54 through ±90 , a further 37 terms. In total, 74 terms will be positive.

R2/3 T = 74. ◦
is in quadrant I, we will get a term of zero only for the ±45 term,
When will a term equal zero? If T
◦
as that is when the angles in the sine and cosine will dier by 90 . No other term in the sequence will be 0, so
we need to see if we cross from positive to negative or negative to positive in the 90 terms. As T = 74 is larger
than 45, we start with a negative term. Thus the positive terms are ±46◦ through ±74◦ , a total of 29 terms.
 FARML 2017

TB Let R be the foot of the altitude from A to BC , let I be the incenter of triangle ABD :

I P

B R D Q C
BR = DR = DP = DQ.
Note that If we call this length 1, then AR = tan B and IR = IP = tan B2 . Since
◦
∠DEP = 90 − ∠DIP = ∠IDP = B2 , we have EP = DP · cot B2 = cot B2 . Since ∠IAP = ∠BAR = 90◦ − B ,
cot B
AP = AI · cos IAP = (tan B − tan B
2
) · sin B . Thus tan EAP = EP
AP
= 2
(tan B−tan B )·sin B
.
2

Sincetan B = 125
, we have cos B = 5
13
and sin B = 12
13
. This gives tan B
2
= 1−cos B
sin B
= 8
12
= 2
3
, which leads to
tan EAP = 15
16
. Finally,

tan C = tan(180◦ − ADC − CAD)

= − tan(ADC + EAP )
tan ADC + tan EAP
=
tan ADC · tan EAP − 1
− 12 + 15
= 125 15 16
− 5 · 16 − 1
9
=
20