2016 ARML Local Problems and Solutions

Team Round Solutions

T-1 All the shelves in a library are the same length. When filled, two shelves side-by-side
can hold exactly 12 algebra books and 10 geometry books. All algebra books have
the same width, as do all the geometry books, but algebra and geometry books have
different widths. Three shelves side-by-side can hold exactly 15 algebra books and
21 geometry books. Compute the maximum number of geometry books that can fit
on one shelf.

T-1 Solution Let a be the width of an algebra book, g be the width of a geometry book, and s
be the width of a shelf. Then 12a + 10g = 2s, 15a + 21g = 3s → 6a + 5g = s =
5a + 7g → a = 2g, so s = 17g, and 17 geometry books can fit on one shelf.

T-2 In the equation A B C + D E F = G H I, each letter denotes a distinct non-zero

digit. Compute the greatest possible value of G H I.

T-2 Solution Note that G H I must be a multiple of nine. The sum of the digits on the left-hand
and right-hand side of the equation must be equivalent modulo nine, and since the
non-zero digits sum to a multiple of nine, both sides’ digits must be equivalent to
zero modulo nine. The largest multiple of nine with three distinct non-zero digits is
981 , and there are several sums that work, including 746 + 235 = 981.

logb a b
T-3 If logc a
= 2016, then c
= ck . Compute k.

logb a ( log a
log b ) log c 1
T-3 Solution Note that 2016 = = = = logb c. So b2016 = c → b = c 2016 . Therefore,
logc a ( log a
log c )
log b

b
1
c 2016 −2015 2015
c
= c
=c 2016 , so the answer is k = − .
2016

π 2π
T-4 Compute cos 100 + cos 100 + · · · + cos 98π
100
+ cos 99π
100
+ cos 100π
100
.

T-4 Solution Because cos(π − x) = − cos(x) for all x, removing the last term from the sum, the
leftmost and rightmost terms in the sum that remains sum to zero. Repeating this
48 more times leaves cos 50π
100
, which equals 0, so the original sum equals cos 100π
100
=
cos(π) = −1 .

T-5 Compute the smallest positive

√ integer k such that n2 − k is not a prime number for
any positive integer n ≥ k.

T-5 Solution The answer is k = 16 . Indeed the number n2 − 16 = (n − 4)(n + 4) is always a

product of two distinct integers, and when n − 4 = 1, n = 5 and the number 52 − 16
is not prime.
It remains to rule out all positive integers k < 16 as candidates.

1
 – By taking n = 2, we rule out k = 1, 2.
– By taking n = 3, we rule out k = 4, 6, 7.
– By taking n = 4, we rule out k = 3, 5, 9, 11, 13, 14.
– By taking n = 5, we rule out k = 8, 12.
– By taking n = 9, we rule out k = 10.
– By taking n = 14, we rule out k = 15.

T-6 A magic square is an n × n grid of numbers where the numbers in each row and
column add up to the same sum. Some of the values in the 5 × 5 magic square below
have been erased. Compute x.
1 8
21 12 23
25 17
7 22 2
20 x

T-6 Solution Consider the erased values in the second and fourth row and column.
1 8
21 A 12 B 23
25 17
7 C 22 D 2
20 x
We know that the sum of the values in the second and fourth row is equal to the
sum of the values in the second and fourth column. Therefore 21 + A + 12 + B +
23 + 7 + C + 22 + D + 2 = 1 + A + 25 + C + 20 + 8 + B + 17 + D + x. As the terms
A, B, C, and D cancel, we are left with 87 = 71 + x → x = 16 .
√
T-7 Triangle ABC is inscribed in circle ω. It is given that BA = BC = 8 and AC = 8 2.
The tangent to ω at B intersects the tangents to ω at A and C at points X and Y ,
respectively. Compute the area of quadrilateral AXY C.

T-7 Solution By the converse of the Pythagorean Theorem, ∠ABC is a right angle. Hence AC is
a diameter. Let O be the center of ω. Then 4AOB ∼= 4COB and thus ∠COB is
a right angle. Hence AX k OB k CY because angles OAX and OCY are also right
angles. Thus quadrilateral AXY C is a rectangle.
X B Y

A C
 Hence the area of AXY C is twice that of the area of ABC, which is 2 · 32 = 64 .

T-8 In triangle LM N , it is given that m∠LM N = 90◦ , LM = 5, and M N = √12. Point

