Find all functions $f$ of two variables, whose arguments $x,y$ and values $f(x,y)$ are positive integers, satisfying the following conditions (for all positive integers $x$ and $y$): \begin{align*} f(x,x)& =x,\\ f(x,y)& =f(y,x),\\ (x+y)f(x,y)& =yf(x,x+y).\end{align*}

The sequence $a_1, a_2,...$ is defined by the equalities $a_1 = 2, a_2 = 12$ and $a_{n+1} = 6a_n-a_{n-1}$ for every positive integer $n \ge 2$. Prove that no member of this sequence is equal to a perfect power (greater than one) of a positive integer.

One hundred balls labelled $1$ to $100$ are to be put into two identical boxes so that each box contains at least one ball and the greatest common divisor of the product of the labels of all the balls in one box and the product of the labels of all the balls in the other box is $1$. Determine the number of ways that this can be done.

We call a positive integer $\textit{cheesy}$ if we can obtain the average of the digits in its decimal representation by putting a decimal separator after the leftmost digit. Prove that there are only finitely many $\textit{cheesy}$ numbers.

Find the remainder modulo $101$ of $$\left\lfloor \dfrac{1}{(2 \cos \left(\frac{4\pi}{7} \right))^{103}}\right\rfloor$$

Let $c$ be a positive real and $a_1, a_2, \dots$ be a sequence of nonnegative integers satisfying the following conditions for every positive integer $n$: [b](i)[/b]$\frac{2^{a_1}+2^{a_2}+\cdots+2^{a_n}}{n}$ is an integer; [b](ii)[/b]$\textbullet 2^{a_n}\leq cn$. Prove that the sequence $a_1, a_2, \dots$ is eventually constant.

Let $a$ and $b$ be positive integers with $b$ odd, such that the number $$\frac{(a+b)^2+4a}{ab}$$ is an integer. Prove that $a$ is a perfect square.

A triple of positive integers $(a, b, c)$ is [i]tasty [/i] if $lcm (a, b, c) | a + b + c - 1$ and $a < b < c$. Find the sum of $a + b + c$ across all tasty triples.

For each positive integer $n$, let $s(n)$ be the sum of the digits of $n$. Find the smallest positive integer $k$ such that \[s(k) = s(2k) = s(3k) = \cdots = s(2013k) = s(2014k).\]

[b]p1.[/b] Find the last digit of $2022^{2022}$. [b]p2.[/b] Let $a_1 < a_2 <... < a_8$ be eight real numbers in an increasing arithmetic progression. If $a_1 + a_3 + a_5 + a_7 = 39$ and $a_2 + a_4 + a_6 + a_8 = 40$, determine the value of $a_1$. [b]p3.[/b] Patrick tries to evaluate the sum of the first $2022$ positive integers, but accidentally omits one of the numbers, $N$, while adding all of them manually, and incorrectly arrives at a multiple of $1000$. If adds correctly otherwise, find the sum of all possible values of $N$. [b]p4.[/b] A machine picks a real number uniformly at random from $[0, 2022]$. Andrew randomly chooses a real number from $[2020, 2022]$. The probability that Andrew’s number is less than the machine’s number is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]p5.[/b] Let $ABCD$ be a square and $P$ be a point inside it such that the distances from $P$ to sides $AB$ and $AD$ respectively are $2$ and $4$, while $PC = 6$. If the side length of the square can be expressed in the form $a +\sqrt{b}$ for positive integers $a, b$, then determine $a + b$. [b]p6.[/b] Positive integers $a_1, a_2, ..., a_{20}$ sum to $57$. Given that $M$ is the minimum possible value of the quantity $a_1!a_2!...a_{20}!$, find the number of positive integer divisors of $M$. [b]p7.[/b] Jessica has $16$ balls in a box, where $15$ of them are red and one is blue. Jessica draws balls out the box three at a time until one of the three is blue. If she ever draws three red marbles, she discards one of them and shuffles the remaining two back into the box. The expected number of draws it takes for Jessica to draw the blue ball can be written as a common fraction $\frac{m}{n}$ where $m, n$ are relatively prime positive integers. Find $m + n$. [b]p8.[/b] The Lucas sequence is defined by these conditions: $L_0 = 2$, $L_1 = 1$, and $L_{n+2} =L_{n+1} +L_n$ for all $n \ge 0$. Determine the remainder when $L^2_{2019} +L^2_{2020}$ is divided by $L_{2023}$. [b]p9.[/b] Let $ABCD$ be a parallelogram. Point $P$ is selected in its interior such that the distance from $P$ to $BC$ is exactly $6$ times the distance from $P$ to $AD$, and $\angle APB = \angle CPD = 90^o$. Given that $AP = 2$ and $CP = 9$, the area of $ABCD$ can be expressed as $m\sqrt{n}$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $m + n$. [b]p10.[/b] Consider the polynomial $P(x) = x^{35} + ... + x + 1$. How many pairs $(i, j)$ of integers are there with $0 \le i < j \le 35$ such that if we flip the signs of the $x^i$ and $x^j$ terms in $P(x)$ to form a new polynomial $Q(x)$, then there exists a nonconstant polynomial $R(x)$ with integer coefficients dividing both $P(x)$ and $Q(x)$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer. Let $A_n$ denote the set of primes $p$ such that there exists positive integers $a,b$ satisfying $$\frac{a+b}{p} \text{ and } \frac{a^n + b^n}{p^2}$$ are both integers that are relatively prime to $p$. If $A_n$ is finite, let $f(n)$ denote $|A_n|$. a) Prove that $A_n$ is finite if and only if $n \not = 2$. b) Let $m,k$ be odd positive integers and let $d$ be their gcd. Show that $$f(d) \leq f(k) + f(m) - f(km) \leq 2 f(d).$$

