A positive integer $n$ is defined as a $\textit{stepstool number}$ if $n$ has one less positive divisor than $n + 1$. For example, $3$ is a stepstool number, as $3$ has $2$ divisors and $4$ has $2 + 1 = 3$ divisors. Find the sum of all stepstool numbers less than $300$. [i]Proposed by [b]Th3Numb3rThr33[/b][/i]

Suppose that $ABCD$ is a parallelogram such that $\angle DAC = 90^o$. Let $H$ be the foot of perpendicular from $A$ to $DC$, also let $P$ be a point along the line $AC$ such that the line $PD$ is tangent to the circumcircle of the triangle $ABD$. Prove that $\angle PBA = \angle DBH$. Proposed by Iman Maghsoudi

Determine all strictly increasing functions $f: R \to R$ satisfying $f (f(x) + y) = f(x + y) + f (0)$ for all $x,y \in R$.

An auditorium with $20$ rows of seats has $10$ seats in the first row. Each successive row has one more seat than the previous row. If students taking an exam are permitted to sit in any row, but not next to another student in that row, then the maximum number of students that can be seated for an exam is $\text{(A)}\ 150 \qquad \text{(B)}\ 180 \qquad \text{(C)}\ 200 \qquad \text{(D)}\ 400 \qquad \text{(E)}\ 460$

Let the point $P$ in the interior of the triangle $ABC$. $(AP, (BP, (CP$ intersect the circumcircle of $ABC$ at $A_{1}, B_{1}, C_{1}$. Prove that the maximal value of the sum of the areas $A_{1}BC$, $B_{1}AC$, $C_{1}AB$ is $p(R-r)$, where $p, r, R$ are the usual notations for the triangle $ABC$.

Four lines in the plane intersect in six points. Each line is thus divided into two segments and two rays. Is it possible for the eight segments to have lengths $1, 2, 3, ... , 8$? Can the lengths of the eight segments be eight distinct integers?

Define the sequence $a_0,a_1,a_2,\hdots$ by $a_n=2^n+2^{\lfloor n/2\rfloor}$. Prove that there are infinitely many terms of the sequence which can be expressed as a sum of (two or more) distinct terms of the sequence, as well as infinitely many of those which cannot be expressed in such a way.

Determine the quadratic functions $f(x) = ax^2 + bx + c$ for which there exists an interval $(h, k)$ such that for all $x \in (h, k)$ it holds that $f(x)f(x + 1) < 0$ and $f(x)f(x -1) < 0$.

It is given a cube with sidelength $a$. Find the surface of the intersection of the cube with a plane, perpendicular to one of its diagonals and whose distance from the centre of the cube is equal to $h$.

Find the domain of the pairs of positive real numbers $(a,\ b)$ such that there is a $\theta\ (0<\theta \leq \pi)$ such that $\cos a\theta =\cos b\theta$, then draw the domain on the coordinate plane. 30 points

Compute the number of ordered quintuples of nonnegative integers $(a_1,a_2,a_3,a_4,a_5)$ such that $0\leq a_1,a_2,a_3,a_4,a_5\leq 7$ and $5$ divides $2^{a_1}+2^{a_2}+2^{a_3}+2^{a_4}+2^{a_5}$.

Let $x$ and $y$ be positive integers we have a table $x\times y$ where $(x + 1)(y + 1)$ points are red(the points are the vertices of the squares). Initially there is one ant in each red point, in a moment the ants walk by the lines of the table with same speed, each turn that an ant arrive in a red point the ant moves $90º$ to some direction. Determine all values of $x$ and $y$ where is possible that the ants move indefinitely where can't be in any moment two ants in the same red point.

It is given a graph whose vertices are positive integers and an edge between numbers $a$ and $b$ exists if and only if $a + b + 1 | a^2 + b^2 + 1$. Is this graph connected?

Find minimum number $n$ that: 1) $80|n$ 2) we can permute 2 different numbers in $n$ to get $m$ and $80|m$

You have some white one-by-one tiles and some black and white two-bye-one tiles as shown below. There are four different color patterns that can be generated when using these tiles to cover a three-by-one rectangoe by laying these tiles side by side (WWW, BWW, WBW, WWB). How many different color patterns can be generated when using these tiles to cover a ten-by-one rectangle? [asy] import graph; size(5cm); real labelscalefactor = 0.5; pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); draw((12,0)--(12,1)--(11,1)--(11,0)--cycle); fill((13.49,0)--(13.49,1)--(12.49,1)--(12.49,0)--cycle, black); draw((13.49,0)--(13.49,1)--(14.49,1)--(14.49,0)--cycle); draw((15,0)--(15,1)--(16,1)--(16,0)--cycle); fill((17,0)--(17,1)--(16,1)--(16,0)--cycle, black); [/asy]

Let $n \geq 2$ be an integer. Prove that if $$\frac{n^2+4^n+7^n}{n}$$ is an integer, then it is divisible by 11.

