Problems

Junior Regional Competition

18th June 2019

1. Let x and y be integers for which x + y 6= 0 holds. Determine all pairs (x, y) satisfying

x2 + y 2
= 10.
x+y

(Walther Janous)

2. Let ABCD be a square. The equilateral triangle BCS is constructed on the exterior
of the side BC. Let N denote the midpoint of the line segment AS and let H be the
midpoint of the side CD.
Prove: ∠N HC = 60°.
(Karl Czakler)

3. Alice and Bob play a game that allows the playing numbers 19 and 20 and the two possible
starting numbers 9 and 10. Alice chooses her playing number and assigns the remaining
playing number to Bob while Bob independently chooses the starting number.
Alice adds her playing number to the starting number, Bob adds his playing number to
the sum, then Alice again adds her playing number to this new sum and so on. The game
lasts till the number 2019 is reached or exceeded.
A player who obtains exactly 2019 wins. If 2019 is exceeded, the game ends in a draw.

• Show that Bob cannot win.

• Which starting number does Bob have to choose in order to prevent Alice from
winning?

(Richard Henner)

4. Let p, q, r and s be prime numbers satisfying

5 < p < q < r < s < p + 10.

Prove that the sum of these four prime numbers is divisible by 60.
(Walther Janous)

1
Regional Competition
4th April 2019

5. Let x and y be real numbers satisfying (x + 1)(y + 2) = 8.

Show that
(xy − 10)2 ≥ 64.
Furthermore, determine all pairs (x, y) of real numbers for which equality holds.
(Karl Czakler)
6. Let ABCDE be a convex pentagon having a circumcircle and satisfying AB = BD. The
point P is the intersection of the diagonals AC and BE. The lines BC and DE intersect
in point Q.
Show that the line P Q is parallel to the diagonal AD.
(Gottfried Perz)
7. Let n ≥ 2 be an integer.
We draw an n × n grid on a board and label each box with either the number −1 or the
number 1. Then we calculate the sum of each of the n rows and the sum of each of the
n columns and determine the sum S of these 2n sums.
(a) Show that there does not exist a labelling of the grid with S = 0 if n is odd.
(b) Show that there exist at least six different labellings with S = 0 if n is even.
(Walther Janous)
8. Determine all non-negative integers n smaller than 12897 which have exactly 2019 positive
divisors.
(Richard Henner)

National Competition—Preliminary Round

4th May 2019

9. We consider the sequences (an )n≥0 and (bn )n≥0 which are defined by a0 = b0 = 2 and
a1 = b1 = 14 and by
an = 14an−1 + an−2 ,
bn = 6bn−1 − bn−2
for n ≥ 2.
Decide whether there are infinitely many integers which occur in both sequences.
(Gerhard Woeginger)
10. Let ABC be a triangle and I its incenter. The circumcircle of ACI intersects the line
BC a second time in the point X and the circumcircle of BCI intersects the line AC a
second time in the point Y .
Prove that the segments AY and BX are of equal length.
(Theresia Eisenkölbl)
2
 11. Let n ≥ 2 be an integer.
Ariane and Bérénice play a game on the set of residue classes modulo n. In the beginning,
the residue class 1 is written on a piece of paper. In each move, the player whose turn it
is replaces the current residue class x with either x + 1 or 2x. The two players alternate
with Ariane starting.
Ariane has won if the residue class 0 is reached during the game. Bérénice has won if she
can permanently avoid this outcome.
For each value of n, determine which player has a winning strategy.
(Theresia Eisenkölbl)

12. Find all pairs (a, b) of real numbers such that

a · bb · nc = b · ba · nc

for all positive integers n.

(Walther Janous)

National Competition—Final Round

29th to 30th May 2019

First day
13. Determine all functions f : R → R such that

f (2x + f (y)) = x + y + f (x)

for all x, y ∈ R.
(Gerhard Kirchner)

14. A (convex) trapezoid ABCD shall be called good if it is inscribed, has parallel sides
AB and CD, and CD is shorter than AB. For a good trapezoid, we fix the following
notations.

