19. Let $S$ be the set of all positive integers whose prime factorizations only contain powers of the primes $2$ and $2017$ ($1$, powers of $2$, and powers of $2017$ are thus contained in $S$). Compute $\sum_{s\in S}\frac1s$. 20. Let $\mathcal{V}$ be the volume enclosed by the graph $$x^ {2016} + y^{2016} + z^2 = 2016$$ Find $\mathcal{V}$ rounded to the nearest multiple of ten. 21. Zlatan has $2017$ socks of various colours. He wants to proudly display one sock of each of the colours, and he counts that there are $N$ ways to select socks from his collection for display. Given this information, what is the maximum value of $N$?

Does there exist a function $f:\mathbb{R}\to \mathbb{R}$ such that $$f(x^2+f(y))=f(x)^2-y$$ for all $x, y\in \mathbb{R}$?

For how many positive integers $x$ is $\log_{10}{(x-40)} + \log_{10}{(60-x)} < 2$? ${ \textbf{(A)}\ 10\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 19\qquad\textbf{(D)}}\ 20\qquad\textbf{(E)}\ \text{infinitely many} $

Carlos went to a sports store to buy running shoes. Running shoes were on sale, with prices reduced by 20% on every pair of shoes. Carlos also knew that he had to pay a 7.5% sales tax on the discounted price. He had 43 dollars. What is the original (before discount) price of the most expensive shoes he could afford to buy? A)$46$ B)$50$ C)$48$ D)$47$ E)$49$

Let $x,y,z$ be positive real numbers such that $x+y+z \ge x^2+y^2+z^2$. Show that; $$\dfrac{x^2+3}{x^3+1}+\dfrac{y^2+3}{y^3+1}+\dfrac{z^2+3}{z^3+1}\ge6$$

An alien from the planet OMO Centauri writes the first ten prime numbers in arbitrary order as U, W, XW, ZZ, V, Y, ZV, ZW, ZY, and X. Each letter represents a nonzero digit. Each letter represents the same digit everywhere it appears, and different letters represent different digits. Also, the alien is using a base other than base ten. The alien writes another number as UZWX. Compute this number (expressed in base ten, with the usual, human digits). [i]Proposed by Luke Robitaille & Eric Shen[/i]

Point $B$ lies on line segment $\overline{AC}$ with $AB=16$ and $BC=4$. Points $D$ and $E$ lie on the same side of line $AC$ forming equilateral triangles $\triangle ABD$ and $\triangle BCE$. Let $M$ be the midpoint of $\overline{AE}$, and $N$ be the midpoint of $\overline{CD}$. The area of $\triangle BMN$ is $x$. Find $x^2$.

Cars A and B travel the same distance. Care A travels half that [i]distance[/i] at $ u$ miles per hour and half at $ v$ miles per hour. Car B travels half the [i]time[/i] at $ u$ miles per hour and half at $ v$ miles per hour. The average speed of Car A is $ x$ miles per hour and that of Car B is $ y$ miles per hour. Then we always have $ \textbf{(A)}\ x \leq y\qquad \textbf{(B)}\ x \geq y \qquad \textbf{(C)}\ x\equal{}y \qquad \textbf{(D)}\ x<y\qquad \textbf{(E)}\ x>y$

In January Jeff’s investment went up by three quarters. In February it went down by one quarter. In March it went up by one third. In April it went down by one fifth. In May it went up by one seventh. In June Jeff’s investment fell by $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. If Jeff’s investment was worth the same amount at the end of June as it had been at the beginning of January, find $m + n$.

