Determine all solutions $(p,n)$ of the equation \[n^3=p^2-p-1\] where $p$ is a prime number and $n$ is an integer

Determine all solutions of the equation $4^x + 4^y + 4^z = u^2$ for integers $x,y,z$ and $u$.

A positive integer is called [i]cool[/i] if it can be expressed in the form $a!\cdot b!+315$ where $a,b$ are positive integers. For example, $1!\cdot 1!+315=316$ is a cool number. Find the sum of all cool numbers that are also prime numbers. [i]Proposed by Evan Fang

Let $ABCD$ be a trapezium, $AD\parallel BC$, and let $E,F$ be points on the sides$AB$ and $CD$, respectively. The circumcircle of $AEF$ meets $AD$ again at $A_1$, and the circumcircle of $CEF$ meets $BC$ again at $C_1$. Prove that $A_1C_1,BD,EF$ are concurrent.

Let be a sequence of natural numbers $ \left( a_n \right)_{n\ge 1} $ such that $ a_n\le n $ for all natural numbers $ n, $ and $$ \sum_{j=1}^{k-1} \cos \frac{\pi a_j}{k} =0, $$ for all natural $ k\ge 2. $ [b]a)[/b] Find $ a_2. $ [b]b)[/b] Determine this sequence.

Given is a $n\times n$ grid with all squares on one diagonal being forbidden. You are allowed to start from any square, and move one step horizontally, vertically or diagonally. You are not allowed to visit a forbidden square or previously visited square. Your goal is to visit all non forbidden squares. Find, with proof, the minimum number of times you will have to move one step diagonally

There is a token in one of the nodes of a hexagon with side $n$, divided into regular triangles (see figure). Two players take turns moving it to one of the neighboring nodes, and it is forbidden to go to a node that the token has already visited. The one who loses who can't make a move. Who wins with the right game? [img]https://cdn.artofproblemsolving.com/attachments/2/f/18314fe7f9f4cd8e783037a8e5642e17f4e1be.png[/img]

Find all positive integers $a$ such that $4x^2 + a$ is prime for all $x = 0, 1, \dots, a - 1$.

Let $a,b,c$ be reals and \[f(a, b, c) = \left| \frac{ |b-a|}{|ab|} +\frac{b+a}{ab} -\frac 2c \right| +\frac{ |b-a|}{|ab|} +\frac{b+a}{ab} +\frac 2c\] Prove that $f(a, b, c) = 4 \max \{\frac 1a, \frac 1b,\frac 1c \}.$

When some number $a^2$ is written in base $b$, the result is $144_b$. $a$ and $b$ also happen to be integer side lengths of a right triangle. If $a$ and $b$ are both less than $20$, find the sum of all possible values of $a$.

A right $100$-gon $P$ is given, which has $x$ vertices coloured in white and all other in black. If among some vertices of a right polygon, all the vertices of which are also vertices of $P$, there is exactly one white vertex, then you are allowed to colour this vertex in black. Find all positive integers $x \leq 100$ for which for all initial colourings it is not possible to make all vertices black. [i]A. Vaidzelevich,M. Shutro[/i]

Determine whether or not there are any positive integral solutions of the simultaneous equations \begin{align*}x_1^2+x_2^2+\cdots+x_{1985}^2&=y^3,\\ x_1^3+x_2^3+\cdots+x_{1985}^3&=z^2\end{align*} with distinct integers $x_1$, $x_2$, $\ldots$, $x_{1985}$.

Let $r$ be a nonnegative continuous function on the real line. Show that there exists a function $f\in C^1(\mathbb{R})$, not identically zero, such that $f'(x)=f(x-r(f(x)))$, $x\in\mathbb{R}$. (translated by L. Erdős)

If $C^p_n=\frac{n!}{p!(n-p)!} (p \ge 1)$, prove the identity \[C^p_n=C^{p-1}_{n-1} + C^{p-1}_{n-2} + \cdots + C^{p-1}_{p} + C^{p-1}_{p-1}\] and then evaluate the sum \[S = 1\cdot 2 \cdot 3 + 2 \cdot 3 \cdot 4 + \cdots + 97 \cdot 98 \cdot 99.\]