P lies on the hypotenuse LN such that m∠P M N = 30◦ . If P N = a−bc 3 , where
a, b, and c are positive integers with no common factor greater than one, compute
a + b + c.

T-8 Solution Let Q be the foot of the perpendicular from P to M N , and let QP √= x. Then
12
triangles LM N and P QN are similar
√
and M√
N = M Q + QN → 12 = x 3+√ 5
x→
60(12−5 3) 20(12−5 3) 52(12−5 3)
x = √ 12 12 = 60√
= = . Since P N = 13
x = , it
3+ 5 12+5 3 144−75 23 5 23

follows that a + b + c = 52(12 + 5) + 23 = 907 .

T-9 Compute the sum of all positive integer values of x such that there exists a positive
integer y such that x1 + y1 = 10
1
.

T-9 Solution Multiply both sides of the equation by 10xy to get 10y +10x = xy or xy −10x−10y =
0. Add 100 to both sides to get (x−10)(y −10) = 100. Accordingly, for every positive
factor k of 100, x = 10 + k, y = 10 + 100 k
is a solution. There are 9 factors of 100,
1, 2, 4, 5, 10, 20, 25, 50, and 100, and their sum is (1+2+4)×(1+5+25) = 7×31 = 217.
The values of x are 10 more than each of these factors, so the sum of the xs is
217 + 9 × 10 = 307 .

T-10 Compute the number of zeroes that 2016! ends with when written in base 2016.

T-10 Solution Note that 2016 = 25 × 32 × 7, so it is necessary to count the powers of 2, 3, and 7 in
2016! to determine which factor limits the number of powers of 2016 in 2016!. There
are b 2016
21
c + b 2016
22
c + · · · + b 2016
210
c = 2010 powers of 2, so 402 powers of 25 . Similarly,
there are b 2016
31
c + b 2016
32
c + · · · + b 2016
36
c = 1004 powers of 3, so 502 powers of 32 . Also,
there are b 2016
71
c + b 2016
72
c + b 2016
73
c = 334 powers of 7, so 2016! will end with 334
zeroes.

T-11 Compute the number of 2 × 2 matrices M with the following properties:

– The entries of M are integers between 0 and 29 inclusive.
 – The determinant of M is divisible by 30.

T-11 Solution First, we count the number of matrices with entries in {0, . . . , p − 1} and with deter-
minant divisible by a prime p. This is the number of quadruples (a, b, c, d) such that
ad ≡ bc (mod p). To count the number of such quadruples we use casework on the
common value x = ad (mod p) = bc (mod p):
– If x 6≡ 0 (mod p), then there are exactly p − 1 pairs (a, d) and (b, c) such that
x ≡ ad ≡ bc (mod p), (let a be any non-zero value, let d = a−1 x), hence there
are (p − 1)2 cases for each x. Thus over all non-zero x, we have (p − 1)3 .
– If x ≡ 0 (mod p), then there are exactly 2p−1 pairs (a, d) and (b, c) (at least one
of the elements in each pair is zero) such that 0 ≡ ad (mod p), hence (2p − 1)2
cases here.
Hence the total number of matrices is (p − 1)3 + (2p − 1)2 .
Now, by the Chinese Remainder Theorem, it suffices to compute the above value
for p = 2, p = 3 and p = 5 and multiple the results. Thus the total number of
matrices satisfying the conditions of the problem is (13 + 32 ) (23 + 52 ) (43 + 92 ) =
10 · 33 · 145 = 47850 .

T-12 Let S denote the set of all 44 functions from the set {1, 2, 3, 4} to itself. Three
functions f, g, h ∈ S are chosen randomly with replacement, with all functions having
an equal probability of being chosen. Compute the probability that the following
property holds: for every y ∈ {1, 2, 3, 4}, there exists an x ∈ {1, 2, 3, 4} such that
f (g(h(x))) = y.

T-12 Solution The condition in the problem is that the composition f ◦ g ◦ h is surjective. For a
function from a finite set to itself, surjectivity implies injectivity, so the condition is
equivalent to f ◦ g ◦ h being a bijection. Note that the composition is a bijection
if and only if f , g, h are each themselves a bijection. The number of bijections of
{1, 2, 3, 4} onto itself is 4! = 24. The answer is
 3  3
24 3 27
= = .
44 32 32768

