[b]p1.[/b] The following figure represents a rectangular piece of paper $ABCD$ whose dimensions are $4$ inches by $3$ inches. When the paper is folded along the line segment $EF$, the corners $A$ and $C$ coincide. (a) Find the length of segment $EF$. (b) Extend $AD$ and $EF$ so they meet at $G$. Find the area of the triangle $\vartriangle AEG$. [img]https://cdn.artofproblemsolving.com/attachments/d/4/e8844fd37b3b8163f62fcda1300c8d63221f51.png[/img] [b]p2.[/b] (a) Let $p$ be a prime number. If $a, b, c$, and $d$ are distinct integers such that the equation $(x -a)(x - b)(x - c)(x - d) - p^2 = 0$ has an integer solution $r$, show that $(r - a) + (r - b) + (r - c) + (r - d) = 0$. (b) Show that $r$ must be a double root of the equation $(x - a)(x - b)(x - c)(x - d) - p^2 = 0$. [b]p3.[/b] If $\sin x + \sin y + \sin z = 0$ and $\cos x + \cos y + \cos z = 0$, prove the following statements. (a) $\cos (x - y) = -\frac12$ (b) $\cos (\theta - x) + \cos(\theta - y) + \cos (\theta - z) = 0$, for any angle $\theta$. (c) $\sin^2 x + \sin^2 y + \sin^2 z =\frac32$ [b]p4.[/b] Let $|A|$ denote the number of elements in the set $A$. (a) Construct an infinite collection $\{A_i\}$ of infinite subsets of the set of natural numbers such that $|A_i \cap A_j | = 0$ for $i \ne j$. (b) Construct an infinite collection $\{B_i\}$ of infinite subsets of the set of natural numbers such that $|B_i \cap B_j |$ gives a distinct integer for every pair of $i$ and $j$, $i \ne j$. [b]p5.[/b] Consider the equation $x^4 + y^4 = z^5$. (a) Show that the equation has a solution where $x, y$, and $z$ are positive integers. (b) Show that the equation has infinitely many solutions where $x, y$, and $z$ are positive integers. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider the equation \[ x^{2001}=y^x .\] [list] [*] Find all pairs $(x,y)$ of solutions where $x$ is a prime number and $y$ is a positive integer. [*] Find all pairs $(x,y)$ of solutions where $x$ and $y$ are positive integers.[/list] (Remember that $2001=3 \cdot 23 \cdot 29$.)

Let $a$ and $b$ be fixed positive integers. Show that the set of primes that divide at least one of the terms of the sequence $a_n = a \cdot 2017^n + b \cdot 2016^n$ is infinite.

Let $ {\mathbb Q}^ \plus{}$ be the set of positive rational numbers. Construct a function $ f : {\mathbb Q}^ \plus{} \rightarrow {\mathbb Q}^ \plus{}$ such that \[ f(xf(y)) \equal{} \frac {f(x)}{y} \] for all $ x$, $ y$ in $ {\mathbb Q}^ \plus{}$.

Max has $2015$ jars labeled with the numbers $1$ to $2015$ and an unlimited supply of coins. Consider the following starting configurations: (a) All jars are empty. (b) Jar $1$ contains $1$ coin, jar $2$ contains $2$ coins, and so on, up to jar $2015$ which contains $2015$ coins. (c) Jar $1$ contains $2015$ coins, jar $2$ contains $2014$ coins, and so on, up to jar $2015$ which contains $1$ coin. Now Max selects in each step a number $n$ from $1$ to $2015$ and adds $n$ to each jar [i]except to the jar $n$[/i]. Determine for each starting configuration in (a), (b), (c), if Max can use a finite, strictly positive number of steps to obtain an equal number of coins in each jar. (Birgit Vera Schmidt)

Let $ ABCDEF$ be a regular hexagon. Let $ G$, $ H$, $ I$, $ J$, $ K$, and $ L$ be the midpoints of sides $ AB$, $ BC$, $ CD$, $ DE$, $ EF$, and $ AF$, respectively. The segments $ AH$, $ BI$, $ CJ$, $ DK$, $ EL$, and $ FG$ bound a smaller regular hexagon. Let the ratio of the area of the smaller hexagon to the area of $ ABCDEF$ be expressed as a fraction $ \frac {m}{n}$ where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$.

Determine all primes $p$ such that $5^p + 4 p^4$ is a perfect square, i.e., the square of an integer.

Determine all pairs of positive integers $(a,b)$ such that \[ \dfrac{a^2}{2ab^2-b^3+1} \] is a positive integer.

