Let $a_0 = 2$, $a_1 = 5$, and $a_2 = 8$, and for $n>2$ define $a_n$ recursively to be the remainder when $4(a_{n-1} + a_{n-2} + a_{n-3})$ is divided by $11$. Find $a_{2018}\cdot a_{2020}\cdot a_{2022}$.

The lock of a safe consists of 3 wheels, each of which may be set in 8 different ways positions. Due to a defect in the safe mechanism the door will open if any two of the three wheels are in the correct position. What is the smallest number of combinations which must be tried if one is to guarantee being able to open the safe (assuming the "right combination" is not known)?

Henry starts with a list of the first 1000 positive integers, and performs a series of steps on the list. At each step, he erases any nonpositive integers or any integers that have a repeated digit, and then decreases everything in the list by 1. How many steps does it take for Henry's list to be empty? [i]Proposed by Michael Ren[/i]

Let $x, y, z$ be nonzero real numbers with $$\frac{x + y}{z}=\frac{y + z}{x}=\frac{z + x}{y}.$$ Determine all possible values of $$\frac{(x + y)(y + z)(z + x)}{xyz}.$$ [i](Walther Janous)[/i]

The coordinates of the triangle's vertices in the Cartesian system $XOY$ are integers. Prove that the diameter of the circle circumscribed by this triangle is not greater than the product of the lengths of the triangle's sides.

Given an odd $n$, prove that there exist $2n$ integers $a_1,a_2,\cdots ,a_n$; $b_1,b_2,\cdots ,b_n$, such that for any integer $k$ ($0<k<n$), the following $3n$ integers: $a_i+a_{i+1}, a_i+b_i, b_i+b_{i+k}$ ($i=1,2,\cdots ,n; a_{n+1}=a_1, b_{n+j}=b_j, 0<j<n$) are of different remainders on division by $3n$.

A boy and his father are standing on a seashore. If the boy stands on his tiptoes, his eyes are at a height of $1$ m above sea-level, and if he seats on father’s shoulders, they are at a height of $2$ m. What is the ratio of distances visible for him in two eases? (Find the answer to $0,1$, assuming that the radius of Earth equals $6000$ km.)

On the sides $AB, BC$ and $CA$ of triangle $ABC$, points $L, M$ and $N$ are chosen, respectively, such that the lines $CL, AM$ and $BN$ intersect at a common point O inside the triangle and the quadrilaterals $ALON, BMOL$ and $CNOM$ have incircles. Prove that $$\frac{1}{AL\cdot BM} +\frac{1}{BM\cdot CN} +\frac{1}{CN \cdot AL} =\frac{1}{AN\cdot BL} +\frac{1}{BL\cdot CM} +\frac{1}{CM\cdot AN} $$

Let $P$ be a point on a circle $C_1$ and let $C_2$ be a circle with center $P$ that intersects $C_1$ at two points Q and R. The circle $C_3$, with center $Q$ and which passes through $R$, intersects $C_2$ at another point S, as in figure. Shows that $QS$ is tangent to $C_1$. [img]https://cdn.artofproblemsolving.com/attachments/7/5/f48d414c68c33c4efaf4d6c8bebcf6f1fad4ba.png[/img]

Find all solutions in positive integers to $(n+1)^k -1 = n!$

Positive reals $p$ and $q$ are such that the graph of $y = x^2 - 2px + q$ does not intersect the $x$-axis. Find $q$ if there is a unique pair of points $A, B$ on the graph with $AB$ parallel to the $x$-axis and $\angle AOB = \frac{\pi}{2}$, where $O$ is the origin.

Determine the sum of all positive integers $n$ between $1$ and $100$ inclusive such that \[\gcd(n,2^n - 1) = 3.\]

Find the solution of the functional equation $P(x)+P(1-x)=1$ with power $2015$ P.S: $P(y)=y^{2015}$ is also a function with power $2015$

