Consider the following one-player game on an infinite chessboard. If two horizontally or vertically adjacent squares are occupied by a pawn each, and a square on the same line that is adjacent to one of them is empty, then it is allowed to remove the two pawns and place a pawn on the third (empty) square. Prove that if in the initial position all the pawns were forming a rectangle with the number of squares divisible by $3$, then it is not possible to end the game with only one pawn left on the board.

Let $n$ be a product of 2024 different prime numbers. Find the number of positive integers $k$, such that $$n+gcd(n, k)=k.$$

Prove that $$AB + PQ + QR + RP \le AP + AQ + AR + BP + BQ + BR$$ where $A, B, P, Q$ and $R $ are any five points in a plane.

Let $t(n)$ be the sum of the digits in the binary representation of a positive integer $n,$ and let $k \geq 2$ be an integer. [b]a.[/b] Show that there exists a sequence $(a_i)_{i=1}^{\infty}$ of integers such that $a_m \geq 3$ is an odd integer and $t(a_1a_2 \cdots a_m)=k$ for all $m \geq 1.$ [b]b.[/b] Show that there is an integer $N$ such that $t(3 \cdot 5 \cdots (2m+1))>k$ for all integers $m \geq N.$

Convex hexagon $ABCDEF$ is drawn in the plane such that $ACDF$ and $ABDE$ are parallelograms with area 168. $AC$ and $BD$ intersect at $G$. Given that the area of $AGB$ is 10 more than the area of $CGB$, find the smallest possible area of hexagon $ABCDEF$.

Determine all squarefree positive integers $n\geq 2$ such that \[\frac{1}{d_1}+\frac{1}{d_2}+\cdots+\frac{1}{d_k}\]is a positive integer, where $d_1,d_2,\ldots,d_k$ are all the positive divisors of $n$.

