Prove that if $n$ is large enough, then for each coloring of the subsets of the set $\{1,2,...,n\}$ with $1391$ colors, two non-empty disjoint subsets $A$ and $B$ exist such that $A$, $B$ and $A\cup B$ are of the same color.

Given a real number $x$, define the series \[ S(x) = \sum_{n=1}^{\infty} \{n! \cdot x\}, \] where $\{s\} = s - \lfloor s \rfloor$ is the fractional part of the number $s$. Determine if there exists an irrational number $x$ for which the series $S(x)$ converges.

Julián writes five positive integers, not necessarily different, such that their product is equal to their sum. What could be the numbers that Julian writes?

Let $a$, $b$, $c$ be positive real numbers. Prove that \[ \frac{a}{b+c}+\frac{b}{c+a}+\frac{c}{a+b}+\sqrt{\frac{ab+bc+ca}{a^2+b^2+c^2}}\ge\frac52\] and determine when equality holds.

High school graduate Igor Petrov, who dreamed of becoming a diplomat, took the entrance exam in mathematics to Moscow University. Igor remembered all the problems offered during the exam, but forgot some numerical data in one. This is the task: “When multiplying two natural numbers, the difference of which is $10$, an error was made: the hundreds digit in the product was increased by $2$. When dividing the resulting (incorrect) product by the smaller of the factors, the result was quotient $k$ and remainder $r$.. Find the numbers that needed to be multiplied.” . The values of $k$ and $r$ were given in the condition, but Igor forgot them. However, he remembered that the problem had two answers. What could the numbers $ k$ and $r$ be equal to (they are both integers and positive)? [i]Note. The problem in question was proposed at one of the humanities faculties of Moscow State University in 1991. [/i]

Three students write on the blackboard next to each other three two-digit squares. In the end, they observe that the 6-digit number thus obtained is also a square. Find this number!

Given $n \in N$, let $A$ be a family of subsets of $\{1,2,...,n\}$. If for every two sets $B,C \in A$ the set $(B \cup C) -(B \cap C)$ has an even number of elements, find the largest possible number of elements of $A$ .

Given are reals $a, b$. Prove that at least one of the equations $x^4-2b^3x+a^4=0$ and $x^4-2a^3x+b^4=0$ has a real root. Proposed by N. Agakhanov

Determine the number of positive integers $n$ for which $(n+15)(n+2010)$ is a perfect square.

Let $K > 0$ be an integer. An integer $k \in [0,K]$ is randomly chosen. A sequence of integers is defined starting on $k$ and ending on $0$, where each nonzero term $t$ is followed by $t$ minus the largest Lucas number not exceeding $t$. The probability that $4$, $5$, or $6$ is in this sequence approaches $\tfrac{a - b \sqrt c}{d}$ for arbitrarily large $K$, where $a$, $b$, $c$, $d$, are positive integers, $\gcd(a,b,d) = 1$, and $c$ is squarefree. Find $a + b + c + d$. [i](Lucas numbers are defined as the members of the infinite integer sequence $2$, $1$, $3$, $4$, $7$, $\ldots$ where each term is the sum of the two before it.)[/i] [i]Proposed by Evan Chang[/i]

Let $a,b,c$ be positive reals satisfying $a^3+b^3+c^3+abc=4$. Prove that \[ \frac{(5a^2+bc)^2}{(a+b)(a+c)} + \frac{(5b^2+ca)^2}{(b+c)(b+a)} + \frac{(5c^2+ab)^2}{(c+a)(c+b)} \ge \frac{(a^3+b^3+c^3+6)^2}{a+b+c} \] and determine the cases of equality. [i]Proposed by Evan Chen[/i]

[b]p1.[/b] Show that for every $n \ge 6$, a square in the plane may be divided into $n$ smaller squares, not necessarily all of the same size. [b]p2.[/b] Let $n$ be the $4018$-digit number $111... 11222...2225$, where there are $2008$ ones and $2009$ twos. Prove that $n$ is a perfect square. (Giving the square root of $n$ is not sufficient. You must also prove that its square is $n$.) [b]p3.[/b] Let $n$ be a positive integer. A game is played as follows. The game begins with $n$ stones on the table. The two players, denoted Player I and Player II (Player I goes first), alternate in removing from the table a nonzero square number of stones. (For example, if $n = 26$ then in the first turn Player I can remove $1$ or $4$ or $9$ or $16$ or $25$ stones.) The player who takes the last stone wins. Determine if the following sentence is TRUE or FALSE and prove your answer: There are infinitely many starting values n such that Player II has a winning strategy. (Saying that Player II has a winning strategy means that no matter how Player I plays, Player II can respond with moves that lead to a win for Player II.) [b]p4.[/b] Consider a convex quadrilateral $ABCD$. Divide side $AB$ into $8$ equal segments $AP_1$, $P_1P_2$, $...$ , $P_7B$. Divide side $DC$ into $8$ equal segments $DQ_1$, $Q_1Q_2$, $...$ , $Q_7C$. Similarly, divide each of sides $AD$ and $BC$ into $8$ equal segments. Draw lines to form an $8 \times 8$ “checkerboard” as shown in the picture. Color the squares alternately black and white. (a) Show that each of the $7$ interior lines $P_iQ_i$ is divided into $8$ equal segments. (b) Show that the total area of the black regions equals the total area of the white regions. [img]https://cdn.artofproblemsolving.com/attachments/1/4/027f02e26613555181ed93d1085b0e2de43fb6.png[/img] [b]p5.[/b] Prove that exactly one of the following two statements is true: A. There is a power of $10$ that has exactly $2008$ digits in base $2$. B. There is a power of $10$ that has exactly $2008$ digits in base $5$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the number of primes$ p$, such that $ x^{3} \minus{}5x^{2} \minus{}22x\plus{}56\equiv 0\, \, \left(mod\, p\right)$ has no three distinct integer roots in $ \left[0,\left. p\right)\right.$. $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{None}$

