Let $p\geq 5$ be a prime number, and set $M=\{1,2,\cdots,p-1\}.$ Define $$T=\{(n,x_n):p|nx_n-1\ \textup{and}\ n,x_n\in M\}.$$ If $\sum_{(n,x_n)\in T}n\left[\dfrac{nx_n}{p}\right]\equiv k \pmod {p},$ with $0\leq k\leq p-1,$ where $\left[\alpha\right]$ denotes the largest integer that does not exceed $\alpha,$ determine the value of $k.$

For a positive integer $n$, let $d(n)$ be the number of positive divisors of $n$. What is the smallest positive integer $n$ such that \[\sum_{t \mid n} d(t)^3\]is divisible by $35$?

Find all pairs $ (m$, $ n)$ of integers which satisfy the equation \[ (m \plus{} n)^4 \equal{} m^2n^2 \plus{} m^2 \plus{} n^2 \plus{} 6mn.\]

Determine the polynomial $$f(x) = x^k + a_{k-1} x^{k-1}+\cdots +a_1 x +a_0 $$ of smallest degree such that $a_i \in \{-1,0,1\}$ for $0\leq i \leq k-1$ and $f(n)$ is divisible by $30$ for all positive integers $n$.

Prove that there exist infinitely many pairs of different positive integers $(m, n)$ for which $m!n!$ is a square of an integer. [i]Proposed by Anton Trygub[/i]

Let $n$ be an odd positive integer. There is a graph $G$ with $2n$ vertices such that if you partition the vertices into two groups $A$ and $B$ with $n$ vertices each, then the subgraph consisting of only vertices and edges within $A$ is connected and has a closed path containing all of its edges, starting and ending with the same vertex. The same condition is true for $B$ as well. Is $G$ necessarily a clique? [i](Proposed by Ho Janson)[/i]

(B.Frenkin) Does a convex quadrilateral without parallel sidelines exist such that it can be divided into four congruent triangles?

A 2 meter long bookshelf is filled end-to-end with 46 books. Some of the books are 3 centimeters thick while all the others are 5 centimeters thick. Find the number of books on the shelf that are 3 centimeters thick.

Luke the frog has a standard deck of $52$ cards shuffled uniformly at random placed face down on a table. The deck contains four aces and four kings (no card is both an ace and a king). He now begins to flip over the cards one by one, leaving a card face up once he has flipped it over. He continues until the set of cards he has flipped over contains at least one ace and at least one king, at which point he stops. What is the expected value of the number of cards he flips over?

let $(a_{n})$ be an arbitrary sequence of positive numbers. Show that $$\limsup_{n\to \infty} \left(\frac{a_1 +a_{n+1}}{a_{n}}\right)^{n} \geq e.$$

Prove that for $n>1$ and real numbers $a_0,a_1,\dots, a_n,k$ with $a_1=a_{n-1}=0$, \[|a_0|-|a_n|\leq \sum_{i=0}^{n-2}|a_i-ka_{i+1}-a_{i+2}|.\]

[color=darkred]Let $ m,n\in \mathbb{N}$, $ n\ge 2$ and numbers $ a_i > 0$, $ i \equal{} \overline{1,n}$, such that $ \sum a_i \equal{} 1$. Prove that $ \small{\dfrac{a_1^{2 \minus{} m} \plus{} a_2 \plus{} ... \plus{} a_{n \minus{} 1}}{1 \minus{} a_1} \plus{} \dfrac{a_2^{2 \minus{} m} \plus{} a_3 \plus{} ... \plus{} a_n}{1 \minus{} a_1} \plus{} ... \plus{} \dfrac{a_n^{2 \minus{} m} \plus{} a_1 \plus{} ... \plus{} a_{n \minus{} 2}}{1 \minus{} a_1}\ge n \plus{} \dfrac{n^m \minus{} n}{n \minus{} 1}}$[/color]

a) Factorize $A= x^4+y^4+z^4-2x^2y^2-2y^2z^2-2z^2x^2$ b) Prove that there are no integers $x,y,z$ such that $x^4+y^4+z^4-2x^2y^2-2y^2z^2-2z^2x^2=2000 $

Answer wither (i) or (ii): (i) Let $V, V_1 , V_2$ and $V_3$ denote four vertices of a cube such that $V_1 , V_2 , V_3 $ are adjacent to $V.$ Project the cube orthogonally on a plane of which the points are marked with complex numbers. Let the projection of $V$ fall in the origin and the projections of $V_1 , V_2 , V_3 $ in points marked with the complex numbers $z_1 , z_2 , z_3$, respectively. Show that $z_{1}^{2} +z_{2}^{2} +z_{3}^{2}=0.$ (ii) Let $(a_{ij})$ be a matrix such that $$|a_{ii}| > |a_{i1}| + |a_{i2}|+\ldots +|a_{i i-1}|+ |a_{i i+1}| +\ldots +|a_{in}|$$ for all $i.$ Show that the determinant is not equal to $0.$

