Prove that for each positive integer $n$ there are at most two pairs $(a, b)$ of positive integers with following two properties: (i) $a^2 + b = n$, (ii) $a+b$ is a power of two, i.e. there is an integer $k \ge 0$ such that $a+b = 2^k$.

Some positive integers are initially written on a board, where each $2$ of them are different. Each time we can do the following moves: (1) If there are 2 numbers (written in the board) in the form $n, n+1$ we can erase them and write down $n-2$ (2) If there are 2 numbers (written in the board) in the form $n, n+4$ we can erase them and write down $n-1$ After some moves, there might appear negative numbers. Find the maximum value of the integer $c$ such that: Independetly of the starting numbers, each number which appears in any move is greater or equal to $c$

Determine the number of $3-$digit numbers in base $10$ having at least one $5$ and at most one $3$.

Is it possible to fill a $3 \times 3$ grid with each of the numbers $1,2,\ldots,9$ once each such that the sum of any two numbers sharing a side is prime?

Suppose that $10$ points are given in the plane, such that among any five of them there are four lying on a circle. Find the minimum number of these points which must lie on a circle.

Prove that for any function $f:\mathbb{Q} \to \mathbb{Z}$, there exist $a,b,c \in \mathbb{Q}$ such that $a<b<c$, $f(b) \ge f(a)$ and $f(b) \ge f(c)$.

Let $F$ be a polygon the boundary of which is a broken line with vertices in the knots (units) of a given in advance regular square network. If $k$ is the count of knots of the network situated over the boundary of $F$, and $\ell$ is the count of the knots of the network lying inside $F$, prove that if the surface of every square from the network is $1$, then the surface $S$ of $F$ is calculated with the formulae: $$S=\frac k2+\ell-1$$ [i]V. Chukanov[/i]

Ant Amelia starts on the number line at $0$ and crawls in the following manner. For $n=1,2,3,$ Amelia chooses a time duration $t_n$ and an increment $x_n$ independently and uniformly at random from the interval $(0,1).$ During the $n$th step of the process, Amelia moves $x_n$ units in the positive direction, using up $t_n$ minutes. If the total elapsed time has exceeded $1$ minute during the $n$th step, she stops at the end of that step; otherwise, she continues with the next step, taking at most $3$ steps in all. What is the probability that Amelia’s position when she stops will be greater than $1$? $\textbf{(A) }\frac{1}{3} \qquad \textbf{(B) }\frac{1}{2} \qquad \textbf{(C) }\frac{2}{3} \qquad \textbf{(D) }\frac{3}{4} \qquad \textbf{(E) }\frac{5}{6}$

For which integers $n\geq 2$, the number $(n-1)^{n^{n+1}}+(n+1)^{n^{n-1}}$ is divisible by $n^{n}$ ?

Let $ a_1, a_2, \ldots, a_{100}$ be nonnegative real numbers such that $ a^2_1 \plus{} a^2_2 \plus{} \ldots \plus{} a^2_{100} \equal{} 1.$ Prove that \[ a^2_1 \cdot a_2 \plus{} a^2_2 \cdot a_3 \plus{} \ldots \plus{} a^2_{100} \cdot a_1 < \frac {12}{25}. \] [i]Author: Marcin Kuzma, Poland[/i]

For a positive integer $n$, let $f(n)$ be the greatest common divisor of all numbers obtained by permuting the digits of $n$, including the permutations that have leading zeroes. For example, $f(1110)=\gcd(1110,1101,1011,0111)=3$. Among all positive integers $n$ with $f(n) \neq n$, what is the largest possible value of $f(n)$?

a) Show that the product of all differences of possible couples of six given positive integers is divisible by $960$ b) Show that the product of all differences of possible couples of six given positive integers is divisible by $34560$ PS. a) original from Albania b) modified by problem selecting committee

Find all continuous functions $f:\mathbb{R}^+\rightarrow \mathbb{R}^+$ such that $$f(xf(y))+f(yf(x))=1+f(x+y)$$ for all $x, y>0.$

