Let be a circle centeted at $ O, $ and $ A,B,C, $ points situated on this circle. Show that if $$ \left|\overrightarrow{OA} +\overrightarrow{OB}\right| = \left|\overrightarrow{OB} +\overrightarrow{OC}\right| = \left|\overrightarrow{OC} +\overrightarrow{OA}\right| , $$ then $ A=B=C, $ or $ ABC $ is an equilateral triangle.

In the plane are given a circle $k$ with radii $R$ and the points $A_1,A_2,\ldots,A_n$, lying on $k$ or outside $k$. Prove that there exist infinitely many points $X$ from the given circumference for which $$\sum_{i=1}^n A_iX^2\ge2nR^2.$$ Does there exist a pair of points on different sides of some diameter, $X$ and $Y$ from $k$, such that $$\sum_{i=1}^n A_iX^2\ge2nR^2\text{ and }\sum_{i=1}^n A_iY^2\ge2nR^2?$$ [i]H. Lesov[/i]

Consider a particle at rest which may decay into two (daughter) particles or into three (daughter) particles. Which of the following is true in the two-body case but false in the three-body case? (There are no external forces.) (a) The velocity vectors of the daughter particles must lie in a single plane. (b) Given the total kinetic energy of the system and the mass of each daughter particle, it is possible to determine the speed of each daughter particle. (c) Given the speed(s) of all but one daughter particle, it is possible to determine the speed of the remaining particle. (d) The total momentum of the daughter particles is zero. (e) None of the above.

Let the roots of \[x^{2022}-7x^{2021}+8x^2+4x+2\] be $r_1,r_2,\dots,r_{2022}$, the roots of \[x^{2022}-8x^{2021}+27x^2+9x+3\] be $s_1,s_2,\dots,s_{2022}$, and the roots of \[x^{2022}-9x^{2021}+64x^2+16x+4\] be $t_1,t_2,\dots,t_{2022}$. Compute the value of \[\sum_{1\le i,j\le2022}r_is_j+\sum_{1\le i,j\le2022}s_it_j+\sum_{1\le i,j\le2022}t_ir_j.\]

Let $ABC$ be a scalene triangle with circle $\Gamma$. Let $P,Q,R,S$ distinct points on the $BC$ side, in that order, such that $\angle BAP = \angle CAS$ and $\angle BAQ = \angle CAR$. Let $U, V, W, Z$ be the intersections, distinct from $A$, of the $AP, AQ, AR$ and $AS$ with $\Gamma$, respectively. Let $X = UQ \cap SW$, $Y = PV \cap ZR$, $T = UR \cap VS$ and $K = PW \cap ZQ$. Suppose that the points $M$ and $N$ are well determined, such that $M = KX \cap TY$ and $N = TX \cap KY$. Show that $M, N, A$ are collinear.

[b]p1.[/b] We say that integers $a$ and $b$ are [i]friends [/i] if their product is a perfect square. Prove that if $a$ is a friend of $b$, then $a$ is a friend of $gcd (a, b)$. [b]p2.[/b] On the island of knights and liars, a traveler visited his friend, a knight, and saw him sitting at a round table with five guests. "I wonder how many knights are among you?" he asked. " Ask everyone a question and find out yourself" advised him one of the guests. "Okay. Tell me one: Who are your neighbors?" asked the traveler. This question was answered the same way by all the guests. "This information is not enough!" said the traveler. "But today is my birthday, do not forget it!" said one of the guests. "Yes, today is his birthday!" said his neighbor. Now the traveler was able to find out how many knights were at the table. Indeed, how many of them were there if [i]knights always tell the truth and liars always lie[/i]? [b]p3.[/b] A rope is folded in half, then in half again, then in half yet again. Then all the layers of the rope were cut in the same place. What is the length of the rope if you know that one of the pieces obtained has length of $9$ meters and another has length $4$ meters? [b]p4.[/b] The floor plan of the palace of the Shah is a square of dimensions $6 \times 6$, divided into rooms of dimensions $1 \times 1$. In the middle of each wall between rooms is a door. The Shah orders his architect to eliminate some of the walls so that all rooms have dimensions $2 \times 1$, no new doors are created, and a path between any two rooms has no more than $N$ doors. What is the smallest value of $N$ such that the order could be executed? [b]p5.[/b] There are $10$ consecutive positive integers written on a blackboard. One number is erased. The sum of remaining nine integers is $2011$. Which number was erased? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$k(k>1)$ is an integer, and $a$ is a solution to the equation $x^2-kx+1=0$. For any integer $n(n>10)$, the last digit number of $a^{2^n}+a^{-2^n}$ is always $7$, then the last digit number of $k$ is________.

Given a list $A$ of $n$ real numbers, the following algorithm, known as $\textit{insertion sort}$, sorts the elements of $A$ from least to greatest. \begin{tabular}{l} 1: \textbf{FUNCTION} $IS(A)$ \\ 2: $\quad$ \textbf{FOR} $i=0,\ldots, n-1$: \\ 3: $\quad\quad$ $j \leftarrow i$\\ 4: $\quad\quad$ \textbf{WHILE} $j>0$ \& $A[j-1]>A[j]:$\\ 5: $\quad\quad\quad$ \textbf{SWAP} $A[j], A[j-1]$\\ 6: $\quad\quad\quad$ $j \leftarrow j-1$\\ 7: \textbf{RETURN} $A$ \end{tabular} As $A$ ranges over all permutations of $\{1, 2, \ldots, n\}$, let $f(n)$ denote the expected number of comparisons (i.e., checking which of two elements is greater) that need to be made when sorting $A$ with insertion sort. Evaluate $f(13) - f(12)$.