• The line parallel to AD through B intersects the line CD in S.

• The tangents through S to the circumcircle of the trapezoid meet the circumcircle
in E and F , respectively, where E is on the same side of the line CD as A.

Characterize good trapezoids ABCD (in terms of the side lengths and/or angles of the
trapezoid) for which the angles ∠BSE and ∠F SC are equal. The characterization should
be as simple as possible.
(Walther Janous)

15. In the country of Oddland, there are stamps with values 1 cent, 3 cent, 5 cent, etc., one
type for each odd number. The rules of Oddland Postal Services stipulate the following:
for any two distinct values, the number of stamps of the higher value on an envelope must
never exceed the number of stamps of the lower value.
In the country of Squareland, on the other hand, there are stamps with values 1 cent,
4 cent, 9 cent, etc., one type for each square number. Stamps can be combined in all
possible ways in Squareland without additional rules.
3
 Prove for every positive integer n: In Oddland and Squareland there are equally many
ways to correctly place stamps of a total value of n cent on an envelope. Rearranging the
stamps on an envelope makes no difference.
(Stephan Wagner)

Second day
16. Let a, b and c be positive real numbers satisfying a + b + c + 2 = abc.
Prove
(a + 1)(b + 1)(c + 1) ≥ 27.

When does equality occur?

(Karl Czakler)

17. We are given an arbitrary acute-angled triangle ABC and its altitudes AD and BE where
D and E denote their feet on sides BC and AC, respectively. Let furthermore F and G
be two points on segments AD and BE, respectively, such that
AF BG
= .
FD GE
The line through C and F intersects BE in point H and the line through C and G
intersects AD in point I. Prove that the four points F , G, H and I are concyclic.
(Walther Janous)

18. Determine the smallest possible positive integer n with the following property: For all
positive integers x, y and z with x | y 3 and y | z 3 and z | x3 we also have xyz | (x+y +z)n .
(Gerhard J. Woeginger)

4
Solutions

Junior Regional Competition

18th June 2019

Problem 1. Let x and y be integers for which x + y 6= 0 holds. Determine all pairs (x, y)
satisfying
x2 + y 2
= 10.
x+y

(Walther Janous)
Answer.
(x, y) ∈ {(−2, 4), (−2, 6), (0, 10), (4, −2), (4, 12), (6, −2), (6, 12), (10, 0), (10, 10), (12, 4), (12, 6)}.

Solution. An equivalent form of the given equation is

x2 + y 2 = 10x + 10y
⇐⇒ x2 − 10x + y 2 − 10y = 0
⇐⇒ (x − 5)2 + (y − 5)2 = 50
with x + y 6= 0. We therefore have to solve the equation a2 + b2 = 50 for integers a and b.
As max(a2 , b2 ) ≤ 50 we get max(|a|, |b|) ≤ 7. Furthermore we obtain min(a2 , b2 ) ≤
25 which yields min(|a|, |b|) ≤ 5. Analyzing the individual cases, we obtain (a, b) ∈
{(±1, ±7), (±7, ±1), (±5, ±5)} as the only possible solutions. If (a, b) ∈ {(±1, ±7), (±7, ±1)},
we get that x − 5 = ±1 and y − 5 = ±7 (or x and y swapped), which yields x ∈ {4, 6} and
y ∈ {−2, 12} (or y ∈ {4, 6} and x ∈ {−2, 12}). The case (a, b) = (±5, ±5) gives x − 5 = ±5
and y − 5 = ±5 which is equivalent to x ∈ {0, 10} and y ∈ {0, 10}. The pair (x, y) = (0, 0) is
the only one violating x + y 6= 0. Therefore, we get the (eleven) different pairs listed in the
answer.
(Walther Janous)

Problem 2. Let ABCD be a square. The equilateral triangle BCS is constructed on the
exterior of the side BC. Let N denote the midpoint of the line segment AS and let H be the
midpoint of the side CD.
Prove: ∠N HC = 60°.
(Karl Czakler)