T-13 Let ABCDEF be a convex cyclic hexagon. Diagonals AC and BD meet at X while
diagonals AE and DF meet at Y . Suppose AF = AB = 3, BC = 4, DC = DE = 5,
and EF = 6. Compute the ratio of the areas of triangles CXF and CY F .

T-13 Solution Let diagonals BE and CF meet at P . Because AB = AF , minor arcs AB d and AF
d
∼ ∼
have the same length, hence ∠ACB = ∠ACF and ∠AEB = ∠AEF . Similarly,
because DC = DE, conclude that ∠DBC ∼ = ∠DBE and ∠DF C ∼ = ∠DF E. Thus
X and Y are the incenters of triangles BP C and F P E, respectively.
 A

F B

P X
Y

The ratio of the areas of CXF and CY F is equal to the ratio of the inradius of
triangle P BC to the inradius of triangle P F E. But these two triangles are similar,
with ratio BC/F E = 4/6 = 2/3 .

T-14 Initially, three vertices of an equilateral triangle are marked on a blackboard. Every
minute, Alice marks the circumcenter of the triangle whose vertices are the three
points on the blackboard, then randomly erases one of the four points on the board
(each with probability 41 ). After one hour has elapsed, the probability that the three
points on the blackboard form an equilateral triangle is x. Compute the nearest
integer to 100x.

T-14 Solution The main observation is that up to similarity, only two types of triangles can arise:
– an equilateral triangle, and
– a 30◦ -30◦ -120◦ triangle.
From the former case there is a 34 chance of transitioning to the latter case, and
from the latter case there is a 21 chance of transitioning to the equilateral triangle.
Therefore, if pn is the probability of having a equilateral triangle after n minutes, it
satisfies the recursion
1 1 1 1
p0 = 1 and pn = pn−1 + (1 − pn−1 ) = − pn−1 .
4 2 2 4
From here we can use induction to derive that
 n
2 3 1
pn = + − .
5 5 4
2
Taking n = 60, pn ≈ 5
so the closest integer to 100pn is 40 .

T-15 In the grid below, each of the letters A through P is equal to either 2, 3, 4, or 5.
Exactly four letters are equal to each of the four numbers. Some of the sums of
 numbers in the columns are given, as are some of the products of numbers in the
rows. Compute the 4-digit number A F K P .

A × B × C × D = 225
+ + +
E × F × G × H = 128
+ + +
I × J × K × L = 120
+ + +
M N O P
= = =
10 12 15

T-15 Solution The sum of all of the numbers in the grid is 56, so D + H + L + P = 19, meaning
that last column consists of the numbers 4, 5, 5, and 5 in some order. Similarly,
the product of all of the numbers in the grid is 1204 , so M N OP = 60, meaning the
bottom row consists of the numbers 2, 2, 3, and 5 in some order. The first column
must consist of the numbers 2, 2, 2, and 4 or 2, 2, 3, and 3 in some order to sum to 10,
but we can discount the former case as the product ABCD is odd so every column
must contain an odd number (in fact, we know the first row is the numbers 3, 3, 5,
and 5 in some order, so A = 3 and D = 5). The second row must be the numbers 2,
4, 4, and 4 in some order, so E = 2 and F = G = H = 4, so L = P = 5. The third
row must be the numbers 2, 3, 4, 5 in some order. Note that C + K + O = 11, and
the only sum that works is 5 + 4 + 2 (since all but one of the 4s are in the second
row, and all but one of the 3s are in the first row or column). Accordingly, C = 5
and K = 4, so A F K P = 3445 .
There are, in fact, two solutions to the puzzle, one of which is shown below, the
other is derived by swapping the 2s and 3s in the bottom left corner.

3 × 3 × 5 × 5 = 225
+ + +
2 × 4 × 4 × 4 = 128
+ + +
2 × 3 × 4 × 5 = 120
+ + +
3 2 2 5
= = =
10 12 15
 Individual Round Solutions
I-1 The degree measures of the interior angles of a pentagon are integral, non-equal,
and form an arithmetic progression. Compute the number of different values of the
smallest degree measure of an interior angle of the pentagon.

I-1 Solution Let the degree measures of the angles form an increasing arithmetic sequence with
first term a and common difference d; then a+(a+d)+(a+2d)+(a+3d)+(a+4d) =
540 → a + 2d = 108. Both a and d must be positive integers, and a must be even,
leading to 53 possible values of a (2, 4, . . . , 106).