The roots of a monic cubic polynomial $p$ are positive real numbers forming a geometric sequence. Suppose that the sum of the roots is equal to $10$. Under these conditions, the largest possible value of $|p(-1)|$ can be written as $\frac{m}{n}$, where $m$, $n$ are relatively prime integers. Find $m + n$.

A liquid is moving in an infinite pipe. For each molecule if it is at point with coordinate $x$ then after $t$ seconds it will be at a point of $p(t,x)$. Prove that if $p(t,x)$ is a polynomial of $t,x$ then speed of all molecules are equal and constant.

Let $ABC$ be a triangle in which $BC<AC$. Let $M$ be the mid-point of $AB$, $AP$ be the altitude from $A$ on $BC$, and $BQ$ be the altitude from $B$ on to $AC$. Suppose that $QP$ produced meets $AB$ (extended) at $T$. If $H$ is the orthocenter of $ABC$, prove that $TH$ is perpendicular to $CM$.

Nick has a $3\times3$ grid and wants to color each square in the grid one of three colors such that no two squares that are adjacent horizontally or vertically are the same color. Compute the number of distinct grids that Nick can create.

For each natural number $n$ we denote $a_n$ as the greatest perfect square less than or equal to $n$ and $b_n$ as the least perfect square greater than $n$. For example $a_9=3^2$, $b_9=4^2$ and $a_{20}=4^2$, $b_{20}=5^2$. Calculate: $$\frac{1}{a_1b_1}+\frac{1}{a_2b_2}+\frac{1}{a_3b_3}+\ldots +\frac{1}{a_{600}b_{600}}$$

Given the polygons $P$ and $Q$ as shown in the grid below, cut $P$ into two polygons $P_1$ and $P_2$ such that, when pasted together differently, they form $Q$. [asy] import graph; size(16cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-2.05,xmax=15.10,ymin=-1.87,ymax=9.74; pen cqcqcq=rgb(0.75,0.75,0.75), zzttqq=rgb(0.6,0.2,0); draw((7,5)--(12,5)--(12,2)--(7,2)--cycle,zzttqq); draw((2,2)--(2,5)--(3,6)--(6,6)--(6,3)--(5,2)--cycle,zzttqq); /*grid*/ pen gs=linewidth(0.7)+cqcqcq+linetype("2 2"); real gx=1,gy=1; for(real i=ceil(xmin/gx)*gx;i<=floor(xmax/gx)*gx;i+=gx) draw((i,ymin)--(i,ymax),gs); for(real i=ceil(ymin/gy)*gy;i<=floor(ymax/gy)*gy;i+=gy) draw((xmin,i)--(xmax,i),gs); draw((0,8)--(0,0)); draw((0,0)--(13,0)); draw((13,0)--(13,8)); draw((13,8)--(0,8)); draw((7,5)--(12,5),zzttqq); draw((12,5)--(12,2),zzttqq); draw((12,2)--(7,2),zzttqq); draw((7,2)--(7,5),zzttqq); draw((2,2)--(2,5),zzttqq); draw((2,5)--(3,6),zzttqq); draw((3,6)--(6,6),zzttqq); draw((6,6)--(6,3),zzttqq); draw((6,3)--(5,2),zzttqq); draw((5,2)--(2,2),zzttqq); dot((0,0),linewidth(1pt)+ds); dot((13,0),linewidth(1pt)+ds); dot((0,8),linewidth(1pt)+ds); dot((2,2),linewidth(1pt)+ds); dot((6,6),linewidth(1pt)+ds); dot((13,8),linewidth(1pt)+ds); dot((7,2),linewidth(1pt)+ds); dot((7,5),linewidth(1pt)+ds); dot((12,2),linewidth(1pt)+ds); dot((12,5),linewidth(1pt)+ds); label("$Q$",(8.42,2.56),NE*lsf,zzttqq); dot((5,2),linewidth(1pt)+ds); dot((6,3),linewidth(1pt)+ds); dot((2,5),linewidth(1pt)+ds); dot((3,6),linewidth(1pt)+ds); label("$P$",(4.65,2.74),NE*lsf,zzttqq); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); [/asy]

The weight of $\frac 13$ of a large pizza together with $3 \frac 12$ cups of orange slices is the same as the weight of $\frac 34$ of a large pizza together with $\frac 12$ cup of orange slices. A cup of orange slices weighs $\frac 14$ of a pound. What is the weight, in pounds, of a large pizza? $\textbf{(A)}~1\frac45\qquad\textbf{(B)}~2\qquad\textbf{(C)}~2\frac25\qquad\textbf{(D)}~3\qquad\textbf{(E)}~3\frac35$

Let $p > 3$ be a prime. For each $k\in \{1,2, \ldots , p-1\}$, define $x_k$ to be the unique integer in $\{1, \ldots, p-1\}$ such that $kx_k\equiv 1 \pmod{p}$ and set $kx_k = 1+ pn_k$. Prove that : \[\sum_{k=1}^{p-1}kn_k \equiv \frac{p-1}{2} \pmod{p}\]

Find all integer solutions $(p, q, r)$ of the equation $r + p ^ 4 = q ^ 4$ with the following conditions: $\bullet$ $r$ is a positive integer with exactly $8$ positive divisors. $\bullet$ $p$ and $q$ are prime numbers.