For a natural number $k>1$, define $S_k$ to be the set of all triplets $(n,a,b)$ of natural numbers, with $n$ odd and $\gcd (a,b)=1$, such that $a+b=k$ and $n$ divides $a^n+b^n$. Find all values of $k$ for which $S_k$ is finite.

The sets $A$ and $B$ are subsets of the positive integers. The sum of any two distinct elements of $A$ is an element of $B$. The quotient of any two distinct elements of $B$ (where we divide the largest by the smallest of the two) is an element of $A$. Determine the maximum number of elements in $A\cup B$.

Determine the number of all numbers which are represented as $x^2+y^2$ with $x, y \in \{1, 2, 3, \ldots, 1000\}$ and which are divisible by 121.

Let $m,n$ be naturals satisfying $n \geq m \geq 2$ and let $S$ be a set consisting of $n$ naturals. Prove that $S$ has at least $2^{n-m+1}$ distinct subsets, each whose sum is divisible by $m$. (The zero set counts as a subset).

Find the remainder of $$\prod_{n = 2}^{99} (1 - n^2 + n^4)(1 - 2n^2 + n^4)$$ when divided by $101$.

Paul and Sara are playing a game with integers on a whiteboard, with Paul going first. When it is Paul’s turn, he can pick any two integers on the board and replace them with their product; when it is Sara’s turn, she can pick any two integers on the board and replace them with their sum. Play continues until exactly one integer remains on the board. Paul wins if that integer is odd, and Sara wins if it is even. Initially, there are $2021$ integers on the board, each one sampled uniformly at random from the set $\{0, 1, 2, 3, . . . , 2021\}$. Assuming both players play optimally, the probability that Paul wins is $m/n$ , where $m, n$ are positive integers and $gcd(m, n) = 1$. Find the remainder when $m + n$ is divided by $1000$.

Show that there are infinitely many positive integers $c$, such that the following equations both have solutions in positive integers: $(x^2 - c)(y^2 -c) = z^2 -c$ and $(x^2 + c)(y^2 - c) = z^2 - c$.

A rectangular floor that is $10$ feet wide and $17$ feet long is tiled with $170$ one-foot square tiles. A bug walks from one corner to the opposite corner in a straight line. Including the first and the last tile, how many tiles does the bug visit? $\textbf{(A) } 17 \qquad\textbf{(B) } 25 \qquad\textbf{(C) } 26 \qquad\textbf{(D) } 27 \qquad\textbf{(E) } 28$

Given a non-zero integer $y$ and a positive integer $n$. If $x_1, x_2, \ldots, x_n \in \mathbb{Z} - \{0, 1\}$ and $z \in \mathbb{Z}^+$ satisfy $(x_1x_2 \ldots x_n)^2y \le 2^{2(n+1)}$ and $x_1x_2 \ldots x_ny = z + 1$, prove that there is a prime among $x_1, x_2, \ldots, x_n, z$. [color=blue]It appears that the problem statement is incorrect; suppose $y = 5, n = 2$, then $x_1 = x_2 = -1$ and $z = 4$. They all satisfy the problem's conditions, but none of $x_1, x_2, z$ is a prime. What should the problem be, or did I misinterpret the problem badly?[/color]

Let $\phi(n)$ denote the number of positive integers less than or equal to $n$ and relatively prime to $n$. Find all natural numbers $n$ and primes $p$ such that $\phi(n)=\phi(np)$.

Determine all pairs $(p, q)$ of prime numbers such that $p^p + q^q + 1$ is divisible by $pq.$

Are there positive integers $a; b; c$ and $d$ such that $a^3 + b^3 + c^3 + d^3 =100^{100}$ ? [i](4 points)[/i]

Find all surjective functions $ f: \mathbb{N} \to \mathbb{N}$ such that for every $ m,n \in \mathbb{N}$ and every prime $ p,$ the number $ f(m + n)$ is divisible by $ p$ if and only if $ f(m) + f(n)$ is divisible by $ p$. [i]Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran[/i]