Solution. Let P be the midpoint of BS, see Figure 1. Since triangles 4SN P and 4SAB are
similar with factor 2, the segment N P is parallel to AB and half the length of the segment
AB. Therefore N P CH is a parallelogram. As N P and BC are orthogonal and P C and BS
are orthogonal, we have ∠N P C = ∠CBP = 60°. Thus we obtain ∠N HC = ∠N P C = 60°.
(Karl Czakler)
5
 D H C

N P

A B
Figure 1: Problem 2

Problem 3. Alice and Bob play a game that allows the playing numbers 19 and 20 and the two
possible starting numbers 9 and 10. Alice chooses her playing number and assigns the remaining
playing number to Bob while Bob independently chooses the starting number.
Alice adds her playing number to the starting number, Bob adds his playing number to the
sum, then Alice again adds her playing number to this new sum and so on. The game lasts till
the number 2019 is reached or exceeded.
A player who obtains exactly 2019 wins. If 2019 is exceeded, the game ends in a draw.

• Show that Bob cannot win.

• Which starting number does Bob have to choose in order to prevent Alice from winning?

(Richard Henner)

Solution. Let s be the starting number and a Alice’s playing number and b Bob’s playing
number. Furthermore, let n be the number of rounds of the game (i.e., the number of times
that Bob adds his number).
In order for Bob to win, the equation s + 39n = 2019 must have an integer solution for n.
But neither s = 9 nor s = 10 satisfy this condition, as neither 2010 nor 2009 is divisible by 39.
Hence Bob cannot win. In fact, 51 · 39 = 1989 and 52 · 39 = 2028.
In order for Alice to win, the equation s + 39n + a = 2019 has to be satisfied for some n.
As 28 ≤ s + a ≤ 30 by definition, this can only work for n = 51, which implies s + a = 30.
Therefore, we have s = 10 and a = 20.
We conclude that Bob has to choose 9 as starting number in order not to lose the game.
(Richard Henner)

Problem 4. Let p, q, r and s be prime numbers satisfying

5 < p < q < r < s < p + 10.

Prove that the sum of these four prime numbers is divisible by 60.
(Walther Janous)

Solution. The four prime numbers have to fulfill p > 5 and s < p + 10 and hence they must be
among the five consecutive odd numbers p, p + 2, p + 4, p + 6 and p + 8.
As we have to choose 4 out of the five numbers p, p + 2, p + 4, p + 6, p + 8, we have to
omit exactly one of these numbers. If we omit one of the numbers p, p + 2, p + 6 or p + 8,
6
three subsequent odd numbers remain, one of which has to be divisible by 3, which is excluded.
Therefore, we have to omit p + 4.
Hence the four prime numbers have to be p, q = p + 2, r = p + 6 and s = p + 8.
Exactly one of the five consecutive integers p, p + 2, p + 4, p + 6 and p + 8 is divisible by 5.
By construction, none of the chosen number p, q, r, s can be divisible by 5. This implies that
p + 4 is divisible by 5. So p + 4 is divisible by 15.
The fact that

p + q + r + s = p + (p + 2) + (p + 6) + (p + 8) = 4p + 16 = 4(p + 4)

yields that the sum is divisible by 60.

Remark. The quadruple (11, 13, 17, 19) indeed shows that the number 60 cannot be replaced by a
greater one.

(Walther Janous)

Regional Competition
4th April 2019

Problem 5. Let x and y be real numbers satisfying (x + 1)(y + 2) = 8.

Show that

(xy − 10)2 ≥ 64.

Furthermore, determine all pairs (x, y) of real numbers for which equality holds.
(Karl Czakler)

Solution. The inequality (2x − y)2 ≥ 0 (with equality if and only if y = 2x) is equivalent to

(2x + y)2 ≥ 8xy.

