1913

1913 1861 1907

1907
1811 1759
1601 1753
1709 1657 1553 1499 1549
1451 1399 1447
1607
1453 1297 1597 1699 1801
1193
1609 1291
1091
1867
1867 1093 1039 1087
1301 1249 937 1187 1289 1493
1697
1559 991
1901
887 883 983 1237
941
881 1033 1543 1901
1663 1303 1097 733 829 1747

Baltic Way 2017

839 787 677 727

19511951
683
631 929 1031
1201 827
1951
577
877 1439

Version: English
523
1613 1459 521 571
673
1151 739 479 421
997 373 419
1511 367 569 773
977 1489
1049 271 269
317 467
619
431 379 823
1409
1871
1871 947 587
433 277
223 167
263 313
1181
1283 1693 1847
1949
163 211
1307 1153 691 173 311 617 1129
1949
1949
113
383
331 227
109 463 719
1051 743 281 229 7371
67 61
59 107 157
821 1231
487 179 127 257
641 2319171311357
2931 2
103 359
283 181 131 7983 37 4143 4753
101 307 461 769 1487
1667 1103 233
137 139
89
97 151
149
409 563
337 199
643 541 439 197 251
613
191 193
797 491
389 239

1873
593 241 457 509
1873
353
293 1229

1973 1361 443 347 349

401
1259 397
557 661
971
647 919
1669 953 547
499
449
503 1279 1433
1823
2003
607 659
1567 599 1021 1741
751 601 1381

2011
1721 853 701
653 709 761
1123
1619 1277 1483
967 1019

1999
757 811 863
1109 809 1637
907 857

2017
859 1069
1009 911 1327
1723 1621 1213 1061 1171 1223 1481
1997
1013
1163 1063 1429
1877
1877 1571 1367
1117
1583 1789
1217 1531
1319 1427
1471 1321
1373
1879
1879 1777 1523 1423
1579
1787 1993
1931
1931 1627 1889
1889

Sorø, November 11th, 2017

1733
1831 1783
1933
1933
1987
1933
1979

Time allowed: 4.5 hours.

During the first 30 minutes, questions may be asked.
Tools for writing and drawing are the only ones allowed.

a n−1 +a n+1
Problem 1. Let a 0 , a 1 , a 2 , ... be an infinite sequence of real numbers satisfying 2 ≥ a n for all positive integers n . Show
that
a 0 + a n +1 a 1 + a 2 + ... + a n
≥
2 n 1

holds for all positive integers n .

Problem 2. Does there exist a finite set of real numbers such that their sum equals 2, the sum of their squares equals 3, the
sum of their cubes equals 4, . . . , and the sum of their ninth powers equals 10?

Problem 3. Positive integers x1 , . . . , xm (not necessarily distinct) are written on a blackboard. It is known that each of the
numbers F1 , . . . , F2018 can be represented as a sum of one or more of the numbers on the blackboard. What is the smallest
possible value of m? 1913
1913 1861
1811 1759
1601
1907
1907
1753
1709 1657 1553 1499 1549
1451 1399 1447

(Here F1 , . . . , F2018 are the first 2018 Fibonacci numbers: F1 = F2 = 1, Fk +1 = Fk + Fk −1 for k > 1.)
1607
1453 1297 1597 1699 1801
1193
1609 1291
1091
1867
1867 1093 1039 1087
1301 1249 937 1187 1289 1493
1697
1559 991
1901
887 883 983 1237
941
881 1033 1543 1901
1663 1303 1097 733 829 1747
839 787 677 727

19511951
683
631 929 1031
1201 827
1951
577
523
877 1439
1613 1459 521 571
673
1151 739 479 421

Baltic
4. A Way
linear2017
997 373 419
1511 367 569 773
977 1489
1049 271 269
317 467
619
431 379 823
1409
1871 1181
1693 1847

Problem
1871

form in k variables is an expression of the form P (x1 , . . . , xk ) = a 1 x1 + . . . + a k xk with real constants