[b]p1.[/b] Three positive integers sum to $16$. What is the least possible value of the sum of their squares? [b]p2.[/b] Ben is thinking of an odd positive integer less than $1000$. Ben subtracts $ 1$ from his number and divides by $2$, resulting in another number. If his number is still odd, Ben repeats this procedure until he gets an even number. Given that the number he ends on is $2$, how many possible values are there for Ben’s original number? [b]p3.[/b] Triangle $ABC$ is isosceles, with $AB = BC = 18$ and has circumcircle $\omega$. Tangents to $\omega$ at $ A$ and $ B$ intersect at point $D$. If $AD = 27$, what is the length of $AC$? [b]p4.[/b] How many non-decreasing sequences of five natural numbers have first term $ 1$, last term $ 11$, and have no three terms equal? [b]p5.[/b] Adam is bored, and has written the string “EMCC” on a piece of paper. For fun, he decides to erase every letter “C”, and replace it with another instance of “EMCC”. For example, after one step, he will have the string “EMEMCCEMCC”. How long will his string be after $8$ of these steps? [b]p6.[/b] Eric has two coins, which land heads $40\%$ and $60\%$ of the time respectively. He chooses a coin randomly and flips it four times. Given that the first three flips contained two heads and one tail, what is the probability that the last flip was heads? [b]p7.[/b] In a five person rock-paper-scissors tournament, each player plays against every other player exactly once, with each game continuing until one player wins. After each game, the winner gets $ 1$ point, while the loser gets no points. Given that each player has a $50\%$ chance of defeating any other player, what is the probability that no two players end up with the same amount of points? [b]p8.[/b] Let $\vartriangle ABC$ have $\angle A = \angle B = 75^o$. Points $D, E$, and $F$ are on sides $BC$, $CA$, and $AB$, respectively, so that $EF$ is parallel to $BC$, $EF \perp DE$, and $DE = EF$. Find the ratio of $\vartriangle DEF$’s area to $\vartriangle ABC$’s area. [b]p9.[/b] Suppose $a, b, c$ are positive integers such that $a+b =\sqrt{c^2 + 336}$ and $a-b =\sqrt{c^2 - 336}$. Find $a+b+c$. [b]p10.[/b] How many times on a $12$-hour analog clock are there, such that when the minute and hour hands are swapped, the result is still a valid time? (Note that the minute and hour hands move continuously, and don’t always necessarily point to exact minute/hour marks.) [b]p11.[/b] Adam owns a square $S$ with side length $42$. First, he places rectangle $A$, which is $6$ times as long as it is wide, inside the square, so that all four vertices of $A$ lie on sides of $S$, but none of the sides of $ A$ are parallel to any side of $S$. He then places another rectangle $B$, which is $ 7$ times as long as it is wide, inside rectangle $A$, so that all four vertices of $ B$ lie on sides of $ A$, and again none of the sides of $B$ are parallel to any side of $A$. Find the length of the shortest side of rectangle $ B$. [b]p12.[/b] Find the value of $\sqrt{3 \sqrt{3^3 \sqrt{3^5 \sqrt{...}}}}$, where the exponents are the odd natural numbers, in increasing order. [b]p13.[/b] Jamesu and Fhomas challenge each other to a game of Square Dance, played on a $9 \times 9$ square grid. On Jamesu’s turn, he colors in a $2\times 2$ square of uncolored cells pink. On Fhomas’s turn, he colors in a $1 \times 1$ square of uncolored cells purple. Once Jamesu can no longer make a move, Fhomas gets to color in the rest of the cells purple. If Jamesu goes first, what the maximum number of cells that Fhomas can color purple, assuming both players play optimally in trying to maximize the number of squares of their color? [b]p14.[/b] Triangle $ABC$ is inscribed in circle $\omega$. The tangents to $\omega$ from $B$ and $C$ meet at $D$, and segments $AD$ and $BC$ intersect at $E$. If $\angle BAC = 60^o$ and the area of $\vartriangle BDE$ is twice the area of $\vartriangle CDE$, what is $\frac{AB}{AC}$ ? [b]p15.[/b] Fhomas and Jamesu are now having a number duel. First, Fhomas chooses a natural number $n$. Then, starting with Jamesu, each of them take turns making the following moves: if $n$ is composite, the player can pick any prime divisor $p$ of $n$, and replace $n$ by $n - p$, if $n$ is prime, the player can replace n by $n - 1$. The player who is faced with $ 1$, and hence unable to make a move, loses. How many different numbers $2 \le n \le 2019$ can Fhomas choose such that he has a winning strategy, assuming Jamesu plays optimally? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products \[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\] form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.