On a board 12 × 12 are placed some knights in such a way that in each 2 × 2 square there is at least one knight. Find the maximum number of squares that are not attacked by knights. (A knight does not attack the square in which it is located.)

In a triangle $ABC$, the excircle $\omega_a$ opposite $A$ touches $AB$ at $P$ and $AC$ at $Q$, while the excircle $\omega_b$ opposite $B$ touches $BA$ at $M$ and $BC$ at $N$. Let $K$ be the projection of $C$ onto $MN$ and let $L$ be the projection of $C$ onto $PQ$. Show that the quadrilateral $MKLP$ is cyclic. ([i]Bulgaria[/i])

On the plane we mark $n$ ($n > 2$) straight lines passing through one point $O$ in such a way that for any two of them there is a marked straight line that bisects one of the pairs of vertical angles, formed by these straight lines. Prove that the drawn straight lines divide full angle into equal parts.

An arbitrary circle can intersect the graph $ y \equal{} \sin x$ in $ \textbf{(A)} \text{ at most 2 points} \qquad \textbf{(B)} \text{ at most 4 points} \qquad$ $ \textbf{(C)} \text{ at most 6 points} \qquad \textbf{(D)} \text{ at most 8 points} \qquad$ $ \textbf{(E)} \text{ more than 16 points}$

In the centre of a $2005 \times 2005$ chessboard lies a dice that is to be moved across the board in a sequence of moves. One move consists of the following three steps: - The dice has to be turned with an arbitrary side on top, - then it has to be moved by the shown number of points to the right or left - and finally moved by the concealed number of points upwards or downwards. The attained square is the starting square for the next move. Which squares of the chessboard can be reached in a finite sequence of such moves?

Let $\mathcal{P}$ be a finite, non-self-intersecting loop in the unit hexagonal grid.¹ All edges enclosed by, but not on $\mathcal P$, are colored green. Let $A$ be the number of green edges, $B$ be the number of connected components of green edges,² and $C$ be the number of unit hexagons enclosed by but not touching $\mathcal{P}$. Prove that $A + B + C$ is even. For example, for the following closed loop highlighted in black, $A=34$, $B = 2$, and $C = 2$. [center][img width=40]https://i.imgur.com/PDJdoS5.png[/img][/center] [size=75]¹The [i]unit hexagonal grid[/i] is the unique arrangement, up to rotation and translation, of unit segments in the plane which partitions the plane into regular hexagons.[/size] [size=75]²Two green edges are said to be in the same connected component if it is possible to walk from one to the other by only walking along green edges.[/size] [i]Ethan Liu[/i]

Let $p$ be a prime number that is greater than $3$. Show that there exist some integers $a_{1}, a_{2}, \cdots a_{k}$ that satisfy: \[-\frac{p}{2}< a_{1}< a_{2}< \cdots <a_{k}< \frac{p}{2}\] making the product: \[\frac{p-a_{1}}{|a_{1}|}\cdot \frac{p-a_{2}}{|a_{2}|}\cdots \frac{p-a_{k}}{|a_{k}|}\] equals to $3^{m}$ where $m$ is a positive integer.