Prove that $a^3 + b^3 + c^3 + abc +a^{3}b^{2}c^{-1}+a^{3}c^{2}b^{-1}+b^{3}a^{2}c^{-1}+b^{3}c^{2}a^{-1}+c^{3}a^{2}b^{-1}+c^{3}b^{2}a^{-1}+a^{5}b^{3}c^{-3}+ abc^{14} + a^{5}c^{3}b^{-3}+b^{5}a^{3}c^{-3}+b^{5}c^{3}a^{-3}+c^{5}a^{3}b^{-3}+c^{5}b^{3}a^{-3}+a^{6}b^{1}c^{-1}+a^{6}c^{1}b^{-1}+b^{6}a^{1}c^{-1}+b^{6}c^{1}a^{-1}+c^{6}a^{1}b^{-1}+c^{6}b^{1}a^{-1}+ a^{6}b^{4}c^{-3}+a^{6}c^{4}b^{-3}+b^{6}a^{4}c^{-3}+b^{6}c^{4}a^{-3}+c^{6}a^{4}b^{-3}+c^{6}b^{4}a^{-3}+a^{7}b^{2}c^{-1}+a^{7}c^{2}b^{-1}+b^{7}a^{2}c^{-1}+b^{7}c^{2}a^{-1}+c^{7}a^{2}b^{-1}+ abc + a^{14}bc + c^{7}b^{2}a^{-1}+a^{4}b^{1}c^{4}+a^{4}c^{1}b^{4}+b^{4}a^{1}c^{4}+b^{4}c^{1}a^{4}+c^{4}a^{1}b^{4}+c^{4}b^{1}a^{4}+a^{6}c^{4}+a^{6}b^{4}+b^{6}c^{4}+b^{6}a^{4}+c^{6}b^{4}+c^{6}a^{4}+a^{9}b^{6}c^{-4}+a^{9}c^{6}b^{-4}+ ab^{14}c + b^{9}a^{6}c^{-4}+b^{9}c^{6}a^{-4}+c^{9}a^{6}b^{-4}+ abc + c^{9}b^{6}a^{-4}+a^{12}b^{1}c^{-1}+a^{12}c^{1}b^{-1}+b^{12}a^{1}c^{-1}+b^{12}c^{1}a^{-1}+c^{12}a^{1}b^{-1}+ c^5 b^5 a^5 - c^5 b^5 a^2 + 3 c^5 b^5 - c^5 b^2 a^5 + c^5 b^2 a^2 - 3 c^5 b^2 + 3 c^5 a^5 - 3 c^5 a^2 + 9 c^5 - c^2 b^5 a^5 + c^2 b^5 a^2 - 3 c^2 b^5 + c^2 b^2 a^5 - c^2 b^2 a^2 + 3 c^2 b^2 - 3 c^2 a^5 + 3 c^2 a^2 - 9 c^2 + 3 b^5 a^5 - 3 b^5 a^2 + 9 b^5 - 3 b^2 a^5 + 3 b^2 a^2 - 9 b^2 + 9 a^5 - 9 a^2 + 27 + c^{12}b^{1}a^{-1}+a^{13}b^{9}c^{-9}+a^{13}c^{9}b^{-9}+b^{13}a^{9}c^{-9}+b^{13}c^{9}a^{-9}+c^{13}a^{9}b^{-9}+c^{13}b^{9}a^{-9}+a^{12}b^{11}c^{-9}+a^{12}c^{11}b^{-9}+b^{12}a^{11}c^{-9}+b^{12}c^{11}a^{-9}+c^{12}a^{11}b^{-9}+c^{12}b^{11}a^{-9}+a^{8}b^{7}+a^{8}c^{7}+b^{8}a^{7}+b^{8}c^{7}+c^{8}a^{7}+c^{8}b^{7} + a^{16} + b^{16} + c^{16} + a^{16} + b^{16} + c^{16} + a^{16} + b^{16} + c^{16}\ge c^3 + 3 c^2 a + 3 c b^2 + 6 c b a + b^3 + 3 b^2 a + a^3 + a^{1}c^{2}+a^{1}b^{2}+4b^{1}c^{2}+4b^{1}a^{2}+c^{1}b^{2}+4c^{1}a^{2}+a^{1}c^{3}+a^{1}b^{3}+b^{1}c^{3}+b^{1}a^{3}+c^{1}b^{3}+c^{1}a^{3}+a^{3}b^{2}+a^{3}c^{2}+b^{3}a^{2}+b^{3}c^{2}+c^{3}a^{2}+c^{3}b^{2}+a^{5}c^{1}+a^{5}b^{1}+b^{5}c^{1}+b^{5}a^{1}+c^{5}b^{1}+c^{5}a^{1}+a^{2}b^{1}c^{4}+a^{2}c^{1}b^{4}+b^{2}a^{1}c^{4}+b^{2}c^{1}a^{4}+c^{2}a^{1}b^{4}+c^{2}b^{1}a^{4}+a^{1}c^{7}+a^{1}b^{7}+b^{1}c^{7}+b^{1}a^{7}+c^{1}b^{7}+c^{1}a^{7}+a^{1}c^{8}+a^{1}b^{8}+b^{1}c^{8}+b^{1}a^{8}+c^{1}b^{8}+c^{1}a^{8}+a^{5}b^{1}c^{4}+a^{5}c^{1}b^{4}+b^{5}a^{1}c^{4}+b^{5}c^{1}a^{4}+c^{5}a^{1}b^{4}+c^{5}b^{1}a^{4}+a^{2}b^{1}c^{8}+a^{2}c^{1}b^{8}+b^{2}a^{1}c^{8}+b^{2}c^{1}a^{8}+c^{2}a^{1}b^{8}+c^{2}b^{1}a^{8}+a^{1}c^{11}+a^{1}b^{11}+b^{1}c^{11}+b^{1}a^{11}+c^{1}b^{11}+c^{1}a^{11}+a^{6}b^{2}c^{5}+a^{6}c^{2}b^{5}+b^{6}a^{2}c^{5}+b^{6}c^{2}a^{5}+c^{6}a^{2}b^{5}+c^{6}b^{2}a^{5}+a^{3}b^{2}c^{9}+a^{3}c^{2}b^{9}+b^{3}a^{2}c^{9}+b^{3}c^{2}a^{9}+c^{3}a^{2}b^{9}+c^{3}b^{2}a^{9}+a^{3}b^{1}c^{11}+a^{3}c^{1}b^{11}+b^{3}a^{1}c^{11}+b^{3}c^{1}a^{11}+c^{3}a^{1}b^{11}+c^{3}b^{1}a^{11} + a^{15}b + ab^{15} + a^{15}c + ac^{15} + b^{15}c + bc^{15} + a^{15}b + ab^{15} + a^{15}c + ac^{15} + b^{15}c + bc^{15}+c^{2}a^{1}b^{4}+c^{2}b^{1}a^{4}+a^{1}c^{7}+a^{1}b^{7}+b^{1}c^{7}+b^{1}a^{7}+c^{1}b^{7}+c^{1}a^{7}+a^{1}c^{8}+a^{1}b^{8}+b^{1}c^{8}+b^{1}a^{8}+c^{1}b^{8}+c^{1}a^{8}+a^{5}b^{1}c^{4}+a^{5}c^{1}b^{4}+b^{5}a^{1}c^{4}+b^{5}c^{1}a^{4}+c^{5}a^{1}b^{4}+c^{5}b^{1}a^{4}+a^{2}b^{1}c^{8}+a^{2}c^{1}b^{8}+b^{2}a^{1}c^{8}+b^{2}c^{1}a^{8}+c^{2}a^{1}b^{8}+c^{2}b^{1}a^{8}+a^{1}c^{11}+a^{1}b^{11}+b^{1}c^{11}+b^{1}a^{11}+c^{1}b^{11}+c^{1}a^{11}+a^{6}b^{2}c^{5}+a^{6}c^{2}b^{5}+b^{6}a^{2}c^{5}+b^{6}c^{2}a^{5}+c^{6}a^{2}b^{5}+c^{6}b^{2}a^{5}+a^{3}b^{2}c^{9}+a^{3}c^{2}b^{9}+b^{3}a^{2}c^{9}+b^{3}c^{2}a^{9}+c^{3}a^{2}b^{9}+c^{3}b^{2}a^{9}+a^{3}b^{1}c^{11}+a^{3}c^{1}b^{11}+b^{3}a^{1}c^{11}+b^{3}c^{1}a^{11}+c^{3}a^{1}b^{11}+c^{3}b^{1}a^{11} + a^{15}b + ab^{15} + a^{15}c + ac^{15} + b^{15}c + bc^{15} + a^{15}b + ab^{15} + a^{15}c + ac^{15} + b^{15}c + bc^{15}$ for all $a,b,c\in\mathbb R^+$. [i]Proposed by Henry Jiang and C++[/i]