The constraint (x + 1)(y + 2) = 8 gives 2x + y = 6 − xy. Substituting this into the inequality
above yields
(6 − xy)2 ≥ 8xy,
which is equivalent to
(xy − 10)2 ≥ 64.
As we noted already, equality holds for y = 2x. In this case, the constraint becomes (x +
1)(2x + 2) = 8 which yields x = 1 or x = −3 and finally the two pairs (x, y) = (1, 2) and
(x, y) = (−3, −6). We easily verify that equality actually holds in both cases.
(Karl Czakler)

Problem 6. Let ABCDE be a convex pentagon having a circumcircle and satisfying AB = BD.
The point P is the intersection of the diagonals AC and BE. The lines BC and DE intersect
in point Q.
Show that the line P Q is parallel to the diagonal AD.
(Gottfried Perz)

7
 E

k
D
A

P Q
C
B
Figure 2: Problem 6

Solution. We denote the circumcircle of the pentagon ABCDE by k, see Figure 2. By assump-
tion, the triangle ABD is isosceles, which implies that the tangent tB to k in B is parallel to
AD.
We apply Pascal’s theorem to the inscribed hexagon BEDACB: The intersection point of
the opposite sides BE and AC is P , the intersection point of the opposite sides ED and CB
is Q, and the intersection point of the parallel opposite sides BB (i.e., tB ) and DA is the point
at infinity corresponding to direction AD. Therefore, P Q is parallel to AD.
(Stefan Leopoldseder)

Problem 7. Let n ≥ 2 be an integer.

We draw an n × n grid on a board and label each box with either the number −1 or the
number 1. Then we calculate the sum of each of the n rows and the sum of each of the n
columns and determine the sum S of these 2n sums.
(a) Show that there does not exist a labelling of the grid with S = 0 if n is odd.

(b) Show that there exist at least six different labellings with S = 0 if n is even.
(Walther Janous)

Solution. As each number of the grid appears exactly once in the sum of all columns of the
grid and the same holds for the sum of all rows, we get that S is twice the sum of all labels of
the boxes of the n × n grid. Therefore, S = 0 holds if and only if the sum of all labels of the
boxes vanishes, or equivalently, if the number of labels +1 equals the number of labels −1. We
call such a labelling admissible.

(a) If n is odd, the sum of all labels is also odd, because it is a sum of an odd number of odd
labels. Thus there cannot be an admissible labelling in this case.

(b) If n is even, we write n = 2k for some integer k. The admissible labellings can be
constructed as follows: Choose exactly half of the n2 = 4k 2 boxes arbitrarily and label
each of them with +1. The remaining boxes are labelled with −1.
2

Thus there are exactly ak := 4k2k2
admissible labellings of a 2k × 2k grid.
We have a1 = 2 = 6 and it is easily seen that ak is increasing in k: if 1 ≤ k 0 < k, each
4

admissible labelling of any 2k 0 × 2k 0 subgrid can be extended to an admissible labelling

8
 of the 2k × 2k grid by choosing half of the extra 4k 2 − 4k 0 2 boxes and labelling each of
them with +1 and the remaining boxes with −1. Therefore, ak ≥ 6 for all k.

(Walther Janous)

Problem 8. Determine all non-negative integers n smaller than 12897 which have exactly 2019
positive divisors.
(Richard Henner)
Answer. There are 4 solutions: n = 2672 · 32 or n = 2672 · 52 or n = 2672 · 72 or n = 2672 · 112 .

Solution. Numbers with exactly 2019 positive divisors are either of the form p2018 or p672 · q 2
for distinct prime numbers p and q. The number 12897 can be written as

12897 = (27 )97 = 2679 .

As p is at least 2, the number p2018 is greater than 2679 and therefore, the case n = p2018 is
impossible. Thus we have n = p672 · q 2 with p672 · q 2 < 2679 . Hence p = 2 and as q 2 < 27 = 128,
q is one of the primes 3, 5, 7 or 11.
(Richard Henner)

National Competition—Preliminary Round

4th May 2019

Problem 9. We consider the sequences (an )n≥0 and (bn )n≥0 which are defined by a0 = b0 = 2
and a1 = b1 = 14 and by