Let $ABCD$ be a convex quadrilateral such that \[\begin{array}{rl} E,F \in [AB],& AE = EF = FB \\ G,H \in [BC],& BG = GH = HC \\ K,L \in [CD],& CK = KL = LD \\ M,N \in [DA],& DM = MN = NA \end{array}\] Let \[[NG] \cap [LE] = \{P\}, [NG]\cap [KF] = \{Q\},\] \[{[}MH] \cap [KF] = \{R\}, [MH]\cap [LE]=\{S\}\] Prove that [list=a][*]$Area(ABCD) = 9 \cdot Area(PQRS)$ [*] $NP=PQ=QG$ [/list]

Solve the equation \[ x^5+x^4+x^3+x^2=x+1 \] in $\mathbb{R}$.

Determine all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that, for all real numbers $x$ and $y$, $$f(x)(x+f(f(y))) = f(x^2)+xf(y)$$

For each positive integer $n\ge 2$, define $k\left(n\right)$ to be the largest integer $m$ such that $\left(n!\right)^m$ divides $2016!$. What is the minimum possible value of $n+k\left(n\right)$? [i]Proposed by Tristan Shin[/i]

problem 3: (a) Show that there exists a multiple of 2005 whose sum of (decimal) digits equals 2. (b) Let $x_n$ denote the number obtained by writing natural numbers from $1$ to $n$ one after another (for example, $x_1 = 1, x_2 = 12,...,x_{13} = 12345678910111213$). Prove that the sequence $x_1,x_2,...$ contains infinitely many terms that are divisiblenby 2005.

Cells of $11\times 11$ table are colored with $n$ colors (each cell is colored with exactly one color). For each color, the total amount of the cells of this color is not less than $7$ and not greater than $13$. Prove that there exists at least one row or column which contains cells of at least four different colors. [i](N. Sedrakyan)[/i]

Let $A_1$ and $C_1$ be the tangency points of the incircle of triangle $ABC$ with $BC$ and $AB$ respectively, $A'$ and $C'$ be the tangency points of the excircle inscribed into the angle $B$ with the extensions of $BC$ and $AB$ respectively. Prove that the orthocenter $H$ of triangle $ABC$ lies on $A_1C_1$ if and only if the lines $A'C_1$ and $BA$ are orthogonal.

Let $ ABCD$ be a convex quadrilateral. Let $ M,N$ be the midpoints of $ AB,AD$ respectively. The foot of perpendicular from $ M$ to $ CD$ is $ K$, the foot of perpendicular from $ N$ to $ BC$ is $ L$. Show that if $ AC,BD,MK,NL$ are concurrent, then $ KLMN$ is a cyclic quadrilateral.

Let $n \geq 3$ be an integer. Let $t_1$, $t_2$, ..., $t_n$ be positive real numbers such that \[n^2 + 1 > \left( t_1 + t_2 + \cdots + t_n \right) \left( \frac{1}{t_1} + \frac{1}{t_2} + \cdots + \frac{1}{t_n} \right).\] Show that $t_i$, $t_j$, $t_k$ are side lengths of a triangle for all $i$, $j$, $k$ with $1 \leq i < j < k \leq n$.

Given $m+n$ numbers: $a_i,$ $i = 1,2, \ldots, m,$ $b_j$, $j = 1,2, \ldots, n,$ determine the number of pairs $(a_i,b_j)$ for which $|i-j| \geq k,$ where $k$ is a non-negative integer.

Solve the equation: \[2^{\lg x}+8=(x-8)^{\frac{1}{\lg 2}}\] Note: $\lg x=\log_{10}x$. [i]Daniel Jinga [/i]