Let $n\geqslant 2$ be a fixed positive integer. Determine the minimum value of the expression $$\frac{a_{a_1}}{a_1}+\frac{a_{a_2}}{a_2}+\dots +\frac{a_{a_n}}{a_n},$$ where $a_1, a_2, \dots, a_n$ are positive integers at most $n$. [i]Proposed by David Anghel[/i]

Three circles $C_1,C_2,C_3$, with radii $1, 2, 3$ respectively, are externally tangent. In the area enclosed by these circles, there is a circle $C_4$ which is externally tangent to all three circles. Find the radius of $C_4$. [asy] unitsize(0.4 cm); pair[] O; real[] r; O[1] = (-12/5,16/5); r[1] = 1; O[2] = (0,5); r[2] = 2; O[3] = (0,0); r[3] = 3; O[4] = (-132/115, 351/115); r[4] = 6/23; draw(Circle(O[1],r[1])); draw(Circle(O[2],r[2])); draw(Circle(O[3],r[3])); draw(Circle(O[4],r[4])); label("$C_1$", O[1]); label("$C_2$", O[2]); label("$C_3$", O[3]); [/asy]

Find all funtions $f : Z_{>0} \to Z_{>0}$ that satisfy $f(f(f(n))) + f(f(n)) + f(n) = 3n$ for all $n \in Z_{>0}$ .

In triangle $ABC$ we have $\angle C = 90^o$ and $AC = BC$. Furthermore $M$ is an interior pont in the triangle so that $MC = 1 , MA = 2$ and $MB =\sqrt2$. Determine $AB$

If $a(x), b(x), c(x)$ and $d(x)$ are polynomials in $ x$, show that $$ \int_{1}^{x} a(x) c(x)\; dx\; \cdot \int_{1}^{x} b(x) d(x) \; dx - \int_{1}^{x} a(x) d(x)\; dx\; \cdot \int_{1}^{x} b(x) c(x)\; dx$$ is divisible by $(x-1)^4.$

Alice and Brian are playing a game on a $1\times (N + 2)$ board. To start the game, Alice places a checker on any of the $N$ interior squares. In each move, Brian chooses a positive integer $n$. Alice must move the checker to the $n$-th square on the left or the right of its current position. If the checker moves off the board, Alice wins. If it lands on either of the end squares, Brian wins. If it lands on another interior square, the game proceeds to the next move. For which values of $N$ does Brian have a strategy which allows him to win the game in a finite number of moves?

[b]p1.[/b] Find all solutions $a, b, c, d, e, f$ if it is known that they represent distinct digits and satisfy the following: $\begin{tabular}{ccccc} & a & b & c & a \\ + & & d & d & e \\ & & & d & e \\ \hline d & f & f & d & d \\ \end{tabular}$ [b]p2.[/b] Snowhite wrote on a piece of paper a whole number greater than $1$ and multiplied it by itself. She obtained a number, all digits of which are $1$: $n^2 = 111...111$ Does she know how to multiply? [b]p3.[/b] Two players play the following game on an $8\times 8$ chessboard. The first player can put a bishop on an arbitrary square. Then the second player can put another bishop on a free square that is not controlled by the first bishop. Then the first player can put a new bishop on a free square that is not controlled by the bishops on the board. Then the second player can do the same, etc. A player who cannot put a new bishop on the board loses the game. Who has a winning strategy? [b]p4.[/b] Four girls Marry, Jill, Ann and Susan participated in the concert. They sang songs. Every song was performed by three girls. Mary sang $8$ songs, more then anybody. Susan sang $5$ songs less then all other girls. How many songs were performed at the concert? [b]p5.[/b] Pinocchio has a $10\times 10$ table of numbers. He took the sums of the numbers in each row and each such sum was positive. Then he took the sum of the numbers in each columns and each such sum was negative. Can you trust Pinocchio's calculations? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In an office, at various times during the day the boss gives the secretary a letter to type, each time putting the letter on top of the pile in the secretary's in-box. When there is time, the secretary takes the top letter off the pile and types it. If there are five letters in all, and the boss delivers them in the order $1\ 2\ 3\ 4\ 5$, which of the following could [b]not[/b] be the order in which the secretary types them? $ \textbf{(A)}\ 1\ 2\ 3\ 4\ 5 \qquad\textbf{(B)}\ 2\ 4\ 3\ 5\ 1 \qquad\textbf{(C)}\ 3\ 2\ 4\ 1\ 5 \qquad\textbf{(D)}\ 4\ 5\ 2\ 3\ 1 \\ \qquad\textbf{(E)}\ 5\ 4\ 3\ 2\ 1 $

Triangle $ABC$ is inscribed in circle $\omega$. Point $P$ lies inside triangle $ABC$.Lines $AP,BP$ and $CP$ intersect $\omega$ again at points $A_1$, $B_1$ and $C_1$ (other than $A, B, C$), respectively. The tangent lines to $\omega$ at $A_1$ and $B_1$ intersect at $C_2$.The tangent lines to $\omega$ at $B_1$ and $C_1$ intersect at $A_2$. The tangent lines to $\omega$ at $C_1$ and $A_1$ intersect at $B_2$. Prove that the lines $AA_2,BB_2$ and $CC_2$ are concurrent.