For each positive integer $n$, let $H_n = \frac{1}{1} + \frac{1}{2} + \cdots + \frac{1}{n}$. If \[ \sum_{n=4}^{\infty} \frac{1}{nH_nH_{n-1}} = \frac{M}{N} \] for relatively prime positive integers $M$ and $N$, compute $100M+N$. [i]Based on a proposal by ssilwa[/i]

Given the positive real numbers $a_{1},a_{2},\dots,a_{n},$ such that $n>2$ and $a_{1}+a_{2}+\dots+a_{n}=1,$ prove that the inequality \[ \frac{a_{2}\cdot a_{3}\cdot\dots\cdot a_{n}}{a_{1}+n-2}+\frac{a_{1}\cdot a_{3}\cdot\dots\cdot a_{n}}{a_{2}+n-2}+\dots+\frac{a_{1}\cdot a_{2}\cdot\dots\cdot a_{n-1}}{a_{n}+n-2}\leq\frac{1}{\left(n-1\right)^{2}}\] does holds.

Let $k > 1$ be a fixed natural number. Find all polynomials $P(x)$ satisfying the condition $P(x^k) = (P(x))^k$ for all real numbers $x$.

The four bottom corners of a cube are colored red, green, blue, and purple. How many ways are there to color the top four corners of the cube so that every face has four different colored corners? Prove that your answer is correct.

Let $f(x)=\cos(\cos(\cos(\cos(\cos(\cos(\cos(\cos(x))))))))$, and suppose that the number $a$ satisfies the equation $a=\cos a$. Express $f'(a)$ as a polynomial in $a$.

Let $ABCD$ be a cyclic quadrilateral. Let $E$ be the intersection of lines parallel to $AC$ and $BD$ passing through points $B$ and $A$, respectively. The lines $EC$ and $ED$ intersect the circumcircle of $AEB$ again at $F$ and $G$, respectively. Prove that points $C$, $D$, $F$, and $G$ lie on a circle.

Find all positive integers $n$, such that the number \[ \frac{n^{2021}+101}{n^2+n+1}\] is an integer.

Before The World Cup tournament, the football coach of $F$ country will let seven players, $A_1, A_2, \ldots, A_7$, join three training matches (90 minutes each) in order to assess them. Suppose, at any moment during a match, one and only one of them enters the field, and the total time (which is measured in minutes) on the field for each one of $A_1, A_2, A_3$, and $A_4$ is divisible by $7$ and the total time for each of $A_5, A_6$, and $A_7$ is divisible by $13$. If there is no restriction about the number of substitutions of players during each match, then how many possible cases are there within the total time for every player on the field?

Let $XY Z$ be a triangle with $\angle XY Z = 40^o$ and $\angle Y ZX = 60^o$. A circle $\Gamma$, centered at the point $I$, lies inside triangle $XY Z$ and is tangent to all three sides of the triangle. Let $A$ be the point of tangency of $\Gamma$ with $Y Z$, and let ray $\overrightarrow{XI}$ intersect side $Y Z$ at $B$. Determine the measure of $\angle AIB$.

Compute $$\prod^{12}_{k=1} \left(\prod^{10}_{j=1} \left(e^{2\pi ji/11} - e^{2\pi ki/13}\right) \right) .$$ (The notation $\prod^{b}_{k=a}f(k)$means the product $f(a)f(a + 1)... f(b)$.)

Let $x_1,x_2,...,x_k$ be a sequence of integers. A rearrangement of this sequence (the numbers in the sequence listed in some other order) is called a [b]scramble[/b] if no number in the new sequence is equal to the number originally in its location. For example, if the original sequence is $1,3,3,5$ then $3,5,1,3$ is a scramble, but $3,3,1,5$ is not. A rearrangement is called a [b]two-two[/b] if exactly two of the numbers in the new sequence are each exactly two more than the numbers that originally occupied those locations. For example, $3,5,1,3$ is a two-two of the sequence $1,3,3,5$ (the first two values $3$ and $5$ of the new sequence are exactly two more than their original values $1$ and $3$). Let $n\geq 2$. Prove that the number of scrambles of $1,1,2,3,...,n-1,n$ is equal to the number of two-twos of $1,2,3,...,n,n+1$. (Notice that both sequences have $n+1$ numbers, but the first one contains two 1s.)

