2017 ARML Local Competition

Photocopying Instructions

Make one copy of the whole packet for each team. It contains:

1 copy of the Team Score Sheet

1 copy of the Team Round Answer Sheet
6 copies of the Team Round (2 pages)
1 copy of the Individual Round questions (for proctor)
6 copies of each Individual Round pair
1 copy of each Relay Round Sheet (6 pages for each round)
1 copy of the Relay Round Answer Sheets
(Cut out the 12 miniature answer sheets)
5 copies of the Tiebreaker Question (make more as needed)

Notes:
No calculators are allowed for any round.
Make sure copious scratch paper is available.
Thank you so much for coordinating ARML Local.
 2017 ARML Local Competition
Team Score Sheet

Team Name: _________________________________

Team Round (4 pts per correct answer, 60 max.)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Tot

Individual Round (1 pt per correct answer, 60 max.)

Student Names 1 2 3 4 5 6 7 8 9 10 Tot
1.
2.
3.
4.
5.
6.
Totals

Relay Round
(Round 1: 3x 2pts/1pt. Round 2: 2x 4pts/2pts, Round 3: 1x 6pts/3pts. 20 points max.)
Relay Round/Team 1/1 1/2 1/3 2/1 2/2 3 Total
Score

Total (out of 140): __________

 2017 ARML Local Competition
Team Round Answer Sheet

Team Name: _______________________________

Question Number Answer

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
 2017 ARML Local Team Round
(45 minutes)

T-1 A fair six-sided die has faces with values 0, 0, 1, 3, 6, and 10. Compute the smallest positive
integer that cannot be the sum of four rolls of this die.

T-2 For a positive integer k, let zk be the number of terminal zeroes of the product 1!2! · · · k!.
For example, z6 = 2 because 1!2!3!4!5!6! = 24883200. Compute z100 .

T-3 Let ARM L be a square of side length 5. A point B on side M R and C on side M L are
selected uniformly at random and independent of one another. Compute the expected area
of triangle ABC.

T-4 The edges of regular hexagon ABCDEF are made of mirrors. A laser is fired from A toward
the interior of edge CD, striking it at point G. The laser beam reflects off the interior of
exactly one additional edge and returns to A. Compute tan(∠DAG).

T-5 Let S be the set of lattice points {(x, y) : x, y ∈ Z, 0 ≤ x ≤ 3, 0 ≤ y ≤ 4}. Compute the
number of subsets of S of 4 lattice points that form the vertices of a square.
√
T-6 If A is an acute angle such that sin 15◦ + cos 15◦ = 2 sin A, compute cos A.

T-7 Consider the following algorithm for a given non-negative integer n:

Step 1: Initialize k = 1.
Step 2: Replace n with the product of its digits.
Step 3: If n ≤ 9 return k and exit. If n > 9, increment k by 1 and return to Step 2.

For example, if n = 125, then the algorithm returns 2 because 125 is replaced by 1×2×5 =
10 which is replaced by 1×0 = 0, at which point the algorithm returns 2 and exits. Compute
the smallest value of n such that this algorithm returns 3.

T-8 Three co-planar squares, BAHT , CAIN , and BCGY have areas 16, 16, and 32, respectively.
If the squares only intersect pairwise at the vertices A, B, and C, compute the area of the
convex hexagon T HIN GY .

T-9 Compute the coefficient of x8 in the expansion of (x2 + x + 1)8 after combining like terms.
T-10 Consider the following 3 × 3 grid with its center square removed, as shown.

Compute the number of distinct ways to fill in the grid with the integers 1 through 8,
each appearing exactly once, such that:
– In each of the three rows, the entries are increasing from left to right.
– In each of the three columns, the entries are increasing from top to bottom.

T-11 Kevin and Tarsha are playing a game with four fair standard six-sided dice. The four dice
are rolled and if the numbers appearing on top of the four dice are all different, Kevin pays
Tarsha $1. If not, Tarsha pays Kevin $k dollars. Compute the value of k such that the game
is fair, in other words, the expected value of each play of the game to both players is zero.

T-12 Compute the minimum value of ab such that log2 (a4 b−3 ) = 3 and log2 (a4 b3 ) = 9.

T-13 Compute
10
X 20
n=3
(n − 2)(n + 2)
.

T-14 The six-digit number 142857 has the property that moving the rightmost digit to the left of
the number results in multiplying the number by five (142857 × 5 = 714285). Compute the
smallest six-digit number with the property that moving the rightmost digit to the left of
the number results in multiplying the number by four.

T-15 Compute the number of distinct sequences (x1 , x2 , . . . , x14 ) with the following properties:
– xk ∈ {1, 2, . . . , 14} for each k = 1, 2, . . . , 14.
– The number 20x2k+1 − 17x2k is divisible by 14 for each k = 1, 2, . . . , 13.
 2017 ARML Local Team Round
(45 minutes)

T-1 A fair six-sided die has faces with values 0, 0, 1, 3, 6, and 10. Compute the smallest positive
integer that cannot be the sum of four rolls of this die.

T-2 For a positive integer k, let zk be the number of terminal zeroes of the product 1!2! · · · k!.
For example, z6 = 2 because 1!2!3!4!5!6! = 24883200. Compute z100 .

T-3 Let ARM L be a square of side length 5. A point B on side M R and C on side M L are
selected uniformly at random and independent of one another. Compute the expected area
of triangle ABC.

T-4 The edges of regular hexagon ABCDEF are made of mirrors. A laser is fired from A toward
the interior of edge CD, striking it at point G. The laser beam reflects off the interior of
exactly one additional edge and returns to A. Compute tan(∠DAG).

