Prove that there exists a surjective function $ f:\mathbb{N}\longrightarrow\mathbb{N} $ having the property that for all natural numbers $ n\ge 2, $ there exists an infinite set $ A_n $ such that $ f(x)=n, $ for all $ x\in A_n. $

$ \frac {2^{n \plus{} 4} \minus{} 2(2^n)}{2(2^{n \plus{} 3})}$ when simplified is: $ \textbf{(A)}\ 2^{n \plus{} 1} \minus{} \frac {1}{8} \qquad\textbf{(B)}\ \minus{} 2^{n \plus{} 1} \qquad\textbf{(C)}\ 1 \minus{} 2^n \qquad\textbf{(D)}\ \frac {7}{8} \qquad\textbf{(E)}\ \frac {7}{4}$

Renata the robot packs boxes in a warehouse. Each box is a cube of side length $1$ foot. The warehouse floor is a square, $12$ feet on each side, and is divided into a $12$-by-$12$ grid of square tiles $1$ foot on a side. Each tile can either support one box or be empty. The warehouse has exactly one door, which opens onto one of the corner tiles. Renata fits on a tile and can roll between tiles that share a side. To access a box, Renata must be able to roll along a path of empty tiles starting at the door and ending at a tile sharing a side with that box. [list=a] [*]Show how Renata can pack $91$ boxes into the warehouse and still be able to access any box. [*]Show that Renata [b]cannot[/b] pack $95$ boxes into the warehouse and still be able to access any box.[/list]

The sequence $(a_n)$ of real numbers is defined as follows: \[a_1=1, \qquad a_2=2, \quad \text{and} \quad a_n=3a_{n-1}-a_{n-2} , \ \ n \geq 3.\] Prove that for $n \geq 3$, $a_n=\left[ \frac{a_{n-1}^2}{a_{n-2}} \right] +1$, where $[x]$ denotes the integer $p$ such that $p \leq x < p + 1$.

Solve the equation $2^a-5^b=3$ in positive integers $a,b$.

A clock chimes once at $ 30$ minutes past each hour and chimes on the hour according to the hour. For example, at 1 PM there is one chime and at noon and midnight there are twelve chimes. Starting at 11:15 AM on February $ 26$, $ 2003$, on what date will the $ 2003^{\text{rd}}$ chime occur? $ \textbf{(A)}\ \text{March 8} \qquad \textbf{(B)}\ \text{March 9} \qquad \textbf{(C)}\ \text{March 10} \qquad \textbf{(D)}\ \text{March 20} \qquad \textbf{(E)}\ \text{March 21}$

There exists a unique prime $p > 5$ for which the decimal expansion of $\tfrac{1}{p}$ repeats with a period of exactly 294. Given that $p > 10^{50}$, compute the remainder when $p$ is divided by $10^9$. [i]Proposed by Ankan Bhattacharya[/i]

Assume that $a,b$ are integers and $n$ is a natural number. $2^na+b$ is a perfect square for every $n$.Prove that $a=0$.

We attach to the vertices of a regular hexagon the numbers $1$, $0$, $0$, $0$, $0$, $0$. Now, we are allowed to transform the numbers by the following rules: (a) We can add an arbitrary integer to the numbers at two opposite vertices. (b) We can add an arbitrary integer to the numbers at three vertices forming an equilateral triangle. (c) We can subtract an integer $t$ from one of the six numbers and simultaneously add $t$ to the two neighbouring numbers. Can we, just by acting several times according to these rules, get a cyclic permutation of the initial numbers? (I. e., we started with $1$, $0$, $0$, $0$, $0$, $0$; can we now get $0$, $1$, $0$, $0$, $0$, $0$, or $0$, $0$, $1$, $0$, $0$, $0$, or $0$, $0$, $0$, $1$, $0$, $0$, or $0$, $0$, $0$, $0$, $1$, $0$, or $0$, $0$, $0$, $0$, $0$, $1$ ?)

Three lights are placed horizontally on a line on the ceiling. All the lights are initially off. Every second, Neil picks one of the three lights uniformly at random to switch: if it is off, he switches it on; if it is on, he switches it off. When a light is switched, any lights directly to the left or right of that light also get turned on (if they were off) or off (if they were on). The expected number of lights that are on after Neil has flipped switches three times can be expressed in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.

