Let $a$ be a positive integer.Suppose that $\forall n$ ,$\exists d$, $d\not =1$, $d\equiv 1\pmod n$ ,$d\mid n^2a-1$.Prove that $a$ is a perfect square.

Let $k$ be a positive integer. Find all collection of integers $(a_1, a_2,\cdots, a_k)$ such that there exist a non-linear polynomial $P$ with integer coefficients, so that for all positive integers $n$ there exist a positive integer $m$ satisfying: $$P(n+a_1)+P(n+a_2)+...+P(n+a_k)=P(m)$$ [i]Proposed by Ivan Chan Kai Chin[/i]

A sequence $a_1, a_2,\dots, a_n$ of positive integers is [i]alagoana[/i], if for every $n$ positive integer, one have these two conditions I- $a_{n!} = a_1\cdot a_2\cdot a_3\cdots a_n$ II- The number $a_n$ is the $n$-power of a positive integer. Find all the sequence(s) [i]alagoana[/i].

Let $ABC$ be any triangle with $\angle BAC \le \angle ACB \le \angle CBA$. Let $D, E$ and $F$ be the midpoints of $BC, CA$ and $AB$, respectively, and let $\epsilon$ be a positive real number. Suppose there is an ant (represented by a point $T$ ) and two spiders (represented by points $P_1$ and $P_2$, respectively) walking on the sides $BC, CA, AB, EF, FD$ and $DE$. The ant and the spiders may vary their speeds, turn at an intersection point, stand still, or turn back at any point; moreover, they are aware of their and the others’ positions at all time. Assume that the ant’s speed does not exceed $1$ mm/s, the first spider’s speed does not exceed $\frac{\sin A}{2 \sin A+\sin B}$ mm/s, and the second spider’s speed does not exceed $\epsilon$ mm/s. Show that the spiders always have a strategy to catch the ant regardless of the starting points of the ant and the spiders. Note: the two spiders can discuss a plan before the hunt starts and after seeing all three starting points, but cannot communicate during the hunt.

Let $n$ be a positive integer. Find the greatest possible integer $m$, in terms of $n$, with the following property: a table with $m$ rows and $n$ columns can be filled with real numbers in such a manner that for any two different rows $\left[ {{a_1},{a_2},\ldots,{a_n}}\right]$ and $\left[ {{b_1},{b_2},\ldots,{b_n}} \right]$ the following holds: \[\max\left( {\left| {{a_1} - {b_1}} \right|,\left| {{a_2} - {b_2}} \right|,...,\left| {{a_n} - {b_n}} \right|} \right) = 1\] [i]Poland (Tomasz Kobos)[/i]

A point $P$ in the interior of a regular hexagon is at distances $8,8,16$ units from three consecutive vertices of the hexagon, respectively. If $r$ is radius of the circumscribed circle of the hexagon, what is the integer closest to $r$?

Let $ABCD$ be a convex quadrilateral. The bisector of the angle $ACD$ intersects $BD$ at point $E$. It is known that $\angle CAD = \angle BCE= 90^o$. Prove that the $AC$ is the bisector of the angle $BAE$ . (Nikolay Nikolay)

The width of rectangle $ABCD$ is twice its height, and the height of rectangle $EFCG$ is twice its width. The point $E$ lies on the diagonal $BD$. Which fraction of the area of the big rectangle is that of the small one? [img]https://1.bp.blogspot.com/-aeqefhbBh5E/XzcBjhgg7sI/AAAAAAAAMXM/B0qSgWDBuqc3ysd-mOitP1LarOtBdJJ3gCLcBGAsYHQ/s0/2004%2BMohr%2Bp1.png[/img]

In the following diagram, the square and pentagon are both regular and share segment $AB$ as designated. What is the measure of $\angle CBD$ in degrees?

Find all positive integers $m$ and $n$ such that both $3^{m}+1$ and $3^{n}+1$ are divisible by $mn$.

Let $ \varphi(x)$ be a cubic polynomial with integer coefficients. Given that $ \varphi(x)$ has have 3 distinct real roots $u,v,w $ and $u,v,w $ are not rational number. there are integers $ a, b,c$ such that $u=av^2+bv+c$. Prove that $b^2 -2b -4ac - 7$ is a square number .

In the acute-angle triangle $ABC$ we have $\angle ACB = 45^\circ$. The points $A_1$ and $B_1$ are the feet of the altitudes from $A$ and $B$, and $H$ is the orthocenter of the triangle. We consider the points $D$ and $E$ on the segments $AA_1$ and $BC$ such that $A_1D = A_1E = A_1B_1$. Prove that a) $A_1B_1 = \sqrt{ \frac{A_1B^2+A_1C^2}{2} }$; b) $CH=DE$.

A black bishop and a white king are placed randomly on a $2000 \times 2000$ chessboard (in distinct squares). Let $p$ be the probability that the bishop attacks the king (that is, the bishop and king lie on some common diagonal of the board). Then $p$ can be expressed in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m$. [i]Proposed by Ahaan Rungta[/i]

The graph of the degree $2021$ polynomial $P(x)$, which has real coefficients and leading coefficient $1$, meets the $x$-axis at the points $(1,0),\, (2,0),\,(3,0),\dots,\, (2020,0)$ and nowhere else. The mean of all possible values of $P(2021)$ can be written in the form $a!/b$, where $a$ and $b$ are positive integers and $a$ is as small as possible. Compute $a+b$.

