Let us call an integer sequence $\{ a_1,a_2, \dots \}$ nice if there exist a function $f: \mathbb{Z^+} \to \mathbb{Z^+} $ such that $$a_i \equiv a_j \pmod{n} \iff i\equiv j \pmod{f(n)}$$ for all $i,j,n \in \mathbb{Z^+}$. Find all nice sequences.

Prove that the sum of the squares of any three pairwise different positive odd integers can be represented as the sum of the squares of six (not necessarily different) positive integers.

Find all integers $n$ satisfying the following property. There exist nonempty finite integer sets $A$ and $B$ such that for any integer $m$, exactly one of these three statements below is true: (a) There is $a \in A$ such that $m \equiv a \pmod n$, (b) There is $b \in B$ such that $m \equiv b \pmod n$, and (c) There are $a \in A$ and $b \in B$ such that $m \equiv a + b \pmod n$.

Prove that there are infinitely many pairs of positive integers $(m, n)$ such that simultaneously $m$ divides $n^2 + 1$ and $n$ divides $m^2 + 1$.

[b]p1.[/b] $p, q, r$ are prime numbers such that $p^q + 1 = r$. Find $p + q + r$. [b]p2.[/b] $2014$ apples are distributed among a number of children such that each child gets a different number of apples. Every child gets at least one apple. What is the maximum possible number of children who receive apples? [b]p3.[/b] Cathy has a jar containing jelly beans. At the beginning of each minute he takes jelly beans out of the jar. At the $n$-th minute, if $n$ is odd, he takes out $5$ jellies. If n is even he takes out $n$ jellies. After the $46$th minute there are only $4$ jellies in the jar. How many jellies were in the jar in the beginning? [b]p4.[/b] David is traveling to Budapest from Paris without a cellphone and he needs to use a public payphone. He only has two coins with him. There are three pay-phones - one that never works, one that works half of the time, and one that always works. The first phone that David tries does not work. Assuming that he does not use the same phone again, what is the probability that the second phone that he uses will work? [b]p5.[/b] Let $a, b, c, d$ be positive real numbers such that $$a^2 + b^2 = 1$$ $$c^2 + d^2 = 1;$$ $$ad - bc =\frac17$$ Find $ac + bd$. [b]p6.[/b] Three circles $C_A,C_B,C_C$ of radius $1$ are centered at points $A,B,C$ such that $A$ lies on $C_B$ and $C_C$, $B$ lies on $C_C$ and $C_A$, and $C$ lies on $C_A$ and $C_B$. Find the area of the region where $C_A$, $C_B$, and $C_C$ all overlap. [b]p7.[/b] Two distinct numbers $a$ and $b$ are randomly and uniformly chosen from the set $\{3, 8, 16, 18, 24\}$. What is the probability that there exist integers $c$ and $d$ such that $ac + bd = 6$? [b]p8.[/b] Let $S$ be the set of integers $1 \le N \le 2^{20}$ such that $N = 2^i + 2^j$ where $i, j$ are distinct integers. What is the probability that a randomly chosen element of $S$ will be divisible by $9$? [b]p9.[/b] Given a two-pan balance, what is the minimum number of weights you must have to weigh any object that weighs an integer number of kilograms not exceeding $100$ kilograms? [b]p10.[/b] Alex, Michael and Will write $2$-digit perfect squares $A,M,W$ on the board. They notice that the $6$-digit number $10000A + 100M +W$ is also a perfect square. Given that $A < W$, find the square root of the $6$-digit number. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a fixed positive integer. Find the sum of all positive integers with the property that in base $2$ each has exactly $2n$ digits, consisting of $n$ 1's and $n$ 0's. (The first digit cannot be $0$.)

Call a number [i]precious[/i] if it is the sum of two distinct powers of two. Find all precious numbers $n$ such that $n^2$ is also precious.

Find all positive integers $a$, $b$, $n$ and prime numbers $p$ that satisfy \[ a^{2013} + b^{2013} = p^n\text{.}\] [i]Proposed by Matija Bucić.[/i]

