On a line a set of segments is given of total length less than $n$. Prove that every set of $n$ points of the line can be translated in some direction along the line for a distance smaller than $\frac{n}{2}$ so that none of the points remain on the segments.

In a village there are only $10$ houses, arranged in a circle of a radius $r$ meters. Each has is the same distance from each of the two closest houses. Every year on Sunday of Pascoa, the village priest makes the Easter visit, leaving the parish house (point $A$) and following the path described in Figure 1. This year the priest decided to take the path represented in the Figure 2. Prove that this year the priest will walk another $10r$ meters. [img]https://cdn.artofproblemsolving.com/attachments/a/9/a6315f4a63f28741ca6fbc75c19a421eb1da06.png[/img]

Find the largest integer $k$ with the following property: Whenever real numbers $x_1,x_2,\dots,x_{2024}$ satisfy \[x_1^2=(x_1+x_2)^2=\dots=(x_1+x_2+\dots+x_{2024})^2,\] at least $k$ of them are equal.

Find all functions $g : R \to R$, for which there exists a strictly increasing function $f : R \to R$ such that $f(x + y) = f(x)g(y) + f(y)$.

Let $ABCD$ to be a quadrilateral inscribed in a circle $\Gamma$. Let $r$ and $s$ to be the tangents to $\Gamma$ through $B$ and $C$, respectively, $M$ the intersection between the lines $r$ and $AD$ and $N$ the intersection between the lines $s$ and $AD$. After all, let $E$ to be the intersection between the lines $BN$ and $CM$, $F$ the intersection between the lines $AE$ and $BC$ and $L$ the midpoint of $BC$. Prove that the circuncircle of the triangle $DLF$ is tangent to $\Gamma$.

Compute \[ \displaystyle\prod_{n=0}^{\infty} \left( 1 - \left( \frac {1}{2} \right)^{3^n} + \left( \frac {1}{4} \right)^{3^n} \right). \]

Let $n$ be a positive integer. A 4-by-$n$ rectangle is divided into $4n$ unit squares in the usual way. Each unit square is colored black or white. Suppose that every white unit square shares an edge with at least one black unit square. Prove that there are at least $n$ black unit squares.

Marisela is putting on a juggling show! She starts with $1$ ball, tossing it once per second. Lawrence tosses her another ball every five seconds, and she always tosses each ball that she has once per second. Compute the total number of tosses Marisela has made one minute after she starts juggling.

Let $f = (f_1, f_2)$ be a function from $\mathbb{R}^2$ to $\mathbb{R}^2$ with continuous partial derivatives $\tfrac{\partial f_i}{\partial x_j}$ that are positive everywhere. Suppose that \[\frac{\partial f_1}{\partial x_1} \frac{\partial f_2}{\partial x_2} - \frac{1}{4} \left(\frac{\partial f_1}{\partial x_2} + \frac{\partial f_2}{\partial x_1} \right)^2 > 0\] everywhere. Prove that $f$ is one-to-one.

Five equally skilled tennis players named Allen, Bob, Catheryn, David, and Evan play in a round robin tournament, such that each pair of people play exactly once, and there are no ties. In each of the ten games, the two players both have a 50% chance of winning, and the results of the games are independent. Compute the probability that there exist four distinct players $P_1$, $P_2$, $P_3$, $P_4$ such that $P_i$ beats $P_{i+1}$ for $i=1, 2, 3, 4$. (We denote $P_5=P_1$).

Find all integers $c$ such that the equation $(2a+b) (2b+a) =5^c$ has integer solutions.

Given a finite number of boys and girls, a [i]sociable set of boys[/i] is a set of boys such that every girl knows at least one boy in that set; and a [i]sociable set of girls[/i] is a set of girls such that every boy knows at least one girl in that set. Prove that the number of sociable sets of boys and the number of sociable sets of girls have the same parity. (Acquaintance is assumed to be mutual.) [i](Poland) Marek Cygan[/i]

Prove that the product of five consecutive positive integers cannot be the square of an integer.

In convex quadrilateral $ ABCD$, $ AB \equal{} BC$ and $ AD \equal{} DC$. Point $ E$ lies on segment $ AB$ and point $ F$ lies on segment $ AD$ such that $ B$, $ E$, $ F$, $ D$ lie on a circle. Point $ P$ is such that triangles $ DPE$ and $ ADC$ are similar and the corresponding vertices are in the same orientation (clockwise or counterclockwise). Point $ Q$ is such that triangles $ BQF$ and $ ABC$ are similar and the corresponding vertices are in the same orientation. Prove that points $ A$, $ P$, $ Q$ are collinear.

Calculate the sum of vector products $[[x, y], z] + [[y, z], x] + [[z, x], y]$