T-5 Let S be the set of lattice points {(x, y) : x, y ∈ Z, 0 ≤ x ≤ 3, 0 ≤ y ≤ 4}. Compute the
number of subsets of S of 4 lattice points that form the vertices of a square.
√
T-6 If A is an acute angle such that sin 15◦ + cos 15◦ = 2 sin A, compute cos A.

T-7 Consider the following algorithm for a given non-negative integer n:

Step 1: Initialize k = 1.
Step 2: Replace n with the product of its digits.
Step 3: If n ≤ 9 return k and exit. If n > 9, increment k by 1 and return to Step 2.

For example, if n = 125, then the algorithm returns 2 because 125 is replaced by 1×2×5 =
10 which is replaced by 1×0 = 0, at which point the algorithm returns 2 and exits. Compute
the smallest value of n such that this algorithm returns 3.

T-8 Three co-planar squares, BAHT , CAIN , and BCGY have areas 16, 16, and 32, respectively.
If the squares only intersect pairwise at the vertices A, B, and C, compute the area of the
convex hexagon T HIN GY .

T-9 Compute the coefficient of x8 in the expansion of (x2 + x + 1)8 after combining like terms.
T-10 Consider the following 3 × 3 grid with its center square removed, as shown.

Compute the number of distinct ways to fill in the grid with the integers 1 through 8,
each appearing exactly once, such that:
– In each of the three rows, the entries are increasing from left to right.
– In each of the three columns, the entries are increasing from top to bottom.

T-11 Kevin and Tarsha are playing a game with four fair standard six-sided dice. The four dice
are rolled and if the numbers appearing on top of the four dice are all different, Kevin pays
Tarsha $1. If not, Tarsha pays Kevin $k dollars. Compute the value of k such that the game
is fair, in other words, the expected value of each play of the game to both players is zero.

T-12 Compute the minimum value of ab such that log2 (a4 b−3 ) = 3 and log2 (a4 b3 ) = 9.

T-13 Compute
10
X 20
n=3
(n − 2)(n + 2)
.

T-14 The six-digit number 142857 has the property that moving the rightmost digit to the left of
the number results in multiplying the number by five (142857 × 5 = 714285). Compute the
smallest six-digit number with the property that moving the rightmost digit to the left of
the number results in multiplying the number by four.

T-15 Compute the number of distinct sequences (x1 , x2 , . . . , x14 ) with the following properties:
– xk ∈ {1, 2, . . . , 14} for each k = 1, 2, . . . , 14.
– The number 20x2k+1 − 17x2k is divisible by 14 for each k = 1, 2, . . . , 13.
 2017 ARML Local Team Round
(45 minutes)

T-1 A fair six-sided die has faces with values 0, 0, 1, 3, 6, and 10. Compute the smallest positive
integer that cannot be the sum of four rolls of this die.

T-2 For a positive integer k, let zk be the number of terminal zeroes of the product 1!2! · · · k!.
For example, z6 = 2 because 1!2!3!4!5!6! = 24883200. Compute z100 .

T-3 Let ARM L be a square of side length 5. A point B on side M R and C on side M L are
selected uniformly at random and independent of one another. Compute the expected area
of triangle ABC.

T-4 The edges of regular hexagon ABCDEF are made of mirrors. A laser is fired from A toward
the interior of edge CD, striking it at point G. The laser beam reflects off the interior of
exactly one additional edge and returns to A. Compute tan(∠DAG).

T-5 Let S be the set of lattice points {(x, y) : x, y ∈ Z, 0 ≤ x ≤ 3, 0 ≤ y ≤ 4}. Compute the
number of subsets of S of 4 lattice points that form the vertices of a square.
√
T-6 If A is an acute angle such that sin 15◦ + cos 15◦ = 2 sin A, compute cos A.

T-7 Consider the following algorithm for a given non-negative integer n:

Step 1: Initialize k = 1.
Step 2: Replace n with the product of its digits.
Step 3: If n ≤ 9 return k and exit. If n > 9, increment k by 1 and return to Step 2.

For example, if n = 125, then the algorithm returns 2 because 125 is replaced by 1×2×5 =
10 which is replaced by 1×0 = 0, at which point the algorithm returns 2 and exits. Compute
the smallest value of n such that this algorithm returns 3.

T-8 Three co-planar squares, BAHT , CAIN , and BCGY have areas 16, 16, and 32, respectively.
If the squares only intersect pairwise at the vertices A, B, and C, compute the area of the
convex hexagon T HIN GY .

T-9 Compute the coefficient of x8 in the expansion of (x2 + x + 1)8 after combining like terms.
T-10 Consider the following 3 × 3 grid with its center square removed, as shown.

Compute the number of distinct ways to fill in the grid with the integers 1 through 8,
each appearing exactly once, such that:
– In each of the three rows, the entries are increasing from left to right.
– In each of the three columns, the entries are increasing from top to bottom.

T-11 Kevin and Tarsha are playing a game with four fair standard six-sided dice. The four dice
are rolled and if the numbers appearing on top of the four dice are all different, Kevin pays
Tarsha $1. If not, Tarsha pays Kevin $k dollars. Compute the value of k such that the game
is fair, in other words, the expected value of each play of the game to both players is zero.

T-12 Compute the minimum value of ab such that log2 (a4 b−3 ) = 3 and log2 (a4 b3 ) = 9.

T-13 Compute
10
X 20
n=3
(n − 2)(n + 2)
.

