There is the number $1$ on the board at the beginning. If the number $a$ is written on the board, then we can also write a natural number $b$ such that $a + b + 1$ is a divisor of $a^2 + b^2 + 1$. Can any positive integer appear on the board after a certain time? Justify your answer.

Compute the number of non-empty subsets $S$ of $\{-3, -2, -1, 0, 1, 2, 3\}$ with the following property: for any $k \ge 1$ distinct elements $a_1, \dots, a_k \in S$ we have $a_1 + \dots + a_k \neq 0$. [i]Proposed by Evan Chen[/i]

We want to cover a rectangular $5 \times 137$ with the following figures, prove that this is impossible. \[\text{Squars are the same and all are } \Huge{1 \times 1}\] [asy] import graph; size(400); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black; pen xdxdff = rgb(0.49,0.49,1); draw((2,4)--(0,4),linewidth(2pt)); draw((0,4)--(0,0),linewidth(2pt)); draw((0,0)--(2,0),linewidth(2pt)); draw((2,0)--(2,1),linewidth(2pt)); draw((2,1)--(0,1),linewidth(2pt)); draw((1,0)--(1,4),linewidth(2pt)); draw((2,4)--(2,3),linewidth(2pt)); draw((2,3)--(0,3),linewidth(2pt)); draw((0,2)--(1,2),linewidth(2pt)); label("(1)", (0.56,-1.54), SE*lsf); draw((4,2)--(4,1),linewidth(2pt)); draw((7,2)--(7,1),linewidth(2pt)); draw((4,2)--(7,2),linewidth(2pt)); draw((4,1)--(7,1),linewidth(2pt)); draw((6,0)--(6,3),linewidth(2pt)); draw((5,3)--(5,0),linewidth(2pt)); draw((5,0)--(6,0),linewidth(2pt)); draw((5,3)--(6,3),linewidth(2pt)); label("(2)", (5.13,-1.46), SE*lsf); draw((9,0)--(9,3),linewidth(2pt)); draw((10,3)--(10,0),linewidth(2pt)); draw((12,3)--(12,0),linewidth(2pt)); draw((11,0)--(11,3),linewidth(2pt)); draw((9,2)--(12,2),linewidth(2pt)); draw((12,1)--(9,1),linewidth(2pt)); draw((9,3)--(10,3),linewidth(2pt)); draw((11,3)--(12,3),linewidth(2pt)); draw((12,0)--(11,0),linewidth(2pt)); draw((9,0)--(10,0),linewidth(2pt)); label("(3)", (10.08,-1.48), SE*lsf); draw((14,1)--(17,1),linewidth(2pt)); draw((15,2)--(17,2),linewidth(2pt)); draw((15,2)--(15,0),linewidth(2pt)); draw((15,0)--(14,0)); draw((14,1)--(14,0),linewidth(2pt)); draw((16,2)--(16,0),linewidth(2pt)); label("(4)", (15.22,-1.5), SE*lsf); draw((14,0)--(16,0),linewidth(2pt)); draw((17,2)--(17,1),linewidth(2pt)); draw((19,3)--(19,0),linewidth(2pt)); draw((20,3)--(20,0),linewidth(2pt)); draw((20,3)--(19,3),linewidth(2pt)); draw((19,2)--(20,2),linewidth(2pt)); draw((19,1)--(20,1),linewidth(2pt)); draw((20,0)--(19,0),linewidth(2pt)); label("(5)", (19.11,-1.5), SE*lsf); dot((0,0),ds); dot((0,1),ds); dot((0,2),ds); dot((0,3),ds); dot((0,4),ds); dot((1,4),ds); dot((2,4),ds); dot((2,3),ds); dot((1,3),ds); dot((1,2),ds); dot((1,1),ds); dot((2,1),ds); dot((2,0),ds); dot((1,0),ds); dot((5,0),ds); dot((6,0),ds); dot((5,1),ds); dot((6,1),ds); dot((5,2),ds); dot((6,2),ds); dot((5,3),ds); dot((6,3),ds); dot((7,2),ds); dot((7,1),ds); dot((4,1),ds); dot((4,2),ds); dot((9,0),ds); dot((9,1),ds); dot((9,2),ds); dot((9,3),ds); dot((10,0),ds); dot((11,0),ds); dot((12,0),ds); dot((10,1),ds); dot((10,2),ds); dot((10,3),ds); dot((11,1),ds); dot((11,2),ds); dot((11,3),ds); dot((12,1),ds); dot((12,2),ds); dot((12,3),ds); dot((14,0),ds); dot((15,0),ds); dot((16,0),ds); dot((15,1),ds); dot((14,1),ds); dot((16,1),ds); dot((15,2),ds); dot((16,2),ds); dot((17,2),ds); dot((17,1),ds); dot((19,0),ds); dot((20,0),ds); dot((19,1),ds); dot((20,1),ds); dot((19,2),ds); dot((20,2),ds); dot((19,3),ds); dot((20,3),ds); clip((-0.41,-10.15)--(-0.41,8.08)--(21.25,8.08)--(21.25,-10.15)--cycle); [/asy]