I-2 Integers a and b are selected uniformly at random and with replacement from the set
{−4, −3, −2, −1, 0, 1, 2, 3, 4} . Compute the probability that a + b2 = a2 + b.

I-2 Solution The given equation can be rewritten as b2 − a2 = b − a, or (b − a)(a + b − 1) = 0. The

equation is satisfied if and only if a = b or a + b = 1. Of the 92 = 81 pairs (a, b), nine
of them satisfy the first equation and eight satisfy the second. The answer is 17/81 .

x
I-3 Given that f (x) = 2
+ 2, and f (2f (2f (2z − 1))) = 25 , compute z.

I-3 Solution Let g(x) denote the inverse of f (x). Therefore, g(x) = 2x − 4. So g(f (2f (2f (2z −
1)))) = g( 52 ) → 2f (2f (2z − 1)) = 1 → f (2f (2z − 1)) = 12 → 2f (2z − 1) = g( 21 ) =
−3 → 2z − 1 = g(− 32 ) = −7 → z = −3 .

I-4 In square ABCD with side length 1, G lies on CD, F lies on BC, and E lies on AB.
If m∠GEF = 30◦ , ∠GF E is right, and tan F EB = 23 , compute BF .

I-4 Solution Let x = BF and m∠F EB = θ. Then EF = sinx θ , GF = cos 1−x

θ
GF
, and EF = √13 , so
√
1−x
× sinx θ = √13 → x1 − 1 tan θ = √13 → x1 − 1 23 = √13 → x1 − 1 = 23 → x1 =




cos θ
√
2+ 3 2√
√
2
→ x = 2+ 3
= 4 − 2 3.
 b
I-5 If log6 48 = z, then log9 6 = cz+d for integers b, c, and d, where b > 0. Compute the
least possible value of the sum b + c + d.

I-5 Solution z = log6 48 = log6 8 + log6 6 = 3 log6 2 + 1 → log6 2 = z−1 3

. log9 6 = log1 9 = 2 log1 3 .
6 6
Since log6 2 + log6 3 = 1, 2 log1 3 = 2(1−log
1
2)
= 2(1−
1
z−1
)
= 3
8−2z
, and b + c + d =
6 6 3

3−2+8= 9.

I-6 Compute the remainder when 100! is divided by 103.

I-6 Solution By Wilson’s Theorem, as 103 is prime, 102! ≡ −1 (mod 103), so 101! ≡ 102! ×
(102)−1 ≡ −1 × −1 ≡ 1 (mod 103). Thus, 100! ≡ 101! × (101)−1 ≡ (101)−1 ≡
(−2)−1 ≡ (−1)(2)−1 ≡ (102)(2)−1 ≡ 51 (mod 103).

I-7 Point A is coplanar with circle O and lies outside circle O. Points C and E lie on
circle O such that AC and AE are tangent to circle O. Points B and F lie on AC and
AE, respectively, such that BF is tangent to circle O. Given that m∠CAE = 50◦ ,
compute the degree measure of ∠BOF .

I-7 Solution Let G be the point where BF is tangent to circle O. Let m∠GOF = x◦ and
m∠BOG = y ◦ , so m∠BOF = (x+y)◦ . m∠CBG+m∠GF E = 360◦ −130◦ = 230◦ , so
m∠CBG + m∠GF E + mCG d + mGEd = 360◦ → mCG d + mGEd = 130◦ = (2x + 2y)◦ →
m∠BOF = 65◦ .

8 8 8




I-8 For each positive integer 1 ≤ k ≤ 8, let bk = 0
+ 1
+···+ k
. Compute the value
( 8) (8) ( 8)
of b12b2 + b23b3 + · · · + b67b7 .

I-8 Solution Note that

8


k 1 1
= −
bk−1 bk bk−1 bk

1 1 1 1 82
and so the sum in question equals b1
− b7
= 1+8
− 28 −1
= .
765
 I-9 The integer Z = 104060001 is the product of three distinct prime numbers. Compute
the largest prime factor of Z.

I-9 Solution 104060001 = 104060401−400 = 1014 −202 = (1012 −20)(1012 +20) = 10181×10221.
The latter number is divisible by 3, so the largest prime factor must be 10181 .

I-10 Let ABCDEF be a hexagon inscribed in circle Γ such that

