Found problems: 560
Draw a $2004 \times 2004$ array of points. What is the largest integer $n$ for which it is possible to draw a convex $n$-gon whose vertices are chosen from the points in the array?
Given a triangle $ ABC$. Let $ G$, $ I$, $ H$ be the centroid, the incenter and the orthocenter of triangle $ ABC$, respectively. Prove that $ \angle GIH > 90^{\circ}$.
For the given triangle $ABC$, prove that a point $X$ on the side $AB$ satisfies the condition $\overrightarrow{XA} \cdot\overrightarrow{XB} +\overrightarrow{XC} \cdot \overrightarrow{XC} = \overrightarrow{CA} \cdot \overrightarrow{CB} $, iff $X$ is the basepoint of the altitude or median of the triangle $ABC$.
Let $\vec{v_1},\vec{v_2},\vec{v_3},\vec{v_4}$ and $\vec{v_5}$ be vectors in three dimensions. Show that for some $i,j$ in $1,2,3,4,5$, $\vec{v_i}\cdot \vec{v_j}\ge 0$.
21 people take a test with 15 true or false questions. It is known that every 2 people have at least 1 correct answer in common. What is the minimum number of people that could have correctly answered the question which the most people were correct on?
Let $ p(x)\equal{}a_0 \plus{}a_1 x\plus{}...\plus{}a_n x^n$ be a polynomial with nonnegative real coefficients. Suppose that $ p(4)\equal{}2$ and $ p(16)\equal{}8$. Prove that $ p(8) \le 4$ and find all such $ p$ with $ p(8)\equal{}4$.
On a semicircle centred at $O$ and with radius $1$ choose the respective points $A_1,A_2,...,A_{2n}$ , for $n \in N^*$. The lenght of the projection of the vector $\overrightarrow {u}=\overrightarrow{OA_1} +\overrightarrow{OA_2}+...+\overrightarrow{OA_{2n}}$ on the diameter is an odd integer. Show that the projection of that vector on the diameter is at least $1$.
Let $ a,b,c$ be positive real numbers. Prove the inequality:
$ \frac {a^3}{b^2} \plus{} \frac {b^3}{c^2} \plus{} \frac {c^3}{a^2}\ge \frac {a^2}{b} \plus{} \frac {b^2}{c} \plus{} \frac {c^2}{a}$
$ \Delta_1,\ldots,\Delta_n$ are $ n$ concurrent segments (their lines concur) in the real plane. Prove that if for every three of them there is a line intersecting these three segments, then there is a line that intersects all of the segments.
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
$
An object moves in two dimensions according to
\[\vec{r}(t) = (4.0t^2 - 9.0)\vec{i} + (2.0t - 5.0)\vec{j}\]
where $r$ is in meters and $t$ in seconds. When does the object cross the $x$-axis?
$ \textbf{(A)}\ 0.0 \text{ s}\qquad\textbf{(B)}\ 0.4 \text{ s}\qquad\textbf{(C)}\ 0.6 \text{ s}\qquad\textbf{(D)}\ 1.5 \text{ s}\qquad\textbf{(E)}\ 2.5 \text{ s}$
Let $A = (0, 0, 0)$ in 3D space. Define the [i]weight[/i] of a point as the sum of the absolute values of the coordinates. Call a point a [i]primitive lattice point[/i] if all of its coordinates are integers whose gcd is 1. Let square $ABCD$ be an [i]unbalanced primitive integer square[/i] if it has integer side length and also, $B$ and $D$ are primitive lattice points with different weights. Prove that there are infinitely many unbalanced primitive integer squares such that the planes containing the squares are not parallel to each other.
Show that for any vectors $a, b$ in Euclidean space,
\[|a \times b|^3 \leq \frac{3 \sqrt 3}{8} |a|^2 |b|^2 |a-b|^2\]
Remark. Here $\times$ denotes the vector product.
Two particles move along the edges of equilateral triangle $ \triangle ABC$ in the direction
\[ A\rightarrow B\rightarrow C\rightarrow A
\]starting simultaneously and moving at the same speed. One starts at $ A$, and the other starts at the midpoint of $ \overline{BC}$. The midpoint of the line segment joining the two particles traces out a path that encloses a region $ R$. What is the ratio of the area of $ R$ to the area of $ \triangle ABC$?
$ \textbf{(A)}\ \frac {1}{16}\qquad \textbf{(B)}\ \frac {1}{12}\qquad \textbf{(C)}\ \frac {1}{9}\qquad \textbf{(D)}\ \frac {1}{6}\qquad \textbf{(E)}\ \frac {1}{4}$
Let $ABC$ a triangle be given with $BC = a$, $CA = b$, $AB = c$ ($a \neq b \neq c \neq a$). In plane ($ABC$) take the points $A'$, $B'$, $C'$ such that:
[b]I.[/b] The pairs of points $A$ and $A'$, $B$ and $B'$, $C$ and $C'$ either all lie in one side either all lie in different sides under the lines $BC$, $CA$, $AB$ respectively;
[b]II.[/b] Triangles $A'BC$, $B'CA$, $C'AB$ are similar isosceles triangles.
Find the value of angle $A'BC$ as function of $a, b, c$ such that lengths $AA', BB', CC'$ are not sides of an triangle. (The word "triangle" must be understood in its ordinary meaning: its vertices are not collinear.)
The [i]cross[/i] of a convex $n$-gon is the quadratic mean of the lengths between the possible pairs of vertices. For example, the cross of a $3 \times 4$ rectangle is $\sqrt{ \dfrac{3^2 + 3^2 + 4^2 + 4^2 + 5^2 + 5^2}{6} } = \dfrac{5}{3} \sqrt{6}$.
Suppose $S$ is a dodecagon ($12$-gon) inscribed in a unit circle. Find the greatest possible cross of $S$.
Pairwise distinct points $P_1,P_2,\ldots, P_{16}$ lie on the perimeter of a square with side length $4$ centered at $O$ such that $\lvert P_iP_{i+1} \rvert = 1$ for $i=1,2,\ldots, 16$. (We take $P_{17}$ to be the point $P_1$.) We construct points $Q_1,Q_2,\ldots,Q_{16}$ as follows: for each $i$, a fair coin is flipped. If it lands heads, we define $Q_i$ to be $P_i$; otherwise, we define $Q_i$ to be the reflection of $P_i$ over $O$. (So, it is possible for some of the $Q_i$ to coincide.) Let $D$ be the length of the vector $\overrightarrow{OQ_1} + \overrightarrow{OQ_2} + \cdots + \overrightarrow{OQ_{16}}$. Compute the expected value of $D^2$.
[i]Ray Li[/i]
Let $n\ge2$. For any two $n$-vectors $\vec x=(x_1,\ldots,x_n)$ and $\vec y=(y_1,\ldots,y_n)$, we define
$$f\left(\vec x,\vec y\right)=x_1\overline{y_1}-\sum_{i=2}^nx_i\overline{y_i}.$$Prove that if $f\left(\vec x,\vec x\right)\ge0$, and $f\left(\vec y,\vec y\right)\ge0$, then $\left|f\left(\vec x,\vec y\right)\right|^2\ge f\left(\vec x,\vec x\right)f\left(\vec y,\vec y\right)$.
Let $ H$ be an arbitrary subgroup of the diffeomorphism group $ \mathsf{Diff}^\infty(M)$ of a differentiable manifold $ M$. We say that an $ \mathcal C^\infty$-vector field $ X$ is [i]weakly tangent[/i] to the group $ H$, if there exists a positive integer $ k$ and a $ \mathcal C^\infty$-differentiable map $ \varphi \mathrel{: } \mathord{]} \minus{} \varepsilon,\varepsilon\mathord{[}^k\times M\to M$ such that
(i) for fixed $ t_1,\dots,t_k$ the map
\[ \varphi_{t_1,\dots,t_k} : x\in M\mapsto \varphi(t_1,\dots,t_k,x)\]
is a diffeomorphism of $ M$, and $ \varphi_{t_1,\dots,t_k}\in H$;
(ii) $ \varphi_{t_1,\dots,t_k}\in H \equal{} \mathsf{Id}$ whenever $ t_j \equal{} 0$ for some $ 1\leq j\leq k$;
(iii) for any $ \mathcal C^\infty$-function $ f: M\to \mathbb R$
\[ X f \equal{} \left.\frac {\partial^k(f\circ\varphi_{t_1,\dots,t_k})}{\partial t_1\dots\partial t_k}\right|_{(t_1,\dots,t_k) \equal{} (0,\dots,0)}.\]
Prove, that the commutators of $ \mathcal C^\infty$-vector fields that are weakly tangent to $ H\subset \textsf{Diff}^\infty(M)$ are also weakly tangent to $ H$.
Let $AA_1,BB_1,CC_1$ be the altitudes of a triangle $ABC$. If $\overrightarrow{AA_1}+\overrightarrow{BB_1}+\overrightarrow{CC_1}=0$ prove that the triangle $ABC$ is equilateral.
$m$ and $n$ are two nonnegative integers. In the Philosopher's Chess, The chessboard is an infinite grid of identical regular hexagons and a new piece named the Donkey moves on it as follows:
Starting from one of the hexagons, the Donkey moves $m$ cells in one of the $6$ directions, then it turns $60$ degrees clockwise and after that moves $n$ cells in this new direction until it reaches it's final cell.
At most how many cells are in the Philosopher's chessboard such that one cannot go from anyone of them to the other with a finite number of movements of the Donkey?
[i]Proposed by Shayan Dashmiz[/i]
Given a table with $2^n * n$ 1*1 squares ( $2^n$ rows and n column). In any square we put a number in {1, -1} such that no two rows are the same. Then we change numbers in some squares by 0. Prove that in new table we can choose some rows such that sum of all numbers in these rows equal to 0.
On a $49\times 69$ rectangle formed by a grid of lattice squares, all $50\cdot 70$ lattice points are colored blue. Two persons play the following game: In each step, a player colors two blue points red, and draws a segment between these two points. (Different segments can intersect in their interior.) Segments are drawn this way until all formerly blue points are colored red. At this moment, the first player directs all segments drawn - i. e., he takes every segment AB, and replaces it either by the vector $\overrightarrow{AB}$, or by the vector $\overrightarrow{BA}$. If the first player succeeds to direct all the segments drawn in such a way that the sum of the resulting vectors is $\overrightarrow{0}$, then he wins; else, the second player wins.
Which player has a winning strategy?
For $n\geq 1$ let $M$ be an $n\times n$ complex array with distinct eigenvalues $\lambda_1,\lambda_2,\ldots,\lambda_k$, with multiplicities $m_1,m_2,\ldots,m_k$ respectively. Consider the linear operator $L_M$ defined by $L_MX=MX+XM^T$, for any complex $n\times n$ array $X$. Find its eigenvalues and their multiplicities. ($M^T$ denotes the transpose matrix of $M$).
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.