Estimate the value of the $2020$th prime number $p$ such that $p + 2$ is also prime. If $E > 0$ is your estimate and $A$ is the correct answer, you will receive $25 \min \left( \frac{E}{A}, \frac{A}{E}\right)^2$ points, rounded to the nearest integer. (An estimate less than or equal to $0$ will receive $0$ points.

Felix chooses a positive integer as the starting number and writes it on the board. He then repeats the next step: he replaces the number $n$ on the board by $\frac12n$ if $n$ is even and by $n^2 + 3$ if $n$ is odd. For how many choices of starting numbers below $2023$ will Felix never write a number of more than four digits on the board?

Natural numbers $a, b$ and $c$ are pairwise distinct and satisfy \[a | b+c+bc, b | c+a+ca, c | a+b+ab.\] Prove that at least one of the numbers $a, b, c$ is not prime.

Solve the system of equations in integers: $$\begin{cases} a^3=abc+2a+2c \\ b^3=abc-c \\ c^3=abc-a+b \end{cases}$$

Let $a_{n}=|n(n+1)-19|$ for $n=0, 1, 2, ...$ and $n \neq 4$. Prove that if for every $k<n$ we have $\gcd(a_{n}, a_{k})=1$, then $a_{n}$ is a prime number.

Let $n = 2^{2015} - 1$. For any integer $1 \le x < n$, let \[f_n(x) = \sum\limits_p s_p(n-x) + s_p(x) - s_p(n),\] where $s_q(k)$ denotes the sum of the digits of $k$ when written in base $q$ and the summation is over all primes $p$. Let $N$ be the number of values of $x$ such that $4 | f_n(x)$. What is the remainder when $N$ is divided by $1000?$

Find all triples $(a, b, c)$ of positive integers for which $a + (a, b) = b + (b, c) = c + (c, a)$. Here $(a, b)$ denotes the greatest common divisor of integers $a, b$. [i](Proposed by Mykhailo Shtandenko)[/i]

[b]p1.[/b] An ant starts at the top vertex of a triangular pyramid (tetrahedron). Each day, the ant randomly chooses an adjacent vertex to move to. What is the probability that it is back at the top vertex after three days? [b]p2.[/b] A square “rolls” inside a circle of area $\pi$ in the obvious way. That is, when the square has one corner on the circumference of the circle, it is rotated clockwise around that corner until a new corner touches the circumference, then it is rotated around that corner, and so on. The square goes all the way around the circle and returns to its starting position after rotating exactly $720^o$. What is the area of the square? [b]p3.[/b] How many ways are there to fill a $3\times 3$ grid with the integers $1$ through $9$ such that every row is increasing left-to-right and every column is increasing top-to-bottom? [b]p4.[/b] Noah has an old-style M&M machine. Each time he puts a coin into the machine, he is equally likely to get $1$ M&M or $2$ M&M’s. He continues putting coins into the machine and collecting M&M’s until he has at least $6$ M&M’s. What is the probability that he actually ends up with $7$ M&M’s? [b]p5.[/b] Erik wants to divide the integers $1$ through $6$ into nonempty sets $A$ and $B$ such that no (nonempty) sum of elements in $A$ is a multiple of $7$ and no (nonempty) sum of elements in $B$ is a multiple of $7$. How many ways can he do this? (Interchanging $A$ and $B$ counts as a different solution.) [b]p6.[/b] A subset of $\{1, 2, 3, 4, 5, 6, 7, 8\}$ of size $3$ is called special if whenever $a$ and $b$ are in the set, the remainder when $a + b$ is divided by $8$ is not in the set. ($a$ and $b$ can be the same.) How many special subsets exist? [b]p7.[/b] Let $F_1 = F_2 = 1$, and let $F_n = F_{n-1} + F_{n-2}$ for all $n \ge 3$. For each positive integer $n$, let $g(n)$ be the minimum possible value of $$|a_1F_1 + a_2F_2 + ...+ a_nF_n|,$$ where each $a_i$ is either $1$ or $-1$. Find $g(1) + g(2) +...+ g(100)$. [b]p8.[/b] Find the smallest positive integer $n$ with base-$10$ representation $\overline{1a_1a_2... a_k}$ such that $3n = \overline{a_1a_2


a_k1}$. [b]p9.[/b] How many ways are there to tile a $4 \times 6$ grid with $L$-shaped triominoes? (A triomino consists of three connected $1\times 1$ squares not all in a line.) [b]p10.[/b] Three friends want to share five (identical) muffins so that each friend ends up with the same total amount of muffin. Nobody likes small pieces of muffin, so the friends cut up and distribute the muffins in such a way that they maximize the size of the smallest muffin piece. What is the size of this smallest piece? [u]Numerical tiebreaker problems:[/u] [b]p11.[/b] $S$ is a set of positive integers with the following properties: (a) There are exactly 3 positive integers missing from $S$. (b) If $a$ and $b$ are elements of $S$, then $a + b$ is an element of $S$. (We allow $a$ and $b$ to be the same.) How many possibilities are there for the set $S$? [b]p12.[/b] In the trapezoid $ABCD$, both $\angle B$ and $\angle C$ are right angles, and all four sides of the trapezoid are tangent to the same circle. If $\overline{AB} = 13$ and $\overline{CD} = 33$, find the area of $ABCD$. [b]p13.[/b] Alice wishes to walk from the point $(0, 0)$ to the point $(6, 4)$ in increments of $(1, 0)$ and $(0, 1)$, and Bob wishes to walk from the point $(0, 1)$ to the point $(6, 5)$ in increments of $(1, 0)$ and $(0,1)$. How many ways are there for Alice and Bob to get to their destinations if their paths never pass through the same point (even at different times)? [b]p14.[/b] The continuous function $f(x)$ satisfies $9f(x + y) = f(x)f(y)$ for all real numbers $x$ and $y$. If $f(1) = 3$, what is $f(-3)$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For any natural number $n= \overline{a_k...a_1a_0}$ $(a_k \ne 0)$ in decimal system write $p(n)=a_0 \cdot a_1 \cdot ... \cdot a_k$, $s(n)=a_0+ a_1+ ... + a_k$, $n^*= \overline{a_0a_1...a_k}$. Consider $P=\{n | n=n^*, \frac{1}{3} p(n)= s(n)-1\}$ and let $Q$ be the set of numbers in $P$ with all digits greater than $1$. (a) Show that $P$ is infinite. (b) Show that $Q$ is finite. (c) Write down all the elements of $Q$.

sppose that $\sigma_k:\mathbb N \longrightarrow \mathbb R$ is a function such that $\sigma_k(n)=\sum_{d|n}d^k$. $\rho_k:\mathbb N \longrightarrow \mathbb R$ is a function such that $\rho_k\ast \sigma_k=\delta$. find a formula for $\rho_k$.($\frac{100}{6}$ points)

I have a four-digit palindrome $\underline{a} \ \underline{b} \ \underline{b} \ \underline{a}$ that is divisible by $b$ and is also divisible by the two-digit number $\underline{b} \ \underline{b}.$ Find the number of palindromes satisfying both of these properties.

Cat and Claire are having a conversation about Cat’s favorite number. Cat says, “My favorite number is a two-digit perfect square!” Claire asks, “If you picked a digit of your favorite number at random and revealed it to me without telling me which place it was in, is there any chance I’d know for certain what it is?” Cat says, “Yes! Moreover, if I told you a number and identified it as the sum of the digits of my favorite number, or if I told you a number and identified it as the positive difference of the digits of my favorite number, you wouldn’t know my favorite number.” Claire says, “Now I know your favorite number!” What is Cat’s favorite number?

Let $d(k)$ be the number of positive divisors of integer $k$. A number $n$ is called [i]balanced[/i] if $d(n-1) \leq d(n) \leq d(n+1)$ or $d(n-1) \geq d(n) \geq d(n+1)$. Show that there are infinitely many balanced numbers.

Let $ (a_{n})_{n\ge 1}$ be a sequence of positive integers satisfying $ (a_{m},a_{n}) = a_{(m,n)}$ (for all $ m,n\in N^ +$). Prove that for any $ n\in N^ + ,\prod_{d|n}{a_{d}^{\mu (\frac {n}{d})}}$ is an integer. where $ d|n$ denotes $ d$ take all positive divisors of $ n.$ Function $ \mu (n)$ is defined as follows: if $ n$ can be divided by square of certain prime number, then $ \mu (1) = 1;\mu (n) = 0$; if $ n$ can be expressed as product of $ k$ different prime numbers, then $ \mu (n) = ( - 1)^k.$

Let $f : N \to [0, \infty)$ be a function satisfying the following conditions: a) $f(4)=2$ b) $\frac{1}{f( 0 ) + f( 1)} + \frac{1}{f( 1 ) + f( 2 )} + ... + \frac{1}{f (n ) + f(n + 1) }= f ( n + 1)$ for all integers $n \ge 0$. Find $f(n)$ in closed form.

Let $a, b$ and $c$ be positive integers satisfying the equation $(a, b) + [a, b]=2021^c$. If $|a-b|$ is a prime number, prove that the number $(a+b)^2+4$ is composite. [i]Proposed by Serbia[/i]

Samuel Tsui and Jason Yang each chose a different integer between $1$ and $60$, inclusive. They don’t know each others’ numbers, but they both know that the other person’s number is between $1$ and $60$ and distinct from their own. They have the following conversation: Samuel Tsui: Do our numbers have any common factors greater than $1$? Jason Yang: Definitely not. However their least common multiple must be less than$ 2023$. Samuel Tsui: Ok, thismeans that the sumof the factors of our two numbers are equal. What is the sumof Samuel Tsui’s and Jason Yang’s numbers? [i]Proposed by Samuel Tsui[/i]