A finite list of rational numbers is written on a blackboard. In an [i]operation[/i], we choose any two numbers $a$, $b$, erase them, and write down one of the numbers \[ a + b, \; a - b, \; b - a, \; a \times b, \; a/b \text{ (if $b \neq 0$)}, \; b/a \text{ (if $a \neq 0$)}. \] Prove that, for every integer $n > 100$, there are only finitely many integers $k \ge 0$, such that, starting from the list \[ k + 1, \; k + 2, \; \dots, \; k + n, \] it is possible to obtain, after $n - 1$ operations, the value $n!$.

A positive integer is called $\emph{lucky}$ if it is divisible by $7$, and the sum of its digits is also divisible by $7$. Fix a positive integer $n$. Show that there exists some lucky integer $l$ such that $\left|n - l\right| \leq 70$.

Suppose that $f:\{1, 2,\ldots ,1600\}\rightarrow\{1, 2,\ldots ,1600\}$ satisfies $f(1)=1$ and \[f^{2005}(x)=x\quad\text{for}\ x=1,2,\ldots ,1600. \] $(a)$ Prove that $f$ has a fixed point different from $1$. $(b)$ Find all $n>1600$ such that any $f:\{1,\ldots ,n\}\rightarrow\{1,\ldots ,n\}$ satisfying the above condition has at least two fixed points.

Find all functions $f : R \to R$ such that $x f(x)-y f(y) = (x-y)f(x+y)$ for all $x,y \in R$.

Given two (identical) polygonal domains in the Euclidean plane, it is not possible in general to superpose the two using only translations and rotations. Prove that this can however be achieved by splitting one of the domains into a finite number of polygonal subdomains which then fit together, via translations and rotations in the plane, to recover the other domain.

Positive integers $a_0<a_1<\dots<a_n$, are to be chosen so that $a_j-a_i$ is not a prime for any $i,j$ with $0 \le i <j \le n$. For each $n \ge 1$, determine the smallest possible value of $a_n$.

Represent the number $\sqrt[3]{1342\sqrt{167}+2005}$ in the form where it contains only addition, subtraction, multiplication, division and square roots.

Let be given four positive real numbers $ a$, $ b$, $ A$, $ B$. Consider a sequence of real numbers $ x_1$, $ x_2$, $ x_3$, $ \ldots$ is given by $ x_1 \equal{} a$, $ x_2 \equal{} b$ and $ x_{n \plus{} 1} \equal{} A\sqrt [3]{x_n^2} \plus{} B\sqrt [3]{x_{n \minus{} 1}^2}$ ($ n \equal{} 2, 3, 4, \ldots$). Prove that there exist limit $ \lim_{n\to \plus{} \propto}x_n$ and find this limit.

Do there exist natural numbers $a, b$ and $c$ such that $a^2+b^2+c^2$ is divisible by $2013(ab+bc+ca)$? [i]Proposed by Mahan Malihi[/i]

Find all pairs $(a, b)$ of real numbers with the following property: [list]Given any real numbers $c$ and $d$, if both of the equations $x^2+ax+1=c$ and $x^2+bx+1=d$ have real roots, then the equation $x^2+(a+b)x+1=cd$ has real roots.[/list]

Given is a natural number $n \geq 3$. Solve the system of equations: $\[ \begin{cases} \tan (x_1) + 3 \cot (x_1) &= 2 \tan (x_2) \\ \tan (x_2) + 3 \cot (x_2) &= 2 \tan (x_3) \\ & \dots \\ \tan (x_n) + 3 \cot (x_n) &= 2 \tan (x_1) \\ \end{cases} \]$