Suppose $S$ is a subset of $\{1, 2, 3, 4, 5, 6, 7\}$. How many different possible values are there for the product of the elements in $S$?

$(SWE 6)$ Prove that there are infinitely many positive integers that cannot be expressed as the sum of squares of three positive integers.

In a group of $90$ children each has at least $30$ friends (friendship is mutual). Prove that they can be divided into three $30$-member groups so that each child has its own a group of at least one friend.

Let $ABC$ be triangle with $A<B<C$ and inscribed in a circle $(O)$. On the minor arc $ABC$ of $(O)$ and does not contain point $A$, choose an arbitrary point $D$. Suppose $CD$ meets $AB$ at $E$ and $BD$ meets $AC$ at $F$. Let $O_1$ be the incenter of triangle $EBD$ touches with $EB,ED$ and tangent to $(O)$. Let $O_2$ be the incenter of triangle $FCD$, touches with $FC,FD$ and tangent to $(O)$. a) $M$ is a tangency point of $O_1$ with $BE$ and $N$ is a tangency point of $O_2$ with $CF$. Prove that the circle with diameter $MN$ has a fixed point. b) A line through $M$ is parallel to $CE$ meets $AC$ at $P$, a line through $N$ is parallel to $BF$ meets $AB$ at $Q$. Prove that the circumcircles of triangles $(AMP),(ANQ)$ are all tangent to a fixed circle.

We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n},\] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof. Prove that $F_{n-1}F_{n}F_{n+1}L_{n-1}L_{n}L_{n+1}(n \geq 2)$ is not a perfect square.

For all integers $x,y,z$, let \[S(x,y,z) = (xy - xz, yz-yx, zx - zy).\] Prove that for all integers $a$, $b$ and $c$ with $abc>1$, and for every integer $n\geq n_0$, there exists integers $n_0$ and $k$ with $0<k\leq abc$ such that \[S^{n+k}(a,b,c) \equiv S^n(a,b,c) \pmod {abc}.\] ($S^1 = S$ and for every integer $m\geq 1$, $S^{m+1} = S \circ S^m.$ $(u_1, u_2, u_3) \equiv (v_1, v_2, v_3) \pmod M \Longleftrightarrow u_i \equiv v_i \pmod M (i=1,2,3).$)

A sequence $(a_n)$ positive integers is determined by equalities $a_1=20,a_2=22$ and $a_{n+1}=4a_n^2+5a_{n-1}^3$ for all $n \geq 2$. Find the maximum power of two which divides $a_{2023}$.

The polygon enclosed by the solid lines in the figure consists of $ 4$ congruent squares joined edge-to-edge. One more congruent square is attached to an edge at one of the nine positions indicated. How many of the nine resulting polygons can be folded to form a cube with one face missing? [asy]unitsize(10mm); defaultpen(fontsize(10pt)); pen finedashed=linetype("4 4"); filldraw((1,1)--(2,1)--(2,2)--(4,2)--(4,3)--(1,3)--cycle,grey,black+linewidth(.8pt)); draw((0,1)--(0,3)--(1,3)--(1,4)--(4,4)--(4,3)-- (5,3)--(5,2)--(4,2)--(4,1)--(2,1)--(2,0)--(1,0)--(1,1)--cycle,finedashed); draw((0,2)--(2,2)--(2,4),finedashed); draw((3,1)--(3,4),finedashed); label("$1$",(1.5,0.5)); draw(circle((1.5,0.5),.17)); label("$2$",(2.5,1.5)); draw(circle((2.5,1.5),.17)); label("$3$",(3.5,1.5)); draw(circle((3.5,1.5),.17)); label("$4$",(4.5,2.5)); draw(circle((4.5,2.5),.17)); label("$5$",(3.5,3.5)); draw(circle((3.5,3.5),.17)); label("$6$",(2.5,3.5)); draw(circle((2.5,3.5),.17)); label("$7$",(1.5,3.5)); draw(circle((1.5,3.5),.17)); label("$8$",(0.5,2.5)); draw(circle((0.5,2.5),.17)); label("$9$",(0.5,1.5)); draw(circle((0.5,1.5),.17));[/asy] $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$

Let $\mathbb{Z}$ be the set of integers. Determine, with proof, all primes $p$ for which there exists a function $f:\mathbb{Z}\to\mathbb{Z}$ such that for any integer $x,$ $\quad \bullet \ f(x+p)=f(x)\text{ and}$ $\quad \bullet \ p \text{ divides } f(x+f(x))-x.$

Find the three-digit positive integer $n$ for which $\binom n3 \binom n4 \binom n5 \binom n6 $ is a perfect square.