Do there exist $2022$ polynomials with real coefficients, each of degree equal to $2021$, so that the $2021 \cdot 2022 + 1$ coefficients in their product are equal?

Let $ABCD$ be a quadrilateral, let $P$ be the intersection of $AB$ and $CD$, and let $O$ be the intersection of the perpendicular bisectors of $AB$ and $CD$. Suppose that $O$ does not lie on line $AB$ and $O$ does not lie on line $CD$. Let $B'$ and $D'$ be the reflections of $B$ and $D$ across $OP$. Show that if $AB'$ and $CD'$ meet on $OP$, then $ABCD$ is cyclic.

A whole number larger than $2$ leaves a remainder of $2$ when divided by each of the numbers $3, 4, 5$ and $6$. The smallest such number lies between which two numbers? $\textbf{(A)}\ 40\text{ and }49\qquad \textbf{(B)}\ 60\text{ and }79\qquad \textbf{(C)}\ 100\text{ and }129\qquad \textbf{(D)}\ 210\text{ and }249\qquad \textbf{(E)}\ 320\text{ and }369$

Homer gives mathematicians Patty and Selma each a different integer, not known to the other or to you. Homer tells them, within each other’s hearing, that the number given to Patty is the product $ab$ of the positive integers $a$ and $b$, and that the number given to Selma is the sum $a + b$ of the same numbers $a$ and $b$, where $b > a > 1.$ He doesn’t, however, tell Patty or Selma the numbers $a$ and $b.$ The following (honest) conversation then takes place: Patty: “I can’t tell what numbers $a$ and $b$ are.” Selma: “I knew before that you couldn’t tell.” Patty: “In that case, I now know what $a$ and $b$ are.” Selma: “Now I also know what $a$ and $b$ are.” Supposing that Homer tells you (but neither Patty nor Selma) that neither $a$ nor $b$ is greater than 20, find $a$ and $b$, and prove your answer can result in the conversation above.

An $n\times n$ square ($n$ is a positive integer) consists of $n^2$ unit squares.A $\emph{monotonous path}$ in this square is a path of length $2n$ beginning in the left lower corner of the square,ending in its right upper corner and going along the sides of unit squares. For each $k$, $0\leq k\leq 2n-1$, let $S_k$ be the set of all the monotonous paths such that the number of unit squares lying below the path leaves remainder $k$ upon division by $2n-1$.Prove that all $S_k$ contain equal number of elements.

Most enzymes are a type of $ \textbf{(A) } \text{Carbohydrate} \qquad\textbf{(B) } \text{Lipid} \qquad\textbf{(C) } \text{Nucleic Acid} \qquad\textbf{(D) } \text{Protein} \qquad $

i) If $x = \left(1+\frac{1}{n}\right)^{n}$ and $y=\left(1+\frac{1}{n}\right)^{n+1}$, show that $y^{x}= x^{y}$. ii) Show that, for all positive integers $n$, \[1^{2}-2^{2}+3^{2}-4^{2}+\cdots+(-1)^{n}(n-1)^{2}+(-1)^{n+1}n^{2}= (-1)^{n+1}(1+2+\cdots+n).\]

Let $m,n$ be two positive integers and $m \geq 2$. We know that for every positive integer $a$ such that $\gcd(a,n)=1$ we have $n|a^m-1$. Prove that $n \leq 4m(2^m-1)$.

Determine all triples $(x,y,z)$ of positive integers such that \[\frac{13}{x^2}+\frac{1996}{y^2}=\frac{z}{1997} \]

For a given parameter $m$, solve the equation \[x(x + 1)(x + 2)(x + 3) + 1 - m = 0.\]

Given a point $P = (p_1, p_2, \ldots, p_n)$ in $n$-dimensional space . Find point $X = (x_1, x_2, \ldots, x_n)$, such that $x_1 \leq x_2 \leq\cdots \leq x_n$ and $\sqrt{(x_1-p_1)^2 + (x_2-p_2)^2+\cdots+(x_n-p_n)^2}$ is minimal.

Let $M \subset R$ be a finite set containing at least two elements. We say that the function $f$ has property $P$ if $f : M \to M$ and there are $a \in R^*$ and $b \in R$ such that $f(x) = ax + b$. (a) Show that there is at least a function having property $P$. (b) Show that there are at most two functions having property $P$. (c) If $M$ has $2003$ elements with sum $0$ and if there are two functions with property $P$, prove that $0 \in M$.

Let be a function $ f:\mathbb{R}_{>0}\longrightarrow\mathbb{R}_{>0} $ that satisfies the relation $$ \sqrt{x^2-x+1}\le f(x) e^{f(x)}\le \sqrt{x^2+x+1} , $$ for any positive real number $ x. $ Prove that [b]a)[/b] $ \lim_{x\to\infty } f(x)=\infty . $ [b]b)[/b] $ \lim_{x\to\infty } (1/x)^{1/f(x)} =1/e. $

