Daily

Random

Practice set

Baltic Way 2018 · Problem 6

Combinatorics

Let nn be a positive integer. Elfie the Elf travels in R3\mathbb{R}^{3}. She starts at the origin: (0,0,0)(0,0,0). In each turn she can teleport to any point with integer coordinates which lies at distance exactly n\sqrt{n} from her current location. However, teleportation is a complicated procedure. Elfie starts off normal but she turns strange with her first teleportation. Next time she teleports she becomes normal again, then strange again... etc.

For which nn can Elfie travel to any given point with integer coordinates and be normal when she gets there?

Change pool

When you’re ready

Review material becomes available with the next Daily.

Review

Topics

Colorings and configurations · Pigeonhole and extremal arguments · Invariants and monovariants

Solutions

Solution

Answer: there are no such nn. We colour all the points in Z3\mathbb{Z}^3 white and black: The point (x,y,z)(x, y, z) is colored white if x+y+z≡20x+y+z \equiv_2 0 and black if x+y+z≡21x + y + z \equiv_2 1. After the first move Elfie is at a point (a,b,c)(a, b, c) where a2+b2+c2=na^2 + b^2 + c^2 = n. Thus, a+b+c≡2na + b + c \equiv_2 n Now, if nn is even then (a,b,c)(a, b, c) is white. Thus, in that case Elfie only jumps between white points. On the other hand, if nn is odd, then (a,b,c)(a, b, c) is certainly black. And one can easily see that Elfie alternates between black and white squares after each move. But since Elfie is normal after even number of moves, and is then on a white point, she can never reach any black point being normal. Thus, there no nn such that Elfie can travel to any given point and be normal when she gets there.

Contest context

Results from Baltic Way 2018

11 teams

Mean score
3.6 / 5
Scores of 4 or 5
8 / 11
Estonia
5 / 5

Score distribution

03
10
20
30
40
58
All team scores
TeamScore
Germany5 / 5
St. Petersburg5 / 5
Denmark5 / 5
Estonia5 / 5
Sweden5 / 5
Norway5 / 5
Lithuania5 / 5
Finland0 / 5
Latvia0 / 5
Poland5 / 5
Iceland0 / 5