Subcontests
(20)divisibility with condition on lcm
Let n≥2 be an integer. Given numbers a1,a2,…,an∈{1,2,3,…,2n} such that lcm(ai,aj)>2n for all 1≤i<j≤n, prove that
a1a2…an∣(n+1)(n+2)…(2n−1)(2n). Largest number of primes
Distinct positive integers a,b,c,d satisfy
⎩⎨⎧a∣b2+c2+d2,b∣a2+c2+d2,c∣a2+b2+d2,d∣a2+b2+c2,
and none of them is larger than the product of the three others. What is the largest possible number of primes among them?
John and a string of paper
John has a string of paper where n real numbers ai∈[0,1], for all i∈{1,…,n}, are written in a row.
Show that for any given k<n, he can cut the string of paper into non-empty k pieces, between adjacent numbers, in such a way that the sum of the numbers on each piece does not differ from any other sum by more than 1. Stone on hexagonal board
Let n>2 be an integer. Anna, Edda and Magni play a game on a hexagonal board tiled with regular hexagons, with n tiles on each side. The figure shows a board with 5 tiles on each side. The central tile is marked.
[asy]unitsize(.25cm);
real s3=1.73205081;
pair[] points={(-4,4*s3),(-2,4*s3),(0,4*s3),(2,4*s3),(4,4*s3),(-5,3*s3), (-3,3*s3), (-1,3*s3), (1,3*s3), (3,3*s3), (5,3*s3), (-6,2*s3),(-4,2*s3), (-2,2*s3), (0,2*s3), (2,2*s3), (4,2*s3),(6,2*s3),(-7,s3), (-5,s3), (-3,s3), (-1,s3), (1,s3), (3,s3), (5,s3),(7,s3),(-8,0), (-6,0), (-4,0), (-2,0), (0,0), (2,0), (4,0), (6,0), (8,0),(-7,-s3),(-5,-s3), (-3,-s3), (-1,-s3), (1,-s3), (3,-s3), (5,-s3), (7,-s3), (-6,-2*s3), (-4,-2*s3), (-2,-2*s3), (0,-2*s3), (2,-2*s3), (4,-2*s3), (6,-2*s3), (-5,-3*s3), (-3,-3*s3), (-1,-3*s3), (1,-3*s3), (3,-3*s3), (5,-3*s3), (-4,-4*s3), (-2,-4*s3), (0,-4*s3), (2,-4*s3), (4,-4*s3)};void draw_hexagon(pair p)
{
draw(shift(p)*scale(2/s3)*(dir(30)--dir(90)--dir(150)--dir(210)--dir(270)--dir(330)--dir(30)));
}
{for (int i=0;i<61;++i){draw_hexagon(points);}}
label((0,0), "\Large ∗");
[/asy]
The game begins with a stone on a tile in one corner of the board. Edda and Magni are on the same team, playing against Anna, and they win if the stone is on the central tile at the end of any player's turn. Anna, Edda and Magni take turns moving the stone: Anna begins, then Edda, then Magni, then Anna, and so on.The rules for each player's turn are:[*] Anna has to move the stone to an adjacent tile, in any direction.
[*] Edda has to move the stone straight by two tiles in any of the 6 possible directions.
[*] Magni has a choice of passing his turn, or moving the stone straight by three tiles in any of the 6 possible directions.Find all n for which Edda and Magni have a winning strategy.
Existence of indices
Let n be a positive integer and t be a non-zero real number. Let a1,a2,…,a2n−1 be real numbers (not necessarily distinct). Prove that there exist distinct indices i1,i2,…,in such that, for all 1≤k,l≤n, we have aik−ail=t.