[b]p1.[/b] Fun facts! We know that $1008^2-1007^2 = 1008+1007$ and $1009^2-1008^2 = 1009+1008$. Now compute the following: $$1010^2 - 1009^2 - 1.$$ [b]p2.[/b] Let $m$ be the smallest positive multiple of $2018$ such that the fraction $m/2019$ can be simplified. What is the number $m$? [b]p3.[/b] Given that $n$ satisfies the following equation $$n + 3n + 5n + 7n + 9n = 200,$$ find $n$. [b]p4.[/b] Grace and Somya each have a collection of coins worth a dollar. Both Grace and Somya have quarters, dimes, nickels and pennies. Serena then observes that Grace has the least number of coins possible to make one dollar and Somya has the most number of coins possible. If Grace has $G$ coins and Somya has $S$ coins, what is $G + S$? [b]p5.[/b] What is the ones digit of $2018^{2018}$? [b]p6.[/b] Kaitlyn plays a number game. Each time when Kaitlyn has a number, if it is even, she divides it by $2$, and if it is odd, she multiplies it by $5$ and adds $1$. Kaitlyn then takes the resulting number and continues the process until she reaches $1$. For example, if she begins with $3$, she finds the sequence of $6$ numbers to be $$3, 3 \cdot 5 + 1 = 16, 16/2 = 8, 8/2 = 4, 4/2 = 2, 2/2 = 1.$$ If Kaitlyn's starting number is $51$, how many numbers are in her sequence, including the starting number and the number $1$? [b]p7.[/b] Andrew likes both geometry and piano. His piano has $88$ keys, $x$ of which are white and $y$ of which are black. Each white key has area $3$ and each black key has area $11$. If the keys of his piano have combined area $880$, how many black keys does he have? [b]p8.[/b] A six-sided die contains the numbers $1$, $2$, $3$, $4$, $5$, and $6$ on its faces. If numbers on opposite faces of a die always sum to $7$, how many distinct dice are possible? (Two dice are considered the same if one can be rotated to obtain the other.) [b]p9.[/b] In $\vartriangle ABC$, $AB$ is $12$ and $AC$ is $15$. Alex draws the angle bisector of $BAC$, $AD$, such that $D$ is on $BC$. If $CD$ is $10$, then the area of $\vartriangle ABC$ can be expressed in the form $\frac{m \sqrt{n}}{p}$ where $m, p$ are relatively prime and $n$ is not divisible by the square of any prime. Find $m + n + p$. [b]p10.[/b] Find the smallest positive integer that leaves a remainder of $2$ when divided by $5$, a remainder of $3$ when divided by $6$, a remainder of $4$ when divided by $7$, and a remainder of $5$ when divided by $8$. [b]p11.[/b] Chris has a bag with $4$ marbles. Each minute, Chris randomly selects a marble out of the bag and flips a coin. If the coin comes up heads, Chris puts the marble back in the bag, while if the coin comes up tails, Chris sets the marble aside. What is the expected number of seconds it will take Chris to empty the bag? [b]p12.[/b] A real fixed point $x$ of a function $f(x)$ is a real number such that $f(x) = x$. Find the absolute value of the product of the real fixed points of the function $f(x) = x^4 + x - 16$. [b]p13.[/b] A triangle with angles $30^o$, $75^o$, $75^o$ is inscribed in a circle with radius $1$. The area of the triangle can be expressed as $\frac{a+\sqrt{b}}{c}$ where $b$ is not divisible by the square of any prime. Find $a + b + c$. [b]p14.[/b] Dora and Charlotte are playing a game involving flipping coins. On a player's turn, she first chooses a probability of the coin landing heads between $\frac14$ and $\frac34$ , and the coin magically flips heads with that probability. The player then flips this coin until the coin lands heads, at which point her turn ends. The game ends the first time someone flips heads on an odd-numbered flip. The last player to flip the coin wins. If both players are playing optimally and Dora goes first, let the probability that Charlotte win the game be $\frac{a}{b}$ . Find $a \cdot b$. [b]p15.[/b] Jonny is trying to sort a list of numbers in ascending order by swapping pairs of numbers. For example, if he has the list $1$, $4$, $3$, $2$, Jonny would swap $2$ and $4$ to obtain $1$, $2$, $3$, $4$. If Jonny is given a random list of $400$ distinct numbers, let $x$ be the expected minimum number of swaps he needs. Compute $\left \lfloor \frac{x}{20} \right \rfloor$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].