Prove that for any odd positive integer $n$, $n^{12}-n^8-n^4+1$ is divisible by $2^9$.

Let \(n\) be a positive integer. Prove that \[\frac{20 \cdot 5^n-2}{3^n+47}\] is not an integer.

Given unequal integers $x, y, z$ prove that $(x-y)^5 + (y-z)^5 + (z-x)^5$ is divisible by $5(x-y)(y- z)(z-x)$.

Compute the smallest positive integer $n$ such that $\frac{n}{2}$ is a perfect square and $\frac{n}{3}$ is a perfect cube.

We say $m \circ n$ for natural m,n $\Longleftrightarrow$ nth number of binary representation of m is 1 or mth number of binary representation of n is 1. and we say $m \bullet n$ if and only if $m,n$ doesn't have the relation $\circ$ We say $A \subset \mathbb{N}$ is golden $\Longleftrightarrow$ $\forall U,V \subset A$ that are finite and arenot empty and $U \cap V = \emptyset$,There exist $z \in A$ that $\forall x \in U,y \in V$ we have $z \circ x ,z \bullet y$ Suppose $\mathbb{P}$ is set of prime numbers.Prove if $\mathbb{P}=P_1 \cup ... \cup P_k$ and $P_i \cap P_j = \emptyset$ then one of $P_1,...,P_k$ is golden.

We color some positive integers $(1,2,...,n)$ with color red, such that any triple of red numbers $(a,b,c)$(not necessarily distincts) if $a(b-c)$ is multiple of $n$ then $b=c$. Prove that the quantity of red numbers is less than or equal to $\varphi(n)$.

Let $a, b, c, d, e$ be positive and [b]different [/b] divisors of $n$ where $n \in Z^{+}$. If $n=a^4+b^4+c^4+d^4+e^4$ let's call $n$ "marvelous" number. $a)$ Prove that all "marvelous" numbers are divisible by $5$. $b)$ Can count of "marvelous" numbers be infinity?

Oleksiy wrote several distinct positive integers on the board and calculated all their pairwise sums. It turned out that all digits from $0$ to $9$ appear among the last digits of these sums. What could be the smallest number of integers that Oleksiy wrote? [i]Proposed by Oleksiy Masalitin[/i]

A positive integer $m$ is said to be $\emph{zero taker}$ if there exists a positive integer $k$ such that: $k$ is a perfect square; $m$ divides $k$; the decimal expression of $k$ contains at least $2021$ '0' digits, but the last digit of $k$ is not equal to $0$. Find all positive integers that are zero takers.

Let $n$, $m$ and $k$ be positive integers satisfying $(n-1)n(n+1)=m^k.$ Prove that $k=1.$

Let $A$ be a set of positive integers such that for any $x,y\in A$, $$x>y\implies x-y\ge\frac{xy}{25}.$$Find the maximal possible number of elements of the set $A$.

[b]p1[/b]. Is it possible to find $n$ positive numbers such that their sum is equal to $1$ and the sum of their squares is less than $\frac{1}{10}$? [b]p2.[/b] In the country of Sepulia, there are several towns with airports. Each town has a certain number of scheduled, round-trip connecting flights with other towns. Prove that there are two towns that have connecting flights with the same number of towns. [b]p3.[/b] A $4 \times 4$ magic square is a $4 \times 4$ table filled with numbers $1, 2, 3,..., 16$ - with each number appearing exactly once - in such a way that the sum of the numbers in each row, in each column, and in each diagonal is the same. Is it possible to complete $\begin{bmatrix} 2 & 3 & * & * \\ 4 & * & * & *\\ * & * & * & *\\ * & * & * & * \end{bmatrix}$ to a magic square? (That is, can you replace the stars with remaining numbers $1, 5, 6,..., 16$, to obtain a magic square?) [b]p4.[/b] Is it possible to label the edges of a cube with the numbers $1, 2, 3, ... , 12$ in such a way that the sum of the numbers labelling the three edges coming into a vertex is the same for all vertices? [b]p5.[/b] (Bonus) Several ants are crawling along a circle with equal constant velocities (not necessarily in the same direction). If two ants collide, both immediately reverse direction and crawl with the same velocity. Prove that, no matter how many ants and what their initial positions are, they will, at some time, all simultaneously return to the initial positions. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ a>0$, and let $ P(x)$ be a polynomial with integer coefficients such that \[ P(1)\equal{}P(3)\equal{}P(5)\equal{}P(7)\equal{}a\text{, and}\] \[ P(2)\equal{}P(4)\equal{}P(6)\equal{}P(8)\equal{}\minus{}a\text{.}\] What is the smallest possible value of $ a$? $ \textbf{(A)}\ 105 \qquad \textbf{(B)}\ 315 \qquad \textbf{(C)}\ 945 \qquad \textbf{(D)}\ 7! \qquad \textbf{(E)}\ 8!$

What is the sum (in base $10$) of all the natural numbers less than $64$ which have exactly three ones in their base $2$ representation?