FARML 2016

TEAM EVENT
T1 Compute the smallest positive value for a + b + c, if a, b, c are integers and abc = 2016.

T2 Ollie the Occasional Liar never lies twice in a row. When asked about his favorite square N, Ollie made the
following statements:
•  N is a two-digit number.
• Actually, N contains an 8.
• Actually, N 's digits are strictly decreasing.
• Actually, N has a digit that appears twice.
• Actually, N is odd.
• Actually, N is a three-digit number.
• Actually, exactly two of those previous statements were lies.
What's the sum of all possible values for N ?

T3 Compute the smallest real number a for which there exists an ellipse passing through the origin, with a major
or minor axis parallel to the x-axis, and which is tangent to the lines y = 20, y = −16, x = 20, and x = a.

sin 4θ − sin θ
T4 Find the smallest positive angle θ for which tan 4θ = .
cos θ − cos 4θ
T5 Compute the largest integer n < 2016 for which nn is a divisor of 20162016 .

T6 Alec has seven plants, each of a dierent height. He intends to plant them in a line, but wishes for the plants to
be arranged so that from either end of the line, the same number a
of plants are visible . In how many ways can
this be done?

T7 Perpendicular lines ℓ1 and ℓ2 intersect at (6, 7). Line ℓ1 and the two axes bound a right triangle of area K in
Quadrant IV. Line ℓ2 and the two axes bound a right triangle of area 4K in Quadrant I. Compute K .

T8 A function f is called shaky N , f (N ) is a rearrangement of the digits of N . That is,

if, for every positive integer
if f f (20) = 20 or 2, and f (2) must equal 2. Compute the smallest pos-
is shaky, then it must be the case that
sible N for which there exists a shaky function g which satises g(N +g(N +g(N ))) = g(2016+g(2016+g(2016))).

T9 A cube is divided into rectangular solids R1 , R2 , . . . , R8 by 3 pairwise perpendicular planes. Each of the 8 solids
has a distinct integer volume, the largest being 2016 and the smallest being V . Compute the largest possible
value for V.

T10 Concentric circles O1 andO2 of radii 3 and 5 are drawn, respectively, as is square ABCD, which is tangent to
O1 at one point and to O2 at two points, as shown. Segment BF is tangent to O1 at P , and segment CT is
tangent to O1 and intersects O2 at S and T , as shown. Compute the length P S .

A B

T P

T10. D F C

ae.g., visible from ground level, as viewed from an arbitrarily far distance away from the nearest plant to the observer's end of the line
 FARML 2016

INDIVIDUAL EVENT
I1 How many 3-digit integers N have the property that the sum of the 3 smallest divisors of N is equal to 17?

I2 Compute the area of the circle circumscribed about an equiangular hexagon with sides of lengths
20, 16, 20, 16, 20, 16.

I3 The angles of convex hexagon ABCDEF are A < B < C < D < E < F , and all have integer degree measures.
Compute the smallest possible value for m∠E .

I4 Compute the number of integers n for which 123! divides into (n!)2 and (n!)2 divides into 321!.

I5 Compute the largest integer N such that the conic x2 + 6x + 4y 2 + 20y = N π passes through the interior of
exactly 2 quadrants.

I6 Cube C is dened as the region enclosed by the six planes x = ±1, y = ±1, z = ±1. Let n be the positive number
for which the two planes x + y + z = ±n intersect C
and slice o two pyramid-shaped corners, leaving a smaller
4 3 2
solid S whose 8 faces each have equal area. There exist integers a, b, c, and d such that n +an +bn +cn+d = 0.
Compute d.
 FARML 2016

I7 Alec rolls a fair 6-sided die repeatedly until the product of the rolls is at least 100, at which point he stops
rolling. Compute the probability that he stops rolling with a product of 200.

I8 Line ℓ intersects the graph of y = x4 − 20x3 + 16x2 − 26x + 2016 at points A, B, C, D such that AB = BC = CD.
Compute the slope of line ℓ.