an = 14an−1 + an−2 ,
bn = 6bn−1 − bn−2

for n ≥ 2.
Decide whether there are infinitely many integers which occur in both sequences.
(Gerhard Woeginger)
Answer. Yes.

Solution. Sequence (an ) starts with values 2, 14, 198, 2786, 39202, 551614. Sequence (bn )
starts with values 2, 14, 82, 478, 2786, 16238, 94642, 551614. We therefore conjecture that
a2k+1 = b3k+1 holds for k ≥ 0.
Shifting the recurrence yields

an+2 − 14an+1 − an = 0,
an+1 − 14an − an−1 = 0,
an − 14an−1 − an−2 = 0

for n ≥ 2. Multiplying these recurrences by 1, 14 and −1, respectively, and taking the sum
yields an+2 − 198an + an−2 = 0 and thus

an+2 = 198an − an−2

for n ≥ 2.
9
 Shifting the recurrence of (bn ) yields

bn+3 − 6bn+2 + bn+1 = 0,

bn+2 − 6bn+1 + bn = 0,
bn+1 − 6bn + bn−1 = 0,
bn − 6bn−1 + bn−2 = 0,
bn−1 − 6bn−2 + bn−3 =0

for n ≥ 3. Multiplying these recurrences by 1, 6, 35, 6 and 1, respectively, and taking the sum
yields bn+3 − 198bn + bn−3 = 0 and thus

bn+3 = 198bn − bn−3

for n ≥ 3.
We see that the subsequences (a2k+1 ) and (b3k+1 ) have the same initial values a1 = b1 = 14
and a3 = b4 = 2786 and fulfil the same recurrence. This implies that a2k+1 = b3k+1 for all
k ≥ 0.
From the given recurrence, it is obvious that the sequence (an ) is strictly increasing. Thus
we also get infinitely many values which occur in both sequences.
(Gerhard Woeginger)

Problem 10. Let ABC be a triangle and I its incenter. The circumcircle of ACI intersects
the line BC a second time in the point X and the circumcircle of BCI intersects the line AC
a second time in the point Y .
Prove that the segments AY and BX are of equal length.
(Theresia Eisenkölbl)

Solution. We shall show that AB = BX holds. Since AB = AY then follows by the same
argument, this completes the proof (see Figure 3).

C
Y

A B
Figure 3: Problem 10

In this solution, we use oriented angles between lines (modulo 180°) with the notation
∠P QR. As usual the angles of the triangle ABC are denoted by α = ∠BAC, β = ∠CBA and
γ = ∠ACB.

10
 The inscribed angle theorem gives
1
∠AXB = ∠AXC = ∠AIC = −∠CIA = 180° − ∠CIA = ∠IAC + ∠ACI = (α + γ).
2
This immediately implies
1 1
∠BAX = −∠AXB − ∠XBA = − (α + γ) − β = (α + γ).
2 2
Therefore, the triangle ABX is indeed isosceles, and we are done.
(Theresia Eisenkölbl)

Problem 11. Let n ≥ 2 be an integer.

Ariane and Bérénice play a game on the set of residue classes modulo n. In the beginning,
the residue class 1 is written on a piece of paper. In each move, the player whose turn it is
replaces the current residue class x with either x + 1 or 2x. The two players alternate with
Ariane starting.
Ariane has won if the residue class 0 is reached during the game. Bérénice has won if she
can permanently avoid this outcome.
For each value of n, determine which player has a winning strategy.
(Theresia Eisenkölbl)
Answer. Ariane wins for n = 2, 4 and 8, for all other n ≥ 2 Bérénice wins.

Solution. We observe: If Ariane can win for a certain n, she will also win for all divisors of
n, and conversely, if Bérénice can win for a certain n, she will also win for all multiples of n
because a residue 0 modulo n is automatically a residue 0 for all divisors of n.
It remains to show that Ariane wins for n = 8 and Bérénice wins for n = 16 and n odd.
All congruences in this solution are modulo n.

