Let $n$ be a positive integer. Suppose that $A,B,$ and $M$ are $n\times n$ matrices with real entries such that $AM=MB,$ and such that $A$ and $B$ have the same characteristic polynomial. Prove that $\det(A-MX)=\det(B-XM)$ for every $n\times n$ matrix $X$ with real entries.

For each positive integer $n$, let $f(n)$ be a positive integer. Show that if $f(n + 1) > f(f(n))$ for every positive integer n, then $f(x) = x$ for all positive integers $x$.

Find all triples $(p, x, y)$ consisting of a prime number $p$ and two positive integers $x$ and $y$ such that $x^{p -1} + y$ and $x + y^ {p -1}$ are both powers of $p$. [i]Proposed by Belgium[/i]

It is known that the general term $\{a_n\}$ of the sequence is $a_n =(\sqrt3 +\sqrt2)^{2n}$ ($n \in N*$), let $b_n= a_n +\frac{1}{a_n}$ . (1) Find the recurrence relation between $b_{n+2}$, $b_{n+1}$, $b_n$. (2) Find the unit digit of the integer part of $a_{2011}$.

Find the maximum number of Permutation of set {$1,2,3,...,2014$} such that for every 2 different number $a$ and $b$ in this set at last in one of the permutation $b$ comes exactly after $a$

Let $ABCD$ be a parallelogram and let $K$ and $L$ be points on the segments $BC$ and $CD$, respectively, such that $BK\cdot AD=DL\cdot AB$. Let the lines $DK$ and $BL$ intersect at $P$. Show that $\measuredangle DAP=\measuredangle BAC$.

There are $2019$ cities in the country of Balticwayland. Some pairs of cities are connected by non-intersecting bidirectional roads, each road connecting exactly 2 cities. It is known that for every pair of cities $A$ and $B$ it is possible to drive from $A$ to $B$ using at most $2$ roads. There are $62$ cops trying to catch a robber. The cops and robber all know each others’ locations at all times. Each night, the robber can choose to stay in her current city or move to a neighbouring city via a direct road. Each day, each cop has the same choice of staying or moving, and they coordinate their actions. The robber is caught if she is in the same city as a cop at any time. Prove that the cops can always catch the robber

Let $ S(n)$ be the sum of decimal digits of a natural number $ n$. Find the least value of $ S(m)$ if $ m$ is an integral multiple of $ 2003$.

Let $S$ be the set of points inside a given equilateral triangle $ABC$ with side $1$ or on its boundary. For any $M \in S, a_M, b_M, c_M$ denote the distances from $M$ to $BC,CA,AB$, respectively. Define \[f(M) = a_M^3 (b_M - c_M) + b_M^3(c_M - a_M) + c_M^3(a_M - b_M).\] [b](a)[/b] Describe the set $\{M \in S | f(M) \geq 0\}$ geometrically. [b](b)[/b] Find the minimum and maximum values of $f(M)$ as well as the points in which these are attained.

Two points $A$ and $B$ are given in the plane. A point $X$ is called their [i]preposterous midpoint[/i] if there is a Cartesian coordinate system in the plane such that the coordinates of $A$ and $B$ in this system are non-negative, the abscissa of $X$ is the geometric mean of the abscissae of $A$ and $B$, and the ordinate of $X$ is the geometric mean of the ordinates of $A$ and $B$. Find the locus of all the [i]preposterous midpoints[/i] of $A$ and $B$. (K. Tyschu)

In a right triangle rectangle $ABC$ such that $AB = AC$, $M$ is the midpoint of $BC$. Let $P$ be a point on the perpendicular bisector of $AC$, lying in the semi-plane determined by $BC$ that does not contain $A$. Lines $CP$ and $AM$ intersect at $Q$. Calculate the angles that form the lines $AP$ and $BQ$.

Let $k$ and $N$ be positive real numbers which satisfy $k\leq N$. For $1\leq i \leq k$, there are subsets $A_i$ of $\{1,2,3,\ldots,N\}$ that satisfy the following property. For arbitrary subset of $\{ i_1, i_2, \ldots , i_s \} \subset \{ 1, 2, 3, \ldots, k \} $, $A_{i_1} \triangle A_{i_2} \triangle ... \triangle A_{i_s}$ is not an empty set. Show that a subset $\{ j_1, j_2, .. ,j_t \} \subset \{ 1, 2, ... ,k \} $ exist that satisfies $n(A_{j_1} \triangle A_{j_2} \triangle \cdots \triangle A_{j_t}) \geq k$. ($A \triangle B=A \cup B-A \cap B$)

Prove that there exist infinitely many positive integers $x,y,z$ for which the sum of the digits in the decimal representation of $~4x^4+y^4-z^2+4xyz$ $~$ is at most $2$. (Proposed by Gerhard Woeginger, Austria)

We are given a triangle $ABC$ and three rectangles $R_1,R_2,R_3$ with sides parallel to two fixed perpendicular directions and such that their union covers the sides $AB,BC$, and $CA$; i.e., each point on the perimeter of $ABC$ is contained in or on at least one of the rectangles. Prove that all points inside the triangle are also covered by the union of $R_1,R_2,R_3.$

How many real solutions does the equation $ x^{3} 3^{1/x^{3} } \plus{}\frac{1}{x^{3} } 3^{x^{3} } \equal{}6$ have? $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ \text{Infinitely many} \qquad\textbf{(E)}\ \text{None}$