I9 Find all triples of integers (x, y, z) for which xy = z + x2 + 7 = y + 6z = 12.

I10 Rhombi ABCD, AECF, and BECG are drawn in the plane, with cos AEC = − 17
18
and BC < EG < AC .
Compute the ratio CD : DE .
 FARML 2016

RELAY & TIEBREAKER EVENTS

R1/1 If log6 n = 2016 then compute the last digit of the number of divisors of n.

R1/2 Let T = T N Y W R. If logT +2 log3 n = 2016 then compute the last digit of the number of divisors of n.

R1/3 Let T = T N Y W R. If log16 log20 n = T then compute the remainder when the number of divisors of n is
divided by 45.

R2/1 Compute the area of the rectangle ABCD satisfying tan BAC = BD = 5.

R2/2 Let T = T N Y W R. Compute the area of the triangle ABC satisfying tan A = tan B = BC = ⌊T ⌋.

R2/3 Let T = T N Y W R. Rhombus ABCD has perimeter 24⌊T ⌋. The midpoints of the sides of ABCD form a
rectangle of area 24. Compute sin A.

Tiebreaker Compute the largest integer N with the following two properties:

• the digits of N are distinct; and

• for any two neighboring digits A and B, at least one of their sum, dierence, or product contains a 3.
 FARML 2016

ANSWER KEY
T1 1
T2 1406 √
T3 −3220 − 1440 5
π
T4
13
T5 1344
T6 1078
289
T7
8
(or 36.125)
T8 12
T9 1560
√
7474
T10
37

I1 8
976π
I2
3
◦
I3 111
I4 48
I5 −3
I6 121
49
I7
3125
I8 −866
I9 (2,
√
6, 1) and (−1, −12, 4)
15
I10
2

R1/1 9
R1/2 2
R1/3 36

125
R2/1
26
64
R2/2
17
4
R2/3
27

TB 9 674 852 130

 FARML 2016

TEAM EVENT
SOLUTIONS

T1 Since (a, b, c) = (−12, −8, 21) and (a, b, c) = (−24, −3, 28) both satisfy abc = 2016 and a + b + c = 1, 1 is the
smallest positive sum. Ha!

T2 Call the statements S1 through S7 . Note that at least one of S1 and S6 is false, and at exactly one of S3 and S4
must be false. If S7 is false, it must be the case that 3 of the preceding statements are false, namely S1 , S3 , S5 .
That means N is 3-digit square that contains at least one 8 and also has a digit appearing twice. 222 = 484 is
the only square that ts these conditions.

So instead suppose that S7 is true. Then either N has 2 or 3 digits. If 2 has 3 digits, N must be odd. It must
contain an 8 and either have a repeated digit or decreasing digits. Only 92 = 81 works. If N has 3 digits, it must
2
be odd and contain an 8. Again it can either have a repeated digit or decreasing digits. Only 29 = 841 works
here. Thus the sum of possible values for N is 484 + 81 + 841 = 1406

T3 The length of the vertical semiaxis is

1
2
(20 − (−16)) = 18, so the center of the ellipse is (h, 2) for some h. The
(x−h)2 (y−2)2 h2
2 = 81 ⇒
80
formula for the ellipse is
(20−h)2
+ 182 = 1. As the ellipse passes through the origin, we have (20−h)
√
h
20−h
= ± 980 ⇒ 20−h h
= 20 h
−1 = ± √80 ⇒ h = 1 ± √80 . In order to have the widest ellipse, we should choose
9 20 9
√ √ √ √ √
the smallest value for h. So solve for h = 1 − √ ⇒h= √ = −20 80( 80 + 9) = −1600 − 720 5.
20 9 80−9 20 80
80
= √ 80 80−9

√
Then the vertical tangent line along the left side is at (x − h) = −(20 − h) ⇒ x = 2h − 20 = −3220 − 1440 5

T4 Clear denominators and then start rearranging:

sin 4θ sin 4θ − sin θ

