There are ten coins a line, which are indistinguishable. It is known that two of them are false and have consecutive positions on the line. For each set of positions, you may ask how many false coins it contains. Is it possible to identify the false coins by making only two of those questions, without knowing the answer to the first question before making the second?

A four-element set $\{a, b, c, d\}$ of positive integers is called [i]good[/i] if there are two of them such that their product is a mutiple of the greatest common divisor of the remaining two. For example, the set $\{2, 4, 6, 8\}$ is good since the greatest common divisor of $2$ and $6$ is $2$, and it divides $4\times 8=32$. Find the greatest possible value of $n$, such that any four-element set with elements less than or equal to $n$ is good. [i]Proposed by Victor and Isaías de la Fuente[/i]

Let $ a_1$, $ a_2$, ..., $ a_n$ and $ b_1$, $ b_2$, ..., $ b_n$ be $ 2 \cdot n$ real numbers. Prove that the following two statements are equivalent: [b]i)[/b] For any $ n$ real numbers $ x_1$, $ x_2$, ..., $ x_n$ satisfying $ x_1 \leq x_2 \leq \ldots \leq x_ n$, we have $ \sum^{n}_{k \equal{} 1} a_k \cdot x_k \leq \sum^{n}_{k \equal{} 1} b_k \cdot x_k,$ [b]ii)[/b] We have $ \sum^{s}_{k \equal{} 1} a_k \leq \sum^{s}_{k \equal{} 1} b_k$ for every $ s\in\left\{1,2,...,n\minus{}1\right\}$ and $ \sum^{n}_{k \equal{} 1} a_k \equal{} \sum^{n}_{k \equal{} 1} b_k$.

A rectangular box has width $12$ inches, length $16$ inches, and height $\tfrac{m}{n}$ inches, where $m$ and $n$ are relatively prime positive integers. Three faces of the box meet at a corner of the box. The center points of those three faces are the vertices of a triangle with an area of $30$ square inches. Find $m+n$.

Introduce a standard scalar product in $\mathbb{R}^4.$ Let $V$ be a partial vector space in $\mathbb{R}^4$ produced by $\left( \begin{array}{c} 1 \\ -1 \\ -1 \\ 1 \end{array} \right),\left( \begin{array}{c} 1 \\-1 \\ 1 \\ -1 \end{array} \right).$ Find a pair of base of orthogonal complement $W$ for $V$ in $\mathbb{R}^4.$

Let $H{}$ be the orthocenter of the triangle $ABC{}$ and $X{}$ be the midpoint of the side $BC.$ The perpendicular at $H{}$ to $HX{}$ intersects the sides $(AB)$ and $(AC)$ at $Y{}$ and $Z{}$ respectively. Let $O{}$ be the circumcenter of $ABC{}$ and $O'$ be the circumcenter of $BHC.$ [list=a] [*]Prove that $HY=HZ.$ [*]Prove that $\overrightarrow{AY}+\overrightarrow{AZ}=2\overrightarrow{OO'}.$ [/list]

Let $n,k$ be positive integers such that $n\ge k$. $n$ lamps are placed on a circle, which are all off. In any step we can change the state of $k$ consecutive lamps. In the following three cases, how many states of lamps are there in all $2^n$ possible states that can be obtained from the initial state by a certain series of operations? i)$k$ is a prime number greater than $2$; ii) $k$ is odd; iii) $k$ is even.

There are $ 16$ pupils in a class. Every month, the teacher divides the pupils into two groups. Find the smallest number of months after which it will be possible that every two pupils were in two different groups during at least one month.

Let $ABC$ be a triangle, and erect three rectangles $ABB_1A_2$, $BCC_1B_2$, $CAA_1C_2$ externally on its sides $AB$, $BC$, $CA$, respectively. Prove that the perpendicular bisectors of the segments $A_1A_2$, $B_1B_2$, $C_1C_2$ are concurrent.