Prove that the following equation has no solution in integer numbers: \[ x^2 + 4 = y^5. \] [i]Bulgaria[/i]

Let the $f:\mathbb{N}\rightarrow\mathbb{N}$ be the function such that (i) For all positive integers $n,$ $f(n+f(n))=f(n)$ (ii) $f(n_o)=1$ for some $n_0$ Prove that $f(n)\equiv 1.$

Let \(m\) be a positive integer. Find, in terms of \(m\), all polynomials \(P(x)\) with integer coefficients such that for every integer \(n\), there exists an integer \(k\) such that \(P(k)=n^m\). [i]Proposed by Raymond Feng[/i]

[b]p1.[/b] Trung took five tests this semester. For his first three tests, his average was $60$, and for the fourth test he earned a $50$. What must he have earned on his fifth test if his final average for all five tests was exactly $60$? [b]p2.[/b] Find the number of pairs of integers $(a, b)$ such that $20a + 16b = 2016 - ab$. [b]p3.[/b] Let $f : N \to N$ be a strictly increasing function with $f(1) = 2016$ and $f(2t) = f(t) + t$ for all $t \in N$. Find $f(2016)$. [b]p4.[/b] Circles of radius $7$, $7$, $18$, and $r$ are mutually externally tangent, where $r = \frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$. [b]p5.[/b] A point is chosen at random from within the circumcircle of a triangle with angles $45^o$, $75^o$, $60^o$. What is the probability that the point is closer to the vertex with an angle of $45^o$ than either of the two other vertices? [b]p6.[/b] Find the largest positive integer $a$ less than $100$ such that for some positive integer $b$, $a - b$ is a prime number and $ab$ is a perfect square. [b]p7.[/b] There is a set of $6$ parallel lines and another set of six parallel lines, where these two sets of lines are not parallel with each other. If Blythe adds $6$ more lines, not necessarily parallel with each other, find the maximum number of triangles that could be made. [b]p8.[/b] Triangle $ABC$ has sides $AB = 5$, $AC = 4$, and $BC = 3$. Let $O$ be any arbitrary point inside $ABC$, and $D \in BC$, $E \in AC$, $F \in AB$, such that $OD \perp BC$, $OE \perp AC$, $OF \perp AB$. Find the minimum value of $OD^2 + OE^2 + OF^2$. [b]p9.[/b] Find the root with the largest real part to $x^4-3x^3+3x+1 = 0$ over the complex numbers. [b]p10.[/b] Tony has a board with $2$ rows and $4$ columns. Tony will use $8$ numbers from $1$ to $8$ to fill in this board, each number in exactly one entry. Let array $(a_1,..., a_4)$ be the first row of the board and array $(b_1,..., b_4)$ be the second row of the board. Let $F =\sum^{4}_{i=1}|a_i - b_i|$, calculate the average value of $F$ across all possible ways to fill in. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $f: N \to N$ be a function satisfying (a) $1\le f(x)-x \le 2019$ $\forall x \in N$ (b) $f(f(x))\equiv x$ (mod $2019$) $\forall x \in N$ Show that $\exists x \in N$ such that $f^k(x)=x+2019 k, \forall k \in N$