For each integer $C>1$ decide whether there exist pairwise distinct positive integers $a_1,a_2,a_3,...$ such that for every $k\ge 1$, $a_{k+1}^k$ divides $C^ka_1a_2...a_k$. [i]Proposed by Daniel Liu

Compute $\int^1_0\left((e-1)\sqrt{\ln(1+ex-x)}+e^{x^2}\right)dx$.

Consider all binary sequences of length $n$. In a sequence that allows the interchange of positions of an arbitrary set of $k$ adjacent numbers, ($k < n$), two sequences are said to be [i]equivalent [/i] if they can be transformed from one sequence to another by a finite number of transitions as above. Find the number of sequences that are not equivalent.

A $10 \times 10$ square on a grid is split by $80$ unit grid segments into $20$ polygons of equal area (no one of these segments belongs to the boundary of the square). Prove that all polygons are congruent. [i]($6$ points)[/i]

In a triangle $ABC$, let $I$ be its incenter. The distance from $I$ to the segment $BC$ is $4 cm$ and the distance from that point to vertex $B$ is $12 cm$. Let $D$ be a point in the plane region between segments $AB$ and $BC$ such that $D$ is the center of a circumference that is tangent to lines $AB$ and $BC$ and passes through $I$. Find all possible values of the length $BD$.

If the sum of two numbers is 1 and their product is 1, then the sum of their cubes is: $\text{(A)} \ 2 \qquad \text{(B)} \ -2-\frac{3i\sqrt{3}}{4} \qquad \text{(C)} \ 0 \qquad \text{(D)} \ -\frac{3i\sqrt{3}}{4} \qquad \text{(E)} \ -2$

Regular hexagon $ABCDEF$ has side length $2.$ Circle $\omega$ lies inside the hexagon and is tangent to segments $\overline{AB}$ and $\overline{AF}.$ There exist two perpendicular lines tangent to $\omega$ that pass through $C$ and $E,$ respectively. Given that these two lines do not intersect on line $AD,$ compute the radius of $\omega.$

Let $C_1,C_2$, and $C_3$ be points inside a bounded convex planar set $M$. Rays $l_1,l_2,l_3$ emanating from $C_1,C_2,C_3$ respectively partition the complement of the set $M \cup l_1 \cup l_2 \cup l_3$ into three regions $D_1,D_2,D_3$. Prove that if the convex sets $A$ and $B$ satisfy $A\cap l_j =\emptyset = B\cap l_j$ and $A\cap D_j \ne \emptyset \ne B\cap D_j$ for $j = 1,2,3$, then $A\cap B \ne \emptyset$

Determine all pairs of functions $f,g:\mathbb{R}\rightarrow\mathbb{R}$ such that for any $x,y\in \mathbb{R}$, \[f(x)f(y)=g(x)g(y)+g(x)+g(y).\]

Do exist pairwise distinct matrices $ A,B,C\in \mathcal{M}_2(\mathbb{R}) $ verifying the following properties? $ \text{(i)} \det A=\det C$ $ \text{(ii)} AB=C,BC=A,CA=B $ $ \text{(iii)} \text{tr} A,\text{tr} B\neq 0 $ [i]Robert Pop[/i]

Let $ABC$ be a right triangle, right in $B$. Inner bisectors are drawn $CM$ and $AN$ that intersect in $I$. Then, the $AMIP$ and $CNIQ$ parallelograms are constructed. Let $U$ and $V$ are the midpoints of the segments $AC$ and $PQ$, respectively. Prove that $UV$ is perpendicular to $AC$.

Let $A,B \in M_{n}(\mathbb{R}).$ Show that $rank(A) = rank(B)$ if and only if there exist nonsingular matrices $X,Y,Z \in M_{n}(\mathbb{R})$ such that \[ AX + YB = AZB. \]