Prove that the equation $2+x^3y+y^2+z^2=0$ has no solutions in integers.

Suppose that $a_1 = 2$ and the sequence $(a_n)$ satisfies the recurrence relation \[\frac{a_n -1}{n-1}=\frac{a_{n-1}+1}{(n-1)+1}\] for all $n \ge 2.$ What is the greatest integer less than or equal to \[\sum^{100}_{n=1} a_n^2?\] $\textbf{(A) } 338{,}550 \qquad \textbf{(B) } 338{,}551 \qquad \textbf{(C) } 338{,}552 \qquad \textbf{(D) } 338{,}553 \qquad \textbf{(E) } 338{,}554$

[b]p1.[/b] Find a real number $x$ for which $x\lfloor x \rfloor = 1234.$ Note: $\lfloor x\rfloor$ is the largest integer less than or equal to $x$. [b]p2.[/b] Let $C_1$ be a circle of radius $1$, and $C_2$ be a circle that lies completely inside or on the boundary of $C_1$. Suppose$ P$ is a point that lies inside or on $C_2$. Suppose $O_1$, and $O_2$ are the centers of $C_1$, and $C_2$, respectively. What is the maximum possible area of $\vartriangle O_1O_2P$? Prove your answer. [b]p3.[/b] The numbers $1, 2, . . . , 99$ are written on a blackboard. We are allowed to erase any two distinct (but perhaps equal) numbers and replace them by their nonnegative difference. This operation is performed until a single number $k$ remains on the blackboard. What are all the possible values of $k$? Prove your answer. Note: As an example if we start from $1, 2, 3, 4$ on the board, we can proceed by erasing $1$ and $2$ and replacing them by $1$. At that point we are left with $1, 3, 4$. We may then erase $3$ and $4$ and replacethem by $1$. The last step would be to erase $1$, $1$ and end up with a single $0$ on the board. [b]p4.[/b] Let $a, b$ be two real numbers so that $a^3 - 6a^2 + 13a = 1$ and $b^3 - 6b^2 + 13b = 19$. Find $a + b$. Prove your answer. [b]p5.[/b] Let $m, n, k$ be three positive integers with $n \ge k$. Suppose $A =\prod_{1\le i\le j\le m} gcd(n + i, k + j) $ is the product of $gcd(n + i, k + j)$, where $i, j$ range over all integers satisfying $1\le i\le j\le m$. Prove that the following fraction is an integer $$\frac{A}{(k + 1) \dots(k + m)}{n \choose k}.$$ Note: $gcd(a, b)$ is the greatest common divisor of $a$ and $b$, and ${n \choose k}= \frac{n!}{k!(n - k)!}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $p_1,p_2,p_3$ be primes with $p_2\neq p_3$ such that $4+p_1p_2$ and $4+p_1p_3$ are perfect squares. Find all possible values of $p_1,p_2,p_3$.

For positive integers $a$, $b$, and $c$ with $a < b < c$, consider collections of postage stamps in denominations $a$, $b$, and $c$ cents that contain at least one stamp of each denomination. If there exists such a collection that contains sub-collections worth every whole number of cents up to $1000$ cents, let $f(a, b, c)$ be the minimum number of stamps in such a collection. Find the sum of the three least values of $c$ such that $f(a, b, c) = 97$ for some choice of $a$ and $b$.

Find all triplets of nonnegative integers $(x,y,z)$ and $x\leq y$ such that $x^2+y^2=3 \cdot 2016^z+77$

On the sides $AB$ and $AC$ of a triangle $ABC$ select points $D$ and $E$ respectively, such that $AB = 6$, $AC = 9$, $AD = 4$ and $AE = 6$. It is known that the circumscribed circle of $\vartriangle ADE$ interects the side $BC$ at points $F, G$ , where $BF < BG$. Knowing that the point of intersection of lines $DF$ and $EG$ lies on the circumscribed circle of $\vartriangle ABC$ , find the ratio $BC:FG$.

In $\Delta ABC$, $AC=kAB$, with $k>1$. The internal angle bisector of $\angle BAC$ meets $BC$ at $D$. The circle with $AC$ as diameter cuts the extension of $AD$ at $E$. Express $\dfrac{AD}{AE}$ in terms of $k$.

Nathan has a collection of weights each weighing either $1, 2, 3,$ or $5$ pounds (and he has an infinite number of each weight). In how many ways can he measure out eight pounds? $\mathrm{(A) \ } 11 \qquad \mathrm{(B) \ } 12 \qquad \mathrm {(C) \ } 13 \qquad \mathrm{(D) \ } 14 \qquad \mathrm{(E) \ } 15$

Finitely many points are given on the surface of a sphere, such that every four of them lie on the surface of open hemisphere. Prove that all points lie on the surface of an open hemisphere.

Find all positive integers $n$ such that we can divide the set $\{1,2,3,\ldots,n\}$ into three sets with the same sum of members.

Let $a, b,c$ be positive integers such that $gcd(a, b, c) = 1$ and each product of two is divided by the third. a) Prove that each of these numbers is equal to the least two remaining numbers the quotient of the coefficient and the highest coefficient. b) Give an example of one of these larger numbers $a, b$ and $c$