Determine the maximum possible value of $$\sqrt{x}(2\sqrt{x}+\sqrt{1-x})(3\sqrt{x}+4\sqrt{1-x})$$ over all $x\in [0,1]$.

Define a sequence $(a_n)$ by $a_1 =1, a_2 =2,$ and $a_{k+2}=2a_{k+1}+a_k$ for all positive integers $k$. Determine all real numbers $\beta >0$ which satisfy the following conditions: (A) There are infinitely pairs of positive integers $(p,q)$ such that $\left| \frac{p}{q}- \sqrt{2} \, \right| < \frac{\beta}{q^2 }.$ (B) There are only finitely many pairs of positive integers $(p,q)$ with $\left| \frac{p}{q}- \sqrt{2} \,\right| < \frac{\beta}{q^2 }$ for which there is no index $k$ with $q=a_k.$

For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.

A frog located at $(x,y)$, with both $x$ and $y$ integers, makes successive jumps of length $5$ and always lands on points with integer coordinates. Suppose that the frog starts at $(0,0)$ and ends at $(1,0)$. What is the smallest possible number of jumps the frog makes? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6 $

Euler's formula states that for a convex polyhedron with $V$ vertices, $E$ edges, and $F$ faces, $V - E + F = 2$. A particular convex polyhedron has 32 faces, each of which is either a triangle or a pentagon. At each of its $V$ vertices, $T$ triangular faces and $P$ pentagonal faces meet. What is the value of $100P + 10T + V$?

Let $({{x}_{n}}),({{y}_{n}})$ be two positive sequences defined by ${{x}_{1}}=1,{{y}_{1}}=\sqrt{3}$ and \[ \begin{cases} {{x}_{n+1}}{{y}_{n+1}}-{{x}_{n}}=0 \\ x_{n+1}^{2}+{{y}_{n}}=2 \end{cases} \] for all $n=1,2,3,\ldots$. Prove that they are converges and find their limits.

Let $ABCD$ be a cyclic quadrilateral for which $|AD| =|BD|$. Let $M$ be the intersection of $AC$ and $BD$. Let $I$ be the incentre of $\triangle BCM$. Let $N$ be the second intersection pointof $AC$ and the circumscribed circle of $\triangle BMI$. Prove that $|AN| \cdot |NC| = |CD | \cdot |BN|$.

Let $ABCD$ be a cyclic quadrilateral. The line parallel to $BD$ passing through $A$ meets the line parallel to $AC$ passing through $B$ at $E$. The circumcircle of triangle $ABE$ meets the lines $EC$ and $ED$, again, at $F$ and $G$, respectively. Prove that the lines $AB, CD$ and $FG$ are either parallel or concurrent.

There is a positive integer $A$. Two operations are allowed: increasing this number by $9$ and deleting a digit equal to $1$ from any position. Is it always possible to obtain $A+1$ by applying these operations several times?

Let be a real number $ a\in (0,1) $ and a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ with the property that: $$ \lim_{x\to 0} f(x) =0= \lim_{x\to 0} \frac{f(x)-f(ax)}{x} $$ Prove that $ \lim_{x\to\infty } \frac{f(x)}{x} =0. $

Circumferences $C_1$ and $C_2$ have different radios and are externally tangent on point $T$. Consider points $A$ on $C_1$ and $B$ on $C_2$, both different from $T$, such that $\angle BTA=90^{\circ}$. What is the locus of the midpoints of line segments $AB$ constructed that way?

Let $A$ be one of the two distinct points of intersection of two unequal coplanar circles $C_1$ and $C_2$ with centers $O_1$ and $O_2$ respectively. One of the common tangents to the circles touches $C_1$ at $P_1$ and $C_2$ at $P_2$, while the other touches $C_1$ at $Q_1$ and $C_2$ at $Q_2$. Let $M_1$ be the midpoint of $P_1Q_1$ and $M_2$ the midpoint of $P_2Q_2$. Prove that $\angle O_1AO_2=\angle M_1AM_2$.

Divide a cube into three equal pyramids.

Determine all pairs $(a,b)$ of positive integers with the following property: all of the terms of the sequence $(a^n+b^n+1)_{n\geqslant 1}$ have a greatest common divisor $d>1.$