=
cos 4θ cos θ − cos 4θ
sin 4θ(cos θ − cos 4θ) = cos 4θ(sin 4θ − sin θ)
sin 4θ cos θ + sin θ cos 4θ = 2 cos 4θ sin 4θ
sin 5θ = sin 8θ,
π
so the smallest positive solution is for 5θ + 8θ = π ⇒ θ =
13
T5 2016 = 25 32 71 , so let n = 2a 3b 7c . We seek the largest n for which an ≤ 2016 · 5 = 10080, bn ≤ 2016 · 2 = 4032,
and cn ≤ 2016. Obviously if n divides 2016 then n divides 2016
n 2016
, so we need only look for n > 1008. This
means we need only consider values of n for which c ≤ 1. So we can set c equal to 0 or 1, then try values of a
and nd the largest b that works. We get the following charts:

c a best b n
0 0 5 243 c a best b n
0 1 5 486 1 0 4 567
0 2 4 324 1 1 3 378
0 3 4 648 1 2 3 756
0 4 3 432 1 3 2 504
0 5 3 864 1 4 2 1008
0 6 2 576 1 5 2 2016
0 7 2 1152 1 6 1 1344
0 8 1 768 1 7 0 896
0 9 0 512
Thus the largest n is 1344
 FARML 2016

T6 Suppose the heights of the plants are 1, 2, 3, 4, 5, 6, 7. Let the arrangement be A B C D E F G. One way to tackle
the problem is by conditioning on the placement of the 7. (The tallest plant.)

There are no OK arrangements with A=7 (or G = 7, by symmetry), since the left side only sees 1 plant and
the right side sees at least 2.

For B = 7, the left side can see 2 plants for any of the 6 shorter plants we choose to put at A. Thus we must
put the tallest of the 5 remaining plants at G, and the other 4 can be arranged in any way. So for B = 7, there
are 6 · 4! = 144 OK arrangements.

(6)
For C = 7, = 15 ways for each case to happen. If the left
the left side can see 2 or 3 plants. There are
2
side can see 2, again we must put the tallest of the remaining plants at G, and the remaining plants (3) can be
arranged in any order. If the left side can see 3 plants, then the tallest of the 4 remaining can be at D, E, or F .
In these cases, there are 2, 3, and 6 ways to place the nal 3 plants. In total, there are 15(3! + 2 + 3 + 6) = 255
OK arrangements.

(6)
D = 7, the left side can see 2, 3, or 4 plants.
For First there are 3
= 20 ways to pick which plants are in
{A, B, C}. There is one way to arrange them (and the leftovers) so that both sides see 4 plants. There are 4 ways
to arrange them (and the leftovers) so that both sides see 2 plants . (Namely, take the tallest from the two sides
2
for A and G, and the two leftovers on each side can be planted in any way.) Finally, there are 3 = 9 ways for
both sides to see 3 plants. In total there are 20(1 + 4 + 9) = 280 OK arrangements here.

By symmetry, the cases for E and F are the same as C and B, so the total number of OK arrangements is
280 + 2(144 + 255) = 1078

T7 Let B = (d, 0) and let ∠BAO = θ. Triangles ABO, ACX, BDX, and CDO are all similar. Furthermore, if we
let Y = (6, 0) and Z = (0, 7) then AXZ, BXY, CXZ, and DXY are also similar to the others:
15

10 C
X
Z

O B D
0
Y

-5

-10

-15

-20
0 10 20 30 40

BY = 6 − d, BY = 7 tan θ, so d = 6 − 7 tan θ. Since [CDO] = 4K , CO : BO = 2 : 1,

but also so CO = 2d.
But we also have CO = OZ + CZ = 7 + 6 tan θ ⇒ 2(6 − 7 tan θ) = 7 + 6 tan θ ⇒ tan θ = 14 .

17 d 289
Now we have d= , AO = = 17, and nally K = [ABO] =
4 tan θ 8
 FARML 2016

