A sequence of $A$s and $B$s is called [i]antipalindromic [/i] if writing it backwards, then turning all the $A$s into $B$s and vice versa, produces the original sequence. For example $ABBAAB$ is antipalindromic. For any sequence of $A$s and $B$s we define the cost of the sequence to be the product of the positions of the $A$s. For example, the string $ABBAAB$ has cost $1\cdot 4 \cdot 5 = 20$. Find the sum of the costs of all antipalindromic sequences of length $2020$.

Do there exist distinct natural numbers $x, y, z, t$, all greater than or equal to $2$, such that $x \geq y + 2$, $z \geq t + 2$, and \[ \binom{x}{y} = \binom{z}{t}? \] [i](For natural numbers $n$ and $k$ with $n \geq k$, we define $\binom{n}{k} = \frac{n!}{k!(n-k)!}$.)[/i]

Show that \[ \left(1 + a + a^2\right)^2 < 3\left(1 + a^2 + a^4\right) \] for real $a \neq 1$.

Let $ x \in \mathbb{Q}^+$. Prove that there exits $\alpha_1,\alpha_2,...,\alpha_k \in \mathbb{N}$ and pairwe distinct such that \[x= \sum_{i=1}^{k} \frac{1}{\alpha_i}\]

(a) For each integer $k\ge 3$, find a positive integer $n$ that can be represented as the sum of exactly $k$ mutually distinct positive divisors of $n$. (b) Suppose that $n$ can be expressed as the sum of exactly $k$ mutually distinct positive divisors of $n$ for some $k\ge 3$. Let $p$ be the smallest prime divisor of $n$. Show that \[\frac1p+\frac1{p+1}+\cdots+\frac{1}{p+k-1}\ge1.\]

A natural number is called [i]good[/i] if it can be represented as sum of two coprime natural numbers, the first of which decomposes into odd number of primes (not necceserily distinct) and the second to even. Prove that there exist infinity many $n$ with $n^4$ being good.

The triangle $ABC$ is inscribed in the circle $S$ and $AB <AC$. The line containing $A$ and is perpendicular to $BC$ meets $S$ in $P$ ($P \ne A$). Point $X$ is on the segment $AC$ and the line $BX$ intersects $S$ in $Q$ ($Q \ne B$). Show that $BX = CX$ if, and only if, $PQ$ is a diameter of $S$.

If $a,b,c>0$ then $$\frac{1}{abc}+1\ge3\left(\frac{1}{a^2+b^2+c^2}+\frac{1}{a+b+c}\right)$$

What is the smallest value of \( k \) such that for any polynomial \( f(x) \) of degree $100$ with real coefficients, there exists a polynomial \( g(x) \) of degree at most \( k \) with real coefficients such that the graphs of \( y = f(x) \) and \( y = g(x) \) intersect at exactly $100$ points? \\

Two equal parallel chords are drawn $ 8$ inches apart in a circle of radius $ 8$ inches. The area of that part of the circle that lies between the chords is: $ \textbf{(A)}\ 21\frac {1}{3}\pi \minus{} 32\sqrt {3} \qquad\textbf{(B)}\ 32\sqrt {3} \plus{} 21\frac {1}{3}\pi \qquad\textbf{(C)}\ 32\sqrt {3} \plus{} 42\frac {2}{3}\pi$ $ \textbf{(D)}\ 16\sqrt {3} \plus{} 42\frac {2}{3}\pi \qquad\textbf{(E)}\ 42\frac {2}{3}\pi$

Let $x_n=\binom{2n}{n}$ for all $n\in\mathbb{Z}^+$. Prove there exist infinitely many finite sets $A,B$ of positive integers, satisfying $A \cap B = \emptyset $, and \[\frac{{\prod\limits_{i \in A} {{x_i}} }}{{\prod\limits_{j\in B}{{x_j}} }}=2012.\]

We write $\{a,b,c\}$ for the set of three different positive integers $a, b$, and $c$. By choosing some or all of the numbers a, b and c, we can form seven nonempty subsets of $\{a,b,c\}$. We can then calculate the sum of the elements of each subset. For example, for the set $\{4,7,42\}$ we will find sums of $4, 7, 42,11, 46, 49$, and $53$ for its seven subsets. Since $7, 11$, and $53$ are prime, the set $\{4,7,42\}$ has exactly three subsets whose sums are prime. (Recall that prime numbers are numbers with exactly two different factors, $1$ and themselves. In particular, the number $1$ is not prime.) What is the largest possible number of subsets with prime sums that a set of three different positive integers can have? Give an example of a set $\{a,b,c\}$ that has that number of subsets with prime sums, and explain why no other three-element set could have more.