Given the sequence $(u_n)$ satisfying:$$\left\{ \begin{array}{l} 1 \le {u_1} \le 3\\ {u_{n + 1}} = 4 - \dfrac{{2({u_n} + 1)}}{{{2^{{u_n}}}}},\forall n \in \mathbb{Z^+}. \end{array} \right.$$ Prove that: $1\le u_n\le 3,\forall n\in \mathbb{Z^+}$ and find the limit of $(u_n).$

Let $n \geq 2, n \in \mathbb{N}$, $a,b,c,d \in \mathbb{N}$, $\frac{a}{b} + \frac{c}{d} < 1$ and $a + c \leq n,$ find the maximum value of $\frac{a}{b} + \frac{c}{d}$ for fixed $n.$

Determine all pairs of positive real numbers $(a, b)$ for which there exists a function $ f:\mathbb{R^{+}}\rightarrow\mathbb{R^{+}} $ satisfying for all positive real numbers $x$ the equation $ f(f(x))=af(x)- bx $

Let $ a$, $ b$, $ c$ denote the sides of a triangle. Show that the quantity \[ \frac{a}{b\plus{}c}\plus{}\frac{b}{c\plus{}a}\plus{}\frac{c}{a\plus{}b}\] must lie between the limits $ 3/2$ and 2. Can equality hold at either limits?

Suppose that the sum of the squares of two complex numbers $x$ and $y$ is 7 and the sum of the cubes is 10. What is the largest real value that $x + y$ can have?

Let $R^+$ be the set of positive real numbers. Determine all functions $f:R^+$ $\rightarrow$ $R^+$ such that for all positive real numbers $x$ and $y:$ \[f(x+f(xy))+y=f(x)f(y)+1\] [i]Ukraine[/i]

The real-valued function $f$ is defined for all positive integers. For any integers $a>1, b>1$ with $d=\gcd (a, b)$, we have \[f(ab)=f(d)\left(f\left(\frac{a}{d}\right)+f\left(\frac{b}{d}\right)\right) \] Determine all possible values of $f(2001)$.

Given that the polynomial $P(x) = x^5 - x^2 + 1$ has $5$ roots $r_1, r_2, r_3, r_4, r_5$. Find the value of the product $Q(r_1)Q(r_2)Q(r_3)Q(r_4)Q(r_5)$, where $Q(x) = x^2 + 1$.

[b]p1.[/b] Fleming has a list of 8 mutually distinct integers between $90$ to $99$, inclusive. Suppose that the list has median $94$, and that it contains an even number of odd integers. If Fleming reads the numbers in the list from smallest to largest, then determine the sixth number he reads. [b]p2.[/b] Find the number of ordered pairs $(x,y)$ of three digit base-$10$ positive integers such that $x-y$ is a positive integer, and there are no borrows in the subtraction $x-y$. For example, the subtraction on the left has a borrow at the tens digit but not at the units digit, whereas the subtraction on the right has no borrows. $$\begin{tabular}{ccccc} & 4 & 7 & 2 \\ - & 1 & 9 & 1\\ \hline & 2 & 8 & 1 \\ \end{tabular}\,\,\, \,\,\, \begin{tabular}{ccccc} & 3 & 7 & 9 \\ - & 2 & 6 & 3\\ \hline & 1 & 1 & 6 \\ \end{tabular}$$ [b]p3.[/b] Evaluate $$1 \cdot 2 \cdot 3-2 \cdot 3 \cdot 4+3 \cdot 4 \cdot 5- 4 \cdot 5 \cdot 6+ ... +2017 \cdot 2018 \cdot 2019 -2018 \cdot 2019 \cdot 2020+1010 \cdot 2019 \cdot 2021$$ [b]p4.[/b] Find the number of ordered pairs of integers $(a,b)$ such that $$\frac{ab+a+b}{a^2+b^2+1}$$ is an integer. [b]p5.[/b] Lin Lin has a $4\times 4$ chessboard in which every square is initially empty. Every minute, she chooses a random square $C$ on the chessboard, and places a pawn in $C$ if it is empty. Then, regardless of whether $C$ was previously empty or not, she then immediately places pawns in all empty squares a king’s move away from $C$. The expected number of minutes before the entire chessboard is occupied with pawns equals $\frac{m}{n}$ for relatively prime positive integers $m$,$n$. Find $m+n$. A king’s move, in chess, is one square in any direction on the chessboard: horizontally, vertically, or diagonally. [b]p6.[/b] Let $P(x) = x^5-3x^4+2x^3-6x^2+7x+3$ and $a_1,...,a_5$ be the roots of$ P(x)$. Compute $$\sum^5_{k=1}(a^3_k -4a^2_k +a_k +6).$$ [b]p7.[/b] Rectangle $AXCY$ with a longer length of $11$ and square $ABCD$ share the same diagonal $\overline{AC}$. Assume $B$,$X$ lie on the same side of $\overline{AC}$ such that triangle$ BXC$ and square $ABCD$ are non-overlapping. The maximum area of $BXC$ across all such configurations equals $\frac{m}{n}$ for relatively prime positive integers $m$,$n$. Compute $m+n$. [b]p8.[/b] Earl the electron is currently at $(0,0)$ on the Cartesian plane and trying to reach his house at point $(4,4)$. Each second, he can do one of three actions: move one unit to the right, move one unit up, or teleport to the point that is the reflection of its current position across the line $y=x$. Earl cannot teleport in two consecutive seconds, and he stops taking actions once he reaches his house. Earl visits a chronologically ordered sequence of distinct points $(0,0)$, $...$, $(4,4)$ due to his choice of actions. This is called an [i]Earl-path[/i]. How many possible such [i]Earl-paths[/i] are there? [b]p9.[/b] Let $P(x)$ be a degree-$2022$ polynomial with leading coefficient $1$ and roots $\cos \left( \frac{2\pi k}{2023} \right)$ for $k = 1$ , $...$,$2022$ (note $P(x)$ may have repeated roots). If $P(1) =\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers, then find the remainder when $m+n$ is divided by $100$. [b]p10.[/b] A randomly shuffled standard deck of cards has $52$ cards, $13$ of each of the four suits. There are $4$ Aces and $4$ Kings, one of each of the four suits. One repeatedly draws cards from the deck until one draws an Ace. Given that the first King appears before the first Ace, the expected number of cards one draws after the first King and before the first Ace is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [b]p11.[/b] The following picture shows a beam of light (dashed line) reflecting off a mirror (solid line). The [i]angle of incidence[/i] is marked by the shaded angle; the[i] angle of reflection[/i] is marked by the unshaded angle. [img]https://cdn.artofproblemsolving.com/attachments/9/d/d58086e5cdef12fbc27d0053532bea76cc50fd.png[/img] The sides of a unit square $ABCD$ are magically distorted mirrors such that whenever a light beam hits any of the mirrors, the measure of the angle of incidence between the light beam and the mirror is a positive real constant $q$ degrees greater than the measure of the angle of reflection between the light beam and the mirror. A light beam emanating from $A$ strikes $\overline{CD}$ at $W_1$ such that $2DW_1 =CW_1$, reflects off of $\overline{CD}$ and then strikes $\overline{BC}$ at $W_2$ such that $2CW_2 = BW_2$, reflects off of $\overline{BC}$, etc. To this end, denote $W_i$ the $i$-th point at which the light beam strikes $ABCD$. As $i$ grows large, the area of $W_iW_{i+1}W_{i+2}W_{i+3}$ approaches $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$. [b]p12.[/b] For any positive integer $m$, define $\phi (m)$ the number of positive integers $k \le m$ such that $k$ and $m$ are relatively prime. Find the smallest positive integer $N$ such that $\sqrt{ \phi (n) }\ge 22$ for any integer $n \ge N$. [b]p13.[/b] Let $n$ be a fixed positive integer, and let $\{a_k\}$ and $\{b_k\}$ be sequences defined recursively by $$a_1 = b_1 = n^{-1}$$ $$a_j = j(n- j+1)a_{j-1}\,\,\, , \,\,\, j > 1$$ $$b_j = nj^2b_{j-1}+a_j\,\,\, , \,\,\, j > 1$$ When $n = 2021$, then $a_{2021} +b_{2021} = m \cdot 2017^2$ for some positive integer $m$. Find the remainder when $m$ is divided by $2017$. [b]p14.[/b] Consider the quadratic polynomial $g(x) = x^2 +x+1020100$. A positive odd integer $n$ is called $g$-[i]friendly[/i] if and only if there exists an integer $m$ such that $n$ divides $2 \cdot g(m)+2021$. Find the number of $g$-[i]friendly[/i] positive odd integers less than $100$. [b]p15.[/b] Let $ABC$ be a triangle with $AB < AC$, inscribed in a circle with radius $1$ and center $O$. Let $H$ be the intersection of the altitudes of $ABC$. Let lines $\overline{OH}$, $\overline{BC}$ intersect at $T$. Suppose there is a circle passing through $B$, $H$, $O$, $C$. Given $\cos (\angle ABC-\angle BCA) = \frac{11}{32}$ , then $TO = \frac{m\sqrt{p}}{n}$ for relatively prime positive integers $m$,$n$ and squarefree positive integer $p$. Find $m+n+ p$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose that $x$, $y$, and $z$ are complex numbers of equal magnitude that satisfy \[x+y+z = -\frac{\sqrt{3}}{2}-i\sqrt{5}\] and \[xyz=\sqrt{3} + i\sqrt{5}.\] If $x=x_1+ix_2, y=y_1+iy_2,$ and $z=z_1+iz_2$ for real $x_1,x_2,y_1,y_2,z_1$ and $z_2$ then \[(x_1x_2+y_1y_2+z_1z_2)^2\] can be written as $\tfrac{a}{b}$ for relatively prime positive integers $a$ and $b$. Compute $100a+b.$

Let $p>0$ be a given parameter. Determine all real $x$ such that \[\frac{1}{\,x+\sqrt{p-x^2\,}\,}+\frac{1}{\,x-\sqrt{p-x^2\,}\,}\ge\frac{1}{\,p\,}.\]

[b]p1.[/b] While computing $7 - 2002 \cdot x$, John accidentally evaluates from left to right $((7 - 2002) \cdot x)$ instead of correctly using order of operations $(7 - (2002 \cdot x))$. If he gets the correct answer anyway, what is $x$? [b]p2.[/b] Given that $$x^2 + y^2 + z^2 = 6$$ $$ \left( \frac{x}{y} + \frac{y}{x} \right)^2 + \left( \frac{y}{z} + \frac{z}{y} \right)^2 + \left( \frac{z}{x} + \frac{x}{z} \right)^2 = 16.5,$$ what is $\frac{1}{x^2} + \frac{1}{y^2} + \frac{1}{z^2}$ ? [b]p3.[/b] Evaluate $$\frac{tan \frac{\pi}{4}}{4}+\frac{tan \frac{3\pi}{4}}{8}+\frac{tan \frac{5\pi}{4}}{16}+\frac{tan \frac{7\pi}{4}}{32}+ ...$$ [b]p4.[/b] Note that $2002 = 22 \cdot 91$, and so $2002$ is a multiple of the number obtained by removing its middle $2$ digits. Generalizing this, how many $4$-digit palindromes, $abba$, are divisible by the $2$-digit palindrome, $aa$? [b]p5.[/b] Let $ABCDE$ be a pyramid such that $BCDE$ is a square with side length $2$, and $A$ is $2$ units above the center of $BCDE$. If $F$ is the midpoint of $\overline{DE}$ and $G$ is the midpoint of $\overline{AC}$, what is the length of $\overline{DE}$? [b]p6.[/b] Suppose $a_1, a_2,..., a_{100}$ are real numbers with the property that $$i(a_1 + a_2 +... + a_i) = 1 + (a_{i+1} + a_{i+2} + ... + a_{100})$$ for all $i$. Compute $a_{10}$. [b]p7.[/b] A bug is sitting on one corner of a $3' \times 4' \times 5'$ block of wood. What is the minimum distance nit needs to travel along the block’s surface to reach the opposite corner? [b]p8.[/b] In the number game, a pair of positive integers $(n,m)$ is written on a blackboard. Two players then take turns doing the following: 1. If $n \ge m$, the player chooses a positive integer $c$ such that $n - cm \ge 0$, and replaces $(n,m)$ with $(n - cm,m)$. 2. If $m > n$, the player chooses a positive integer $c$ such that $m - cn \ge 0$, and replaces $(n,m)$ with $(n,m - cn)$. If $m$ or $n$ ever become $0$, the game ends, and the last player to have moved is declared the winner. If $(n,m)$ are originally $(20021000, 2002)$, what choices of $c$ are winning moves for the first player? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For each $n\in\mathbb N$, the function $f_n$ is defined on real numbers $x\ge n$ by $$f_n(x)=\sqrt{x-n}+\sqrt{x-n+1}+\ldots+\sqrt{x+n}-(2n+1)\sqrt x.$$(a) If $n$ is fixed, prove that $\lim_{x\to+\infty}f_n(x)=0$. (b) Find the limit of $f_n(n)$ as $n\to+\infty$.

Let the sequence $u_n$ be defined by $u_0=0$ and $u_{2n}=u_n$, $u_{2n+1}=1-u_n$ for each $n\in\mathbb N_0$. (a) Calculate $u_{1990}$. (b) Find the number of indices $n\le1990$ for which $u_n=0$. (c) Let $p$ be a natural number and $N=(2^p-1)^2$. Find $u_N$.