If $ 1 \minus{} y$ is used as an approximation to the value of $ \frac {1}{1 \plus{} y}$, $ |y| < 1$, the ratio of the error made to the correct value is: $ \textbf{(A)}\ y \qquad \textbf{(B)}\ y^2 \qquad \textbf{(C)}\ \frac {1}{1 \plus{} y} \qquad \textbf{(D)}\ \frac {y}{1 \plus{} y} \qquad \textbf{(E)}\ \frac {y^2}{1 \plus{} y}\qquad$

(A.Zaslavsky, 9--10) Quadrilateral $ ABCD$ is circumscribed arounda circle with center $ I$. Prove that the projections of points $ B$ and $ D$ to the lines $ IA$ and $ IC$ lie on a single circle.

A sub-graph of a complete graph with $n$ vertices is chosen such that the number of its edges is a multiple of $3$ and degree of each vertex is an even number. Prove that we can assign a weight to each triangle of the graph such that for each edge of the chosen sub-graph, the sum of the weight of the triangles that contain that edge equals one, and for each edge that is not in the sub-graph, this sum equals zero. [i]Proposed by Morteza Saghafian[/i]

Consider the graphs of $y=2\log{x}$ and $y=\log{2x}$. We may say that: $ \textbf{(A)}\ \text{They do not intersect}$ $ \qquad\textbf{(B)}\ \text{They intersect at 1 point only}$ $\qquad\textbf{(C)}\ \text{They intersect at 2 points only}$ $\qquad\textbf{(D)}\ \text{They intersect at a finite number of points but greater than 2 }$ ${\qquad\textbf{(E)}\ \text{They coincide} } $

Prove that any polygon $A_1A_2\dots A_n$ has three vertices $A_i,A_j,A_k$ such that $[A_iA_jA_k]>\frac{1}{4}[A_1A_2\dots A_n]$. [i]Folklore[/i]

We are given 4 similar dices. Denote $x_i (1\le x_i \le 6)$ be the number of dots on a face appearing on the $i$-th dice $1\le i \le 4$ a) Find the numbers of $(x_1,x_2,x_3,x_4)$ b) Find the probability that there is a number $x_j$ such that $x_j$ is equal to the sum of the other 3 numbers c) Find the probability that we can divide $x_1,x_2,x_3,x_4$ into 2 groups has the same sum

Given non-zero reals $ a$, $ b$, find all functions $ f: \mathbb{R} \longmapsto \mathbb{R}$, such that for every $ x, y \in \mathbb{R}$, $ y \neq 0$, $ f(2x) \equal{} af(x) \plus{} bx$ and $ \displaystyle f(x)f(y) \equal{} f(xy) \plus{} f \left( \frac {x}{y} \right)$.

Let $a$ and $b$ be distinct positive integers. The following infinite process takes place on an initially empty board. [list=i] [*] If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by $a$ and the other by $b$. [*] If no such pair exists, we write two times the number $0$. [/list] Prove that, no matter how we make the choices in $(i)$, operation $(ii)$ will be performed only finitely many times. Proposed by [I]Serbia[/I].

In a convex quadrilateral $ABCD$ we have $\angle ADB=\angle ACD$ and $AC=CD=DB$. If the diagonals $AC$ and $BD$ intersect at $X$, prove that $\frac{CX}{BX}-\frac{AX}{DX}=1$.

Let $x$ and $y$ be integers between $0$ and $5$, inclusive. For the system of modular congruences $$ \begin{cases} x + 3y \equiv 1 \,\,(mod \, 2) \\ 4x + 5y \equiv 2 \,\,(mod \, 3) \end{cases}$$, find the sum of all distinct possible values of $x + y$

Let $A$ be a finite set of positive integers, and for each positive integer $n$ we define \[S_n = \{x_1 + x_2 + \cdots + x_n \;\vert\; x_i \in A \text{ for } i = 1, 2, \dots, n\}\] That is, $S_n$ is the set of all positive integers which can be expressed as sum of exactly $n$ elements of $A$, not necessarily different. Prove that there exist positive integers $N$ and $k$ such that $$\left\vert S_{n + 1} \right\vert = \left\vert S_n \right\vert + k \text{ for all } n\geq N.$$ [i]Proposed by Ariel García[/i]

Let $ABCD$ be a convex quadrilateral with $A,B,C,D$ concyclic. Assume $\angle ADC$ is acute and $\frac{AB}{BC}=\frac{DA}{CD}$. Let $\Gamma$ be a circle through $A$ and $D$, tangent to $AB$, and let $E$ be a point on $\Gamma$ and inside $ABCD$. Prove that $AE\perp EC$ if and only if $\frac{AE}{AB}-\frac{ED}{AD}=1$.