• For n = 8, Ariane has to choose 2 in the first step. If Bérénice takes 4, Ariane can choose
8 ≡ 0 and has won. If Bérénice takes 3, Ariane can choose 6. Now, Bérénice has to decide
between 7 and 2 · 6 = 12 ≡ 4. But for both, Ariane can immediately choose 8 ≡ 0.

• For n = 16, Bérénice chooses 2x for all numbers except 4 and 8. This clearly never gives
the residue classes 0, 15 or 8, so that Ariane also cannot choose 0.

• For n = 3, Ariane has to choose 2 in the first step and then Bérénice chooses 1 again,
which means that Bérénice wins.

• For odd n > 3, it is not possible to reach 0 with 2x from another residue class. So the
only possible issue for Bérénice would be the situation that both her options are among n
and n − 1 such that she or Ariane choose 0. But this means that x + 1 takes the residues
0 or −1, so 2x takes the residues −2 or −4 which are both different from 0 and −1, so
this cannot happen and Bérénice can permanently avoid 0 being chosen.

(Theresia Eisenkölbl)

Problem 12. Find all pairs (a, b) of real numbers such that

a · bb · nc = b · ba · nc

for all positive integers n.

(Walther Janous)
11
Answer. The solutions are all pairs (a, b) with a = 0 or b = 0 or a = b or both a and b integers.

P Let
Solution. a0 = bac and ai be the binary digits of the fractional part P of a such that a =
a0 + ∞ ai
i=1 2i with a 0 ∈ Z and a i ∈ {0, 1} for i ≥ 1. Similarly, let b = b 0 + ∞ bi
i=1 2i with b0 ∈ Z
and bi ∈ {0, 1} for i ≥ 1. In the case of a non-unique binary expansion, we choose the expansion
ending on infinitely many zeros.
Now choose n = 2k and n = 2k−1 in the given equation. We get the equations
 k
X   k
X 
k k−i k k−i
a 2 b0 + bi 2 = b 2 a0 + ai 2 ,
i=1 i=1
 k−1
X   k−1
X 
k−1 k−i−1 k−1 k−i−1
a 2 b0 + bi 2 = b 2 a0 + ai 2 .
i=1 i=1

The first equation for k = 0 and the difference of the first equation and the doubled second
equation for k ≥ 1 yields
abk = bak (1)
for k ≥ 0.
Now, we consider three cases. If one or both of a and b are zero, then the original equation
is clearly satisfied. If both fractional parts are zero, then both numbers are integers and again,
the original equation is satisfied. So, finally, we consider the case that a, b 6= 0 and that there
is a k ≥ 1 with ak = 1. The equation (1) shows that bk cannot be zero, so we get bk = 1 and
thus from the same equation a = b. This clearly satisfies the original equation. (Of course,
bk = 1 leads to the same conclusion.) Therefore, the solutions are exactly the pairs listed in
the answer.
(Theresia Eisenkölbl)

National Competition—Final Round

29th to 30th May 2019

Problem 13. Determine all functions f : R → R such that

f (2x + f (y)) = x + y + f (x)

for all x, y ∈ R.
(Gerhard Kirchner)
Answer. The only solution is f (x) = x for all x ∈ R.

Solution. We choose x so that the arguments on both sides become equal, i.e. the equation
2x + f (y) = x is satisfied. For this value x = −f (y), we get f (−f (y)) = −f (y) + y + f (−f (y))
and therefore f (y) = y for all y ∈ R. But this is clearly a solution, therefore, it is the only
solution.
(Gerhard Kirchner)

Problem 14. A (convex) trapezoid ABCD shall be called good if it is inscribed, has parallel
sides AB and CD, and CD is shorter than AB. For a good trapezoid, we fix the following
notations.
• The line parallel to AD through B intersects the line CD in S.
12
 • The tangents through S to the circumcircle of the trapezoid meet the circumcircle in E
and F , respectively, where E is on the same side of the line CD as A.