A circle with center $O$ passes through the vertices $A$ and $C$ of the triangle $ABC$ and intersects the segments $AB$ and $BC$ again at distinct points $K$ and $N$ respectively. Let $M$ be the point of intersection of the circumcircles of triangles $ABC$ and $KBN$ (apart from $B$). Prove that $\angle OMB=90^{\circ}$.

Determine the values that \(n\) can take so that the equation in \( x \) $$ x^4-(3n+2)x^2+n^2=0$$ has four different real roots \( x_1\), \(x_2\), \(x_3\) and \(x_4\) in arithmetic progression. That is, they satisfy that $$x_4-x_3=x_3-x_2=x_2-x_1$$

Given a circle $k$ and two points $A$ and $B$ outside the circle. Specify how to can construct a circle with a compass and ruler, so that $A$ and $B$ lie on that circle and that circle is tangent to $k$.

Compute the largest positive integer such that $\dfrac{2007!}{2007^n}$ is an integer.

Oleksii and Solomiya play the following game on a square $6n\times 6n$, where $n$ is a positive integer. Oleksii in his turn places a piece of type $F$, consisting of three cells, on the board. Solomia, in turn, after each move of Oleksii, places the numbers $0, 1, 2$ in the cells of the figure that Oleksii has just placed, using each of the numbers exactly once. If two of Oleksii's pieces intersect at any moment (have a common square), he immediately loses. Once the square is completely filled with numbers, the game stops. In this case, if the sum of the numbers in each row and each column is divisible by $3$, Solomiya wins, and otherwise Oleksii wins. Who can win this game if the figure of type $F$ is: a) a rectangle ; b) a corner of three cells? [i]Proposed by Oleksii Masalitin[/i]

Given a circle $\gamma$ and two points $A$ and $B$ in its plane. By $B$ passes a variable secant that intersects $\gamma$ at two points $M$ and $N$. Determine the locus of the centers of the circles circumscribed to the triangle $AMN$.

Let $G$ be a complete directed graph with $100$ vertices such that for any two vertices $x,y$ one can find a directed path from $x$ to $y$. a) Show that for any such $G$, one can find a $m$ such that for any two vertices $x,y$ one can find a directed path of length $m$ from $x$ to $y$ (Vertices can be repeated in the path) b) For any graph $G$ with the properties above, define $m(G)$ to be smallest possible $m$ as defined in part a). Find the minimim value of $m(G)$ over all such possible $G$'s.

Let $N$ be the greatest five-digit number whose digits have a product of $120$. What is the sum of the digits of $N$? $\textbf{(A) }15\qquad\textbf{(B) }16\qquad\textbf{(C) }17\qquad\textbf{(D) }18\qquad\textbf{(E) }20$

Let $n$ be a positive integer. The numbers $\{1, 2, ..., n^2\}$ are placed in an $n \times n$ grid, each exactly once. The grid is said to be [i]Muirhead-able[/i] if the sum of the entries in each column is the same, but for every $1 \le i,k \le n-1$, the sum of the first $k$ entries in column $i$ is at least the sum of the first $k$ entries in column $i+1$. For which $n$ can one construct a Muirhead-able array such that the entries in each column are decreasing? [i]Proposed by Evan Chen[/i]

In the interior of the convex polygon $A_1A_2...A_{2n}$ there is point $M$. Prove that at least one side of the polygon has not intersection points with the lines $MA_i$, $1\le i\le 2n$. (Spain)

A $6\text{-year stock}$ that goes up $30\%$ in the first year, down $30\%$ in the second, up $30\%$ in the third, down $30\%$ in the fourth, up $30\%$ in the fifth, and down $30\%$ in the sixth is equivalent to a $3\text{-year stock}$ that loses $x\%$ in each of its three years. Compute $x$.

Determine all integers $n\ge 2$ with the following property: there exist nonzero real numbers $x_1, x_2, \ldots, x_n,y$ such that \[(x_1+x_2+\ldots+x_k)(x_{k+1}+x_{k+2}+\ldots+x_n)=y\] for all $k\in\{1,2,\ldots,n-1\}$.

Let $a,b$ be positive real numbers such that $b^3+b\le a-a^3$. Prove that: i) $b<a<1$ ii) $a^2+b^2<1$