AB = DE = 4, BC = EF = 6, and CD = F A = 8.
Let M , N , L, and K denote the midpoints of AB, BC, CD, and EF , respectively.
Let P be a point in space not coplanar with Γ. If P M = 5, P N = 7, P L = 9,
compute P K.

I-10 Solution Recall that if XY Z is a triangle and M is the midpoint of Y Z then XY 2 + XZ 2 =

1
2
(Y Z 2 + (2XM )2 ). (This can be seen as, say, a consequence of the parallelogram
lemma, or by Stewart’s Theorem.) Let O be the center of Γ and 2R its diameter.
Note that AD, BE and CF are all diameters of Γ.
C

B N

L
M
P

A D
O

K E

Applying the above observation to triangles P AD, P BE, P CF gives

1
(2R)2 + (2P O)2 = P A2 + P D2 = P B 2 + P E 2 = P C 2 + P F 2 .


2
On the other hand
1
P A2 + P B 2 = (42 + 102 ) = 58
2
1
P B + P C = (62 + 142 ) = 116
2 2
2
1
P C 2 + P D2 = (82 + 182 ) = 194
2
From this we can compute P A2 + P B 2 + P C 2 + P D2 = 252 and hence P A2 + P D2 =
136. So P E 2 + P F 2 = 3 · 136 − 252 = 156. Hence
1 √
156 = (62 + (2P K)2 ) → (2P K)2 = 276 → P K = 69 .
2
 Relay Round Solutions
R1-1 Compute the number of ordered pairs of integers (x, y) which satisfy x2 +6x + y 2 = 4.

R1-1 Solution x2 + 6x + y 2 = 4 → x2 + 6x + 9 = 13 − y 2 → (x + 3)2 = 13 − y 2 . When y = ±2 or

±3, the right-hand side of the equation is a perfect square, so there are two values of
x that satisfy the equation for each value of y, hence there are 8 different ordered
pairs.

R1-2 Let T = T N Y W R. In triangle ABC, AB = 2T and BC = 3T . Let the angle

bisectors of triangle ABC meet at point O. If m∠AOB = 110◦ and m∠BOC = 130◦ ,
compute the area of triangle ABC.

R1-2 Solution Let m∠A = 2x◦ , m∠B = 2y ◦ , and m∠C = 2z ◦ . Then m∠AOC = 360◦ − 110◦ −
130◦ = 120◦ . Similarly, x + y + 110 = 180, x + z + 120 = 180, and y + z + 130 = 180.
This system has the solution x = 40, y = 30, and √z = 20. Therefore the area of
2
ABC = 12 × AB × BC × sin B = 3T 2 sin(60◦ ) = 3 23T . As T = 8, the answer is
√
96 3 .

R2-1 An eight-team soccer league is split into two divisions of four teams each. In a season,
each team plays two games against each team in its division and one game against
each team in the other division. Compute the total number of games played in the
league in a season.

R2-1 Solution A team plays six games against teams in its division and four games against teams
in the other division, for a total of 10 games per team. There are eight teams for a
total of 80 games, but each game is played by two teams, so there are a total of 40
games played in the league per season.

R2-2 Let T = T N Y W R. Compute the number of distinct prime factors of 1600 − T .

R2-2 Solution As T = 40, 1600 − 40 = 40(40 − 1). The prime factors of 40 are 2 and 5, and the
prime factors of 39 are 3 and 13, for a total of 4 distinct prime factors.

R2-3 Let T = T N Y W R. A fair standard six-sided die is rolled n times. Suppose the
probability of rolling exactly T − 1 perfect squares is equal to the probability of
rolling exactly T perfect squares. Compute the greatest possible value of the positive
integer n.

R2-3 Solution We have T = 4. Assume n ≥ 3 for convenience (noting n = 1 and n = 2 are trivial
solutions). This amounts to solving the equation
   3  n−3    4  n−4
n 1 2 n 1 2
= .
3 3 3 4 3 3
 n−3
Dividing out the common terms, we obtain that 2 = 4
, and solving gives n = 11 .

R3-1 Given that x + 2x + 3x + · · · + 300x = 3 + 6 + 9 + · · · + 300, compute x.

3+6+9+···+300 1+2+3+···+100
1
×100×101 101
R3-1 Solution Note that x = 1+2+3+···+300
=3· 1+2+3+···+300
=3· 2
1
×300×301
= .
2 301