A rectangular pool table has vertices at $(0, 0) (12, 0) (0, 10),$ and $(12, 10)$. There are pockets only in the four corners. A ball is hit from $(0, 0)$ along the line $y = x$ and bounces off several walls before eventually entering a pocket. Find the number of walls that the ball bounces off of before entering a pocket.

This ISL 2005 problem has not been used in any TST I know. A pity, since it is a nice problem, but in its shortlist formulation, it is absolutely incomprehensible. Here is a mathematical restatement of the problem: Let $k$ be a nonnegative integer. A forest consists of rooted (i. e. oriented) trees. Each vertex of the forest is either a leaf or has two successors. A vertex $v$ is called an [i]extended successor[/i] of a vertex $u$ if there is a chain of vertices $u_{0}=u$, $u_{1}$, $u_{2}$, ..., $u_{t-1}$, $u_{t}=v$ with $t>0$ such that the vertex $u_{i+1}$ is a successor of the vertex $u_{i}$ for every integer $i$ with $0\leq i\leq t-1$. A vertex is called [i]dynastic[/i] if it has two successors and each of these successors has at least $k$ extended successors. Prove that if the forest has $n$ vertices, then there are at most $\frac{n}{k+2}$ dynastic vertices.

Several irrational numbers are written on a blackboard. It is known that for every two numbers $ a$ and $ b$ on the blackboard, at least one of the numbers $ a\over b\plus{}1$ and $ b\over a\plus{}1$ is rational. What maximum number of irrational numbers can be on the blackboard? [i]Author: Alexander Golovanov[/i]

Let $\triangle XOY$ be a right-angled triangle with $\angle XOY=90^\circ$. Let $M$ and $N$ be the midpoints of legs $OX$ and $OY$, respectively. Find the length $XY$ given that $XN=22$ and $YM=31$.

Two non-decreasing sequences of nonnegative integers have different first terms. Each sequence has the property that each term beginning with the third is the sum of the previous two terms, and the seventh term of each sequence is $N$. What is the smallest possible value of $N$? ${ \textbf{(A)}\ 55\qquad\textbf{(B)}\ 89\qquad\textbf{(C)}\ 104\qquad\textbf{(D}}\ 144\qquad\textbf{(E)}\ 273 $

Is it true, that for all pairs of non-negative integers $a$ and $b$ , the system \begin{align*} \tan{13x} \tan{ay} =& 1 \\ \tan{21x} \tan{by}= & 1 \end{align*} has at least one solution?

Each square of the chessboard was painted in one of eight colors in such a way that the number of squares colored by all the colors are equal. Is it always possible to put $8$ rooks not threatening each other on multi-colored cells?

Given that $x, y,$ and $z$ are positive real numbers such that $$x^{\log_2(yz)}=2^8\cdot3^4, \quad y^{\log_2(zx)}=2^9\cdot3^6, \quad \text{and}\quad z^{\log_2(xy)}=2^5 \cdot 3^{10},$$ compute the smallest possible value of $xyz.$

Let $ABCD$ be a convex quadrilateral and let the diagonals $AC$ and $BD$ intersect at $O$. Let $I_1, I_2, I_3, I_4$ be respectively the incentres of triangles $AOB, BOC, COD, DOA$. Let $J_1, J_2, J_3, J_4$ be respectively the excentres of triangles $AOB, BOC, COD, DOA$ opposite $O$. Show that $I_1, I_2, I_3, I_4$ lie on a circle if and only if $J_1, J_2, J_3, J_4$ lie on a circle.

One side of a given triangle is $ 18$ inches. Inside the triangle a line segment is drawn parallel to this side forming a trapezoid whose area is one-third of that of the triangle. The length of this segment, in inches, is: $ \textbf{(A)}\ 6\sqrt {6} \qquad \textbf{(B)}\ 9\sqrt {2} \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 6\sqrt {3} \qquad \textbf{(E)}\ 9$

There exists a unique pair of positive integers $k,n$ such that $k$ is divisible by $6$, and $\sum_{i=1}^ki^2=n^2$. Find $(k,n)$.