Characterize good trapezoids ABCD (in terms of the side lengths and/or angles of the trapezoid)
for which the angles ∠BSE and ∠F SC are equal. The characterization should be as simple as
possible.
(Walther Janous)

Answer. The angles ∠BSE and ∠F SC are equal if and only if ∠BAD = 60° or AB = AD.

Solution. We denote the circumcircle of the trapezoid by u, the second intersection point of
the line SB with u by T and the centre of u by M , see Figure 4. As the trapezoid is inscribed,
it is isosceles. As ABSD is a parallelogram by construction, we have BS = AD = BC and
DS = AB.
F
D
S
C

A B
M
E
u

T
Figure 4: Problem 14, Case 1: B between S and T

Consider the reflection across the line M S. It clearly maps E and F to each other and maps
u to itself. We say that the trapezoid meets the angle condition if ∠BSE = ∠F SC.
The trapezoid meets the angle condition if and only if the reflection maps the rays SB and
SC to each other. Equivalently, the intersection points of these rays with u are mapped to each
other corresponding to the order of the points on the rays.
We first consider the case that B is between S and T , see Figure 4. Then the trapezoid meets
the angle condition if and only if the reflection maps B and C to each other. Equivalently, the
triangle BSC is isosceles with axis of symmetry SM . As M lies on the perpendicular bisector
of BC in any case, this is equivalent to CS = BS. As BS = BC, this is in turn equivalent to
the triangle BSC being equilateral. Again by BS = BC, this is equivalent to ∠CSB = 60°.
As ABSD is a parallelogram, the trapezoid meets the angle condition in this case if and only
if ∠BAD = 60°.
We now consider the case that T lies between S and B, see Figure 5. Then the above
considerations show that the trapezoid meets the angle condition if and only if the reflection
maps B and D to each other. Equivalently, the triangle BSD is isosceles with axis of symmetry
M S. By the same argument as in the first case, this is equivalent to SB = SD. This is
equivalent to AB = AD.
(Clemens Heuberger)

Problem 15. In the country of Oddland, there are stamps with values 1 cent, 3 cent, 5 cent,
etc., one type for each odd number. The rules of Oddland Postal Services stipulate the following:
for any two distinct values, the number of stamps of the higher value on an envelope must never
exceed the number of stamps of the lower value.

13
 F
D
S
C
u
T

E
M

A B

Figure 5: Problem 14, Case 2: T between S and B

In the country of Squareland, on the other hand, there are stamps with values 1 cent, 4 cent,
9 cent, etc., one type for each square number. Stamps can be combined in all possible ways in
Squareland without additional rules.
Prove for every positive integer n: In Oddland and Squareland there are equally many ways
to correctly place stamps of a total value of n cent on an envelope. Rearranging the stamps on
an envelope makes no difference.
(Stephan Wagner)

Solution. We construct a bijection between possible combinations in Oddland and possible

combinations in Squareland. Suppose we have a combination of Squareland stamps that sum
to n cent, consisting of a1 stamps of value 1 cent, a2 stamps of value 4 cent, . . . , aM stamps of
value M 2 cent, so that
XM
n= k 2 ak .
k=1

Now we express k 2 as − 1) and interchange the order of summation, which yields