947 587 223 263 313
433 277 167
1283
1949
163 211
1307 1153 691 173 311 617 1129
1949
1949
113
383
331 227
109 463 719
1051 743 281 229 7371
67 61
59 107 157
821 1231
487 179 127 2319171311357 53 103 257
641 2931 2 47 359
283 181 131 79
101 307 461 769 1487
1667
37 4143
1103 233 83
89
97 151
149
409 563
137 139
337 199
643 541 439 197 251
613
191 193
797 491
389 239

1873
593 241 457 509
1873
353
293 1229

1973 1361 443 347 349

401
1259 397
557 661
971
647 919
1669 953 547
449
503 1279 1433

a 1 , . . . , a k . Prove that there exist a positive integer n and linear forms P1 , . . . , Pn in 2017 variables such that the equation
499
1823
2003
607 659
1567 599 1021 1741
751 601 1381

2011
1721 853 701
653 709 761
1123
1619 1277 1483
967 1019

1999
757 811 863
1109 809 1637
907 857

2017
859 1069
1009 911 1327
1723 1621 1213 1061 1171 1223 1481
1997
1013
1163 1063 1429
1877
1877 1571 1367
1117
1583 1789
1217 1531
1319 1427
1471 1321
1373
1879
1879 1777 1523 1423
1579
1787 1993
1931
1931 1627 1889
1889
1733

x1 · x2 · . . . · x2017 = P1 (x1 , . . . , x2017 )2017 + . . . + Pn (x1 , . . . , x2017 )2017

1831 1783
1933
1933
1987
1933
1979

holds for all real numbers x1 , . . . , x2017 .

Solutions to Combinatorics
Problem 5. Find all functions f : R → R such that

f (x 2 y ) = f (x y ) + y f (f (x ) + y )
C1. A solitaire game is played on a 4 ⇥ 4 board of square cells, where fifteen counters have
been
for all real placed,
numbers oneyin
x and . each cell, the sixteenth being empty. Whenever two counters stand on
neighbouring cells (having a common edge), one may jump over the other to the opposite
Problem 6. Fifteen stones are placed on a 4 × 4 board, one in each cell, the remaining cell being empty. Whenever two
stones neighbouring
are on neighbouringcell,cells
provided
(having athis cell isside),
common empty. Thejump
one may counter jumped
over the other toover is removed
the opposite from cell,
neighbouring
provided thethis
board.
cell is empty. The stone jumped over is removed from the board. 1

X Y X

For which
Theinitial
game positions
is wonofwhen
the empty
onlycell
a issingle
it possible to endremains
counter up with exactly
on the oneboard.
stone onWhat
the board?
locations are
Problempossible
7. Eachforedgetheofinitial empty
a complete cellonif30
graph the gameisshould
vertices beeither
coloured winnable?
red or blue. It is allowed to choose a non-
monochromatic triangle and change the colour of the two edges of the same colour to make the triangle monochromatic. 1913
1913 1861 1907
1907

Solution
1811 1759
1601 1753
1709 1657 1553 1499 1549
1451 1399 1447
1607
1453 1297 1597 1699 1801

Prove that by using this operation repeatedly it is possible to make the entire graph monochromatic.
1193
1609 1291
1091
1867
1867 1093 1039 1087
1301 1249 937 1187 1289 1493
1697
1559 991
1901
887 883 983 1237
941
881 1033 1543 1901
1663

ThereBaltic
are three types of cells onvertices
the board: corner cells, edge cells and centre cells. Colour
1303 1097 733
727
829 1747
839 787 677

19511951
683
631 929 1031
1201 827
1951
577
523
877 1439
1613 1459 521 571
673
1151 739 479 421

isWay 2017 - Problem selection

997 373 419
1511 367 569 773
977 1489
1049 271 269
317 467
619

(A complete graph a graph where any two are connected by an edge.)