R3-2 Let T = T N Y W R. A, R, M , and L are distinct non-zero digits such that A R ×

M L = L L L. There are two 4-tuples (A, R, M, L) that satisfy this equation. Pass
back the 4-digit number A R M L such that (M 0R) × T is an integer.

R3-2 Solution Note that L L L = 111L = (3 × 37)L. Therefore, either one of the factors A R and
M L is 37 and the other is 3L, or one of the factors is 74 and the other is 3L/2. We
can discard this second case, as the only even value of L that results in a two-digit
number is L = 8, and 74 × 12 = 888, but neither factor shares its units digit with
888. If M L is 37, then the other factor is 3L, so 21 × 37 = 777. If A R is 37, the
only value of L such that 37L has L as its units digit is 5, so 37 × 15 = 555. Since
101
T = 301 , the first case results in (M 0R) × T being an integer, so the answer is 2137 .

R3-3 Let T = T N Y W R. For each positive integer x, let P (x) be the product of the digits
of x and S(x) be the sum of the digits of x. Let B be the set of all positive integers
x such that P (x) = P (T ) and S(x) = S(T ). Compute the number of elements in B.

R3-3 Solution Consider the following two rules that apply to elements of B:
– Rule 1: If x ∈ B, so is any integer formed by a permutation of the digits of x.
– Rule 2: If x ∈ B contains one or more digits whose product can be represented
by another product of digits with the same sum, then those digits can swap
out and the resulting integer (and its permutations) will also be in B. As an
example, if x contains 4 as one of its digits, then any integer formed by replacing
the 4 with 22 is also in B, and vice versa. Also, if x contains 6 as one of its
digits, then any integer formed by replacing the 6 with 123 is also in B, and vice
versa, and so forth.
Thankfully, T = 2137, and the only application of Rule 2 that applies is that 213 can
be replaced by 6 and so 67 ∈ B and 76 ∈ B along with the 4! = 24 permutations of
2137, resulting in 26 integers in B.

R3-4 Let T = T N Y W R. A sequence of T positive integers s1 , s2 , . . . , sT has the property

that the sum of every three consecutive terms in the sequence is T . Compute the
least possible value of s1 + s2 + · · · + sT .

R3-4 Solution For this condition to hold, the sequence must have the form a, b, c, a, b, c, . . ., with
a + b + c = T . If r = b T3 c, then the sum is either rT , rT + a, or rT + a + b, depending
on the value of T (mod 3). Since T = 26, the sum is 8×26+a+b, which is minimized
when a = b = 1, so the answer is 210 .
 R3-5 Let T = T N Y W R. Patty’s outfits consist of a hat, a blouse, and a skirt. Patty has
x different hats, y different blouses, and x + y different skirts. If the total number of
different outfits Patty can make is T , compute the number of skirts Patty has.

R3-5 Solution The total number of outfits is x × y × (x + y), meaning that T can be broken into
three factors whose product is T , one of which is the sum of the other two. As
T = 210 = 3 × 7 × 10, the answer is 10 .

T l
X √ m l√ m l√ m l√ m
R3-6 Let T = T N Y W R. Compute k = 1 + 2 + ··· + T .
k=1

√
R3-6 Solution For the integers j such that (k − 1)2 + 1 ≤ j ≤ k 2 , d je = k. There are 2k − 1
numbers in that range, so if N 2 is the largest perfect square less than or equal
T l N2 l T N
X √ m X √ m X l√ m X
to T , then k = k + k = (2j − 1)j + (T − N 2 )(N + 1).
k=1 k=1 k=N 2 +1 j=1
As T = 10, N = 3, and the sum is (1 × 1) + (3 × 2) + (5 × 3) + (10 − 9) × 4 = 26 .
 Tiebreaker Solution
2
TB A sequence an is defined for positive integers n as follows: an = 1 if n = N +N
2
+2
for
some non-negative integer N , and an = an−1 + 1 otherwise. Compute a2016 .

TB Solution Note that the sequence resets to 1 on the number following every triangular number
2
(since N +N
2
+2
= N (N2+1) + 1), so the sequence is 1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, . . . . Ac-
cordingly, an is 1 more than n minus the largest triangular number less than or equal
to n. Because 2016 is the 53rd triangular number, a2016 = 53 .

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