Given integer $n$, let $W_n$ be the set of complex numbers of the form $re^{2qi\pi}$, where $q$ is a rational number so that $q_n \in Z$ and $r$ is a real number. Suppose that p is a polynomial of degree $ \ge 2$ such that there exists a non-constant function $f : W_n \to C$ so that $p(f(x))p(f(y)) = f(xy)$ for all $x, y \in W_n$. If $p$ is the unique monic polynomial of lowest degree for which such an $f$ exists for $n = 65$, find $p(10)$.

In equilateral triangle $ABC$, a circle $\omega$ is drawn such that it is tangent to all three sides of the triangle. A line is drawn from $A$ to point $D$ on segment $BC$ such that $AD$ intersects $\omega$ at points $E$ and $F$. If $EF = 4$ and $AB = 8$, determine $|AE - FD|$.

For a positive integer $n$, numbers $2n+1$ and $3n+1$ are both perfect squares. Is it possible for $5n+3$ to be prime?

Show that, for any sequence $a_1,a_2,\ldots$ of real numbers, the two conditions \[ \lim_{n\to\infty}\frac{e^{(ia_1)} + e^{(ia_2)} + \cdots + e^{(ia_n)}}n = \alpha \] and \[ \lim_{n\to\infty}\frac{e^{(ia_1)} + e^{(ia_2)} + \cdots + e^{(ia_{n^2})}}{n^2} = \alpha \] are equivalent.

Given $\triangle ABC$ and it's orthocenter $H$. Point $P$ is arbitrary chosen on the side $ BC$. Let $Q$ and $R$ be reflections of point $P$ over sides $AB, AC$. It is given that points $Q,H,R$ are collinear. Prove that $\triangle ABC$ is right angled.

Two long cylindrical tubes of the same length but different diameters lie parallel to each other on a flat surface. The larger tube has radius $72$ and rolls along the surface toward the smaller tube, which has radius $24$. It rolls over the smaller tube and continues rolling along the flat surface until it comes to rest on the same point of its circumference as it started, having made one complete revolution. If the smaller tube never moves, and the rolling occurs with no slipping, the larger tube ends up a distance $x$ from where it starts. The distance $x$ can be expressed in the form $a\pi+b\sqrt{c},$ where $a,$ $b,$ and $c$ are integers and $c$ is not divisible by the square of any prime. Find $a+b+c.$

Let $O$ be the intersection of the diagonals of convex quadrilateral $ABCD$. The circumcircles of $\triangle{OAD}$ and $\triangle{OBC}$ meet at $O$ and $M$. Line $OM$ meets the circumcircles of $\triangle{OAB}$ and $\triangle{OCD}$ at $T$ and $S$ respectively. Prove that $M$ is the midpoint of $ST$.

Let $ m $ and $ n $ be odd integers such that $n^2 - 1 $ is divisible by $m^2 + 1 - n^2 $. Prove that $ |m^2 + 1 - n^2 | $ is a perfect square.

Consider the integer $30x070y03$ where $x, y$ are unknown digits. Find all possible values of $x, y$ so that the given integer is a multiple of $37$.