A [i]special number[/i] is a positive integer $n$ for which there exists positive integers $a$, $b$, $c$, and $d$ with \[ n = \frac {a^3 + 2b^3} {c^3 + 2d^3}. \] Prove that i) there are infinitely many special numbers; ii) $2014$ is not a special number. [i]Romania[/i]

Does there exist a strictly increasing sequence $\{a_n\}_{n=1}^\infty$ of natural numbers with the following property: for $\forall$ $c\in \mathbb{Z}$ the sequence $c+a_1,c+a_2,...,c+a_n...$ has finite number of primes? Explain your answer.

In the right-angled triangle $ABC$ with a right angle at $C$, the side $BC$ is longer than the side $AC$. The perpendicular bisector of $AB$ intersects the line $BC$ at point $D$ and the line $AC$ at point $E$. The segments $DE$ has the same length as the side $AB$. Find the measures of the angles of the triangle $ABC$. (R. Henner, Vienna)

In triangle $ABC$, angle $A$ is equal to $a$ and the altitude drawn to side $BC$ is equal to $h$. The inscribed circle of the triangle touches the sides of the triangle at points $K$, $M$ and $P$, where $P$ lies on side $BC$. Find the distance from $P$ to $KM$.

Consider a $12$-sided regular polygon. If the vertices going clockwise are $A$, $B$, $C$, $D$, $E$, $F$, etc, draw a line between $A$ and $F$, $B$ and $G$, $C$ and $H$, etc. This will form a smaller $12$-sided regular polygon in the center of the larger one. What is the area of the smaller one divided by the area of the larger one?

Let $n> 2$ be a positive integer. Given is a horizontal row of $n$ cells where each cell is painted blue or red. We say that a block is a sequence of consecutive boxes of the same color. Arepito the crab is initially standing at the leftmost cell. On each turn, he counts the number $m$ of cells belonging to the largest block containing the square he is on, and does one of the following: If the square he is on is blue and there are at least $m$ squares to the right of him, Arepito moves $m$ squares to the right; If the square he is in is red and there are at least $m$ squares to the left of him, Arepito moves $m$ cells to the left; In any other case, he stays on the same square and does not move any further. For each $n$, determine the smallest integer $k$ for which there is an initial coloring of the row with $k$ blue cells, for which Arepito will reach the rightmost cell.

Find the minimum possible sum of lengths of edges of a prism all of whose edges are tangent of a unit sphere. [Muller-Pfeiffer].

Let $X$ be a set of $n + 1$ elements, $n\geq 2$. Ordered $n$-tuples $(a_1,\ldots,a_n)$ and $(b_1,\ldots,b_n)$ formed from distinct elements of $X$ are called[i] disjoint [/i]if there exist distinct indices $1\leq i \neq j\leq n$ such that $a_i = b_j$. Find the maximal number of pairwise disjoint $n$-tuples.

Find the sum of the solution(s) $x$ to the equation \[x=\sqrt{2022+\sqrt{2022+x}}.\]

Let $P$ be a real polynomial with degree $n\ge1$ such that $$P(0),P(1),P(4),P(9),\ldots,P(n^2)$$ are in $\mathbb Z$. Prove that $\forall a\in\mathbb Z,P(a^2)\in\mathbb Z$. [i]Proposed by Moubinool Omarjee[/i]

1. A strip for playing "hopscotch" consists of ten squares numbered consecutively $1,2, \ldots, 10$. Clarissa and Marissa start from the center of the first square, jump 9 times to the centers of the other squares so that they visit each square once, and end up at the tenth square. (Jumps forward and backward are allowed.) Each jump of Clarissa was for the same distance as the corresponding jump of Marissa. Does this mean that they both visited the squares in the same order? Alexey Tolpygo

In this diagram the center of the circle is $O$, the radius is $a$ inches, chord $EF$ is parallel to chord $CD, O, G, H, J$ are collinear, and $G$ is the midpoint of $CD$. Let $K$ (sq. in.) represent the area of trapezoid $CDFE$ and let $R$ (sq. in.) represent the area of rectangle $ELMF$. Then, as $CD$ and $EF$ are translated upward so that $OG$ increases toward the value $a$, while $JH$ always equals $HG$, the ratio $K:R$ become arbitrarily close to: [asy] size((270)); draw((0,0)--(10,0)..(5,5)..(0,0)); draw((5,0)--(5,5)); draw((9,3)--(1,3)--(1,1)--(9,1)--cycle); draw((9.9,1)--(.1,1)); label("O", (5,0), S); label("a", (7.5,0), S); label("G", (5,1), SE); label("J", (5,5), N); label("H", (5,3), NE); label("E", (1,3), NW); label("L", (1,1), S); label("C", (.1,1), W); label("F", (9,3), NE); label("M", (9,1), S); label("D", (9.9,1), E); [/asy] $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ \sqrt{2} \qquad\textbf{(D)}\ \frac{1}{\sqrt{2}}+\frac{1}{2} \qquad\textbf{(E)}\ \frac{1}{\sqrt{2}}+1$

Let $S $ be a set of three distinct integers. Show that there are $a, b \in S$ such that $a \ne b$ and $10 | a^3b - ab^3$.