In $\Delta ABC$, $\angle ABC = 90^\circ$ and $BA = BC = \sqrt{2}$. Points $P_1, P_2, \dots, P_{2024}$ lie on hypotenuse $\overline{AC}$ so that $AP_1= P_1P_2 = P_2P_3 = \dots = P_{2023}P_{2024} = P_{2024}C$. What is the length of the vector sum \[ \overrightarrow{BP_1} + \overrightarrow{BP_2} + \overrightarrow{BP_3} + \dots + \overrightarrow{BP_{2024}}? \] $ \textbf{(A) }1011 \qquad \textbf{(B) }1012 \qquad \textbf{(C) }2023 \qquad \textbf{(D) }2024 \qquad \textbf{(E) }2025 \qquad $

Put $ M\equal{}\begin{pmatrix}p&q&r\\ r&p&q\\q&r&p\end{pmatrix}$ where $ p,q,r>0$ and $ p\plus{}q\plus{}r\equal{}1$. Prove that $ \lim_{n\rightarrow \infty}M^n\equal{}\begin{bmatrix}\frac13&\frac13&\frac13\\ \frac13&\frac13&\frac13\\\frac13&\frac13&\frac13\end{bmatrix}$

For each positive integer $ k$, find the smallest number $ n_{k}$ for which there exist real $ n_{k}\times n_{k}$ matrices $ A_{1}, A_{2}, \ldots, A_{k}$ such that all of the following conditions hold: (1) $ A_{1}^{2}= A_{2}^{2}= \ldots = A_{k}^{2}= 0$, (2) $ A_{i}A_{j}= A_{j}A_{i}$ for all $ 1 \le i, j \le k$, and (3) $ A_{1}A_{2}\ldots A_{k}\ne 0$.

For each finite set $ U$ of nonzero vectors in the plane we define $ l(U)$ to be the length of the vector that is the sum of all vectors in $ U.$ Given a finite set $ V$ of nonzero vectors in the plane, a subset $ B$ of $ V$ is said to be maximal if $ l(B)$ is greater than or equal to $ l(A)$ for each nonempty subset $ A$ of $ V.$ (a) Construct sets of 4 and 5 vectors that have 8 and 10 maximal subsets respectively. (b) Show that, for any set $ V$ consisting of $ n \geq 1$ vectors the number of maximal subsets is less than or equal to $ 2n.$

Find the least positive integer $n$ such that the prime factorizations of $n$, $n + 1$, and $n + 2$ each have exactly two factors (as $4$ and $6$ do, but $12$ does not).

Consider the sequences of six positive integers $a_1,a_2,a_3,a_4,a_5,a_6$ with the properties that $a_1=1$, and if for some $j > 1$, $a_j = m > 1$, then $m-1$ appears in the sequence $a_1,a_2,\dots,a_{j-1}$. Such sequences include $1,1,2,1,3,2$ and $1,2,3,1,4,1$ but not $1,2,2,4,3,2$. How many such sequences of six positive integers are there?

Half the cells of a $2m \times n$ board are colored black and the other half are colored white. The cells at the opposite ends of the main diagonal are different colors. The center of each black cell is connected to the center of every other black cell by a straight line segment, and similarly for the white cells. Show that we can place an arrow on each segment so that it becomes a vector and the vectors sum to zero.

Consider $n$ lamps clockwise numbered from $1$ to $n$ on a circle. Let $\xi$ to be a configuration where $0 \le \ell \le n$ random lamps are turned on. A [i]cool procedure[/i] consists in perform, simultaneously, the following operations: for each one of the $\ell$ lamps which are turned on, we verify the number of the lamp; if $i$ is turned on, a [i]signal[/i] of range $i$ is sent by this lamp, and it will be received only by the next $i$ lamps which follow $i$, turned on or turned off, also considered clockwise. At the end of the operations we verify, for each lamp, turned on or turned off, how many signals it has received. If it was reached by an even number of signals, it remains on the same state(that is, if it was turned on, it will be turned on; if it was turned off, it will be turned off). Otherwise, it's state will be changed. The example in attachment, for $n=4$, ilustrates a configuration where lamps $2$ and $4$ are initially turned on. Lamp $2$ sends signal only for the lamps $3$ e $4$, while lamp $4$ sends signal for lamps $1$, $2$, $3$ e $4$. Therefore, we verify that lamps $1$ e $2$ received only one signal, while lamps $3$ e $4$ received two signals. Therefore, in the next configuration, lamps $1$ e $4$ will be turned on, while lamps $2$ e $3$ will be turned off. Let $\Psi$ to be the set of all $2^n$ possible configurations, where $0 \le \ell \le n$ random lamps are turned on. We define a function $f: \Psi \rightarrow \Psi$ where, if $\xi$ is a configuration of lamps, then $f(\xi)$ is the configurations obtained after we perform the [i]cool procedure[/i] described above. Determine all values of $n$ for which $f$ is bijective.