Let $\mathbb{N}$ be the set of all positive integers. Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that $f(x) + y$ and $f(y) + x$ have the same number of $1$'s in their binary representations, for any $x,y \in \mathbb{N}$.

Let $n$ be the smallest positive integer such that the remainder of $3n+45$, when divided by $1060$, is $16$. Find the remainder of $18n+17$ upon division by $1920$.

Four positive integers $x,y,z$ and $t$ satisfy the relations \[ xy - zt = x + y = z + t. \] Is it possible that both $xy$ and $zt$ are perfect squares?

Solve the equation for the positive integers: $$(x+2y)^2+2x+5y+9=(y+z)^2$$

Determine whether there are infinitely many triples $(u,v,w)$ of positive integers such that $u,v,w$ form an arithmetic progression and the numbers $uv+1, vw+1$ and $wu+1$ are all perfect squares.

What is the smallest positive integer value of $x$ for which $x \equiv 4$ (mod $9$) and $x \equiv 7$ (mod $8$)?

Find all positive integers $n$ that can be represented in the form $$n=\mathrm{lcm}(a,b)+\mathrm{lcm}(b,c)+\mathrm{lcm}(c,a)$$ where $a,b,c$ are positive integers.

The diagram below shows twelve $30-60-90$ triangles placed in a circle so that the hypotenuse of each triangle coincides with the longer leg of the next triangle. The fourth and last triangle in this diagram are shaded. The ratio of the perimeters of these two triangles can be written as $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [asy] size(200); defaultpen(linewidth(0.8)); pair point=(-sqrt(3),0); pair past,unit; path line; for(int i=0;i<=12;++i) { past = point; line=past--origin; unit=waypoint(line,1/200); point=extension(past,rotate(90,past)*unit,origin,dir(180-30*i)); if (i == 4) { filldraw(origin--past--point--cycle,gray(0.7)); } else if (i==12) { filldraw(origin--past--point--cycle,gray(0.7)); } else { draw(origin--past--point); } } draw(origin--point); [/asy]

Let $ a,b,c$ be positive integers. If $ 30|a\plus{}b\plus{}c$, prove that $ 30|a^5\plus{}b^5\plus{}c^5$.

Let $ p_i $ denote the $ i $-th prime number. Let $ n = \lfloor\alpha^{2015}\rfloor $, where $ \alpha $ is a positive real number such that $ 2 < \alpha < 2.7 $. Prove that $$ \displaystyle\sum_{2 \le p_i \le p_j \le n}\frac{1}{p_ip_j} < 2017 $$

Let $A,B\in\mathcal{M}_n(\mathbb{Z})$ and $p$ a prime number. Prove that $$\text{Tr}((A+B)^p)\equiv\text{Tr}(A^p+B^p)\pmod p.$$

The sequence $a_1, a_2, \dots, a_n$ consists of the numbers $1, 2, \dots, n$ in some order. For which positive integers $n$ is it possible that the $n+1$ numbers $0, a_1, a_1+a_2, a_1+a_2+a_3,\dots, a_1 + a_2 +\cdots + a_n$ all have different remainders when divided by $n + 1$?

Consider the sequence $x_n>0$ defined with the following recurrence relation: \[x_1 = 0\] and for $n>1$ \[(n+1)^2x_{n+1}^2 + (2^n+4)(n+1)x_{n+1}+ 2^{n+1}+2^{2n-2} = 9n^2x_n^2+36nx_n+32.\] Show that if $n$ is a prime number larger or equal to $5$, then $x_n$ is an integer.

If $d$ is a positive integer such that $d \mid 5+2022^{2022}$, show that $d=2x^2+2xy+3y^2$ for some $x, y \in \mathbb{Z}$ iff $d \equiv 3,7 \pmod {20}$.