T-14 The six-digit number 142857 has the property that moving the rightmost digit to the left of
the number results in multiplying the number by five (142857 × 5 = 714285). Compute the
smallest six-digit number with the property that moving the rightmost digit to the left of
the number results in multiplying the number by four.

T-15 Compute the number of distinct sequences (x1 , x2 , . . . , x14 ) with the following properties:
– xk ∈ {1, 2, . . . , 14} for each k = 1, 2, . . . , 14.
– The number 20x2k+1 − 17x2k is divisible by 14 for each k = 1, 2, . . . , 13.
 2017 ARML Local Team Round
(45 minutes)

T-1 A fair six-sided die has faces with values 0, 0, 1, 3, 6, and 10. Compute the smallest positive
integer that cannot be the sum of four rolls of this die.

T-2 For a positive integer k, let zk be the number of terminal zeroes of the product 1!2! · · · k!.
For example, z6 = 2 because 1!2!3!4!5!6! = 24883200. Compute z100 .

T-3 Let ARM L be a square of side length 5. A point B on side M R and C on side M L are
selected uniformly at random and independent of one another. Compute the expected area
of triangle ABC.

T-4 The edges of regular hexagon ABCDEF are made of mirrors. A laser is fired from A toward
the interior of edge CD, striking it at point G. The laser beam reflects off the interior of
exactly one additional edge and returns to A. Compute tan(∠DAG).

T-5 Let S be the set of lattice points {(x, y) : x, y ∈ Z, 0 ≤ x ≤ 3, 0 ≤ y ≤ 4}. Compute the
number of subsets of S of 4 lattice points that form the vertices of a square.
√
T-6 If A is an acute angle such that sin 15◦ + cos 15◦ = 2 sin A, compute cos A.

T-7 Consider the following algorithm for a given non-negative integer n:

Step 1: Initialize k = 1.
Step 2: Replace n with the product of its digits.
Step 3: If n ≤ 9 return k and exit. If n > 9, increment k by 1 and return to Step 2.

For example, if n = 125, then the algorithm returns 2 because 125 is replaced by 1×2×5 =
10 which is replaced by 1×0 = 0, at which point the algorithm returns 2 and exits. Compute
the smallest value of n such that this algorithm returns 3.

T-8 Three co-planar squares, BAHT , CAIN , and BCGY have areas 16, 16, and 32, respectively.
If the squares only intersect pairwise at the vertices A, B, and C, compute the area of the
convex hexagon T HIN GY .

T-9 Compute the coefficient of x8 in the expansion of (x2 + x + 1)8 after combining like terms.
T-10 Consider the following 3 × 3 grid with its center square removed, as shown.

Compute the number of distinct ways to fill in the grid with the integers 1 through 8,
each appearing exactly once, such that:
– In each of the three rows, the entries are increasing from left to right.
– In each of the three columns, the entries are increasing from top to bottom.

T-11 Kevin and Tarsha are playing a game with four fair standard six-sided dice. The four dice
are rolled and if the numbers appearing on top of the four dice are all different, Kevin pays
Tarsha $1. If not, Tarsha pays Kevin $k dollars. Compute the value of k such that the game
is fair, in other words, the expected value of each play of the game to both players is zero.

T-12 Compute the minimum value of ab such that log2 (a4 b−3 ) = 3 and log2 (a4 b3 ) = 9.

T-13 Compute
10
X 20
n=3
(n − 2)(n + 2)
.

T-14 The six-digit number 142857 has the property that moving the rightmost digit to the left of
the number results in multiplying the number by five (142857 × 5 = 714285). Compute the
smallest six-digit number with the property that moving the rightmost digit to the left of
the number results in multiplying the number by four.

T-15 Compute the number of distinct sequences (x1 , x2 , . . . , x14 ) with the following properties:
– xk ∈ {1, 2, . . . , 14} for each k = 1, 2, . . . , 14.
– The number 20x2k+1 − 17x2k is divisible by 14 for each k = 1, 2, . . . , 13.
 2017 ARML Local Team Round
(45 minutes)

T-1 A fair six-sided die has faces with values 0, 0, 1, 3, 6, and 10. Compute the smallest positive
integer that cannot be the sum of four rolls of this die.

T-2 For a positive integer k, let zk be the number of terminal zeroes of the product 1!2! · · · k!.
For example, z6 = 2 because 1!2!3!4!5!6! = 24883200. Compute z100 .

T-3 Let ARM L be a square of side length 5. A point B on side M R and C on side M L are
selected uniformly at random and independent of one another. Compute the expected area
of triangle ABC.

T-4 The edges of regular hexagon ABCDEF are made of mirrors. A laser is fired from A toward
the interior of edge CD, striking it at point G. The laser beam reflects off the interior of
exactly one additional edge and returns to A. Compute tan(∠DAG).

T-5 Let S be the set of lattice points {(x, y) : x, y ∈ Z, 0 ≤ x ≤ 3, 0 ≤ y ≤ 4}. Compute the
number of subsets of S of 4 lattice points that form the vertices of a square.
√
T-6 If A is an acute angle such that sin 15◦ + cos 15◦ = 2 sin A, compute cos A.

T-7 Consider the following algorithm for a given non-negative integer n:

Step 1: Initialize k = 1.
Step 2: Replace n with the product of its digits.
Step 3: If n ≤ 9 return k and exit. If n > 9, increment k by 1 and return to Step 2.

For example, if n = 125, then the algorithm returns 2 because 125 is replaced by 1×2×5 =
10 which is replaced by 1×0 = 0, at which point the algorithm returns 2 and exits. Compute
the smallest value of n such that this algorithm returns 3.