T8 Note that g(N ) ≡ N (mod 9) for all N , so the righthand side will be a multiple of 9 no matter what shaky
function g we use, while the lefthand side will be congruent to 3N . So N must be a multiple of 3. Let
R3 = g(2016 + g(2016 + g(2016))), and R2 = g(2016 + g(2016)). We claim that R3 must be at least 45. First, we
show that R3 cannot be 9. To be 9, R2 must be 9000 − 2016 = 6884. But there is no value for g(2016) such that
2016 + g(2016) = 6884.

In order to get R3 = 18, we would need 2016 + R2 to equal 8100, 8010, or 8001. None of these val-
ues is achievable. In order to get R3 = 27, we would need 2016 + R2 to equal 2700, 2070, 2007, 7200, 7020,
or 7002. It can be seen that these are also all impossible. And in order to get R3 = 36, we would need
2016 + R2 to equal one of 6300, 6030, 6003, 3600, 3060, or 3006. Again, these are all unachievable. Yet setting
g(2016) = 2016, R2 = g(4032) = 2034, and R3 = g(4050) = 45 works.

Now focus on N, L3 = g(N + g(N + g(N ))). If N = 3, then L3 = 9. If N = 6, then L3 = g(6 + g(12)),
and let
which falls into the 18 27 cases. Not doable. If N = 9, then L3 = g(9 + g(18)), which falls into the
and
27 and 9 cases. (90 is covered by the 9 case.) If N = 12, we can have g(12) = 21, g(12 + g(12)) = 33, and
L3 = g(12 + 33) = g(45) = 45. Thus 12 is the answer.

T9 Let the side length of the cube be S, and suppose the three planes divide S along the length, width, and
height of the cube into segments of length a and b, c and d, and e and f , with a > b, c > d, e > f . Then
a + b = c + d = e + f = S , ace = 2016, and bdf = V . Note that a, b, c, d, e, f, and S , so far, need not be integers.

a c
The ratios b must be rational, as ace and bce are both integer volumes of rectangular solids. Similarly, d
e A a C c E e
end f are rational. So let A, B, C, D, E, F be positive integers such that B = b , D = d , F = f , and such that
gcd(A, B) = gcd(C, D) = gcd(E, F ) = 1. These three fractions must be distinct, because if any two are equal
that would imply that 2 (or more) of the 8 solids have the same volume. Since 2016 · A is an integer, A divides
B

2016. By similar logic, C and E do, too.

Let A = 2xA 3yA 7zA , C = 2xC 3yC 7zC , and E = 2xE 3yE 7zE . Then xi ≤ 5, yi ≤ 2, zi ≤ 1 for i ∈ {A, C, E}. We
claim that ACE|2016  that is, xA + xC + xE ≤ 5, yA + yC + yE ≤ 2, and zA + zC + zE ≤ 1.

Proof of claim. Let's focus rst on the subclaim that xA + xC + xE ≤ 5. Condition on the number of
{A, C, E} which are even. If none are even, then the LHS is 0. If exactly one of the three is even, we can suppose
without loss of generality that it is A. We know A divides 2016, so xA ≤ 5, and since xC = xE = 0 the LHS is at
most 5.If exactly two are even then suppose without loss of generality that they are A and C . Then B and D
are odd. One of the eight solids has a volume of 2016 · A · C = . The numerator is of the form 2 · [odd],
B D 2016BD 5
AC
therefore xA + xC ≤ 5; as xE = 0, LHS is at most 5. Finally, suppose all three are even. Then again, one of the
eight solids has a volume of 2016· A · C · E = , which is again of the form 2 ·[odd]. Thus xA +xC +xE ≤ 5.
B D F 2016BDF 5
ACE

The other two subcases of the claim can be handled in a similar fashion. 

Now, we know that the maximum value for V will be of the form 2016 · (A−1)(C−1)(E−1)
ACE
, where ACE|2016 and
{A, C, E} are distinct. Trying dierent examples, it can be seen that this value is maximized when {A, C, E} are
as close as possible to each other: when {A, C, E} = {9, 14, 16}, we get V = 1560
 FARML 2016