[u]Set 7[/u] [b]p19.[/b] Let circles $\omega_1$ and $\omega_2$, with centers $O_1$ and $O_2$, respectively, intersect at $X$ and $Y$ . A lies on $\omega_1$ and $B$ lies on $\omega_2$ such that $AO_1$ and $BO_2$ are both parallel to $XY$, and $A$ and $B$ lie on the same side of $O_1O_2$. If $XY = 60$, $\angle XAY = 45^o$, and $\angle XBY = 30^o$, then the length of $AB$ can be expressed in the form $\sqrt{a - b\sqrt2 + c\sqrt3}$, where $a, b, c$ are positive integers. Determine $a + b + c$. [b]p20.[/b] If $x$ is a positive real number such that $x^{x^2}= 2^{80}$, find the largest integer not greater than $x^3$. [b]p21.[/b] Justin has a bag containing $750$ balls, each colored red or blue. Sneaky Sam takes out a random number of balls and replaces them all with green balls. Sam notices that of the balls left in the bag, there are $15$ more red balls than blue balls. Justin then takes out $500$ of the balls chosen randomly. If $E$ is the expected number of green balls that Justin takes out, determine the greatest integer less than or equal to $E$. [u]Set 8[/u] These three problems are interdependent; each problem statement in this set will use the answers to the other two problems in this set. As such, let the positive integers $A, B, C$ be the answers to problems $22$, $23$, and $24$, respectively, for this set. [b]p22.[/b] Let $WXYZ$ be a rectangle with $WX =\sqrt{5B}$ and $XY =\sqrt{5C}$. Let the midpoint of $XY$ be $M$ and the midpoint of $YZ$ be $N$. If $XN$ and $W Y$ intersect at $P$, determine the area of $MPNY$ . [b]p23.[/b] Positive integers $x, y, z$ satisfy $$xy \equiv A \,\, (mod 5)$$ $$yz \equiv 2A + C\,\, (mod 7)$$ $$zx \equiv C + 3 \,\, (mod 9).$$ (Here, writing $a \equiv b \,\, (mod m)$ is equivalent to writing $m | a - b$.) Given that $3 \nmid x$, $3 \nmid z$, and $9 | y$, find the minimum possible value of the product $xyz$. [b]p24.[/b] Suppose $x$ and $y$ are real numbers such that $$x + y = A$$ $$xy =\frac{1}{36}B^2.$$ Determine $|x - y|$. [u]Set 9[/u] [b]p25. [/b]The integer $2017$ is a prime which can be uniquely represented as the sum of the squares of two positive integers: $$9^2 + 44^2 = 2017.$$ If $N = 2017 \cdot 128$ can be uniquely represented as the sum of the squares of two positive integers $a^2 +b^2$, determine $a + b$. [b]p26.[/b] Chef Celia is planning to unveil her newest creation: a whole-wheat square pyramid filled with maple syrup. She will use a square flatbread with a one meter diagonal and cut out each of the five polygonal faces of the pyramid individually. If each of the triangular faces of the pyramid are to be equilateral triangles, the largest volume of syrup, in cubic meters, that Celia can enclose in her pyramid can be expressed as $\frac{a-\sqrt{b}}{c}$ where $a, b$ and $c$ are the smallest possible possible positive integers. What is $a + b + c$? [b]p27.[/b] In the Cartesian plane, let $\omega$ be the circle centered at $(24, 7)$ with radius $6$. Points $P, Q$, and $R$ are chosen in the plane such that $P$ lies on $\omega$, $Q$ lies on the line $y = x$, and $R$ lies on the $x$-axis. The minimum possible value of $PQ+QR+RP$ can be expressed in the form $\sqrt{m}$ for some integer $m$. Find m. [u]Set 10[/u] [i]Deja vu?[/i] [b]p28. [/b] Let $ABC$ be a triangle with incircle $\omega$. Let $\omega$ intersect sides $BC$, $CA$, $AB$ at $D, E, F$, respectively. Suppose $AB = 7$, $BC = 12$, and $CA = 13$. If the area of $ABC$ is $K$ and the area of $DEF$ is $\frac{m}{n}\cdot K$, where $m$ and $n$ are relatively prime positive integers, then compute $m + n$. [b]p29.[/b] Sebastian is playing the game Split! again, but this time in a three dimensional coordinate system. He begins the game with one token at $(0, 0, 0)$. For each move, he is allowed to select a token on any point $(x, y, z)$ and take it off, replacing it with three tokens, one at $(x + 1, y, z)$, one at $(x, y + 1, z)$, and one at $(x, y, z + 1)$ At the end of the game, for a token on $(a, b, c)$, it is assigned a score $\frac{1}{2^{a+b+c}}$ . These scores are summed for his total score. If the highest total score Sebastian can get in $100$ moves is $m/n$, then determine $m + n$. [b]p30.[/b] Determine the number of positive $6$ digit integers that satisfy the following properties: $\bullet$ All six of their digits are $1, 5, 7$, or $8$, $\bullet$ The sum of all the digits is a multiple of $5$. [u]Set 11[/u] [b]p31.[/b] The triangular numbers are defined as $T_n =\frac{n(n+1)}{2}$. We also define $S_n =\frac{n(n+2)}{3}$. If the sum $$\sum_{i=16}^{32} \left(\frac{1}{T_i}+\frac{1}{S_i}\right)= \left(\frac{1}{T_{16}}+\frac{1}{S_{16}}\right)+\left(\frac{1}{T_{17}}+\frac{1}{S_{17}}\right)+...+\left(\frac{1}{T_{32}}+\frac{1}{S_{32}}\right)$$ can be written in the form $a/b$ , where $a$ and $b$ are positive integers with $gcd(a, b) = 1$, then find $a + b$. [b]p32.[/b] Farmer Will is considering where to build his house in the Cartesian coordinate plane. He wants to build his house on the line $y = x$, but he also has to minimize his travel time for his daily trip to his barnhouse at $(24, 15)$ and back. From his house, he must first travel to the river at $y = 2$ to fetch water for his animals. Then, he heads for his barnhouse, and promptly leaves for the long strip mall at the line $y =\sqrt3 x$ for groceries, before heading home. If he decides to build his house at $(x_0, y_0)$ such that the distance he must travel is minimized, $x_0$ can be written in the form $\frac{a\sqrt{b}-c}{d}$ , where $a, b, c, d$ are positive integers, $b$ is not divisible by the square of a prime, and $gcd(a, c, d) = 1$. Compute $a+b+c+d$. [b]p33.[/b] Determine the greatest positive integer $n$ such that the following two conditions hold: $\bullet$ $n^2$ is the difference of consecutive perfect cubes; $\bullet$ $2n + 287$ is the square of an integer. [u]Set 12[/u] The answers to these problems are nonnegative integers that may exceed $1000000$. You will be awarded points as described in the problems. [b]p34.[/b] The “Collatz sequence” of a positive integer n is the longest sequence of distinct integers $(x_i)_{i\ge 0}$ with $x_0 = n$ and $$x_{n+1} =\begin{cases} \frac{x_n}{2} & if \,\, x_n \,\, is \,\, even \\ 3x_n + 1 & if \,\, x_n \,\, is \,\, odd \end{cases}.$$ It is conjectured that all Collatz sequences have a finite number of elements, terminating at $1$. This has been confirmed via computer program for all numbers up to $2^{64}$. There is a unique positive integer $n < 10^9$ such that its Collatz sequence is longer than the Collatz sequence of any other positive integer less than $10^9$. What is this integer $n$? An estimate of $e$ gives $\max\{\lfloor 32 - \frac{11}{3}\log_{10}(|n - e| + 1)\rfloor, 0\}$ points. [b]p35.[/b] We define a graph $G$ as a set $V (G)$ of vertices and a set $E(G)$ of distinct edges connecting those vertices. A graph $H$ is a subgraph of $G$ if the vertex set $V (H)$ is a subset of $V (G)$ and the edge set $E(H)$ is a subset of $E(G)$. Let $ex(k, H)$ denote the maximum number of edges in a graph with $k$ vertices without a subgraph of $H$. If $K_i$ denotes a complete graph on $i$ vertices, that is, a graph with $i$ vertices and all ${i \choose 2}$ edges between them present, determine $$n =\sum_{i=2}^{2018} ex(2018, K_i).$$ An estimate of $e$ gives $\max\{\lfloor 32 - 3\log_{10}(|n - e| + 1)\rfloor, 0\}$ points. [b]p36.[/b] Write down an integer between $1$ and $100$, inclusive. This number will be denoted as $n_i$ , where your Team ID is $i$. Let $S$ be the set of Team ID’s for all teams that submitted an answer to this problem. For every ordered triple of distinct Team ID’s $(a, b, c)$ such that a, b, c ∈ S, if all roots of the polynomial $x^3 + n_ax^2 + n_bx + n_c$ are real, then the teams with ID’s $a, b, c$ will each receive one virtual banana. If you receive $v_b$ virtual bananas in total and $|S| \ge 3$ teams submit an answer to this problem, you will be awarded $$\left\lfloor \frac{32v_b}{3(|S| - 1)(|S| - 2)}\right\rfloor$$ points for this problem. If $|S| \le 2$, the team(s) that submitted an answer to this problem will receive $32$ points for this problem. PS. You had better use hide for answers. First sets have been posted [url=https://artofproblemsolving.com/community/c4h2777264p24369138]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Three positive integers are written on the board. In every minute, instead of the numbers $a, b, c$, Elbek writes $a+\gcd(b,c), b+\gcd(a,c), c+\gcd(a,b)$ . Prove that there will be two numbers on the board after some minutes, such that one is divisible by the other. Note. $\gcd(x,y)$ - Greatest common divisor of numbers $x$ and $y$ [i]Proposed by Sergey Berlov, Russia[/i]

Prove that the equation $$1320x^3=(y_1+y_2+y_3+y_4)(z_1+z_2+z_3+z_4)(t_1+t_2+t_3+t_4+t_5)$$ has infinitely many solutions in the set of Fibonacci numbers. [i]Proposed by Mihály Bencze[/i]