T-8 Three co-planar squares, BAHT , CAIN , and BCGY have areas 16, 16, and 32, respectively.
If the squares only intersect pairwise at the vertices A, B, and C, compute the area of the
convex hexagon T HIN GY .

T-9 Compute the coefficient of x8 in the expansion of (x2 + x + 1)8 after combining like terms.
T-10 Consider the following 3 × 3 grid with its center square removed, as shown.

Compute the number of distinct ways to fill in the grid with the integers 1 through 8,
each appearing exactly once, such that:
– In each of the three rows, the entries are increasing from left to right.
– In each of the three columns, the entries are increasing from top to bottom.

T-11 Kevin and Tarsha are playing a game with four fair standard six-sided dice. The four dice
are rolled and if the numbers appearing on top of the four dice are all different, Kevin pays
Tarsha $1. If not, Tarsha pays Kevin $k dollars. Compute the value of k such that the game
is fair, in other words, the expected value of each play of the game to both players is zero.

T-12 Compute the minimum value of ab such that log2 (a4 b−3 ) = 3 and log2 (a4 b3 ) = 9.

T-13 Compute
10
X 20
n=3
(n − 2)(n + 2)
.

T-14 The six-digit number 142857 has the property that moving the rightmost digit to the left of
the number results in multiplying the number by five (142857 × 5 = 714285). Compute the
smallest six-digit number with the property that moving the rightmost digit to the left of
the number results in multiplying the number by four.

T-15 Compute the number of distinct sequences (x1 , x2 , . . . , x14 ) with the following properties:
– xk ∈ {1, 2, . . . , 14} for each k = 1, 2, . . . , 14.
– The number 20x2k+1 − 17x2k is divisible by 14 for each k = 1, 2, . . . , 13.
 2017 ARML Local Team Round
(45 minutes)

T-1 A fair six-sided die has faces with values 0, 0, 1, 3, 6, and 10. Compute the smallest positive
integer that cannot be the sum of four rolls of this die.

T-2 For a positive integer k, let zk be the number of terminal zeroes of the product 1!2! · · · k!.
For example, z6 = 2 because 1!2!3!4!5!6! = 24883200. Compute z100 .

T-3 Let ARM L be a square of side length 5. A point B on side M R and C on side M L are
selected uniformly at random and independent of one another. Compute the expected area
of triangle ABC.

T-4 The edges of regular hexagon ABCDEF are made of mirrors. A laser is fired from A toward
the interior of edge CD, striking it at point G. The laser beam reflects off the interior of
exactly one additional edge and returns to A. Compute tan(∠DAG).

T-5 Let S be the set of lattice points {(x, y) : x, y ∈ Z, 0 ≤ x ≤ 3, 0 ≤ y ≤ 4}. Compute the
number of subsets of S of 4 lattice points that form the vertices of a square.
√
T-6 If A is an acute angle such that sin 15◦ + cos 15◦ = 2 sin A, compute cos A.

T-7 Consider the following algorithm for a given non-negative integer n:

Step 1: Initialize k = 1.
Step 2: Replace n with the product of its digits.
Step 3: If n ≤ 9 return k and exit. If n > 9, increment k by 1 and return to Step 2.

For example, if n = 125, then the algorithm returns 2 because 125 is replaced by 1×2×5 =
10 which is replaced by 1×0 = 0, at which point the algorithm returns 2 and exits. Compute
the smallest value of n such that this algorithm returns 3.

T-8 Three co-planar squares, BAHT , CAIN , and BCGY have areas 16, 16, and 32, respectively.
If the squares only intersect pairwise at the vertices A, B, and C, compute the area of the
convex hexagon T HIN GY .

T-9 Compute the coefficient of x8 in the expansion of (x2 + x + 1)8 after combining like terms.
T-10 Consider the following 3 × 3 grid with its center square removed, as shown.

Compute the number of distinct ways to fill in the grid with the integers 1 through 8,
each appearing exactly once, such that:
– In each of the three rows, the entries are increasing from left to right.
– In each of the three columns, the entries are increasing from top to bottom.

T-11 Kevin and Tarsha are playing a game with four fair standard six-sided dice. The four dice
are rolled and if the numbers appearing on top of the four dice are all different, Kevin pays
Tarsha $1. If not, Tarsha pays Kevin $k dollars. Compute the value of k such that the game
is fair, in other words, the expected value of each play of the game to both players is zero.

T-12 Compute the minimum value of ab such that log2 (a4 b−3 ) = 3 and log2 (a4 b3 ) = 9.

T-13 Compute
10
X 20
n=3
(n − 2)(n + 2)
.

T-14 The six-digit number 142857 has the property that moving the rightmost digit to the left of
the number results in multiplying the number by five (142857 × 5 = 714285). Compute the
smallest six-digit number with the property that moving the rightmost digit to the left of
the number results in multiplying the number by four.

T-15 Compute the number of distinct sequences (x1 , x2 , . . . , x14 ) with the following properties:
– xk ∈ {1, 2, . . . , 14} for each k = 1, 2, . . . , 14.
– The number 20x2k+1 − 17x2k is divisible by 14 for each k = 1, 2, . . . , 13.
 Individual Round (10 minutes per pair)
I-1 A positive integer m is stable if m = 2n − n2 for some positive integer n. Compute the
number of stable positive integers less than 2017.

I-2 Compute the area of the quadrilateral with vertices at (1, 1), (4, 7), (5, 3), and (2, 0).