Jeremy has three cups. Cup $A$ has a cylindrical shape, cup $B$ has a conical shape, and cup $C$ has a hemispherical shape. The rim of the cup at the top is a unit circle for every cup, and each cup has the same volume. If the cups are ordered from least height to greatest height, what is the ordering of the cups?

Let's define [i]almost mean[/i] of numbers $a_1, a_2, \ldots, a_n$ as $\frac{a_1 + a_2 + \ldots + a_n}{n+1}$. Oleksiy has positive real numbers $b_1, b_2, \ldots, b_{2023}$, not necessarily distinct. For each pair $(i, j)$ with $1 \leq i, j \leq 2023$, Oleksiy wrote on a board [i]almost mean[/i] of numbers $b_i, b_{i+1}, \ldots, b_j$. Prove that there are at least $45$ distinct numbers on the board. [i]Proposed by Anton Trygub[/i]

Find the differentiable functions $ f:\mathbb{R}\longrightarrow (-\infty ,1) $ with the property $ f(1)=-1 $ and $$ f(x+y)=f(x)+f(y)-f(x)f(y) , $$ for any reals $ x,y. $ [i]Vasile Pop[/i]

Three circles of radius $ 1$ are externally tangent to each other and internally tangent to a larger circle. What is the radius of the large circle? [asy]unitsize(0.8cm); defaultpen(linewidth(.8pt)+fontsize(8pt)); real r = 1 + (2/3)*(sqrt(3)); pair A = dir(47.5)*(r - 1); pair B = dir(167.5)*(r - 1); pair C = dir(-72.5)*(r - 1); draw(Circle(A,1)); draw(Circle(B,1)); draw(Circle(C,1)); draw(Circle(origin,r));[/asy] $ \textbf{(A)}\ \frac{2 \plus{} \sqrt{6}}{3}\qquad \textbf{(B)}\ 2\qquad \textbf{(C)}\ \frac{2 \plus{} 3\sqrt{2}}{3}\qquad \textbf{(D)}\ \frac{3 \plus{} 2\sqrt{3}}{3}\qquad \textbf{(E)}\ \frac{3 \plus{} \sqrt{3}}{2}$

We are given an infinite set of rectangles in the plane, each with vertices of the form $(0, 0)$, $(0,m)$, $(n, 0)$ and $ (n,m)$, where $m$ and $n$ are positive integers. Prove that there exist two rectangles in the set such that one contains the other.

Find $\sum_{k=1}^\infty\frac{k^2-2}{(k+2)!}$.

Given an equilateral triangle with sidelength $k$ cm. With lines parallel to it's sides, we split it into $k^2$ small equilateral triangles with sidelength $1$ cm. This way, a triangular grid is created. In every small triangle of sidelength $1$ cm, we place exactly one integer from $1$ to $k^2$ (included), such that there are no such triangles having the same numbers. With vertices the points of the grid, regular hexagons are defined of sidelengths $1$ cm. We shall name as [i]value [/i] of the hexagon, the sum of the numbers that lie on the $6$ small equilateral triangles that the hexagon consists of . Find (in terms of the integer $k>4$) the maximum and the minimum value of the sum of the values of all hexagons .

[list=a][*] Find infinitely many pairs of integers $a$ and $b$ with $1<a<b$, so that $ab$ exactly divides $a^{2}+b^{2}-1$. [*] With $a$ and $b$ as above, what are the possible values of \[\frac{a^{2}+b^{2}-1}{ab}?\] [/list]

Cyclic quadrilateral $ABCD$ has positive integer side lengths $AB$, $BC$, $CA$, $AD$. It is known that $AD=2005$, $\angle{ABC}=\angle{ADC} = 90^o$, and $\max \{ AB,BC,CD \} < 2005$. Determine the maximum and minimum possible values for the perimeter of $ABCD$.