[i]20 problems for 20 minutes.[/i] [b]p1.[/b] Determine how many digits the number $10^{10}$ has. [b]p2.[/b] Let $ABC$ be a triangle with $\angle ABC = 60^o$ and $\angle BCA = 70^o$. Compute $\angle CAB$ in degrees. [b]p3.[/b] Given that $x : y = 2012 : 2$ and $y : z = 1 : 2013$, compute $x : z$. Express your answer as a common fraction. [b]p4.[/b] Determine the smallest perfect square greater than $2400$. [b]p5.[/b] At $12:34$ and $12:43$, the time contains four consecutive digits. Find the next time after 12:43 that the time contains four consecutive digits on a 24-hour digital clock. [b]p6.[/b] Given that $ \sqrt{3^a \cdot 9^a \cdot 3^a} = 81^2$, compute $a$. [b]p7.[/b] Find the number of positive integers less than $8888$ that have a tens digit of $4$ and a units digit of $2$. [b]p8.[/b] Find the sum of the distinct prime divisors of $1 + 2012 + 2013 + 2011 \cdot 2013$. [b]p9.[/b] Albert wants to make $2\times 3$ wallet sized prints for his grandmother. Find the maximum possible number of prints Albert can make using one $4 \times 7$ sheet of paper. [b]p10.[/b] Let $ABC$ be an equilateral triangle, and let $D$ be a point inside $ABC$. Let $E$ be a point such that $ADE$ is an equilateral triangle and suppose that segments $DE$ and $AB$ intersect at point $F$. Given that $\angle CAD = 15^o$, compute $\angle DFB$ in degrees. [b]p11.[/b] A palindrome is a number that reads the same forwards and backwards; for example, $1221$ is a palindrome. An almost-palindrome is a number that is not a palindrome but whose first and last digits are equal; for example, $1231$ and $1311$ are an almost-palindromes, but $1221$ is not. Compute the number of $4$-digit almost-palindromes. [b]p12.[/b] Determine the smallest positive integer $n$ such that the sum of the digits of $11^n$ is not $2^n$. [b]p13.[/b] Determine the minimum number of breaks needed to divide an $8\times 4$ bar of chocolate into $1\times 1 $pieces. (When a bar is broken into pieces, it is permitted to rotate some of the pieces, stack some of the pieces, and break any set of pieces along a vertical plane simultaneously.) [b]p14.[/b] A particle starts moving on the number line at a time $t = 0$. Its position on the number line, as a function of time, is $$x = (t-2012)^2 -2012(t-2012)-2013.$$ Find the number of positive integer values of $t$ at which time the particle lies in the negative half of the number line (strictly to the left of $0$). [b]p15.[/b] Let $A$ be a vertex of a unit cube and let $B$,$C$, and $D$ be the vertices adjacent to A. The tetrahedron $ABCD$ is cut off the cube. Determine the surface area of the remaining solid. [b]p16.[/b] In equilateral triangle $ABC$, points $P$ and $R$ lie on segment $AB$, points $I$ and $M$ lie on segment $BC$, and points $E$ and $S$ lie on segment $CA$ such that $PRIMES$ is a equiangular hexagon. Given that $AB = 11$, $PS = 2$, $RI = 3$, and $ME = 5$, compute the area of hexagon $PRIMES$. [b]p17.[/b] Find the smallest odd positive integer with an odd number of positive integer factors, an odd number of distinct prime factors, and an odd number of perfect square factors. [b]p18.[/b] Fresh Mann thinks that the expressions $2\sqrt{x^2 -4} $and $2(\sqrt{x^2} -\sqrt4)$ are equivalent to each other, but the two expressions are not equal to each other for most real numbers $x$. Find all real numbers $x$ such that $2\sqrt{x^2 -4} = 2(\sqrt{x^2} -\sqrt4)$. [b]p19.[/b] Let $m$ be the positive integer such that a $3 \times 3$ chessboard can be tiled by at most $m$ pairwise incongruent rectangles with integer side lengths. If rotations and reflections of tilings are considered distinct, suppose that there are $n$ ways to tile the chessboard with $m$ pairwise incongruent rectangles with integer side lengths. Find the product $mn$. [b]p20.[/b] Let $ABC$ be a triangle with $AB = 4$, $BC = 5$, and $CA = 6$. A triangle $XY Z$ is said to be friendly if it intersects triangle $ABC$ and it is a translation of triangle $ABC$. Let $S$ be the set of points in the plane that are inside some friendly triangle. Compute the ratio of the area of $S$ to the area of triangle $ABC$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all surjective functions $ f: \mathbb{N} \to \mathbb{N}$ such that for every $ m,n \in \mathbb{N}$ and every prime $ p,$ the number $ f(m + n)$ is divisible by $ p$ if and only if $ f(m) + f(n)$ is divisible by $ p$. [i]Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran[/i]

Solve in integer:$x^6+x^2y=y^3+2y^2$

Is there an integer $ N$ such that $ \left(\sqrt{1997}\minus{}\sqrt{1996}\right)^{1998}\equal{}\sqrt{N}\minus{}\sqrt{N\minus{}1}$?

On each day of their tour of the West Indies, Sourav and Srinath have either an apple or an orange for breakfast. Sourav has oranges for the first $m$ days, apples for the next $m$ days, followed by oranges for the next $m$ days, and so on. Srinath has oranges for the first $n$ days, apples for the next $n$ days, followed by oranges for the next $n$ days, and so on. If $\gcd(m,n)=1$, and if the tour lasted for $mn$ days, on how many days did they eat the same kind of fruit?