Complex numbers $z_1,z_2$ satisfy that $|z_1|=2,|z_2|=3,3z_1-2z_2=\frac{3}{2}-\text{i}$, then $z_1\cdot z_2=$________.

Joshua rolls two dice and records the product of the numbers face up. The probability that this product is composite can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Nathan Xiong[/i]

Let $ P$ be a point on the diagonal $ BD$ of a rectangle $ ABCD$, $ F$ be the projection of $ P$ on $ BC$, and $ H \not\equal{} B$ be the point on $ BC$ such that $ BF\equal{}FH$. If lines $ PC$ and $ AH$ intersect at $ Q$, prove that the areas of triangles $ APQ$ and $ CHQ$ are equal.

A $1\times 1\times 1$ cube is placed on an $8\times 8$ chessboard so that its bottom face coincides with a square of the chessboard. The cube rolls over a bottom edge so that the adjacent face now lands on the chessboard. In this way, the cube rolls around the chessboard, landing on each square at least once. Is it possible that a particular face of the cube never lands on the chessboard?

The incircle of a triangle $A_0B_0C_0$ touches the sides $B_0C_0,C_0A_0,A_0B_0$ at the points $A,B,C$ respectively, and the incircle of the triangle $ABC$ with incenter $ I$ touches the sides $BC,CA, AB$ at the points $A_1, B_1,C_1$, respectively. Let $\sigma(ABC)$ and $\sigma(A_1B_1C)$ be the areas of the triangles $ABC$ and $A_1B_1C$ respectively. Show that if $\sigma(ABC) = 2 \sigma(A_1B_1C)$ , then the lines $AA_0, BB_0,IC_1$ pass through a common point .

Let $X$ be a set with $n$ elements, and let $A_{1}$, $A_{2}$, ..., $A_{m}$ be subsets of $X$ such that: 1) $|A_{i}|=3$ for every $i\in\left\{1,2,...,m\right\}$; 2) $|A_{i}\cap A_{j}|\leq 1$ for all $i,j\in\left\{1,2,...,m\right\}$ such that $i \neq j$. Prove that there exists a subset $A$ of $X$ such that $A$ has at least $\left[\sqrt{2n}\right]$ elements, and for every $i\in\left\{1,2,...,m\right\}$, the set $A$ does not contain $A_{i}$. [i]Alternative formulation.[/i] Let $X$ be a finite set with $n$ elements and $A_{1},A_{2},\ldots, A_{m}$ be three-elements subsets of $X$, such that $|A_{i}\cap A_{j}|\leq 1$, for every $i\neq j$. Prove that there exists $A\subseteq X$ with $|A|\geq \lfloor \sqrt{2n}\rfloor$, such that none of $A_{i}$'s is a subset of $A$.

Let $ABCD$ be a convex quadrilateral. Let $E,F,G,H$ be points on segments $AB$, $BC$, $CD$, $DA$, respectively, and let $P$ be the intersection of $EG$ and $FH$. Given that quadrilaterals $HAEP$, $EBFP$, $FCGP$, $GDHP$ all have inscribed circles, prove that $ABCD$ also has an inscribed circle. [i]Evan O'Dorney.[/i]

Solve the following equation in the set of integer numbers: \[ x^{2010}-2006=4y^{2009}+4y^{2008}+2007y. \]

An invisible tank is on a $100 \times 100 $ table. A cannon can fire at any $60$ cells of the board after that the tank will move to one of the adjacent cells (by side). Then the progress is repeated. Can the cannon grantee to shoot the tank?

Let $\triangle ABC $ and $\triangle A'B'C'$ are acute triangles.Prove that\[Max\{cotA'(cotB+cotC),cotB'(cotC+cotA),cotC'(cotA+cotB)\}\ge \frac{2}{3}.\]

An ordered quadruple of numbers is called [i]ten-esque[/i] if it is composed of 4 nonnegative integers whose sum is equal to $10$. Ana chooses a ten-esque quadruple $(a_1, a_2, a_3, a_4)$ and Banana tries to guess it. At each stage Banana offers a ten-esque quadtruple $(x_1,x_2,x_3,x_4)$ and Ana tells her the value of \[|a_1-x_1|+|a_2-x_2|+|a_3-x_3|+|a_4-x_4|\] How many guesses are needed for Banana to figure out the quadruple Ana chose?