I-3 The sum of the squares of five consecutive positive integers, the largest integer being n,
is equal to the sum of the squares of the next four consecutive integers. Compute n.

I-4 The polynomial P (x) = x3 + ax2 + bx + c has the property that the sum of its coefficients
is equal to the sum of its roots and is also equal to the product of its roots. If P (0) = 4,
compute b.

I-5 ABCDEF G is a pyramid with a hexagonal base. Compute the number of distinct ways
all seven vertices of ABCDEF G can be colored one of either red, blue, or green such
that no vertices that share an edge are identically colored.

3 5
I-6 In triangle ABC, if sin A = 5
and sin B = 13
, compute the smallest possible value of
cos C.

I-7 Compute log2 (3136) − log2 (1764) + log2 (900) − log2 (400) + log2 (144) − log2 (36).

I-8 The roots of 10x2 − 14x + k are sin α and cos α for some real value of α. Compute k.

I-9 Compute the rightmost non-zero digit in the base-8 expansion of 17!.

I-10 Let S be a set of 100 points inside a square of side length 1. An ordered
√
pair of not
3
necessarily distinct points (P, Q) is bad if P ∈ S, Q ∈ S and |P Q| < 2 . Compute the
minimum possible number of bad ordered pairs in S.
 2017 ARML Local Individual Questions 1 and 2
(10 minutes)

Name:

Team:

Answer to I-1: Answer to I-2:

I-1. A positive integer m is stable if m = 2n − n2 for some positive integer n. Compute

the number of stable positive integers less than 2017.

I-2. Compute the area of the quadrilateral with vertices at (1, 1), (4, 7), (5, 3), and (2, 0).
 2017 ARML Local Individual Questions 1 and 2
(10 minutes)

Name:

Team:

Answer to I-1: Answer to I-2:

I-1. A positive integer m is stable if m = 2n − n2 for some positive integer n. Compute

the number of stable positive integers less than 2017.

I-2. Compute the area of the quadrilateral with vertices at (1, 1), (4, 7), (5, 3), and (2, 0).
 2017 ARML Local Individual Questions 1 and 2
(10 minutes)

Name:

Team:

Answer to I-1: Answer to I-2:

I-1. A positive integer m is stable if m = 2n − n2 for some positive integer n. Compute

the number of stable positive integers less than 2017.

I-2. Compute the area of the quadrilateral with vertices at (1, 1), (4, 7), (5, 3), and (2, 0).
 2017 ARML Local Individual Questions 1 and 2
(10 minutes)

Name:

Team:

Answer to I-1: Answer to I-2:

I-1. A positive integer m is stable if m = 2n − n2 for some positive integer n. Compute

the number of stable positive integers less than 2017.

I-2. Compute the area of the quadrilateral with vertices at (1, 1), (4, 7), (5, 3), and (2, 0).
 2017 ARML Local Individual Questions 1 and 2
(10 minutes)

Name:

Team:

Answer to I-1: Answer to I-2:

I-1. A positive integer m is stable if m = 2n − n2 for some positive integer n. Compute

the number of stable positive integers less than 2017.

I-2. Compute the area of the quadrilateral with vertices at (1, 1), (4, 7), (5, 3), and (2, 0).
 2017 ARML Local Individual Questions 1 and 2
(10 minutes)

Name:

Team:

Answer to I-1: Answer to I-2:

I-1. A positive integer m is stable if m = 2n − n2 for some positive integer n. Compute

the number of stable positive integers less than 2017.

I-2. Compute the area of the quadrilateral with vertices at (1, 1), (4, 7), (5, 3), and (2, 0).
 2017 ARML Local Individual Questions 3 and 4
(10 minutes)

Name:

Team:

Answer to I-3: Answer to I-4:

I-3. The sum of the squares of five consecutive positive integers, the largest integer
being n, is equal to the sum of the squares of the next four consecutive integers.
Compute n.

I-4. The polynomial P (x) = x3 + ax2 + bx + c has the property that the sum of its
coefficients is equal to the sum of its roots and is also equal to the product of its
roots. If P (0) = 4, compute b.
 2017 ARML Local Individual Questions 3 and 4
(10 minutes)

Name:

Team:

Answer to I-3: Answer to I-4:

I-3. The sum of the squares of five consecutive positive integers, the largest integer
being n, is equal to the sum of the squares of the next four consecutive integers.
Compute n.

I-4. The polynomial P (x) = x3 + ax2 + bx + c has the property that the sum of its
coefficients is equal to the sum of its roots and is also equal to the product of its
roots. If P (0) = 4, compute b.
 2017 ARML Local Individual Questions 3 and 4
(10 minutes)

Name:

Team:

Answer to I-3: Answer to I-4:

I-3. The sum of the squares of five consecutive positive integers, the largest integer
being n, is equal to the sum of the squares of the next four consecutive integers.
Compute n.

I-4. The polynomial P (x) = x3 + ax2 + bx + c has the property that the sum of its
coefficients is equal to the sum of its roots and is also equal to the product of its
roots. If P (0) = 4, compute b.
 2017 ARML Local Individual Questions 3 and 4
(10 minutes)

Name:

Team:

Answer to I-3: Answer to I-4:

I-3. The sum of the squares of five consecutive positive integers, the largest integer
being n, is equal to the sum of the squares of the next four consecutive integers.
Compute n.

I-4. The polynomial P (x) = x3 + ax2 + bx + c has the property that the sum of its
coefficients is equal to the sum of its roots and is also equal to the product of its
roots. If P (0) = 4, compute b.
 2017 ARML Local Individual Questions 3 and 4
(10 minutes)

Name:

Team:

Answer to I-3: Answer to I-4:

I-3. The sum of the squares of five consecutive positive integers, the largest integer
being n, is equal to the sum of the squares of the next four consecutive integers.
Compute n.

I-4. The polynomial P (x) = x3 + ax2 + bx + c has the property that the sum of its
coefficients is equal to the sum of its roots and is also equal to the product of its
roots. If P (0) = 4, compute b.
 2017 ARML Local Individual Questions 3 and 4
(10 minutes)

Name:

Team:

Answer to I-3: Answer to I-4:

I-3. The sum of the squares of five consecutive positive integers, the largest integer
being n, is equal to the sum of the squares of the next four consecutive integers.
Compute n.

I-4. The polynomial P (x) = x3 + ax2 + bx + c has the property that the sum of its
coefficients is equal to the sum of its roots and is also equal to the product of its
roots. If P (0) = 4, compute b.
 2017 ARML Local Individual Questions 5 and 6
(10 minutes)

Name:

Team:

Answer to I-5: Answer to I-6:

I-5. ABCDEF G is a pyramid with a hexagonal base. Compute the number of distinct
ways all seven vertices of ABCDEF G can be colored one of either red, blue, or
green such that no vertices that share an edge are identically colored.

3 5
I-6. In triangle ABC, if sin A = 5
and sin B = 13
, compute the smallest possible value
of cos C.
 2017 ARML Local Individual Questions 5 and 6
(10 minutes)

Name:

Team:

Answer to I-5: Answer to I-6:

I-5. ABCDEF G is a pyramid with a hexagonal base. Compute the number of distinct
ways all seven vertices of ABCDEF G can be colored one of either red, blue, or
green such that no vertices that share an edge are identically colored.

3 5
I-6. In triangle ABC, if sin A = 5
and sin B = 13
, compute the smallest possible value
of cos C.
 2017 ARML Local Individual Questions 5 and 6
(10 minutes)

Name:

Team:

Answer to I-5: Answer to I-6:

I-5. ABCDEF G is a pyramid with a hexagonal base. Compute the number of distinct
ways all seven vertices of ABCDEF G can be colored one of either red, blue, or
green such that no vertices that share an edge are identically colored.

3 5
I-6. In triangle ABC, if sin A = 5
and sin B = 13
, compute the smallest possible value
of cos C.
 2017 ARML Local Individual Questions 5 and 6
(10 minutes)

Name:

Team:

Answer to I-5: Answer to I-6:

I-5. ABCDEF G is a pyramid with a hexagonal base. Compute the number of distinct
ways all seven vertices of ABCDEF G can be colored one of either red, blue, or
green such that no vertices that share an edge are identically colored.

3 5
I-6. In triangle ABC, if sin A = 5
and sin B = 13
, compute the smallest possible value
of cos C.
 2017 ARML Local Individual Questions 5 and 6
(10 minutes)

Name:

Team:

Answer to I-5: Answer to I-6:

I-5. ABCDEF G is a pyramid with a hexagonal base. Compute the number of distinct
ways all seven vertices of ABCDEF G can be colored one of either red, blue, or
green such that no vertices that share an edge are identically colored.

3 5
I-6. In triangle ABC, if sin A = 5
and sin B = 13
, compute the smallest possible value
of cos C.
 2017 ARML Local Individual Questions 5 and 6
(10 minutes)

Name:

Team:

Answer to I-5: Answer to I-6:

I-5. ABCDEF G is a pyramid with a hexagonal base. Compute the number of distinct
ways all seven vertices of ABCDEF G can be colored one of either red, blue, or
green such that no vertices that share an edge are identically colored.

3 5
I-6. In triangle ABC, if sin A = 5
and sin B = 13
, compute the smallest possible value
of cos C.
 2017 ARML Local Individual Questions 7 and 8
(10 minutes)

Name:

Team:

Answer to I-7: Answer to I-8:

I-7. Compute log2 (3136) − log2 (1764) + log2 (900) − log2 (400) + log2 (144) − log2 (36).

I-8. The roots of 10x2 − 14x + k are sin α and cos α for some real value of α. Compute
k.
 2017 ARML Local Individual Questions 7 and 8
(10 minutes)

Name:

Team:

Answer to I-7: Answer to I-8:

I-7. Compute log2 (3136) − log2 (1764) + log2 (900) − log2 (400) + log2 (144) − log2 (36).

I-8. The roots of 10x2 − 14x + k are sin α and cos α for some real value of α. Compute
k.
 2017 ARML Local Individual Questions 7 and 8
(10 minutes)

Name:

Team:

Answer to I-7: Answer to I-8:

I-7. Compute log2 (3136) − log2 (1764) + log2 (900) − log2 (400) + log2 (144) − log2 (36).

I-8. The roots of 10x2 − 14x + k are sin α and cos α for some real value of α. Compute
k.
 2017 ARML Local Individual Questions 7 and 8
(10 minutes)

Name:

Team:

Answer to I-7: Answer to I-8:

I-7. Compute log2 (3136) − log2 (1764) + log2 (900) − log2 (400) + log2 (144) − log2 (36).

I-8. The roots of 10x2 − 14x + k are sin α and cos α for some real value of α. Compute
k.
 2017 ARML Local Individual Questions 7 and 8
(10 minutes)

Name:

Team:

Answer to I-7: Answer to I-8:

I-7. Compute log2 (3136) − log2 (1764) + log2 (900) − log2 (400) + log2 (144) − log2 (36).

I-8. The roots of 10x2 − 14x + k are sin α and cos α for some real value of α. Compute
k.
 2017 ARML Local Individual Questions 7 and 8