X be the intersection of BF and CT , and let α = ∠ABO and β = ∠OBP , as shown below left. Note that
T10 Let
∠DCO = α and ∠OCQ = β , so we can conclude ∠CF B = α + β , ∠F CT = α − β , and ∠CXF = 180◦ − 2α.
A B A B
α
β

O O

T P T P

Q X S Q X S
β
D F C D F C
Triangles OP X and OQX are congruent right triangles, thus ∠QOX = ∠P OX = α, as shown below.

A B
α

O
α α
T P

Q X
S
D F C
5
We know tan α = 7 , so P X = OP · tan α = 3 · 57 = 15
7
. SX = QS − QX = 4 − 7 = 7 , and ∠P XS
15 13
= 2α. We
7
can calculate cos 2α = 2( √ )
74
2
−1= 12
37
. Finally, use the Law of Cosines on triangle P SX to get

( )2 ( )2
15 13 15 13 12
P S2 = + −2· · ·
7 7 7 7 37
( )
1 4680
= 152 + 132 −
72 37
( )
1 4680
= 394 −
72 37
( )
1 14800 − 222 − 4680
=
72 37
1 9898
= ·
72 37
202
= ,
37
√
7474
and so PS =
37
 FARML 2016

INDIVIDUAL EVENT
SOLUTIONS

I1 Let the three smallest divisors be 1, a, b. Then a < b and a + b = 16. Looking at cases, we see that
(a, b) = (2, 14), (4, 12), (6, 10), (7, 9) have no solutions. If (a, b) = (3, 13), then N = 39m, where m is not di-
visible by any prime smaller than 13. We get valid 3-digit integers for m = 13, 17, 19, 23. If (a, b) = (5, 11), then
N = 55m, where m is not divisible by 2, 3, or 7. We get valid 3-digit integers for m = 5, 11, 13, 17. In total there
are 8 integers N that work.

I2 Call the hexagon ABCDEF , such that AB = CD = EF = 20 and BC = DE = AF = 16, as shown below:
B
C
√
r 3

r
r
A
r
O
D

E
√
If we call the center of the circle O and its radius r , then ACO is a 30/30/120 triangle, so AC = r 3. Since
∠B = 120◦ , use the Law of Cosines on triangle ABC to get 3r2 = 202 +162 −2·20·16·cos 120◦ = 400+256+320 =
976π
976. Thus the area of the circle is πr2 =
3
◦ ◦ ◦ ◦ ◦
I3 Let's make the rst four angles as large as possible, so our six angles are E−4 , E−3 , E−2 , E−1 , E, F = 720 −
(5E −10 ) = 730 −5E . Then we need F > E and F ≤ 179 . The second condition gives 5E ≥ 551 ⇒ E ≥ 111◦ .
◦ ◦ ◦ ◦
◦ ◦ ◦ ◦ ◦ ◦ ◦
This satises the rst condition, we E = 111 would give a set of angles {107 , 108 , 109 , 110 , 111 , 175 }. Thus

111◦ is the smallest possible value.