[b]p1.[/b] There are $2024$ apples in a very large basket. First, Julie takes away half of the apples in the basket; then, Diane takes away $202$ apples from the remaining bunch. How many apples remain in the basket? [b]p2.[/b] The set of all permutations (different arrangements) of the letters in ”ABMC” are listed in alphabetical order. The first item on the list is numbered $1$, the second item is numbered $2$, and in general, the kth item on the list is numbered $k$. What number is given to ”ABMC”? [b]p3.[/b] Daniel has a water bottle that is three-quarters full. After drinking $3$ ounces of water, the water bottle is three-fifths full. The density of water is $1$ gram per milliliter, and there are around $28$ grams per ounce. How many milliliters of water could the bottle fit at full capacity? [b]p4.[/b] How many ways can four distinct $2$-by-$1$ rectangles fit on a $2$-by-$4$ board such that each rectangle is fully on the board? [b]p5.[/b] Iris and Ivy start reading a $240$ page textbook with $120$ left-hand pages and $120$ right-hand pages. Iris takes $4$ minutes to read each page, while Ivy takes $5$ minutes to read a left-hand page and $3$ minutes to read a right-hand page. Iris and Ivy move onto the next page only when both sisters have completed reading. If a sister finishes reading a page first, the other sister will start reading three times as fast until she completes the page. How many minutes after they start reading will both sisters finish the textbook? [b]p6.[/b] Let $\vartriangle ABC$ be an equilateral triangle with side length $24$. Then, let $M$ be the midpoint of $BC$. Define $P$ to be the set of all points $P$ such that $2PM = BC$. The minimum value of $AP$ can be expressed as $\sqrt{a}- b$, where $a$ and $b$ are positive integers. Find $a + b$. [b]p7.[/b] Jonathan has $10$ songs in his playlist: $4$ rap songs and $6$ pop songs. He will select three unique songs to listen to while he studies. Let $p$ be the probability that at least two songs are rap, and let $q$ be the probability that none of them are rap. Find $\frac{p}{q}$ . [b]p8.[/b] A number $K$ is called $6,8$-similar if $K$ written in base $6$ and $K$ written in base $8$ have the same number of digits. Find the number of $6,8$-similar values between $1$ and $1000$, inclusive. [b]p9.[/b] Quadrilateral $ABCD$ has $\angle ABC = 90^o$, $\angle ADC = 120^o$, $AB = 5$, $BC = 18$, and $CD = 3$. Find $AD^2$. [b]p10.[/b] Bob, Eric, and Raymond are playing a game. Each player rolls a fair $6$-sided die, and whoever has the highest roll wins. If players are tied for the highest roll, the ones that are tied reroll until one wins. At the start, Bob rolls a $4$. The probability that Eric wins the game can be expressed as $\frac{p}{q}$ where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [b]p11.[/b] Define the following infinite sequence $s$: $$s = \left\{\frac92,\frac{99}{2^2},\frac{999}{2^3} , ... , \overbrace{\frac{999...999}{2^k}}^{k\,\,nines}, ...\right\}$$ The sum of the first $2024$ terms in $s$, denoted $S$, can be expressed as $$S =\frac{5^a - b}{4}+\frac{1}{2^c},$$ where $a, b$, and $c$ are positive integers. Find $a + b + c$. [b]p12.[/b] Andy is adding numbers in base $5$. However, he accidentally forgets to write the units digit of each number. If he writes all the consecutive integers starting at $0$ and ending at $50$ (base $10$) and adds them together, what is the difference between Andy’s sum and the correct sum? (Express your answer in base-$10$.) [b]p13.[/b] Let $n$ be the positive real number such that the system of equations $$y =\frac{1}{\sqrt{2024 - x^2}}$$ $$y =\sqrt{x^2 - n}$$ has exactly two real solutions for $(x, y)$: $(a, b)$ and $(-a, b)$. Then, $|a|$ can be expressed as $j\sqrt{k}$, where $j$ and $k$ are integers such that $k$ is not divisible by any perfect square other than $1$. Find $j · k$. [b]p14.[/b] Nakio is playing a game with three fair $4$-sided dice. But being the cheater he is, he has secretly replaced one of the three die with his own $4$-sided die, such that there is a $1/2$ chance of rolling a $4$, and a $1/6$ chance to roll each number from $1$ to $3$. To play, a random die is chosen with equal probability and rolled. If Nakio guesses the number that is on the die, he wins. Unfortunately for him, Nakio’s friends have an anti-cheating mechanism in place: when the die is picked, they will roll it three times. If each roll lands on the same number, that die is thrown out and one of the two unused dice is chosen instead with equal probability. If Nakio always guesses $4$, the probability that he wins the game can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime. Find $m + n$. [b]p15.[/b] A particle starts in the center of a $2$m-by-$2$m square. It moves in a random direction such that the angle between its direction and a side of the square is a multiple of $30^o$. It travels in that direction at $1$ m/s, bouncing off of the walls of the square. After a minute, the position of the particle is recorded. The expected distance from this point to the start point can be written as $$\frac{1}{a}\left(b - c\sqrt{d}\right),$$ where $a$ and $b$ are relatively prime, and d is not divisible by any perfect square. Find $a + b + c + d$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ b_1, b_2, \ldots, b_{1989}$ be positive real numbers such that the equations \[ x_{r\minus{}1} \minus{} 2x_r \plus{} x_{r\plus{}1} \plus{} b_rx_r \equal{} 0 \quad (1 \leq r \leq 1989)\] have a solution with $ x_0 \equal{} x_{1989} \equal{} 0$ but not all of $ x_1, \ldots, x_{1989}$ are equal to zero. Prove that \[ \sum^{1989}_{k\equal{}1} b_k \geq \frac{2}{995}.\]