(10 minutes)

Name:

Team:

Answer to I-7: Answer to I-8:

I-7. Compute log2 (3136) − log2 (1764) + log2 (900) − log2 (400) + log2 (144) − log2 (36).

I-8. The roots of 10x2 − 14x + k are sin α and cos α for some real value of α. Compute
k.
 2017 ARML Local Individual Questions 9 and 10
(10 minutes)

Name:

Team:

Answer to I-9: Answer to I-10:

I-9. Compute the rightmost non-zero digit in the base-8 expansion of 17!.

I-10. Let S be a set of 100 points inside a square of side length 1. An ordered
√
pair of not
3
necessarily distinct points (P, Q) is bad if P ∈ S, Q ∈ S and |P Q| < 2 . Compute
the minimum possible number of bad ordered pairs in S.fa
 2017 ARML Local Individual Questions 9 and 10
(10 minutes)

Name:

Team:

Answer to I-9: Answer to I-10:

I-9. Compute the rightmost non-zero digit in the base-8 expansion of 17!.

I-10. Let S be a set of 100 points inside a square of side length 1. An ordered
√
pair of not
3
necessarily distinct points (P, Q) is bad if P ∈ S, Q ∈ S and |P Q| < 2 . Compute
the minimum possible number of bad ordered pairs in S.fa
 2017 ARML Local Individual Questions 9 and 10
(10 minutes)

Name:

Team:

Answer to I-9: Answer to I-10:

I-9. Compute the rightmost non-zero digit in the base-8 expansion of 17!.

I-10. Let S be a set of 100 points inside a square of side length 1. An ordered
√
pair of not
3
necessarily distinct points (P, Q) is bad if P ∈ S, Q ∈ S and |P Q| < 2 . Compute
the minimum possible number of bad ordered pairs in S.fa
 2017 ARML Local Individual Questions 9 and 10
(10 minutes)

Name:

Team:

Answer to I-9: Answer to I-10:

I-9. Compute the rightmost non-zero digit in the base-8 expansion of 17!.

I-10. Let S be a set of 100 points inside a square of side length 1. An ordered
√
pair of not
3
necessarily distinct points (P, Q) is bad if P ∈ S, Q ∈ S and |P Q| < 2 . Compute
the minimum possible number of bad ordered pairs in S.fa
 2017 ARML Local Individual Questions 9 and 10
(10 minutes)

Name:

Team:

Answer to I-9: Answer to I-10:

I-9. Compute the rightmost non-zero digit in the base-8 expansion of 17!.

I-10. Let S be a set of 100 points inside a square of side length 1. An ordered
√
pair of not
3
necessarily distinct points (P, Q) is bad if P ∈ S, Q ∈ S and |P Q| < 2 . Compute
the minimum possible number of bad ordered pairs in S.fa
 2017 ARML Local Individual Questions 9 and 10
(10 minutes)

Name:

Team:

Answer to I-9: Answer to I-10:

I-9. Compute the rightmost non-zero digit in the base-8 expansion of 17!.

I-10. Let S be a set of 100 points inside a square of side length 1. An ordered
√
pair of not
3
necessarily distinct points (P, Q) is bad if P ∈ S, Q ∈ S and |P Q| < 2 . Compute
the minimum possible number of bad ordered pairs in S.fa
 2017 ARML Local Relay 1
(6 minutes)

R1-1 If x and y are integers such that x < y and x!y! = 10!, compute
x.

1
 2017 ARML Local Relay 1
(6 minutes)

R1-2 Let T = TNYWR. HAIRN ET S is an equilateral concave oc-

tagon of side length T . The interior angle measurements of H, I,
N , and T are 60 degrees, and the interior angle measurements of A,
R, E, and S are 210 degrees. Compute the area of HAIRN ET S.
 2017 ARML Local Relay 1
(6 minutes)

R1-1 If x and y are integers such that x < y and x!y! = 10!, compute
x.
 2017 ARML Local Relay 1
(6 minutes)

R1-2 Let T = TNYWR. HAIRN ET S is an equilateral concave oc-

tagon of side length T . The interior angle measurements of H, I,
N , and T are 60 degrees, and the interior angle measurements of A,
R, E, and S are 210 degrees. Compute the area of HAIRN ET S.
 2017 ARML Local Relay 1
(6 minutes)

R1-1 If x and y are integers such that x < y and x!y! = 10!, compute
x.
 2017 ARML Local Relay 1
(6 minutes)

R1-2 Let T = TNYWR. HAIRN ET S is an equilateral concave oc-

tagon of side length T . The interior angle measurements of H, I,
N , and T are 60 degrees, and the interior angle measurements of A,
R, E, and S are 210 degrees. Compute the area of HAIRN ET S.
 2017 ARML Local Relay 2
(8 minutes)

√ √
R2-1 The side lengths of a triangle are 20, 17, and x. Compute the
maximum possible integer value of x.
 2017 ARML Local Relay 2
(8 minutes)

R2-2 Let T = TNYWR. The set S has T subsets containing an even

number of elements. Compute the total number of elements in S.
 2017 ARML Local Relay 2
(8 minutes)

R2-3 Let T = TNYWR. Let S consist of the set of non-negative integers

less than T 3. Compute the (base-10) sum of the digits of all of the
elements of S written in base T .
 2017 ARML Local Relay 2
(8 minutes)

√ √
R2-1 The side lengths of a triangle are 20, 17, and x. Compute the
maximum possible integer value of x.
 2017 ARML Local Relay 2