431 379 823
1409
1871
1871 947 587
433 277
223 167
263 313
1181
1283 1693 1847
1949
163 211
1307 1153 691 173 311 617 1129
1949
1949
113
383
331 227
109 463 719
1051 743 281 229 7371
67 6159 107 157
821 1231
487 127 257
641 179 2319171311357 53 103
2931 2 47 359
283 181 131 79
101 307 461 769 1487
1667
37 4143
1103 233 83
89
97 151
149
409 563
137 139
337 199
643 541 439 197 251
613
191 193
797 491
389 239

1873

the cells in three distinct colours as follows.

593 241 457 509
1873
353
293 1229

1973 1361 443 347 349

401
1259 397
557 661
971
647 919
1669 953 547
499
449
503 1279 1433
1823
2003
607 659
1567 599 1021 1741
751 601 1381

2011
1721 853 701
653 709 761
1123
1619 1277 1483
967 1019

1999
757 811 863
1109 809 1637
907 857

2017move
859 1069
1009 911 1327
1723 1621 1213 1061 1171 1223 1481
1997
1013
1163 1063 1429

Problem 8. A chess knight has injured his leg and is limping. He alternates between a normal move and a short
1877
1877 1571 1367
1117
1583 1789
1217 1531
1319 1427
1471 1321
1373
1879
1879 1777 1523 1423
1579
1787 1993
1931
1931 1627 1889
1889
1733
1831 1783

where he moves to any diagonally neighbouring cell. A B C A

1933
1933
1987
1933
1979

B C A B
C A B C
A B C A

Suppose there are initially a , b , c counters on cells of colours A, B, C, respectively. With

n
each move, one of these numbers will increase by 1, while nthe other two will decrease by 1.
Because there are fourteen moves altogether, the game must end with a , b , c of the same
parity as they originally had. ThereNormal move
are 6, 5, 5 cells Short move
of each colour on the board, so if the 1

gameknight
The limping should endonwith
moves a 5 ×a6 single piece remaining,
cell chessboard starting withthe gamemove.
a normal mustWhat
begin with
is the largest number of moves he
can make if he is starting from a cell of his own choice and is not allowed to visit any cell (including the initial cell) more
than once? a = 6, b = 5, c = 4 or a = 6, b = 4, c = 5.
Problem 9. A positive integer n is Danish if a regular hexagon can be partitioned into n congruent polygons. Prove that
The
there are emptymany
infinitely slot positive
shouldintegers
thus have
n such colour B or
that both C. This
n and 2n + nexcludes the corner cells and two of
are Danish.
the centre cells. However, by symmetry (changing the colouring), the two remaining centre
cells will also be excluded. Hence the empty space
1 at the beginning must be at an edge cell.
That the game is indeed winnable in this case can be seen from the sequence of moves here:
 1913
1913 1861 1907
1907
1811 1759
1601 1753
1709 1657 1553 1499 1549
1451 1399 1447
1607
1453 1297 1597 1699 1801
1193
1609 1291
1091
1867
1867 1093 1039 1087
1301 1249 937 1187 1289 1493
1697
1559 991
1901
887 883 983 1237
941
881 1033 1543 1901
1663 1303 1097 733 829 1747
839 787 677 727

19511951
683
631 929 1031
1201 827
1951
577
877 1439

Version: English
523
1613 1459 521 571
673
1151 739 479 421
997 373 419
1511 367 569 773
977 1489
1049 271 269
317 467
619
431 379 823
1409
1871
1871 947 587
433 277
223 167
263 313
1181
1283 1693 1847
1949
163 211
1307 1153 691 173 311 617 1129
1949
1949
113
383
331 227
109 463 719
1051 743 281 229 7371
67 61
59 107 157
821 1231
487 179 127 257
641 2319171311357
2931 2
103 359
283 181 131 7983 37 4143 4753
101 307 461 769 1487
1667 1103 233
137 139
89
97 151
149
409 563
337 199
643 541 439 197 251
613
191 193
797 491
389 239

1873
593 241 457 509
1873
353
293 1229

1973 1361 443 347 349