I4 In order for (n!)2 to be a multiple of 123!, n must be at least as large as the largest prime smaller than 123. That
largest be checked that for 113 ≤ n ≤ 122, 123 · 122 · · · · (n + 1) divides into n!.) On
prime is 113. (And it can
the other end, the smallest prime larger than 2 is 163, so (n!) will not divide into 321! for n ≥ 163. Does
321 2
2
n = 162 work? If we look at powers of 3 dividing (162!) and 321!, we will see that it does not. What about 161?
This can be shown to fail by looking at powers of 7. n = 160 does work, and so the range of values that works is
113 ≤ n ≤ 160, so there are 48 values in total.

I5 Rewrite the conic equation as (x + 3) + 4(y + ) − 9 − 4 · = N π ⇒ (x + 3)2 + 4(y + 52 )2 = N π + 34. This

2 5 2 25
2 4
is a conic centered at (−3, − 2 ) for which the width-to-height ratio is 2 : 1. If the ellipse is tangent to the y -axis,
5
3 5
then its width is 3 and its height is 2 , which is less than 2 , so the ellipse will only be inside quadrant III. If it is
tangent to the x-axis, then its height will be 2 and its width will be 2 · 2 > 3, so it will extend into quadrant IV.
5 5

Therefore, we should solve for the value of N such that the ellipse is tangent to the x-axis (or as close to being
tangent without crossing into quadrant II).

−9
If (−3, 0) is on the ellipse, 4 · ( 52 )2 = N π + 34 ⇒ N = π
, which is between −2 and −3. Thus the largest

integer value for N is −3

 FARML 2016

I6 The solid S has 2 faces which are equilateral triangles, and 6 faces that are squares of side length 2 with
right isosceles triangles removed. Let n = 3 − s. Then the vertices of one of the equilateral triangles are at
√ √ 2√
2√
(1, 1, 1 − s), (1, 1 − s, 1), (1 − s, 1, 1). The side length of the triangle is s 2, so its area is (s 2) 3
= s 2 3 . This
√ √ √ √ √√ 4
s2
must equal 2 − 2 ⇒ s (1 + 3) = 4 ⇒ s = 1+8√3 = 2 (√3+1)( 3 − 1.
2 2 2( 3−1)
√ =2
3−1)
√√ √
So we have n = 3−2 3 − 1, thus (n − 3)2 = 4 3 − 4 ⇒ ((n − 3)2 + 4)2 = 48, which, when expanded, gives

a fourth-degree equation in n with constant term d = 121

I7 Since a roll of 1 does not change the product, the problem is equivalent to one in which Alec rolls a fair 5-sided
die with sides labeled 2, 3, 4, 5, 6. To get a product of 200 requires the 4-roll combo {2, 4, 5, 5} or the 5-roll combo
{2, 2, 2, 5, 5}. There are 12 and 10 ways, respectively, to permute these combos. However, we can't have a per-
mutation that ends in 2, as that would imply that the product of the previous rolls is 100. This reduces us to 9
( )4 ( )5
1 1 49
and 4 useable permutations, respectively. The total probability is 9 +4 =
5 5 3125
I8 Call the quartic equation f (x) and let ℓ have the equation g(x) = mx + b. If g(x) intersects f (x) at 4 equally
spaced points, then f (x) − g(x) = 0 has 4 distinct real roots. Those roots form an arithmetic progression, so
there exists a constant shift d and real number a such that

f (x − d) − g(x − d) = (x − 3a)(x − a)(x + a)(x + 3a) = (x2 − a2 )(x2 − 9a2 ) = x4 − 10a2 x2 + 9a4 .
In order to make the cubic term disappear, we must choose d = 5. Rewriting f (x) as a polynomial in (x − 5),
one gets f (x) = (x − 5) − 134(x − 5) − 866(x − 5) + 411.
4 2

√ √ (√ )4
Thus if a= 134
10
= 67
5
and g(x) = −866(x − 5) + 411 − 9 67
5
, f (x) − g(x) will be of the form given

above. So the slope of g(x) is m = −866

10 000

5000

-5000

-10 000

-5 0 5 10 15

I9 From y + 6z = 12, y must be a multiple of 6. From xy = 12, we can narrow down the possible values for (x, y)
to four pairs to try: (1, 12), (−1, −12), (2, 6), (−2 − 6). Of these pairs, two of them yield values of z that cause all
the equalities to align: (2, 6, 1) and (−1, −12, 4)
 FARML 2016

E and F lie on the segment BD , BE||CG.

I10 Since That is, ∠ACG = 90◦ . If we say α = ∠BAC , then
∠BCG = 90◦ − α and so ∠CGE = α.

Depending on α, the diagram for the three rhombi may look rather dierent. If α < 30◦ , we get something
like this, with E and F outside ABCD and F nearer to B:
G

A C

E
◦ ◦
If 30 < α < 45 , we get something like this, with E and F inside ABCD and F nearer to B:
G

A C

D
◦
Finally, if α > 45 we get something like this, with E and F inside ABCD and F nearer to D:
B

A C

D
As we know BC < EG < AC , we can deduce that we must be in the second case. ∠AEC = 2 · ∠BEC = 4α,
◦
so cos 4α = − 18
17 2 1 1
, which implies cos 2α = 36 from the double-angle formula. As 2α < 90 , we have cos 2α = 6 .

Let AB = 1. The sin α = 1/2

⇒ CG = BE = 1
DE = BD − BE = 2 sin α − BE = 2 sin α − CG =
.
2
CG 2 sin α √ √
2 sin α − 1
2 sin α
= 4 sin α−1
2 sin α
. We have cos 2α = 1
6
⇒ 1 − 2 sin2 α = 16 ⇒ sin α = 5
12
= 615 . From here we get
√
1 2 sin α 15
CD : DE = DE
= 4 sin2 α−1
=
2
 FARML 2016

RELAY / TIEBREAKER EVENTS

SOLUTIONS

R1/1 n = 62016 = 22016 · 32016 , so n has 20172 divisors, and the last digit is 9
2016 2016
R1/2 T = 9. n = (T + 2)3 = 113 . Since 11 is prime, the number of divisors is 32016 + 1. The last digits of 3k for

k = 1, 2, 3, 4, . . . are 3, 9, 7, 1, 3, 9, 7, 1, . . ., so the last digit is 1 + 1 = 2

T T T
R1/3 T = 2. n = 2016 = 516 · 22·16 , which has (16T + 1)(2 · 16T + 1) divisors. Note that modulo 45, 16k is either 16
(k is 1 mod 3), 31 (2 mod 3), or 1 (0 mod 3). Since T = 2, we have a remainder of (31 + 1)(62 + 1) = 32 · 63 ≡

32 · 18 = 576 ≡ 36

125
R2/1 s2 + (5s)2 = 52 ⇒ 26s2 = 25 ⇒ [ABCD] = s(5s) = 5s2 =
26
, so ⌊T ⌋ = 4. Let K = ⌊T ⌋ for now. The area is the same as that of a rectangle with diagonal K and
125
R2/2 T = 26
diagonal angle of tangent K . (Just like the previous problem.) So let the rectangle's side lengths be s and Ks,

K3 64
from which s2 (K 2 + 1) = K 2 , and the area is Ks2 = K 2 +1
. As K = 4, the area is
17
R2/3 T = 64
17
, so ⌊T ⌋ = 3. Let K = ⌊T ⌋ for now. The dimensions of the rectangle determined by the midpoints of
ABCD are 2 · 3K cos A 2
and 2 · 3K sin 2 , so we have
A

( )( )
A A A A 24 4 4
24 = 6K cos 6K sin = 36K 2 cos sin = 18K 2 sin A ⇒ sin A = = =
2 2 2 2 18K 2 3K 2 27

TB We want to aim for a 10-digit number N, one that uses all 10 digits exactly once and which begins with a 9.
Note that 0 can only be next to 3, so the last two digits must be 3 0. Also note that 8  which we are not putting
at the beginning and cannot put at the end  can only go beside a 4 or a 5. Thus if we are to succeed with a
10-digit number starting in 9 we must have a substring of 485 or 584 somewhere in the interior.

So look for N beginning with 9 7. We can put a 6, 5, or 4 after the 7. These choices force, respectively, N to
begin as 9 7 6 5 8 4, 9 7 5 8 4 1 2, and 9 7 4 8 5. In the rst case, we would need to follow with 1 2, but this doesn't
work with the forced conclusion of 3 0. In the second case, we are already stuck. In the third case, following with
a 6 would leave us stuck; following with a 2 would force 9 7 4 8 5 2 1, and now there is no way to use the remaining
digits (0, 3, 6).

So we move down to N potentially beginning with 9 6 7. The next highest usable digit is 5, which would force
9 6 7 5 8 4, but from here we would need to follow with 1 2, and we're stuck. Next up we try 4 as a 4th digit, which
gives 9 6 7 4 8 5. The rest of N is forced, and this time we are able to nish! We get N = 9 674 852 130