On the Cartesian plane consider the set $V$ of all vectors with integer coordinates. Determine all functions $f : V \rightarrow \mathbb{R}$ satisfying the conditions: (i) $f(v) = 1$ for each of the four vectors $v \in V$ of unit length. (ii) $f(v+w) = f(v)+f(w)$ for every two perpendicular vectors $v, w \in V$ (Zero vector is considered to be perpendicular to every vector).

$ ABC$ and $ A'B'C'$ are two triangles in the same plane such that the lines $ AA',BB',CC'$ are mutually parallel. Let $ [ABC]$ denotes the area of triangle $ ABC$ with an appropriate $ \pm$ sign, etc.; prove that \[ 3([ABC] \plus{} [A'B'C']) \equal{} [AB'C'] \plus{} [BC'A'] \plus{} [CA'B'] \plus{} [A'BC] \plus{} [B'CA] \plus{} [C'AB].\]

Prove that on the coordinate plane it is impossible to draw a closed broken line such that [i](i)[/i] the coordinates of each vertex are rational; [i](ii)[/i] the length each of its edges is 1; [i](iii)[/i] the line has an odd number of vertices.

[b]a)[/b] Let $ AA',BB',CC' $ be the altitudes of a triangle $ ABC. $ Prove that $$ \frac{BC}{AA'}\cdot \overrightarrow{AA'} +\frac{AC}{BB'}\cdot \overrightarrow{BB'} +\frac{AB}{CC'}\cdot \overrightarrow{CC'} =0. $$ [b]b)[/b] The sum of the vectors that are perpendicular to the sides of a convex polygon and have equal lengths as those sides, respectively, is $ 0. $

Let $ a,\ b$ be real numbers satisfying $ \int_0^1 (ax\plus{}b)^2dx\equal{}1$. Determine the values of $ a,\ b$ for which $ \int_0^1 3x(ax\plus{}b)\ dx$ is maximized.

Suppose that the components of he vector $ \textbf{u}=(u_0,\ldots,u_n)$ are real functions defined on the closed interval $ [a,b]$ with the property that every nontrivial linear combination of them has at most $ n$ zeros in $ [a,b]$. Prove that if $ \sigma$ is an increasing function on $ [a,b]$ and the rank of the operator \[ A(f)= \int_{a}^b \textbf{u}(x)f(x)d\sigma(x), \;f \in C[a,b]\ ,\] is $ r \leq n$, then $ \sigma$ has exactly $ r$ points of increase. [i]E. Gesztelyi[/i]

[b]a)[/b] Prove that, for any point in the interior of a triangle, there are two points on the sides of this triangle such that the resultant of the vectors from the interior point those two points is the vector $ 0. $ [b]b)[/b] Prove that, for any point in the interior of a triangle, there are three points on the sides of this triangle such that the resultant of the vectors from the interior point those three points is the vector $ 0. $

Let $V$ be a $n-$dimensional vector space over a field $F$ with a basis $\{e_1,e_2, \cdots ,e_n\}$.Prove that for any $m-$dimensional linear subspace $W$ of $V$, the number of elements of the set $W \cap P$ is less than or equal to $2^m$ where $P=\{\lambda_1e_1 + \lambda_2e_2 + \cdots + \lambda_ne_n : \lambda_i=0,1\}$.