The number of pairs of positive integers $(x,y)$ which satisfy the equation $x^2+y^2=x^3$ is $\textbf {(A) } 0 \qquad \textbf{(B) } 1 \qquad \textbf {(C) } 2 \qquad \textbf {(D) } \text{not finite} \qquad \textbf {(E) } \text{none of these}$

For an integer $n \ge 3$ we consider a circle with $n$ points on it. We place a positive integer at each point, where the numbers are not necessary need to be different. Such placement of numbers is called [i]stable [/i] as three numbers next to always have product $n$ each other. For how many values of $n$ with $3 \le n \le 2020$ is it possible to place numbers in a stable way?

We say a triple of real numbers $ (a_1,a_2,a_3)$ is [b]better[/b] than another triple $ (b_1,b_2,b_3)$ when exactly two out of the three following inequalities hold: $ a_1 > b_1$, $ a_2 > b_2$, $ a_3 > b_3$. We call a triple of real numbers [b]special[/b] when they are nonnegative and their sum is $ 1$. For which natural numbers $ n$ does there exist a collection $ S$ of special triples, with $ |S| \equal{} n$, such that any special triple is bettered by at least one element of $ S$?

Suppose m and n are positive odd integers. Which of the following must also be an odd integer? $ \textbf{(A)}\ m+3n\qquad\textbf{(B)}\ 3m-n\qquad\textbf{(C)}\ 3m^2 + 3n^2\qquad\textbf{(D)}\ (nm + 3)^2\qquad\textbf{(E)}\ 3mn $

Given two integers $n\geq 1$ and $q\geq 2$, let $A=\{(a_1,\ldots ,a_n):a_i\in\{0,\ldots ,q-1\}, i=1,\ldots ,n\}$. If $a=(a_1,\ldots ,a_n)$ and $b=(b_1,\ldots ,b_n)$ are two elements of $A$, let $\delta(a,b)=\#\{i:a_i\neq b_i\}$. Let further $t$ be a non-negative integer and $B$ a non-empty subset of $A$ such that $\delta(a,b)\geq 2t+1$, whenever $a$ and $b$ are distinct elements of $B$. Prove that the two statements below are equivalent: a) For any $a\in A$, there is a unique $b\in B$, such that $\delta (a,b)\leq t$; b) $\displaystyle|B|\cdot \sum_{k=0}^t \binom{n}{k}(q-1)^k=q^n$

The cards in a stack of $2n$ cards are numbered consecutively from $1$ through $2n$ from top to bottom. The top $n$ cards are removed, kept in order, and form pile $A$. The remaining cards form pile $B$. The cards are then restacked by taking cards alternately from the tops of pile $B$ and $A$, respectively. In this process, card number $(n+1)$ becomes the bottom card of the new stack, card number $1$ is on top of this card, and so on, until piles $A$ and $B$ are exhausted. If, after the restacking process, at least one card from each pile occupies the same position that it occupied in the original stack, the stack is named [i]magical[/i]. Find the number of cards in the magical stack in which card number $131$ retains its original position.

A sequence $(a_{n})$ of positive integers is given by $a_{n}=[n+\sqrt{n}+\frac{1}{2}]$. Find all of positive integers which belong to the sequence.

Solve in the set of real numbers the equation $$ 16\{ x \}^2-8x=-1, $$ where $ \{\} $ denotes the fractional part.

A house has an even number of lamps distributed among its rooms in such a way that there are at least three lamps in every room. Each lamp shares a switch with exactly one other lamp, not necessarily from the same room. Each change in the switch shared by two lamps changes their states simultaneously. Prove that for every initial state of the lamps there exists a sequence of changes in some of the switches at the end of which each room contains lamps which are on as well as lamps which are off. [i]Proposed by Australia[/i]

In tetrahedron $ABCD$, edge $AB$ has length 3 cm. The area of face $ABC$ is 15 $\text{cm}^2$ and the area of face $ABD$ is 12 $\text{cm}^2$. These two faces meet each other at a $30^\circ$ angle. Find the volume of the tetrahedron in $\text{cm}^3$.

Find the maximal value of $c>0$ such that for any $n\ge 1$, and for any $n$ real numbers $x_1, \cdots, x_n$ there exists real numbers $a ,b$ such that $$\{x_i-a\}+\{x_{i+1}-b\}\le \frac{1}{2024}$$ for at least $cn$ indices $i$. Here, $x_{n+1}=x_1$ and $\{x\}$ denotes the fractional part of $x$. [i]Proposed by Wong Jer Ren[/i]