Find all integers $x$ and $y$ such that $2^x+1=y^2$

There are $1 000 000$ soldiers in a line. The sergeant splits the line into $100$ segments (the length of different segments may be different) and permutes the segments (not changing the order of soldiers in each segment) forming a new line. The sergeant repeats this procedure several times (splits the new line in segments of the same lengths and permutes them in exactly the same way as the first time). Every soldier originally from the first segment recorded the number of performed procedures that took him to return to the first segment for the first time. Prove that at most $100$ of these numbers are different.

In a quadrilateral $ABCD$ the intersection of the diagonals is called $P$. Point $X$ is the orthocentre of triangle $PAB$. (The orthocentre of a triangle is the point where the three altitudes of the triangle intersect.) Point $Y$ is the orthocentre of triangle $PCD$. Suppose that $X$ lies inside triangle $PAB$ and $Y$ lies inside triangle $PCD$. Moreover, suppose that $P$ is the midpoint of line segment $XY$ . Prove that $ABCD$ is a parallelogram. [asy] import geometry; unitsize (1.5 cm); pair A, B, C, D, P, X, Y; A = (0,0); B = (2,-0.5); C = (3.5,2.2); D = A + C - B; P = (A + C)/2; X = orthocentercenter(A,B,P); Y = orthocentercenter(C,D,P); draw(A--B--C--D--cycle); draw(A--C); draw(B--D); draw(A--extension(A,X,B,P), dotted); draw(B--extension(B,X,A,P), dotted); draw(P--extension(P,X,A,B), dotted); draw(C--extension(C,Y,D,P), dotted); draw(D--extension(D,Y,C,P), dotted); draw(P--extension(P,Y,C,D), dotted); dot("$A$", A, W); dot("$B$", B, S); dot("$C$", C, E); dot("$D$", D, N); dot("$P$", P, E); dot("$X$", X, NW); dot("$Y$", Y, SE); [/asy]

Terence Tao is playing rock-paper-scissors. Because his mental energy is focused on solving the twin primes conjecture, he uses the following very simple strategy:    ·He plays rock first.    ·On each subsequent turn, he plays a different move than the previous one, each with probability ½. What is the probability that his 5th move will be rock?

Prove that there exist infinitely many odd positive integers $n$ for which the number $2^n + n$ is composite. (V Senderov)

Rachel has $3$ children, all of which are at least $2$ years old. The ages of the children are all pairwise relatively prime, but Rachel’s age is a multiple of each of her children’s ages. What is Rachel’s minimum possible age?

Let $C$ be a (probably infinite) family of subsets of $\mathbb{N}$ such that for every chain $C_{1}\subset C_{2}\subset \ldots$ of members of $C$, there is a member of $C$ containing all of them. Show that there is a member of $C$ such that no other member of $C$ contains it!

[asy]draw((0,0)--(0,6)--(8,6)--(8,3)--(4,3)--(4,0)--cycle); label("6",(0,3),W); label("8",(4,6),N);[/asy] Given that all angles shown are marked, the perimeter of the polygon shown is \[ \textbf{(A)}\ 14 \qquad \textbf{(B)}\ 20 \qquad \textbf{(C)}\ 28 \qquad \textbf{(D)}\ 48 \qquad \textbf{(E)}\ \text{cannot be determined from the information given} \qquad \]

For a positive integer $n$, let $p(n)$ denote the smallest prime divisor of $n$. Find the maximum number of divisors $m$ can have if $p(m)^4>m$.

On Andover's campus, Graves Hall is $60$ meters west of George Washington Hall, and George Washington Hall is $80$ meters north of Paresky Commons. Jessica wants to walk from Graves Hall to Paresky Commons. If she first walks straight from Graves Hall to George Washington Hall and then walks straight from George Washington Hall to Paresky Commons, it takes her $8$ minutes and $45$ seconds while walking at a constant speed. If she walks with the same speed directly from Graves Hall to Paresky Commons, how much time does she save, in seconds? [i]Proposed by Nathan Xiong[/i]