As shown in the figure below a regular dodecahedron (the polyhedron consisting of 12 congruent regular pentagonal faces) floats in space with two horizontal faces. Note that there is a ring of five slanted faces adjacent to the top face, and a ring of five slanted faces adjacent to the bottom face. How many ways are there to move from the top face to the bottom face via a sequence of adjacent faces so that each face is visited at most once and moves are not permitted from the bottom ring to the top ring? [asy] import graph; unitsize(4.5cm); pair A = (0.082, 0.378); pair B = (0.091, 0.649); pair C = (0.249, 0.899); pair D = (0.479, 0.939); pair E = (0.758, 0.893); pair F = (0.862, 0.658); pair G = (0.924, 0.403); pair H = (0.747, 0.194); pair I = (0.526, 0.075); pair J = (0.251, 0.170); pair K = (0.568, 0.234); pair L = (0.262, 0.449); pair M = (0.373, 0.813); pair N = (0.731, 0.813); pair O = (0.851, 0.461); path[] f; f[0] = A--B--C--M--L--cycle; f[1] = C--D--E--N--M--cycle; f[2] = E--F--G--O--N--cycle; f[3] = G--H--I--K--O--cycle; f[4] = I--J--A--L--K--cycle; f[5] = K--L--M--N--O--cycle; draw(f[0]); axialshade(f[1], white, M, gray(0.5), (C+2*D)/3); draw(f[1]); filldraw(f[2], gray); filldraw(f[3], gray); axialshade(f[4], white, L, gray(0.7), J); draw(f[4]); draw(f[5]); [/asy] $\textbf{(A) } 125 \qquad \textbf{(B) } 250 \qquad \textbf{(C) } 405 \qquad \textbf{(D) } 640 \qquad \textbf{(E) } 810$

Let $n$ red and $n$ blue subarcs of a circle be given such that each red subarc intersects each blue subarc. Prove that there is a point which is covered by at least $n$ of the given (red or blue) subarcs.

The polynomials $k_n(x_1, \ldots, x_n)$, where $n$ is a non-negative integer, satisfy the following conditions \[k_0=1\] \[k_1(x_1)=x_1\] \[k_n(x_1, \ldots, x_n) = x_nk_{n-1}(x_1, \ldots , x_{n-1}) + (x_n^2+x_{n-1}^2)k_{n-2}(x_1,\ldots,x_{n-2})\] Prove that for each non-negative $n$ we have $k_n(x_1,\ldots,x_n)=k_n(x_n,\ldots,x_1)$.

In the village of numbers the houses are numbered from $1$ to $n$. Meanwhile, one of the houses was demolished. Duarte calculated that the average number of houses that still exist is $\frac{202}{3}$ . How many houses were there in the village and what is the number of the demolished house?

Is it possible to divide the integers from $1$ to $100$ inclusive into $50$ pairs such that for $1\le k\le 50$, the difference between the two numbers in the $k$-th pair is $k$? (V Proizvolov)

How many zeros does $ f(x) \equal{} \cos(\log(x)))$ have on the interval $ 0 < x < 1$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ \text{infinitely many}$

Points $E$ and $F$ are located on square $ABCD$ so that $\Delta BEF$ is equilateral. What is the ratio of the area of $\Delta DEF$ to that of $\Delta ABE$? [asy] pair A=origin, B=(1,0), C=(1,1), D=(0,1), X=B+2*dir(165), E=intersectionpoint(B--X, A--D), Y=B+2*dir(105), F=intersectionpoint(B--Y, D--C); draw(B--C--D--A--B--F--E--B); pair point=(0.5,0.5); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F));[/asy] $\textbf{(A)}\; \frac43\qquad \textbf{(B)}\; \frac32\qquad \textbf{(C)}\; \sqrt3\qquad \textbf{(D)}\; 2\qquad \textbf{(E)}\; 1+\sqrt3\qquad$

Consider a triangle $ABC$ in which $AB<BC<CA$. The excircles touch the sides $BC, CA,$ and $AB$ at points $A_1, B_1$ and $C_1$ respectively. A circle is drawn through the points $A_1, B_1$ and $C_1$ which intersects the sides $BC, CA$ and $AB$ for the second time at the points $A_2, B_2$ and $C_2$ respectively. On which side of the triangle can lie the largest of the segments $A_1A_2, B_1B_2$ and $C_1C_2$? [i]Proposed by I. Weinstein[/i]

(a) What is the maximum area of a triangle with vertices in a given square (or on its boundary)? (b) What is the maximum volume of a tetrahedron with vertices in a given cube (or on its boundary)?

Let $\vartriangle ABC$ be a triangle such that angle $\angle ABC$ is less than angle $\angle ACB$. The bisector of angle $\angle BAC$ cuts side $BC$ at $D$. Let $E$ be on side $AB$ such that $\angle EDB = 90^o$ and $F$ on side $AC$ such that $\angle BED = \angle DEF$. Prove that $\angle BAD = \angle FDC$.

Find all the polynomials with real coefficients which satisfy $ (x^2-6x+8)P(x)=(x^2+2x)P(x-2)$ for all $x\in \mathbb{R}$.