There are $n \ge 2$ houses on the northern side of a street. Going from the west to the east, the houses are numbered from 1 to $n$. The number of each house is shown on a plate. One day the inhabitants of the street make fun of the postman by shuffling their number plates in the following way: for each pair of neighbouring houses, the currnet number plates are swapped exactly once during the day. How many different sequences of number plates are possible at the end of the day?

On the diagonal $AC$ of the rhombus $ABCD$, a point $E$ is taken, which is different from points $A$ and $C$, and on the lines $AB$ and $BC$ are points $N$ and $M$, respectively, with $AE = NE$ and $CE = ME$. Let $K$ be the intersection point of lines $AM$ and $CN$. Prove that points $K, E$ and $D$ are collinear.

Find all the finite sets $A$ of real positive numbers having at least two elements, with the property that $a^2 + b^2 \in A$ for every $a, b \in A$ with $a \ne b$

There are several equal (possibly overlapping) square-shaped napkins on a rectangular table, with sides parallel to the sides of the table. Prove that it is possible to nail some of them to the table in such a way that every napkin is nailed exactly once.

A polynomial $ P(x)$ with integer coefficients is called good,if it can be represented as a sum of cubes of several polynomials (in variable $ x$) with integer coefficients.For example,the polynomials $ x^3 \minus{} 1$ and $ 9x^3 \minus{} 3x^2 \plus{} 3x \plus{} 7 \equal{} (x \minus{} 1)^3 \plus{} (2x)^3 \plus{} 2^3$ are good. a)Is the polynomial $ P(x) \equal{} 3x \plus{} 3x^7$ good? b)Is the polynomial $ P(x) \equal{} 3x \plus{} 3x^7 \plus{} 3x^{2008}$ good? Justify your answers.

Let $n$ be a positive integer and $p$ be a prime number such that $np+1$ is a perfect square. Prove that $n+1$ can be written as the sum of $p$ perfect squares.

$ f: \mathbb N \times \mathbb Z \rightarrow \mathbb Z$ satisfy the given conditions $ a)$ $ f(0,0)\equal{}1$ , $ f(0,1)\equal{}1$ , $ b)$ $ \forall k \notin \left\{0,1\right\}$ $ f(0,k)\equal{}0$ and $ c)$ $ \forall n \geq 1$ and $ k$ , $ f(n,k)\equal{}f(n\minus{}1,k)\plus{}f(n\minus{}1,k\minus{}2n)$ find the sum $ \displaystyle\sum_{k\equal{}0}^{\binom{2009}{2}}f(2008,k)$

Let $a,b, c$ be real numbers with $a+b+c = 2018$. Suppose $x, y$, and $z$ are the distinct positive real numbers which are satisfied $a = x^2 - yz - 2018, b = y^2 - zx - 2018$ , and $c = z^2 - xy - 2018$. Compute the value of the following expression $P = \frac{\sqrt{a^3 + b^3 + c^3 - 3abc}}{x^3 + y^3 + z^3 - 3xyz}$

For a non-isosceles $ABC$ we have that $2AC = AB + BC$. Point $I$ is the center of the circle inscribed in $\triangle ABC$, point $K$ is the middle of the arc $\widehat{AC}$ that includes point $B$, and point $T$ is from the line $AC$, such that $\angle TIB = 90^\circ$. Prove that the line $TB$ is tangent to the circumscribed circle of $\triangle KBI$.

Let $n > k$ be positive integers and let $F$ be a family of finite sets with the following properties: i. $F$ contains at least $\binom{n}{k}+ 1$ distinct sets containing exactly $k$ elements; ii. For any two sets $A, B \in F$ their union, i.e., $A \cup B$ also belongs to $F$. Prove that $F$ contains at least three sets with at least $n$ elements.

Markers in the colors violet, cyan, octarine and gamma were placed on all fields of a $41\times 5$ chessboard. Show that there are four squares of the same color that form the vertices of a rectangle whose edges are parallel to those of the board.

There are $36$ cards in a deck arranged in the sequence spades, clubs, hearts, diamonds, spades, clubs, hearts, diamonds, etc. Somebody took part of this deck off the top, turned it upside down, and cut this part into the remaining part of the deck (i.e. inserted it between two consecutive cards). Then four cards were taken off the top, then another four, etc. Prove that in any of these sets of four cards, all the cards are of different suits. (A Merkov, Moscow)

Let $k$ be a positive integer with the following property: For every subset $A$ of $\{1,2,\ldots, 25\}$ with $|A|=k$, we can find distinct elements $x$ and $y$ of $A$ such that $\tfrac23\leq\tfrac xy\leq\tfrac 32$. Find the smallest possible value of $k$.

Calculate the volume $ V $ of tetrahedron $ ABCD $ given the length $ d $ of edge $ AB $ and the area $ S $ of the projection of the tetrahedron on the plane perpendicular to the line $ AB $.