Pk
j=1 (2j

X k
M X M
X M
X
n= (2j − 1)ak = (2j − 1) ak .
k=1 j=1 j=1 k=j

This gives us a possible combination of Oddland stamps: By setting bj = ak , we have

PM
k=j

M
X
n= (2j − 1)bj .
j=1

This can be interpreted as a collection of b1 stamps of value 1 cent, b2 stamps of value 3 cent,
. . . , bM stamps of value (2M − 1) cent. We have b1 ≥ b2 ≥ · · · ≥ bM by definition, so this is a
legal combination in Oddland.
Conversely, if a combination in Oddland is given by the values b1 , b2 , . . . , bM , we can use
the identities a1 = b1 − b2 , a2 = b2 − b3 , . . . , aM −1 = bM −1 − bM , aM = bM to recover the
corresponding combination in Squareland. (Note that these values are nonnegative whenever
b1 ≥ b2 ≥ · · · ≥ bM .)
Since these two operations obviously are inverse to one another, we have found a bijection,
which proves the statement.
(Stephan Wagner)
14
Problem 16. Let a, b and c be positive real numbers satisfying a + b + c + 2 = abc.
Prove
(a + 1)(b + 1)(c + 1) ≥ 27.
When does equality occur?
(Karl Czakler)

Answer. Equality occurs if and only if a = b = c = 2.

Solution. We set x = a + 1, y = b + 1 and z = c + 1. Thus we have to show

xyz ≥ 27

subject to
xyz = xy + yz + zx.
From the constraint we get
p
xyz = xy + yz + zx ≥ 3 3 x2 y 2 z 2

by using the inequality between the arithmetic and the geometric means of xy, yz and zx. This
is clearly equivalent to xyz ≥ 27.
Equality occurs if and only if xy = yz = zx, or, equivalently, x = y = z. By the constraint,
this is equivalent to x = y = z = 3 and finally a = b = c = 2.
(Clemens Heuberger)

Problem 17. We are given an arbitrary acute-angled triangle ABC and its altitudes AD and
BE where D and E denote their feet on sides BC and AC, respectively. Let furthermore F
and G be two points on segments AD and BE, respectively, such that
AF BG
= .
FD GE
The line through C and F intersects BE in point H and the line through C and G intersects
AD in point I. Prove that the four points F , G, H and I are concyclic.
(Walther Janous)

Solution. The two right-angled triangles ADC and BEC are inversely similar to each other,
see Figure 6. Here, the sides AD and BE correspond to each other.
But the condition
AF BG
=
FD GE
means: The two points F and G divide the two sides AD and BE, respectively, in equal ratios.
Thus, the two oriented angles ∠DF C and ∠CGE are equal, which implies that the oriented
angles ∠IF H and ∠IGH are equal modulo 180°. Thus the inscribed angle theorem implies
that the four points F , G, H and I are concyclic.
(Walther Janous)

Remark. The solution only uses that ABDE is inscribable.

Problem 18. Determine the smallest possible positive integer n with the following property:
For all positive integers x, y and z with x | y 3 and y | z 3 and z | x3 we also have xyz | (x+y+z)n .
(Gerhard J. Woeginger)
15
 C

D
E
I
H
F
G

A B
Figure 6: Problem 17

Answer. The smallest possible integer with that property is n = 13.

Solution. We note that we have xyz | (x + y + z)n if and only if for each prime p the inequality
vp (xyz) ≤ vp ((x + y + z)n ) holds, where as usual vp (m) denotes the exponent of p in the prime
factorization of m.
Let x, y and z be positive integers with x | y 3 , y | z 3 and z | x3 . Let p be an arbitrary prime,
and w.l.o.g. let the multiplicity of p be lowest in z, that is, vp (z) = min{vp (x), vp (y), vp (z)}.
Then we have vp (x + y + z) ≥ vp (z), and from the divisibility constraints we get vp (x) ≤
3vp (y) ≤ 9vp (z). It follows that

vp (xyz) = vp (x) + vp (y) + vp (z)

≤ 9vp (z) + 3vp (z) + vp (z) = 13vp (z)
≤ 13vp (x + y + z) = vp ((x + y + z)13 ), (2)

which proves that for n = 13 the desired property is satisfied.

It remains to show that this is indeed the smallest possible integer with this property. For
doing so, let n now be a number that has the desired property. By setting (x, y, z) = (p9 , p3 , p1 )
with an arbitrary prime p (in order to achieve that both inequalities in (2) become equalities),
we get

13 = vp (p13 ) = vp (p9 · p3 · p1 ) = vp (xyz)

≤ vp ((x + y + z)n ) = vp ((p9 + p3 + p1 )n ) = n · vp (p(p8 + p2 + 1)) = n,

which yields n ≥ 13.

(Birgit Vera Schmidt, Gerhard Woeginger)

16