(8 minutes)

R2-2 Let T = TNYWR. The set S has T subsets containing an even

number of elements. Compute the total number of elements in S.
 2017 ARML Local Relay 2
(8 minutes)

R2-3 Let T = TNYWR. Let S consist of the set of non-negative integers

less than T 3. Compute the (base-10) sum of the digits of all of the
elements of S written in base T .
 2017 ARML Local Relay 3
(10 minutes)

R3-1 Compute the number of ways to erase two of the decimal digits of
9876543210 and obtain an eight-digit number that is divisible by
9.
 2017 ARML Local Relay 3
(10 minutes)

R3-2 Let T = TNYWR. ABC is an isoceles right triangle. If the

longest median has length T , compute the area of ABC.
 2017 ARML Local Relay 3
(10 minutes)

R3-3 Let T = TNYWR. The polynomial x3 + 3x2 + px + T is evenly

divisible by x + 2. Compute p.
 2017 ARML Local Relay 3
(10 minutes)

R3-4 Let T = TNYWR. If p and q are the roots of x2 + x + 3, then

x2 + bx + c has roots p + T and q + T . Compute c.
 2017 ARML Local Relay 3
(10 minutes)

R3-5 Let T = TNYWR. Phil has a stack of money consisting of 5-dollar

and 20-dollar bills worth 780 dollars in total. If there are T bills
in total, compute the number of 5 dollar bills.
 2017 ARML Local Relay 3
(10 minutes)

R3-6 Let T = TNYWR. Compute the remainder when the eight-digit

number T 2 3 4 2 3 4 T is divided by 13.
 2017 ARML Local Competition

Relay Round Answer Sheets

Team Name: Team Name:

Relay 1, Team 1 Answer (3 minutes, 2 points) Relay 1, Team 1 Answer (6 minutes, 1 point)

Team Name: Team Name:

Relay 1, Team 2 Answer (3 minutes, 2 points) Relay 1, Team 2 Answer (6 minutes, 1 point)

Team Name: Team Name:

Relay 1, Team 3 Answer (3 minutes, 2 points) Relay 1, Team 3 Answer (6 minutes, 1 point)

Team Name: Team Name:

Relay 2, Team 1 Answer (4 minutes, 4 points) Relay 2, Team 1 Answer (8 minutes, 2 points)

Team Name: Team Name:

Relay 2, Team 2 Answer (4 minutes, 4 points) Relay 2, Team 2 Answer (8 minutes, 2 points)

Team Name: Team Name:

Relay 3, Team Answer (5 minutes, 6 points) Relay 3, Team Answer (10 minutes, 3 points)
Name:

Team:

Time to submit answer (seconds):

Answer to Tiebreaker:

2017 ARML Local Tiebreaker

(10 minutes)

Tiebreaker: ABCD is an isosceles trapezoid with AD k BC and

AD < BC. E lies on ← BC
→ such←−→ AE ⊥ BC and let M be the
that
midpoint of BC. Lines DE and AM meet at G. Given that triangle
GEM has area 20 and AB = AM = 17, compute the area of triangle
ABC.

1
Name:

Team:

Time to submit answer (seconds):

Answer to Tiebreaker:

2017 ARML Local Tiebreaker

(10 minutes)

Tiebreaker: ABCD is an isosceles trapezoid with AD k BC and

AD < BC. E lies on ← BC
→ such←−→ AE ⊥ BC and let M be the
that
midpoint of BC. Lines DE and AM meet at G. Given that triangle
GEM has area 20 and AB = AM = 17, compute the area of triangle
ABC.

1
Name:

Team:

Time to submit answer (seconds):

Answer to Tiebreaker:

2017 ARML Local Tiebreaker

(10 minutes)

Tiebreaker: ABCD is an isosceles trapezoid with AD k BC and

AD < BC. E lies on ← BC
→ such←−→ AE ⊥ BC and let M be the
that
midpoint of BC. Lines DE and AM meet at G. Given that triangle
GEM has area 20 and AB = AM = 17, compute the area of triangle
ABC.

1
Name:

Team:

Time to submit answer (seconds):

Answer to Tiebreaker:

2017 ARML Local Tiebreaker

(10 minutes)

Tiebreaker: ABCD is an isosceles trapezoid with AD k BC and

AD < BC. E lies on ← BC
→ such←−→ AE ⊥ BC and let M be the
that
midpoint of BC. Lines DE and AM meet at G. Given that triangle
GEM has area 20 and AB = AM = 17, compute the area of triangle
ABC.

1
Name:

Team:

Time to submit answer (seconds):

Answer to Tiebreaker:

2017 ARML Local Tiebreaker

(10 minutes)

Tiebreaker: ABCD is an isosceles trapezoid with AD k BC and

AD < BC. E lies on ← BC
→ such←−→ AE ⊥ BC and let M be the
that
midpoint of BC. Lines DE and AM meet at G. Given that triangle
GEM has area 20 and AB = AM = 17, compute the area of triangle
ABC.

APASS
20
APASS
http://www.asdanchina.com.cn/a-pass/

1
 2017 ARML Local Competition

Question Writers:
Paul Dreyer
Evan Chen

Question Editors:
Oleg Kryzhanovsky
Andy Niedermaier

If there are any questions about the contest, please contact the
ARML Local Head Coordinator ASAP.

Contact Information
Paul Dreyer, ARML Local Head Coordinator

E-mail: [email protected]
Cell: 310-383-3499

Mailing Address:
ARML Local
c/o Paul Dreyer
809 Harvard Street
Santa Monica, CA 90403