[b]p1.[/b] What is $6\times 7 + 4 \times 7 + 6\times 3 + 4\times 3$? [b]p2.[/b] How many integers $n$ have exactly $\sqrt{n}$ factors? [b]p3.[/b] A triangle has distinct angles $3x+10$, $2x+20$, and $x+30$. What is the value of $x$? [b]p4.[/b] If $4$ people of the Math Club are randomly chosen to be captains, and Henry is one of the $30$ people eligible to be chosen, what is the probability that he is not chosen to be captain? [b]p5.[/b] $a, b, c, d$ is an arithmetic sequence with difference $x$ such that $a, c, d$ is a geometric sequence. If $b$ is $12$, what is $x$? (Note: the difference of an aritmetic sequence can be positive or negative, but not $0$) [b]p6.[/b] What is the smallest positive integer that contains only $0$s and $5$s that is a multiple of $24$. [b]p7.[/b] If $ABC$ is a triangle with side lengths $13$, $14$, and $15$, what is the area of the triangle made by connecting the points at the midpoints of its sides? [b]p8.[/b] How many ways are there to order the numbers $1,2,3,4,5,6,7,8$ such that $1$ and $8$ are not adjacent? [b]p9.[/b] Find all ordered triples of nonnegative integers $(x, y, z)$ such that $x + y + z = xyz$. [b]p10.[/b] Noah inscribes equilateral triangle $ABC$ with area $\sqrt3$ in a cricle. If $BR$ is a diameter of the circle, then what is the arc length of Noah's $ARC$? [b]p11.[/b] Today, $4/12/14$, is a palindromic date, because the number without slashes $41214$ is a palindrome. What is the last palindromic date before the year $3000$? [b]p12.[/b] Every other vertex of a regular hexagon is connected to form an equilateral triangle. What is the ratio of the area of the triangle to that of the hexagon? [b]p13.[/b] How many ways are there to pick four cards from a deck, none of which are the same suit or number as another, if order is not important? [b]p14.[/b] Find all functions $f$ from $R \to R$ such that $f(x + y) + f(x - y) = x^2 + y^2$. [b]p15.[/b] What are the last four digits of $1(1!) + 2(2!) + 3(3!) + ... + 2013(2013!)$/ [b]p16.[/b] In how many distinct ways can a regular octagon be divided up into $6$ non-overlapping triangles? [b]p17.[/b] Find the sum of the solutions to the equation $\frac{1}{x-3} + \frac{1}{x-5} + \frac{1}{x-7} + \frac{1}{x-9} = 2014$ . [b]p18.[/b] How many integers $n$ have the property that $(n+1)(n+2)(n+3)(n+4)$ is a perfect square of an integer? [b]p19.[/b] A quadrilateral is inscribed in a unit circle, and another one is circumscribed. What is the minimum possible area in between the two quadrilaterals? [b]p20.[/b] In blindfolded solitary tic-tac-toe, a player starts with a blank $3$-by-$3$ tic-tac-toe board. On each turn, he randomly places an "$X$" in one of the open spaces on the board. The game ends when the player gets $3$ $X$s in a row, in a column, or in a diagonal as per normal tic-tac-toe rules. (Note that only $X$s are used, not $O$s). What fraction of games will run the maximum $7$ amount of moves? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that for every pair of positive integers $k$ and $n$, there exists integer $x_1$, $x_2$,$...$, $x_k$ with $0 \le x_j \le 2^{k-1}\cdot \sqrt[k]{n}$ for $j = 1$, $2$, $...$, $k$, and such that $$x_1 + x^2_2+ x^3_3+...+ x^k_k= n.$$

Two circles $\omega_1$ and $\omega_2$, centered at $O_1$ and $O_2$, respectively, meet at points $A$ and $B$. A line through $B$ intersects $\omega_1$ again at $C$ and $\omega_2$ again at $D$. The tangents to $\omega_1$ and $\omega_2$ at $C$ and $D$, respectively, meet at $E$, and the line $AE$ intersects the circle $\omega$ through $AO_1O_2$ at $F$. Prove that the length of segment $EF$ is equal to the diameter of $\omega$.

A finite sequence of decimal digits from $\{0,1,\cdots, 9\}$ is said to be [i]common[/i] if for each sufficiently large positive integer $n$, there exists a positive integer $m$ such that the expansion of $n$ in base $m$ ends with this sequence of digits. For example, $0$ is common because for any large $n$, the expansion of $n$ in base $n$ is $10$, whereas $00$ is not common because for any squarefree $n$, the expansion of $n$ in any base cannot end with $00$. Determine all common sequences. [i]Proposed by Wong Jer Ren[/i]