A circle $\omega$ with radius $1$ is given. A collection $T$ of triangles is called [i]good[/i], if the following conditions hold: [list=1] [*] each triangle from $T$ is inscribed in $\omega$; [*] no two triangles from $T$ have a common interior point. [/list] Determine all positive real numbers $t$ such that, for each positive integer $n$, there exists a good collection of $n$ triangles, each of perimeter greater than $t$.

Is it possible to divide a $8 \times 8$ chessboard into $32$ rectangles, each either $1 \times 2$ or $2 \times 1$, and to draw exactly one diagonal on each rectangle such that no two of these diagonals have a common endpoint? (A Shapovalov)

In a triangle $ABC$ with circumcircle $(O)$ suppose that $A$-altitude cut $(O)$ at $D$. Let altitude of $B,C$ cut $AC,AB$ at $E,F$. $H$ is orthocenter and $T$ is midpoint of $AH$. Parallel line with $EF$ passes through $T$ cut $AB,AC$ at $X,Y$. Prove that $\angle XDF = \angle YDE$.

The function $f(x)$ has the property that $f(x) = -\frac{1}{f(x-1)}.$ Given that $f(0)=-\frac{1}{21},$ find the value of $f(2021).$ [i]Proposed by Ada Tsui[/i]

Points $P_1, P_2, P_3,$ and $P_4$ are $(0,0), (10, 20), (5, 15),$ and $(12, -6)$, respectively. For what point $P \in \mathbb{R}^2$ is the sum of the distances from $P$ to the other $4$ points minimal?

Let $n$ be a positive integer. There are $2018n+1$ cities in the Kingdom of Sellke Arabia. King Mark wants to build two-way roads that connect certain pairs of cities such that for each city $C$ and integer $1\le i\le 2018,$ there are exactly $n$ cities that are a distance $i$ away from $C.$ (The [i]distance[/i] between two cities is the least number of roads on any path between the two cities.) For which $n$ is it possible for Mark to achieve this? [i]Proposed by Michael Ren[/i]

What is the least real value of the expression $\sqrt{x^2-6x+13} + \sqrt{x^2-14x+58}$ where $x$ is a real number? $ \textbf{(A)}\ \sqrt {39} \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ \frac {43}6 \qquad\textbf{(D)}\ 2\sqrt 2 + \sqrt {13} \qquad\textbf{(E)}\ \text{None of the above} $

A carpet dealer,who has a lot of carpets in the market,is available to exchange a carpet of dimensions $a\cdot b$ either with a carpet with dimensions $\frac{1}{a}\cdot \frac{1}{b}$ or with two carpets with dimensions $c\cdot b$ and $\frac{a}{c}\cdot b$ (the customer can select the number $c$).The dealer supports that,at the beginning he had a carpet with dimensions greater than $1$ and,after some exchanges like the ones we described above,he ended up with a set of carpets,each one having one dimension greater than $1$ and one smaller than $1$.Is this possible? [i]Note:The customer can demand from the dealer to consider a carpet of dimensions $a\cdot b$ as one with dimensions $b\cdot a$.[/i]

For how many integral values of $x$ can a triangle of positive area be formed having side lengths $ \log_{2} x, \log_{4} x, 3$? $\textbf{(A) } 57\qquad \textbf{(B) } 59\qquad \textbf{(C) } 61\qquad \textbf{(D) } 62\qquad \textbf{(E) } 63$

Let $ABC$ be triangle with incenter $I$. A point $P$ in the interior of the triangle satisfies \[\angle PBA+\angle PCA = \angle PBC+\angle PCB.\] Show that $AP \geq AI$, and that equality holds if and only if $P=I$.

Let $a_1,\ldots,a_n,b_1,\ldots,b_n$ be positive numbers. Show that \[\sqrt{\left(a_1+\cdots+a_n\right)\left(b_1+\cdots+b_n\right)}\ge\sqrt{a_1b_1}+\cdots+\sqrt{a_nb_n}\] and prove that equality holds if and only if \[\frac{a_1}{b_1}=\cdots=\frac{a_n}{b_n}.\]

Rational numbers are written in the following sequence: $\frac{1}{1},\frac{2}{1},\frac{1}{2},\frac{3}{1},\frac{2}{2},\frac{1}{3},\frac{4}{1},\frac{3}{2},\frac{2}{3},\frac{1}{4}, . . .$ In which position of this sequence is $\frac{2005}{2004}$ ?

William was bored at the math lesson, so he drew a circle and $n\ge3$ empty cells around the circumference. In every cell he wrote a positive number. Later on he erased the numbers and in every cell wrote the geometric mean of the numbers previously written in the two neighboring cells. Show that there exists a cell whose number was not replaced by a larger number.

[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].