[b]p1.[/b] Compute the greatest integer less than or equal to $$\frac{10 + 12 + 14 + 16 + 18 + 20}{21}$$ [b]p2.[/b] Let$ A = 1$.$B = 2$, $C = 3$, $...$, $Z = 26$. Find $A + B +M + C$. [b]p3.[/b] In Mr. M's farm, there are $10$ cows, $8$ chickens, and $4$ spiders. How many legs are there (including Mr. M's legs)? [b]p4.[/b] The area of an equilateral triangle with perimeter $18$ inches can be expressed in the form $a\sqrt{b}{c}$ , where $a$ and $c$ are relatively prime and $b$ is not divisible by the square of any prime. Find $a + b + c$. [b]p5.[/b] Let $f$ be a linear function so $f(x) = ax + b$ for some $a$ and $b$. If $f(1) = 2017$ and $f(2) = 2018$, what is $f(2019)$? [b]p6.[/b] How many integers $m$ satisfy $4 < m^2 \le 216$? [b]p7.[/b] Allen and Michael Phelps compete at the Olympics for swimming. Allen swims $\frac98$ the distance Phelps swims, but Allen swims in $\frac59$ of Phelps's time. If Phelps swims at a rate of $3$ kilometers per hour, what is Allen's rate of swimming? The answer can be expressed as $m/n$ for relatively prime positive integers $m, n$. Find $m + n$. [b]p8.[/b] Let $X$ be the number of distinct arrangements of the letters in "POONAM," $Y$ be the number of distinct arrangements of the letters in "ALLEN" and $Z$ be the number of distinct arrangements of the letters in "NITHIN." Evaluate $\frac{X+Z}{Y}$ : [b]p9.[/b] Two overlapping circles, both of radius $9$ cm, have centers that are $9$ cm apart. The combined area of the two circles can be expressed as $\frac{a\pi+b\sqrt{c}+d}{e}$ where $c$ is not divisible by the square of any prime and the fraction is simplified. Find $a + b + c + d + e$. [b]p10.[/b] In the Boxborough-Acton Regional High School (BARHS), $99$ people take Korean, $55$ people take Maori, and $27$ people take Pig Latin. $4$ people take both Korean and Maori, $6$ people take both Korean and Pig Latin, and $5$ people take both Maori and Pig Latin. $1$ especially ambitious person takes all three languages, and and $100$ people do not take a language. If BARHS does not oer any other languages, how many students attend BARHS? [b]p11.[/b] Let $H$ be a regular hexagon of side length $2$. Let $M$ be the circumcircle of $H$ and $N$ be the inscribed circle of $H$. Let $m, n$ be the area of $M$ and $N$ respectively. The quantity $m - n$ is in the form $\pi a$, where $a$ is an integer. Find $a$. [b]p12.[/b] How many ordered quadruples of positive integers $(p, q, r, s)$ are there such that $p + q + r + s \le 12$? [b]p13.[/b] Let $K = 2^{\left(1+ \frac{1}{3^2} \right)\left(1+ \frac{1}{3^4} \right)\left(1+ \frac{1}{3^8}\right)\left(1+ \frac{1}{3^{16}} \right)...}$. What is $K^8$? [b]p14.[/b] Neetin, Neeton, Neethan, Neethine, and Neekhil are playing basketball. Neetin starts out with the ball. How many ways can they pass 5 times so that Neethan ends up with the ball? [b]p15.[/b] In an octahedron with side lengths $3$, inscribe a sphere. Then inscribe a second sphere tangent to the first sphere and to $4$ faces of the octahedron. The radius of the second sphere can be expressed in the form $\frac{\sqrt{a}-\sqrt{b}}{c}$ , where the square of any prime factor of $c$ does not evenly divide into $b$. Compute $a + b + c$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

How many real triples $(x,y,z)$ are there such that $\dfrac{4x^2}{1+4x^2}=y$, $\dfrac{4y^2}{1+4y^2}=z$, $\dfrac{4z^2}{1+4z^2}=x$ ? $ \textbf{(A)}\ 2 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ \text{Infinitely many} \qquad\textbf{(E)}\ \text{None of the preceding} $

Given that $20N^2$ is a divisor of $11!,$ what is the greatest possible integer value of $N?$

Every integer is painted white or black, so that if $m$ is white then $m + 20$ is also white, and if $k$ is black then $k + 35$ is also black. For which $n$ can exactly $n$ of the numbers $1, 2, ..., 50$ be white?

Let $ABCD$ be a parallelogram and $H$ the Orthocentre of $\triangle{ABC}$. The line parallel to $AB$ through $H$ intersects $BC$ at $P$ and $AD$ at $Q$ while the line parallel to $BC$ through $H$ intersects $AB$ at $R$ and $CD$ at $S$. Show that $P$, $Q$, $R$ and $S$ are concyclic. [i](Swiss Mathematical Olympiad 2011, Final round, problem 8)[/i]