Professional Documents
Culture Documents
2020 AMO Paper Solutions
2020 AMO Paper Solutions
DAY 1
Tuesday, 4 February 2020
Time allowed: 4 hours
No calculators are to be used.
Each question is worth seven points.
a+b p
− ab = 1.
2
2. Amy and Bec play the following game. Initially, there are three piles, each containing
2020 stones. The players take turns to make a move, with Amy going first. Each
move consists of choosing one of the piles available, removing the unchosen pile(s)
from the game, and then dividing the chosen pile into 2 or 3 non-empty piles. A
player loses the game if they are unable to make a move.
Prove that Bec can always win the game, no matter how Amy plays.
3. Let ABC be a triangle with \ACB = 90 . Suppose that the tangent line at C to the
circle passing through A, B, C intersects the line AB at D. Let E be the midpoint
of CD and let F be the point on the line EB such that AF is parallel to CD.
Prove that the lines AB and CF are perpendicular.
Bn2 + 2
Bn+1 = .
2Bn
The Olympiad programs receive grant funding from the Australian Government.
© 2020 Australian Mathematics Trust
2020 Australian Mathematical Olympiad
DAY 2
Wednesday, 5 February 2020
Time allowed: 4 hours
No calculators are to be used.
Each question is worth seven points.
7. A tetromino tile is a tile that can be formed by gluing together four unit square tiles,
edge to edge. For each positive integer n, consider a bathroom whose floor is in the
shape of a 2 ⇥ 2n rectangle. Let Tn be the number of ways to tile this bathroom floor
with tetromino tiles. For example, T2 = 4 since there are four ways to tile a 2 ⇥ 4
rectangular bathroom floor with tetromino tiles, as shown below.
8. Prove that for each integer k satisfying 2 k 100, there are positive integers
b2 , b3 , . . . , b101 such that
k+1 k+2
b22 + b33 + · · · + bkk = bk+1 + bk+2 101
+ · · · + b101 .
The Olympiad programs receive grant funding from the Australian Government.
© 2020 Australian Mathematics Trust
AUSTRALIAN MATHEMATICAL OLYMPIAD 2020
Solutions
2020 Australian Mathematical Olympiad Solutions
© 2020 Australian Mathematics Trust
and
GM = 2(n + 1)2 × 2n2 = 2n(n + 1) = 2n2 + 2n = AM − 1.
1
The Olympiad programs receive grant funding from the Australian Government.
© 2020 Australian Mathematics Trust
2020 Australian Mathematical Olympiad Solutions
m2 k + n 2 k
= mnk + 1 ⇔ (n − m)2 k = 2.
2
It follows that n = m + 1 and k = 2. So (a, b) = (2m2 , 2(m + 1)2 ) which works.
Solution 5 (Angelo Di Pasquale)
(Shows that a rather mechanical solution can be found)
WLOG a ≤ b so that a = b + d for some integer d ≥ 0. Substitution yields
2a + d
= a(a + d) + 1 ⇔ 8a = (d − 2)2 .
2
Thus d is even. Put d = 2e to find 2a = (e − 1)2 . Thus e is odd. Put e = 2f + 1 to find
a = 2f 2 and then b = a + d = 2(f + 1)2 , which is easy to verify.
Solution 6 (Andrew Elvey Price)
√
Without loss of generality, a ≥ b. Squaring both sides of (a + b)/2 − 1 = ab then
rearranging yields
(a − b)2 = 4a + 4b − 4.
It follows that a−b is even, so we write a−b = 2n. Then a+b = n2 +1. Since a and b have
the same parity is follows that n = 2m + 1 for some integer m. Solving these equations
for a, b in terms of m yields a = 2(m + 1)2 and b = 2m2 . Finally we can check that this
satisfies the conditions of the question for all non-negative integers m.
Solution 7 (Ivan Guo)
√
Since ab is rational, it must be an integer and ab is a perfect square. Write g = gcd(a, b).
√
Since g divides (a + b) − 2 ab = 2, we must have g = 1 or 2. If it is 1, then both a and
√ √
b are perfect squares. But this contradicts ( a − b)2 = 2 as 2 is not a perfect square.
So g = 2. Then we can write a = 2c, b = 2d (where c and d are coprime) to obtain
√ √ √
1 = c + d − 2 cd = ( c − d)2 . Hence c and d must be perfect squares with a difference
of 1, which lead to the required solution.
a2 − (4 + 2b)a + (b − 2)2 = 0.
r r−1
A √ C
O 2r − 1 D
√ √
We then have that AD = a = r + 2r − 1 and DC = b = r − 2r − 1 (if a > b, say).
But a and b are integers which means (the odd number) 2r − 1 must be a perfect square.
Hence 2r − 1 = (2k + 1)2 for some integer k and so r = 2k 2 + 2k + 1.
Hence, the pair of integers (2k 2 + 2k + 1, 2k 2 + 2k) for all integers k are the only pairs of
integers which have their arithmetic mean 1 more than their geometric mean.
Solution 11 (Ian Wanless)
(which may amount to the same thing, but feels different):
√
(a + b)/2 − 1 = ab.
a2 + b2 + 4 + 2ab − 4a − 4b = 4ab.
Hence
(a − b)2 = 4(a + b − 1)
Considering this mod 4 we see that a − b is even. Hence a + b is even so
2. Amy and Bec play the following game. Initially, there are three piles, each containing 2020
stones. The players take turns to make a move, with Amy going first. Each move consists
of choosing one of the piles available, removing the unchosen pile(s) from the game, and
then dividing the chosen pile into 2 or 3 non-empty piles. A player loses the game if they
are unable to make a move.
Prove that Bec can always win the game, no matter how Amy plays.
3. Let ABC be a triangle with ∠ACB = 90◦ . Suppose that the tangent line at C to the
circle passing through A, B, C intersects the line AB at D. Let E be the midpoint of CD
and let F be the point on the line EB such that AF is parallel to CD.
Prove that the lines AB and CF are perpendicular.
Since ∠ACH is a right angle, the circumcircle of triangle ACH has AH as diameter and
so F as centre. Hence, F C = F H as these are both radii. It follows that triangle CF H
is isosceles, so ∠BCF = ∠BHF = ∠BCD = ∠BAC, where the second equation follows
from the alternate angle theorem and the last equation from the the alternate segment
theorem.
Letting G be the point of intersection between AB and CF , it follows that triangles ABC
and CBG are similar, as two pairs of corresponding angles are equal. Hence, ∠BGC =
∠BCA, which is a right angle, as required.
∠F CA = ∠ACZ = ∠CAF.
GB · DA = GA · BD. (2)
Let O be the centre of circle ABC, and r its radius. Then (2) is equivalent to
OG OC
(r − OG)(r + OD) = (r + OG)(OD − r) ⇔ OG · OD = r2 ⇔ = .
OC OD
The last equality above implies OGC ∼ OCD (PAP). Hence ∠OGC = ∠OCD = 90◦ .
DE CF G B AF G B CD AF
· · = · = · = 1.
EC G F BD G F BD CG G F
The first equality is due to DE = EC and CF = AF , the second is due to DCG ∼
AF G , and the last is from the angle bisector theorem in CDG . Hence by Menelaus’
theorem, points E, B, and F are collinear. Hence F = F , and G = G, which implies the
result.
Let O be the midpoint of AB. We firstly show that AOF ∼ DBC. Note that since
AF and CD are parallel, ∠OAF = ∠BDC (alternate angles) and AF B ∼ DEB (two
pairs of alternate angles). Then
AF 2AF
= (as O is the midpoint of AB)
AO AB
2DE
= (as AF B ∼ DEB)
DB
DC
= (as E is the midpoint of CD).
DB
AF DC
As two sides of AOF and DBC have lengths in the same ratio ( AO = DB ) and the
angles between them are equal (∠OAF = ∠BDC), AOF and DBC are similar.
Let F O extended meet AC at P . Then
∠F AP = ∠F AB + ∠BAC
= ∠BDC + ∠BCE (alternate angles and alternate segment theorem)
= ∠ABC (exterior angle equals the sum of interior opposite angles of BCD).
It follows that ABC ∼ F AP (two pairs of corresponding angles are equal). Therefore,
∠OP A = ∠F P A = ∠ACB = 90◦ and we conclude that OP is parallel to BC. Then
AOP and ABC are also similar (equal corresponding pairs of angles) and as O is the
midpoint of AB, P is the midpoint of AC.
Since altitude F P bisects side AC, ACF is isosceles with F AP congruent to F CP .
Hence ABC is additionally similar to F CP so corresponding sides have the same angle
between them. As AC ⊥ F P it follows that AB ⊥ F C as required.
Bn2 + 2
Bn+1 = .
2Bn
B0+1 = B1 = 1 = A1 = A20 ,
(The base case n = 0 can be established in this setting by interpreting both f (0) (x) and
g (0) (x) as the identity function, so that both sides of the equation above equal 1.)
To apply the inductive argument which follows, we also need to establish the case n = 1:
12 + k 1+k 1
g (1) (1) = g(1) = = = f (1) = f (2 −1) (1).
2×1 1+1
f (x)2 + k
g(f (x)) =
2f (x)
x+k 2
+k
x+1
=
x+k
2
x+1
(x + k)2 + k(x + 1)2
=
2(x + k)(x + 1)
(k + 1)x2 + 4kx + k(k + 1)
= ,
2x2 + 2(k + 1)x + 2k
10
f (g(x)) + k
f (f (g(x)) =
f (g(x)) + 1
g(x) + k
+k
g(x) + 1
=
g(x) + k
+1
g(x) + 1
(k + 1)g(x) + 2k
=
2g(x) + k + 1
x2 + k
(k + 1) + 2k
= 2x
x2 + k
2 +k+1
2x
(k + 1)x2 + 4kx + k(k + 1)
=
2x2 + 2(k + 1)x + 2k
= g(f (x)).
= ···
= f 2(m−1) (g(f (x))
= f (2m) (g(x)).
n
Finally, assume by induction that g (n) (1) = f (2 −1) (1). Then, via the above generalised
identity with m = 2n − 1 and the fact that f (1) = g(1), we have
11
c/d+2 c+2d
holds for n we now show it holds for n + 1. We easily compute An+1 = c/d+1 = c+d ,
c2 +2d2 +4cd
A2n+1 = c2 +2d2 +2cd
,
Putting xn = yn+1 − yn into the first recurrence and yn = 12 (xn+1 − xn ) into the second
recurrence and tidying up yields
The conclusion of the problem statement gives us a clue as to what to do next. For example
if n = 3, we hope that
It is straightforward to confirm that the equalities in (2) are true by using the equalities
in (1). It follows from (2) that
x2n x2 + 2yn2 A2 + 2
A2n = = n = n . (3)
y2n 2xn yn 2An
The result now follows inductively from (3) because B1 = A20 , and if Bn = A2n−1 , then
Bn2 + 2 A2n−1 + 2
Bn+1 = = 2 = A2n ,
2Bn 2A2n−1
12
as desired.
This can be proven by induction. The base case A1 = 1 is true. for the inductive step, we
assume the equation above and aim to prove the same equation with n replaced by n + 1.
An + 1 and An + 2 can be calculated as follows
√ √
(1 + 2)n+1 − (1 − 2)n+1
An + 1 = √ √ ,
(1 + 2)n − (1 − 2)n
and √ √
√ (1 + 2)n+1 + (1 − 2)n+1
An + 2 = 2 √ √ .
(1 + 2)n − (1 − 2)n
It follows that √ √
An + 2 √ (1 + 2)n+1 + (1 − 2)n+1
An+1 = = 2 √ √ ,
An + 1 (1 + 2)n+1 − (1 − 2)n+1
which completes the induction.
Now it suffices to prove that
√ √
√ (1 + 2)2n−1 + (1 − 2)2n−1
Bn = 2 √ √ .
(1 + 2)2n−1 − (1 − 2)2n−1
Again, we can prove this by induction. The base cases B1 = 1 and B2 = 3/2 can easily be
checked. For the inductive step, we assume that the equation above holds for some n ≥ 2,
√ n−1
and we will show that it also holds for n+1. For convenience we will write c = (1+ 2)2 ,
then we have
√ c + c−1
Bn = 2 ,
c − c−1
and we want to prove that
√ c2 + c−2
Bn+1 = 2 2 .
c − c−2
This follows immediately by substituting the formula for Bn into the equation
Bn2 + 2
Bn+1 = .
2Bn
13
We claim that An = pn /qn for all n ≥ 1 and Bn+1 = p2n /q2n for all n ≥ 0.
Both can be proven easily by induction. The base cases are clear. For the first claim, it
suffices to note that
√ √ √ √
pk+1 + qk+1 2 = (pk + qk 2)(1 + 2) = (pk + 2qk ) + (pk + qk ) 2,
which implies
Ak + 2 pk /qk + 2 pk + 2qk pk+1
Ak+1 = = = = .
Ak + 1 pk /qk + 1 pk + q k qk+1
For the second claim, it suffices to note that
√ √ √
p2k + q2k 2 = (p2k−1 + q2k−1 2)2 = (p22k−1 + 2q22k−1 ) + 2p2k−1 q2k−1 2,
which implies
Thus we have An as
√ n−1 √ √ √
An = 1 + [(1 + 2) − (1 − 2)n−1 ]/[(1 + 2)n − (1 − 2)n ]
which simplifies to
√ √ √ √ √
An = 2[(1 + 2)n + (1 − 2)n ]/[(1 + 2)n − (1 − 2)n ].
We now show that A2n = Bn+1 . For n = 1 we verify A21 = A2 = 3/2 = B2 . It remains to
show that A2n satisfies the same recursion as Bn+1 , i.e. that A2n+1 = (A22n + 2)/(2A2n ).
We verify this directly: upon clearing denominators in
(A22n + 2)/(2A2n )
14
The numerator simplifies using the identity (x + y)2 + (x − y)2 = 2x2 + 2y 2 , and the
denominator simplifies using the identity (x + y)(x − y) = x2 − y 2 . We end up with
√ √ n+1 √ n+1 √ n+1 √ n+1
2[(1 + 2)2 + (1 − 2)2 ]/[(1 + 2)2 − (1 − 2)2 ]
15
Hence cn satisfies the first order recurrence as An with the same initial value and we
conclude cn = An for n = 1, 2, 3 . . .. Next we note that
√ α2n + β 2n
A2n = 2 2n
α − β 2n
√ (αn + β n )2 + (αn − β n )2
= 2
2(αn + β n )(αn − β n )
√ αn + β n αn − β n
= 2 + √
2(αn − β n ) 2(αn + β n )
An 1
= +
2 An
2
A +2
= n .
2An
A2n−1 +2
It follows that A2n = 2A2n−1 . If we define dn = A2n−1 for n
2
= 1, 2, . . . we find that
2 +2
d1 = A1 = 1 and dn+1 = d2dn
n
. This is the same recurrence that defines Bn and we
conclude that Bn+1 = dn+1 = A2n for non-negative integers n.
16
which means that our formula holds when n = k + 1. By induction the formula holds for
all positive integers n.
Next we use another induction to show that Bn+1 = A2n . The base case, n = 0, works
because we are told that B1 = A1 . Assuming that Bk+1 = A2k , we find that
√
k )+Y (2k ) 2
)2
(Bk+1 + 2 (A2k + 2 )2 2 X(2
X(2k )−Y (2k )
+2
Bk+2 = = = √ k )+Y (2k )
2Bk+1 2A2k 2 2 X(2
X(2k )−Y (2k )
(X(2k ) + Y (2k ))2 + (X(2k ) − Y (2k ))2
= √
2(X(2k ) + Y (2k ))(X(2k ) − Y (2k ))
2X(2k )2 + 2Y (2k )2
=√
2(X(2k )2 − Y (2k )2 )
√
2(X(2k+1 ) + Y (2k+1 ))
= = A2k+1 .
X(2k+1 ) − Y (2k+1 )
17
whenever i ≡ 4 mod 6. Since 2020 ≡ 4 mod 6 we have a2020 , a2021 , a2022 = 1, 1, 1 and
once again a2020 = 1.
18
The first two are clearly bad by rule A. If we have 0100, the next two are forced by rule A
to be 010001, but then this violates rule B. If we have 0010, the next three are forced by
19
rule A to be 0010001 which again violates rule B. So we have the required contradiction.
Hence the sequence alternates every 3 terms. Therefore a2020 = 1 − a2017 = 1 − a1 = 0 as
2017 is 1 mod 6.
1. ?0001000
2. 111000111000
3. ?000100
4. 11100011100
5. ?00010
6. 1110001110
Since 2020 = 6*336 + 4, sequence 2 starts with 1000111000 · · · , sequence 4 starts with
11000111000 · · · , sequence 6 starts with 111000111000 · · · . In each case a1 = 1, a contra-
diction.
20
Now exactly two of ai+1 , ai+2 and ai+3 are equal to ai , while both of ai+4 and ai+5 are
equal to ai , so again by (2), it follows that ai+6 = ai .
But ai+3 = ai+4 = ai+5 = ai+6 is contrary to (1). Thus the original assumption is false.
Hence ai+3 = ai . In particular, the terms a1 , a4 , a7 , a10 , . . . alternate, with ai = a1 for
i ≡ 1 (mod 6) and ai = a1 for i ≡ 4 (mod 6). As 2020 ≡ 4 (mod 6) and a1 = 0, it follows
that a2020 = 1.
From the tree diagram we can see the only valid sequences begin:
21
0, 0, 0, 1, 1, 1, 0, 0, 0, . . .
0, 0, 1, 1, 1, 0, 0, 0, . . .
0, 1, 1, 1, 0, 0, 0, . . .
Finally, note that a sequence containing the six consecutive terms 1, 1, 1, 0, 0, 0 can only
continue repeating this sequence 1, 1, 1, 0, 0, 0.
Hence the only sequences satisfying both conditions begin with one, two, or three 0s, and
then repeating 1, 1, 1, 0, 0, 0.
Consider now the 2020th term. Since
the 2020th term is the 3rd, 2nd, or 1st term of the repeating sequence 1, 1, 1, 0, 0, 0, and
hence is a 1.
22
6. Let ABCD be a square. For a point P inside ABCD, a windmill centred at P consists of
two perpendicular lines 1 and 2 passing through P , such that
Therefore, triangles ABP and ADP share the common side AP , have the equal sides AB =
AD, and have the equal angles ∠ABP = ∠ADP . It follows that either ∠AP B = ∠AP D
or ∠AP B + ∠AP D = 180◦ . In the first case, triangles ABP and ADP are congruent,
so P must lie on the segment AC. In the second case, P must lie on the segment BD.
Therefore, P lies on one of the diagonals of the square ABCD.
B X C
P
Y
A Z D
Conversely, suppose that P lies on one of the diagonals of the square ABCD. In fact, we
may assume without loss of generality that P lies on AC. Then the triangles ABP and
ADP are congruent and we have the following equal angles.
23
Assume P has the property. Then in particular the quadrilateral with horizontal is
cyclic. Let P W = a, P Z = b and the square have side L. Then tan(∠W ZP ) =
bL
a/b, tan(∠Y ZP ) = (L − a)/b, so tan(∠Y ZW ) = b2 −a(L−a) . Similarly tan(∠W XY ) =
(L−b)L
(L−b)2 −a(L−a)
. Since W XY Z is cyclic, the two angles must add up to 180, so the tan-
bL (L−b)L
gents must be opposite numbers. Hence b2 −a(L−a) = − (L−b)2 −a(L−a) , which simplifies to
2 2
L(a − b) = a − b , so either a = b and P is on AC, or a = L − b and P is on BD.
Conversely, assume P is on a diagonal, WLOG say AC. Because of the two right angles the
two quadrilaterals W AZP and XCY P are cyclic. It follows that ∠W ZP = ∠W AP = 45,
so the right-angled triangle W ZP is isosceles, and P Z = P W . Similarly P Y = P X. It
follows that the triangles P Y Z and P XW are congruent, and ∠Y ZP = 90 − ∠P XW .
Now we see that ∠Y ZW + ∠Y XW = ∠Y ZP + ∠P ZW + ∠Y XP + ∠P XW = (90 −
∠P XW ) + 45 + 45 + ∠P XW = 180. Thus the quadrilateral W XY Z is cyclic.
(1 − a2 )2 = (1 − b2 )2 .
Since both a, b are between −1 and 1, the solution of this equation is a = ±b which
corresponds to the diagonals of the square.
24
25
7. A tetromino tile is a tile that can be formed by gluing together four unit square tiles, edge
to edge. For each positive integer n, consider a bathroom whose floor is in the shape of a
2 × 2n rectangle. Let Tn be the number of ways to tile this bathroom floor with tetromino
tiles. For example, T2 = 4 since there are four ways to tile a 2 × 4 rectangular bathroom
floor with tetromino tiles, as shown below.
The leftmost column is covered by a 2 × 2 square, whose removal leaves one of the
Tn−1 tilings of the 2 × 2(n − 1) rectangle.
The leftmost column is covered by two 1 × 4 rectangles, whose removal leaves one of
the Tn−2 tilings of the 2 × 2(n − 2) rectangle.
The leftmost column is covered by an L-tetromino and resembles one of the following
diagrams, or their reflections in a horizontal axis. The areas outlined by dashed lines
are tiled with 1 × 4 rectangles. (Observe that there may actually be any non-negative
integer number of 1 × 4 rectangles appearing in the diagram.) The top case occurs
when the area covers a number of columns that is 0 modulo 4, while the bottom case
occurs when the area covers a number of columns that is 2 modulo 4. The removal
of these areas leaves one of the Tn−k tilings of the 2 × 2(n − k) rectangle, where
k = 2, 3, . . . , n. The case k = n leaves zero columns, so we set T0 = 1 to allow for
this case.
26
We can check that Tn = Fn2 for small values of n and then use these two matching recursions
to deduce that Tn = Fn2 for all positive integers n.
If a piece consists of two unit squares on top of each other, then we replace it with a
2 × 2 rectangle.
If a piece consists of two dominoes on top of each other, then we replace it with two
1 × 4 rectangles on top of each other.
Otherwise, the piece must resemble one of the following diagrams, or theire reflefc-
tions in a horizontal axis. The areas outlined by dashed lines are tiled with dominoes.
(Observe that there may actually be any positive integer number of dominoes appear-
ing in the diagram.) In this case, we replace the diagram with the respective diagrams
from the official solution.
The construction gives the necessary bijection between the tilings of a 2 × n rectangle with
unit squares and horizontal dominoes and the tilings of a 2×2n rectangle with tetrominoes.
Therefore, we conclude that Tn = Fn2 .
27
Tn+1 = Tn + Tn−1 + Un + Ln .
Ln+1 = Tn + Un .
T1 = 1 U 1 = 1 L 1 = 1
T2 = 4 U2 = 2 L2 = 2.
n Tn U n L n
1 1 1 1
Then using the recurrence equations we get 2 4 2 2
3 9 6 6
4 25 15 15
Tn+1 = Tn + Tn−1 + Un + Ln
2
= Fn+1 + Fn2 + 2Fn Fn−1
= (Fn + Fn+1 )2
2
= Fn+2 .
Un+1 = Tn + Ln .
2
= Fn+1 + Fn Fn+1
= Fn+1 (Fn+1 + Fn )
= Fn+1 Fn+2 .
Since Un = Ln the result follows by induction and we see that Tn+1 is a perfect square for
all n.
28
Alternative way to get from the first recurrence of the official solution to the answer:
29
8. Prove that for each integer k satisfying 2 ≤ k ≤ 100, there are positive integers b2 , b3 , . . . , b101
such that
k+1 k+2
b22 + b33 + · · · + bkk = bk+1 + bk+2 101
+ · · · + b101 .
Since gcd(k, d) = 1, by the Euclidean algorithm, (3) has solutions in positive integers w
and z.
We use the lemma extensively in the problem at hand..
If k ≥ 52, then let b100 = b99 = · · · = bk+1 = bk = bk−1 = · · · = b2k−99 = 1. It remains to
2k−100 i
solve b101
101 = i=2 bi . Since 101 is prime, and all the superscripts on the right are less
than 101, we may apply the lemma to dispose of this case.
If k = 51, then let bi = 1 for all 2 ≤ i ≤ 101.
If 11 ≤ k ≤ 50, then at most 8 of the terms on the RHS have superscripts that are multiples
of 11. Thus we may set all bi on the LHS equal to 1 except for b11 , and the same number
of bi on the RHS equal to 1, and making sure that all bi with 11 | i on the RHS are set
ji
equal to 1. What is left is an equation of the form b11
11 = bji where none of the ji are
divisible by 11. Hence we may apply the lemma to dispose of this case.
If 3 ≤ k ≤ 10, let bi = 1 for every i > k with 3 | i (there are at least 30 and at most 32 of
such i). Also let b1 = 6. Set the remaining bi on the LHS equal to 1 except for b3 and the
correct number of remaining bi on the RHS equal to 1 so that what is left is an equation
ji
of the form b33 = bji where none of the ji are divisible by 3. Hence we may apply the
lemma to dispose of this case.
Finally, if k = 2, then let b1 = 11, b3 = b4 = 2, and bi = 1 for 5 ≤ i ≤ 101.
Hence we have covered all required k.
100!+1
b101 = ρ 101
30
100!
bj = ρ j for 3 ≤ j ≤ 100.
x2 + k − 2 = 100 − k + ρ.
This evidently has many solutions, for example we can set x = 10 and ρ = 2k − 2.
First choose b2 , . . . , b100 arbitrarily so that L is positive (e.g., by making b2 very big). Since
101 is coprime to 100!, there exists positive integers c, d such that 100!c + 1 = 101d (in
fact, by Wilson’s theorem, c = 1 works). The multiplying both sides by L100!c , we have
(b2 L100!c/2 )2 +· · ·+(bk L100!c/k )k −(bk+1 L100!c/(k+1) )k+1 −· · ·−(b100 L100!c/100 )100 = (Ld )101 ,
as required.
31