Given a prime number $p > 2$. Find the least $n\in Z_+$, for which every set of $n$ perfect squares not divisible by $p$ contains nonempty subset with product of all it's elements equal to $1\ (\text{mod}\ p)$

Define the function $f:(0,1)\to (0,1)$ by \[\displaystyle f(x) = \left\{ \begin{array}{lr} x+\frac 12 & \text{if}\ \ x < \frac 12\\ x^2 & \text{if}\ \ x \ge \frac 12 \end{array} \right.\] Let $a$ and $b$ be two real numbers such that $0 < a < b < 1$. We define the sequences $a_n$ and $b_n$ by $a_0 = a, b_0 = b$, and $a_n = f( a_{n -1})$, $b_n = f (b_{n -1} )$ for $n > 0$. Show that there exists a positive integer $n$ such that \[(a_n - a_{n-1})(b_n-b_{n-1})<0.\] [i]Proposed by Denmark[/i]

For integers $x$, $y$, and $z$, we have $(x-y)(y-z)(z-x)=x+y+z$. Prove that $27|x+y+z$.

Let $n$ be a positive integer, and let $f(n)$ denote the last nonzero digit in the decimal expansion of $n!$. $(\text a)$ Show that if $a_1,a_2,\ldots,a_k$ are distinct nonnegative integers, then $f(5^{a_1}+5^{a_2}+\ldots+5^{a_k})$ depends only on the sum $a_1+a_2+\ldots+a_k$. $(\text b)$ Assuming part $(\text a)$, we can define $$g(s)=f(5^{a_1}+5^{a_2}+\ldots+5^{a_k}),$$where $s=a_1+a_2+\ldots+a_k$. Find the least positive integer $p$ for which $$g(s)=g(s+p),\enspace\text{for all }s\ge1,$$or show that no such $p$ exists.

Given a circle with its perimeter equal to $n$( $n \in N^*$), the least positive integer $P_n$ which satisfies the following condition is called the “[i]number of the partitioned circle[/i]”: there are $P_n$ points ($A_1,A_2, \ldots ,A_{P_n}$) on the circle; For any integer $m$ ($1\le m\le n-1$), there always exist two points $A_i,A_j$ ($1\le i,j\le P_n$), such that the length of arc $A_iA_j$ is equal to $m$. Furthermore, all arcs between every two adjacent points $A_i,A_{i+1}$ ($1\le i\le P_n$, $A_{p_n+1}=A_1$) form a sequence $T_n=(a_1,a_2,,,a_{p_n})$ called the “[i]sequence of the partitioned circle[/i]”. For example when $n=13$, the number of the partitioned circle $P_{13}$=4, the sequence of the partitioned circle $T_{13}=(1,3,2,7)$ or $(1,2,6,4)$. Determine the values of $P_{21}$ and $P_{31}$, and find a possible solution of $T_{21}$ and $T_{31}$ respectively.

Determine the polynomials P of two variables so that: [b]a.)[/b] for any real numbers $t,x,y$ we have $P(tx,ty) = t^n P(x,y)$ where $n$ is a positive integer, the same for all $t,x,y;$ [b]b.)[/b] for any real numbers $a,b,c$ we have $P(a + b,c) + P(b + c,a) + P(c + a,b) = 0;$ [b]c.)[/b] $P(1,0) =1.$

We place $8$ distinct integers in the vertices of a cube and then write the greatest common divisor of each pair of adjacent vertices on the edge connecting them. Let $E$ be the sum of the numbers on the edges and $V$ the sum of the numbers on the vertices. a) Prove that $\frac23E\le V$. b) Can $E=V$?

Find all triples $(a,b,c)$ of positive integers such that if $n$ is not divisible by any prime less than $2014$, then $n+c$ divides $a^n+b^n+n$. [i]Proposed by Evan Chen[/i]

Find all functions $ f: \mathbb{R}\to\mathbb{R}$ that satisfy the equation: $ f\left(\left(f\left(x\right)\right)^2 \plus{} f\left(y\right)\right) \equal{} xf\left(x\right) \plus{} y$ for any two real numbers $ x$ and $ y$.

The numeral $47$ in base $a$ represents the same number as $74$ in base $b$. Assuming that both bases are positive integers, the least possible value of $a+b$ written as a Roman numeral, is $\textbf{(A) }\mathrm{XIII}\qquad\textbf{(B) }\mathrm{XV}\qquad\textbf{(C) }\mathrm{XXI}\qquad\textbf{(D) }\mathrm{XXIV}\qquad \textbf{(E) }\mathrm{XVI}$

Let $a$ and $b$ be positive integers, $b<a$, such that $a^3+b^3+ab$ is divisible by $ab(a-b)$. Prove that $ab$ is a perfect cube.

Let $ f:[1,\infty )\longrightarrow (0,\infty ) $ be a continuous function satisfying the following properties: $ \text{(i)}\exists\lim_{x\to\infty } \frac{f(x)}{x}\in\overline{\mathbb{R}} $ $ \text{(ii)}\exists\lim_{x\to\infty } \frac{1}{x}\int_1^x f(t)dt\in\mathbb{R}. $ [b]a)[/b] Show that $ \lim_{x\to\infty } \frac{f(x)}{x}=0. $ [b]b)[/b] Prove that $ \lim_{x\to\infty } \frac{1}{x^2}\int_1^x f^2(t)dt=0. $

Tom has a scientific calculator. Unfortunately, all keys are broken except for one row: 1, 2, 3, + and -. Tom presses a sequence of $5$ random keystrokes; at each stroke, each key is equally likely to be pressed. The calculator then evaluates the entire expression, yielding a result of $E$. Find the expected value of $E$. (Note: Negative numbers are permitted, so 13-22 gives $E = -9$. Any excess operators are parsed as signs, so -2-+3 gives $E=-5$ and -+-31 gives $E = 31$. Trailing operators are discarded, so 2++-+ gives $E=2$. A string consisting only of operators, such as -++-+, gives $E=0$.) [i]Proposed by Lewis Chen[/i]

A model used to estimate the time it will take to hike to the top of the mountain on a trail is of the form $T = aL + bG,$ where $a$ and $b$ are constants, $T$ is the time in minutes, $L$ is the length of the trail in miles, and $G$ is the altitude gain in feet. The model estimates that it will take $69$ minutes to hike to the top if a trail is $1.5$ miles long and ascends $800$ feet, as well as if a trail is $1.2$ miles long and ascends $1100$ feet. How many minutes does the model estimate it will take to hike to the top if the trail is $4.2$ miles long and ascends $4000$ feet? $\textbf{(A) } 240 \qquad \textbf{(B) } 246 \qquad \textbf{(C) } 252 \qquad \textbf{(D) } 258 \qquad \textbf{(E) } 264$

Find all polynomials $P(x, y)$ with real coefficients which for all real numbers $x$ and $y$ satisfy $P(x + y, x - y) = 2P(x, y)$.