[u]Round 1[/u] [b]p1.[/b] Elaine creates a sequence of positive integers $\{s_n\}$. She starts with $s_1 = 2018$. For $n \ge 2$, she sets $s_n =\frac12 s_{n-1}$ if $s_{n-1}$ is even and $s_n = s_{n-1} + 1$ if $s_{n-1}$ is odd. Find the smallest positive integer $n$ such that $s_n = 1$, or submit “$0$” as your answer if no such $n$ exists. [b]p2.[/b] Alice rolls a fair six-sided die with the numbers $1$ through $6$, and Bob rolls a fair eight-sided die with the numbers $1$ through $8$. Alice wins if her number divides Bob’s number, and Bob wins otherwise. What is the probability that Alice wins? [b]p3.[/b] Four circles each of radius $\frac14$ are centered at the points $\left( \pm \frac14, \pm \frac14 \right)$, and ther exists a fifth circle is externally tangent to these four circles. What is the radius of this fifth circle? [u]Round 2 [/u] [b]p4.[/b] If Anna rows at a constant speed, it takes her two hours to row her boat up the river (which flows at a constant rate) to Bob’s house and thirty minutes to row back home. How many minutes would it take Anna to row to Bob’s house if the river were to stop flowing? [b]p5.[/b] Let $a_1 = 2018$, and for $n \ge 2$ define $a_n = 2018^{a_{n-1}}$ . What is the ones digit of $a_{2018}$? [b]p6.[/b] We can write $(x + 35)^n =\sum_{i=0}^n c_ix^i$ for some positive integer $n$ and real numbers $c_i$. If $c_0 = c_2$, what is $n$? [u]Round 3[/u] [b]p7.[/b] How many positive integers are factors of $12!$ but not of $(7!)^2$? [b]p8.[/b] How many ordered pairs $(f(x), g(x))$ of polynomials of degree at least $1$ with integer coefficients satisfy $f(x)g(x) = 50x^6 - 3200$? [b]p9.[/b] On a math test, Alice, Bob, and Carol are each equally likely to receive any integer score between $1$ and $10$ (inclusive). What is the probability that the average of their three scores is an integer? [u]Round 4[/u] [b]p10.[/b] Find the largest positive integer N such that $$(a-b)(a-c)(a-d)(a-e)(b-c)(b-d)(b-e)(c-d)(c-e)(d-e)$$ is divisible by $N$ for all choices of positive integers $a > b > c > d > e$. [b]p11.[/b] Let $ABCDE$ be a square pyramid with $ABCD$ a square and E the apex of the pyramid. Each side length of $ABCDE$ is $6$. Let $ABCDD'C'B'A'$ be a cube, where $AA'$, $BB'$, $CC'$, $DD'$ are edges of the cube. Andy the ant is on the surface of $EABCDD'C'B'A'$ at the center of triangle $ABE$ (call this point $G$) and wants to crawl on the surface of the cube to $D'$. What is the length the shortest path from $G$ to $D'$? Write your answer in the form $\sqrt{a + b\sqrt3}$, where $a$ and $b$ are positive integers. [b]p12.[/b] A six-digit palindrome is a positive integer between $100, 000$ and $999, 999$ (inclusive) which is the same read forwards and backwards in base ten. How many composite six-digit palindromes are there? PS. You should use hide for answers. Rounds 5-7 have been posted [url=https://artofproblemsolving.com/community/c4h2784943p24473026]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $P$ be a simple polygon completely in $C$, a circle with radius $1$, such that $P$ does not pass through the center of $C$. The perimeter of $P$ is $36$. Prove that there is a radius of $C$ that intersects $P$ at least $6$ times, or there is a circle which is concentric with $C$ and have at least $6$ common points with $P$. [i]Proposed by Seyed Reza Hosseini[/i]

From the $9 \times 9$ chessboard, all $16$ unit squares whose row numbers and column numbers are both even have been removed. Disect the punctured board into rectangular pieces, with as few of them being unit squares as possible.

The equation $ x^2 \plus{} ax \plus{} b \equal{} 0$ has two distinct real roots. Prove that the equation $ x^4 \plus{} ax^3 \plus{} (b \minus{} 2)x^2 \minus{} ax \plus{} 1 \equal{} 0$ has four distinct real roots.

Solve in real numbers $\frac{(x+2)^4}{x^3}-\frac{(x+2)^2}{2x}\ge - \frac{x}{16}$

Let $n>1$ be an integer. Hippo chooses a list of $n$ points in the plane $P_1, \dots, P_n$; some of these points may coincide, but not all of them can be identical. After this, Wombat picks a point from the list $X$ and measures the distances from it to the other $n-1$ points in the list. The average of the resulting $n-1$ numbers will be denoted $m(X)$. Find all values of $n$ for which Hippo can prepare the list in such a way, that for any point $X$ Wombat may pick, he can point to a point $Y$ from the list such that $XY=m(X)$.