401
1259 397
557 661
971
647 919
1669 953 547
499
449
503 1279 1433
1823
2003
607 659
1567 599 1021 1741
751 601 1381

2011
1721 853 701
653 709 761
1123
1619 1277 1483
967 1019

1999
757 811 863
1109 809 1637
907 857

2017
859 1069
1009 911 1327
1723 1621 1213 1061 1171 1223 1481
1997
1013
1163 1063 1429
1877
1877 1571 1367
1117
1583 1789
1217 1531
1319 1427
1471 1321
1373
1879
1879 1777 1523 1423
1579
1787 1993
1931
1931 1627 1889
1889
1733
1831 1783
1933
1933
1987
1933
1979

Problem 10. Maker and Breaker are building a wall. Maker has a supply of green cubical building blocks, and Breaker has
a supply of red ones, all of the same size. On the ground, a row of m squares has been marked in chalk as place-holders.
Maker and Breaker now take turns in placing a block either directly on one of these squares, or on top of another block
already in place, in such a way that the height of each column never exceeds n . Maker places the first block.
Maker bets that he can form a green row, i.e. all m blocks at a certain height are green. Breaker bets that he can prevent
Maker from achieving this. Determine all pairs (m, n ) of positive integers for which Maker can make sure he wins the bet.

Problem 11. Let H and I be the orthocentre and incentre, respectively, of an acute angled triangle AB C . The circumcircle
1

of the triangle B C I intersects the segment AB at the point P different from B . Let K be the projection of H onto AI and
Q the reflection of P in K . Show that B , H and Q are collinear.

Problem 12. Line ` touches circle S1 in the point X and circle S2 in the point Y . We draw a line m which is parallel to ` and
intersects S1 in a point P and S2 in a point Q . Prove that the ratio X P /Y Q does not depend on the choice of m.

Problem 13. Let AB C be a triangle in which ∠AB C = 60◦ . Let I and O be the incentre and circumcentre of AB C , respec-
tively. Let M be the midpoint of the arc B C of the circumcircle of AB C , which does not contain the point A. Determine
∠B AC given that M B = O I .

Problem 14. Let P be a point inside the acute angle ∠B AC . Suppose that ∠AB P = ∠AC P = 90◦ . The points D and E are
on the segments B A and C A, respectively, such that B D = B P and C P = C E . The points F and G are on the segments AC
and AB , respectively, such that D F is perpendicular to AB and E G is perpendicular to AC . Show that P F = P G .

Problem 15. Let n ≥ 3 be an integer. What is the largest possible number of interior angles greater than 180◦ in an n -gon
in the plane, given that the n -gon does not intersect itself and all its sides have the same length?

Problem 16. Is it possible for any group of people to choose a positive integer N and assign a positive integer to each
person in the group such that the product of two persons’ numbers is divisible by N if and only if they are friends?

Problem 17. Determine whether the equation

x4 + y 3 = z!+7
has an infinite number of solutions in positive integers.
p −1
Problem 18. Let p > 3 be a prime and let a 1 , a 2 , . . . , a p −1 be a permutation of 1, 2, . . . , 2 . For which p is it always possible
2
p −1
to determine the sequence a 1 , a 2 , . . . , a p −1 if for all i , j ∈ {1, 2, . . . , 2 } with i 6= j the residue of a i a j modulo p is known?
2

Problem 19. For an integer n ≥ 1 let a (n ) denote the total number of carries which arise when adding 2017 and n · 2017.
The first few values are given by a (1) = 1, a (2) = 1, a (3) = 0, which can be seen from the following:

001 001 000

2017 4034 6051
+2017 +2017 +2017
=4034 =6051 =8068

Prove that
102017 − 1
a (1) + a (2) + . . . + a (102017 − 2) + a (102017 − 1) = 10 · .
9
Problem 20. Let S be the set of all ordered pairs (a , b ) of integers with 0 < 2a < 2b < 2017 such that a 2 + b 2 is a multiple of
2017. Prove that X 1 X
a = b.
(a ,b )∈S
2 (a ,b )∈S