Given two sequences of positive numbers $\{a_k\}$ and $\{b_k\} \ (k \in \mathbb N)$ such that: [b](i)[/b] $a_k < b_k,$ [b](ii) [/b] $\cos a_kx + \cos b_kx \geq -\frac 1k $ for all $k \in \mathbb N$ and $x \in \mathbb R,$ prove the existence of $\lim_{k \to \infty} \frac{a_k}{b_k}$ and find this limit.

Let $S$ be a class of functions from $[0,\infty)$ to $[0,\infty)$ that satisfies: (i) The functions $f_1(x)=e^x-1$ and $f_2(x)=\ln(x+1)$ are in $S;$ (ii) If $f(x)$ and $g(x)$ are in $S,$ the functions $f(x)+g(x)$ and $f(g(x))$ are in $S;$ (iii) If $f(x)$ and $g(x)$ are in $S$ and $f(x)\ge g(x)$ for all $x\ge 0,$ then the function $f(x)-g(x)$ is in $S.$ Prove that if $f(x)$ and $g(x)$ are in $S,$ then the function $f(x)g(x)$ is also in $S.$

Does there exist a solution in integers for the equation $a^2+b^2+c^2+d^2+e^2=abcde-78$ where $a,b,c,d,e>2022$?

Are there polynomials $P, Q$ with real coefficients, such that $P(P(x))\cdot Q(Q(x))$ has exactly $2023$ distinct real roots and $P(Q(x)) \cdot Q(P(x))$ has exactly $2024$ distinct real roots?

For a finite set $ X$ of positive integers, let $ \Sigma(X) \equal{} \sum_{x \in X} \arctan \frac{1}{x}.$ Given a finite set $ S$ of positive integers for which $ \Sigma(S) < \frac{\pi}{2},$ show that there exists at least one finite set $ T$ of positive integers for which $ S \subset T$ and $ \Sigma(S) \equal{} \frac{\pi}{2}.$ [i]Kevin Buzzard, United Kingdom[/i]

The numbers $a_{1}, a_{2}, ..., a_{20}$ satisfy the following conditions: $a_{1} \ge a_{2} \ge ... \ge a_{20} \ge 0$ $a_{1} + a_{2} = 20$ $a_{3} + a_{4} + ... + a_{20} \le 20$ . What is maximum value of the expression: $a_{1}^2 + a_{2}^2 + ... + a_{20}^2$ ? For which values of $a_{1}, a_{2}, ..., a_{20}$ is the maximum value achieved?

Find all pairs of positive integers $ (x,y)$ such that \[ x^y \equal{} y^{x \minus{} y}. \] [i]Albania[/i]

A nonzero polynomial $f(x)$ with real coefficients has the property that $f(x)=f^\prime(x)f^{\prime\prime}(x)$. What is the leading coefficient of $f(x)$?

Suppose that \[ \prod_{n=1}^{\infty}\left(\frac{1+i\cot\left(\frac{n\pi}{2n+1}\right)}{1-i\cot\left(\frac{n\pi}{2n+1}\right)}\right)^{\frac{1}{n}} = \left(\frac{p}{q}\right)^{i \pi}, \] where $p$ and $q$ are relatively prime positive integers. Find $p+q$. [i]Note: for a complex number $z = re^{i \theta}$ for reals $r > 0, 0 \le \theta < 2\pi$, we define $z^{n} = r^{n} e^{i \theta n}$ for all positive reals $n$.[/i]

Let $a, b, c$ be positive real numbers such that: $$ab - c = 3$$ $$abc = 18$$ Calculate the numerical value of $\frac{ab}{c}$

Determine all positive roots of the equation $ x^x = \frac{1}{\sqrt{2}}.$

Let $a_1, a_2, \cdots , a_n$ be real numbers, with $n\geq 3,$ such that $a_1 + a_2 +\cdots +a_n = 0$ and $$ 2a_k\leq a_{k-1} + a_{k+1} \ \ \ \text{for} \ \ \ k = 2, 3, \cdots , n-1.$$ Find the least number $\lambda(n),$ such that for all $k\in \{ 1, 2, \cdots, n\} $ it is satisfied that $|a_k|\leq \lambda (n)\cdot \max \{|a_1|, |a_n|\} .$

Let $x_1=1$ and $x_{n+1} =x_n+\left\lfloor \frac{x_n}{n}\right\rfloor +2$, for $n=1,2,3,\ldots $ where $x$ denotes the largest integer not greater than $x$. Determine $x_{1997}$.

[hide=D stands for Descartes, L stands for Leibniz]they had two problem sets under those two names[/hide] [b]L.10[/b] Given the following system of equations where $x, y, z$ are nonzero, find $x^2 + y^2 + z^2$. $$x + 2y = xy$$ $$3y + z = yz$$ $$3x + 2z = xz$$ [u]Set 4[/u] [b]L.16 / D.23[/b] Anson, Billiam, and Connor are looking at a $3D$ figure. The figure is made of unit cubes and is sitting on the ground. No cubes are floating; in other words, each unit cube must either have another unit cube or the ground directly under it. Anson looks from the left side and says, “I see a $5 \times 5$ square.” Billiam looks from the front and says the same thing. Connor looks from the top and says the same thing. Find the absolute difference between the minimum and maximum volume of the figure. [b]L.17[/b] The repeating decimal $0.\overline{MBMT}$ is equal to $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers, and $M, B, T$ are distinct digits. Find the minimum value of $q$. [b]L.18[/b] Annie, Bob, and Claire have a bag containing the numbers $1, 2, 3, . . . , 9$. Annie randomly chooses three numbers without replacement, then Bob chooses, then Claire gets the remaining three numbers. Find the probability that everyone is holding an arithmetic sequence. (Order does not matter, so $123$, $213$, and $321$ all count as arithmetic sequences.) [b]L.19[/b] Consider a set $S$ of positive integers. Define the operation $f(S)$ to be the smallest integer $n > 1$ such that the base $2^k$ representation of $n$ consists only of ones and zeros for all $k \in S$. Find the size of the largest set $S$ such that $f(S) < 2^{2019}$. [b]L.20 / D.25[/b] Find the largest solution to the equation $$2019(x^{2019x^{2019}-2019^2+2019})^{2019} = 2019^{x^{2019}+1}.$$ [u]Set 5[/u] [b]L.21[/b] Steven is concerned about his artistic abilities. To make himself feel better, he creates a $100 \times 100$ square grid and randomly paints each square either white or black, each with probability $\frac12$. Then, he divides the white squares into connected components, groups of white squares that are connected to each other, possibly using corners. (For example, there are three connected components in the following diagram.) What is the expected number of connected components with 1 square, to the nearest integer? [img]https://cdn.artofproblemsolving.com/attachments/e/d/c76e81cd44c3e1e818f6cf89877e56da2fc42f.png[/img] [b]L.22[/b] Let x be chosen uniformly at random from $[0, 1]$. Let n be the smallest positive integer such that $3^n x$ is at most $\frac14$ away from an integer. What is the expected value of $n$? [b]L.23[/b] Let $A$ and $B$ be two points in the plane with $AB = 1$. Let $\ell$ be a variable line through $A$. Let $\ell'$ be a line through $B$ perpendicular to $\ell$. Let X be on $\ell$ and $Y$ be on $\ell'$ with $AX = BY = 1$. Find the length of the locus of the midpoint of $XY$ . [b]L.24[/b] Each of the numbers $a_i$, where $1 \le i \le n$, is either $-1$ or $1$. Also, $$a_1a_2a_3a_4+a_2a_3a_4a_5+...+a_{n-3}a_{n-2}a_{n-1}a_n+a_{n-2}a_{n-1}a_na_1+a_{n-1}a_na_1a_2+a_na_1a_2a_3 = 0.$$ Find the number of possible values for $n$ between $4$ and $100$, inclusive. [b]L.25[/b] Let $S$ be the set of positive integers less than $3^{2019}$ that have only zeros and ones in their base $3$ representation. Find the sum of the squares of the elements of $S$. Express your answer in the form $a^b(c^d - 1)(e^f - 1)$, where $a, b, c, d, e, f$ are positive integers and $a, c, e$ are not perfect powers. PS. You should use hide for answers. D.1-15 / L1-9 problems have been collected [url=https://artofproblemsolving.com/community/c3h2790795p24541357]here [/url] and D.16-30/ L10-15 [url=https://artofproblemsolving.com/community/c3h2790818p24541688]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] What is the units digit of the product of the first seven primes? [b]p2. [/b]In triangle $ABC$, $\angle BAC$ is a right angle and $\angle ACB$ measures $34$ degrees. Let $D$ be a point on segment $ BC$ for which $AC = CD$, and let the angle bisector of $\angle CBA$ intersect line $AD$ at $E$. What is the measure of $\angle BED$? [b]p3.[/b] Chad numbers five paper cards on one side with each of the numbers from $ 1$ through $5$. The cards are then turned over and placed in a box. Jordan takes the five cards out in random order and again numbers them from $ 1$ through $5$ on the other side. When Chad returns to look at the cards, he deduces with great difficulty that the probability that exactly two of the cards have the same number on both sides is $p$. What is $p$? [b]p4.[/b] Only one real value of $x$ satisfies the equation $kx^2 + (k + 5)x + 5 = 0$. What is the product of all possible values of $k$? [b]p5.[/b] On the Exeter Space Station, where there is no effective gravity, Chad has a geometric model consisting of $125$ wood cubes measuring $ 1$ centimeter on each edge arranged in a $5$ by $5$ by $5$ cube. An aspiring carpenter, he practices his trade by drawing the projection of the model from three views: front, top, and side. Then, he removes some of the original $125$ cubes and redraws the three projections of the model. He observes that his three drawings after removing some cubes are identical to the initial three. What is the maximum number of cubes that he could have removed? (Keep in mind that the cubes could be suspended without support.) [b]p6.[/b] Eric, Meena, and Cameron are studying the famous equation $E = mc^2$. To memorize this formula, they decide to play a game. Eric and Meena each randomly think of an integer between $1$ and $50$, inclusively, and substitute their numbers for $E$ and $m$ in the equation. Then, Cameron solves for the absolute value of $c$. What is the probability that Cameron’s result is a rational number? [b]p7.[/b] Let $CDE$ be a triangle with side lengths $EC = 3$, $CD = 4$, and $DE = 5$. Suppose that points $ A$ and $B$ are on the perimeter of the triangle such that line $AB$ divides the triangle into two polygons of equal area and perimeter. What are all the possible values of the length of segment $AB$? [b]p8.[/b] Chad and Jordan are raising bacteria as pets. They start out with one bacterium in a Petri dish. Every minute, each existing bacterium turns into $0, 1, 2$ or $3$ bacteria, with equal probability for each of the four outcomes. What is the probability that the colony of bacteria will eventually die out? [b]p9.[/b] Let $a = w + x$, $b = w + y$, $c = x + y$, $d = w + z$, $e = x + z$, and $f = y + z$. Given that $af = be = cd$ and $$(x - y)(x - z)(x - w) + (y - x)(y - z)(y - w) + (z - x)(z - y)(z - w) + (w - x)(w - y)(w - z) = 1,$$ what is $$2(a^2 + b^2 + c^2 + d^2 + e^2 + f^2) - ab - ac - ad - ae - bc - bd - bf - ce - cf - de - df - ef ?$$ [b]p10.[/b] If $a$ and $b$ are integers at least $2$ for which $a^b - 1$ strictly divides $b^a - 1$, what is the minimum possible value of $ab$? Note: If $x$ and $y$ are integers, we say that $x$ strictly divides $y$ if $x$ divides $y$ and $|x| \ne |y|$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Alex launches his boat into a river and heads upstream at a constant speed. At the same time at a point $8$ miles upstream from Alex, Alice launches her boat and heads downstream at a constant speed. Both boats move at $6$ miles per hour in still water, but the river is owing downstream at $2\frac{3}{10}$ miles per hour. Alex and Alice will meet at a point that is $\frac{m}{n}$ miles from Alex's starting point, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Prove that for any three distinct positive real numbers $a, b$ and $c$: $$\frac{(a^2 - b^2)^3 + (b^2 - c^2)^3 + (c^2 - a^2)^3}{(a - b)^3 + (b - c)^3 + (c - a)^3}> 8abc.$$

Since counting the numbers from 1 to 100 wasn't enough to stymie Gauss, his teacher devised another clever problem that he was sure would stump Gauss. Defining $\zeta_{15} = e^{2\pi i/15}$ where $i = \sqrt{-1}$, the teacher wrote the 15 complex numbers $\zeta_{15}^k$ for integer $0 \le k < 15$ on the board. Then, he told Gauss: On every turn, erase two random numbers $a, b$, chosen uniformly randomly, from the board and then write the term $2ab - a - b + 1$ on the board instead. Repeat this until you have one number left. What is the expected value of the last number remaining on the board?

For positive numbers is true that $$ab+ac+bc=a+b+c$$ Prove $$a+b+c+1 \geq 4abc$$

Find all functions $f: R \rightarrow R$ such that $f(x^{2015} + (f(y))^{2015}) = (f(x))^{2015} + y^{2015}$ holds for all reals $x, y$

Given positive numbers $a_1, \ldots , a_n$, $b_1, \ldots , b_n$, $c_1, \ldots , c_n$. Let $m_k$ be the maximum of the products $a_ib_jc_l$ over the sets $(i, j, l)$ for which $max(i, j, l) = k$. Prove that $$(a_1 + \ldots + a_n) (b_1 +\ldots + b_n) (c_1 +\ldots + c_n) \leq n^2 (m_1 + \ldots + m_n).$$

Do there exist distinct numbers $x,y,z$ from $[0,\dfrac{\pi}{2}]$, such that six number $\sin x$, $\sin y$,$\sin z$, $\cos x$, $\cos y$, $\cos z$ could be partitioned into 3 pairs with equal sums? [I]Proposed by A. Golovanov[/i]

[b]p1.[/b] What is the largest number of five dollar footlongs Jimmy can buy with 88 dollars? [b]p2.[/b] Austin, Derwin, and Sylvia are deciding on roles for BMT $2021$. There must be a single Tournament Director and a single Head Problem Writer, but one person cannot take on both roles. In how many ways can the roles be assigned to Austin, Derwin, and Sylvia? [b]p3.[/b] Sofia has$ 7$ unique shirts. How many ways can she place $2$ shirts into a suitcase, where the order in which Sofia places the shirts into the suitcase does not matter? [b]p4.[/b] Compute the sum of the prime factors of $2021$. [b]p5.[/b] A sphere has volume $36\pi$ cubic feet. If its radius increases by $100\%$, then its volume increases by $a\pi$ cubic feet. Compute $a$. [b]p6.[/b] The full price of a movie ticket is $\$10$, but a matinee ticket to the same movie costs only $70\%$ of the full price. If $30\%$ of the tickets sold for the movie are matinee tickets, and the total revenue from movie tickets is $\$1001$, compute the total number of tickets sold. [b]p7.[/b] Anisa rolls a fair six-sided die twice. The probability that the value Anisa rolls the second time is greater than or equal to the value Anisa rolls the first time can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$. [b]p8.[/b] Square $ABCD$ has side length $AB = 6$. Let point $E$ be the midpoint of $\overline{BC}$. Line segments $\overline{AC}$ and $\overline{DE}$ intersect at point $F$. Compute the area of quadrilateral ABEF. [b]p9.[/b] Justine has a large bag of candy. She splits the candy equally between herself and her $4$ friends, but she needs to discard three candies before dividing so that everyone gets an equal number of candies. Justine then splits her share of the candy between herself and her two siblings, but she needs to discard one candy before dividing so that she and her siblings get an equal number of candies. If Justine had instead split all of the candy that was originally in the large bag between herself and $14$ of her classmates, what is the fewest number of candies that she would need to discard before dividing so that Justine and her $14$ classmates get an equal number of candies? [b]p10.[/b] For some positive integers $a$ and $b$, $a^2 - b^2 = 400$. If $a$ is even, compute $a$. [b]p11.[/b] Let $ABCDEFGHIJKL$ be the equilateral dodecagon shown below, and each angle is either $90^o$ or $270^o$. Let $M$ be the midpoint of $\overline{CD}$, and suppose $\overline{HM}$ splits the dodecagon into two regions. The ratio of the area of the larger region to the area of the smaller region can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$. [img]https://cdn.artofproblemsolving.com/attachments/3/e/387bcdf2a6c39fcada4f21f24ceebd18a7f887.png[/img] [b]p12.[/b] Nelson, who never studies for tests, takes several tests in his math class. Each test has a passing score of $60/100$. Since Nelson's test average is at least $60/100$, he manages to pass the class. If only nonnegative integer scores are attainable on each test, and Nelson gets a dierent score on every test, compute the largest possible ratio of tests failed to tests passed. Assume that for each test, Nelson either passes it or fails it, and the maximum possible score for each test is 100. [b]p13.[/b] For each positive integer $n$, let $f(n) = \frac{n}{n+1} + \frac{n+1}{n}$ . Then $f(1)+f(2)+f(3)+...+f(10)$ can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Compute $m + n$. [b]p14.[/b] Triangle $\vartriangle ABC$ has point $D$ lying on line segment $\overline{BC}$ between $B$ and $C$ such that triangle $\vartriangle ABD$ is equilateral. If the area of triangle $\vartriangle ADC$ is $\frac14$ the area of triangle $\vartriangle ABC$, then $\left( \frac{AC}{AB}\right)^2$ can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$. [b]p15.[/b] In hexagon $ABCDEF$, $AB = 60$, $AF = 40$, $EF = 20$, $DE = 20$, and each pair of adjacent edges are perpendicular to each other, as shown in the below diagram. The probability that a random point inside hexagon $ABCDEF$ is at least $20\sqrt2$ units away from point $D$ can be expressed in the form $\frac{a-b\pi}{c}$ , where $a$, $b$, $c$ are positive integers such that gcd$(a, b, c) = 1$. Compute $a + b + c$. [img]https://cdn.artofproblemsolving.com/attachments/3/c/1b45470265d10a73de7b83eff1d3e3087d6456.png[/img] [b]p16.[/b] The equation $\sqrt{x} +\sqrt{20-x} =\sqrt{20 + 20x - x^2}$ has $4$ distinct real solutions, $x_1$, $x_2$, $x_3$, and $x_4$. Compute $x_1 + x_2 + x_3 + x_4$. [b]p17.[/b] How many distinct words with letters chosen from $B, M, T$ have exactly $12$ distinct permutations, given that the words can be of any length, and not all the letters need to be used? For example, the word $BMMT$ has $12$ permutations. Two words are still distinct even if one is a permutation of the other. For example, $BMMT$ is distinct from $TMMB$. [b]p18.[/b] We call a positive integer binary-okay if at least half of the digits in its binary (base $2$) representation are $1$'s, but no two $1$s are consecutive. For example, $10_{10} = 1010_2$ and $5_{10} = 101_2$ are both binary-okay, but $16_{10} = 10000_2$ and $11_{10} = 1011_2$ are not. Compute the number of binary-okay positive integers less than or equal to $2020$ (in base $10$). [b]p19.[/b] A regular octahedron (a polyhedron with $8$ equilateral triangles) has side length $2$. An ant starts on the center of one face, and walks on the surface of the octahedron to the center of the opposite face in as short a path as possible. The square of the distance the ant travels can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$. [img]https://cdn.artofproblemsolving.com/attachments/f/8/3aa6abe02e813095e6991f63fbcf22f2e0431a.png[/img] [b]p20.[/b] The sum of $\frac{1}{a}$ over all positive factors $a$ of the number $360$ can be expressed in the form $\frac{m}{n}$ ,where $m$ and $n$ are relatively prime positive integers. Compute $m + n$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A real number $a$ is chosen randomly and uniformly from the interval $[-20, 18]$. The probability that the roots of the polynomial \[x^4 + 2ax^3 + (2a-2)x^2 + (-4a+3)x - 2\] are all real can be written in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

[b]p1.[/b] Find the greatest integer $n$ such that $n \log_{10} 4$ does not exceed $\log_{10} 1998$. [b]p2.[/b] Rectangle $ABCD$ has sides $AB = CD = 12/5$, $BC = DA = 5$. Point $P$ is on $AD$ with $\angle BPC = 90^o$. Compute $BP + PC$. [b]p3.[/b] Compute the number of sequences of four decimal digits $(a, b, c, d)$ (each between $0$ and $9$ inclusive) containing no adjacent repeated digits. (That is, each digit is distinct from the digits directly before and directly after it.) [b]p4.[/b] Solve for $t$, $-\pi/4 \le t \le \pi/4 $: $$\sin^3 t + \sin^2 t \cos t + \sin t \cos^2 t + \cos^3 t =\frac{\sqrt6}{2}$$ [b]p5.[/b] Find all integers $n$ such that $n - 3$ divides $n^2 + 2$. [b]p6.[/b] Find the maximum number of bishops that can occupy an $8 \times 8$ chessboard so that no two of the bishops attack each other. (Bishops can attack an arbitrary number of squares in any diagonal direction.) [b]p7.[/b] Points $A, B, C$, and $D$ are on a Cartesian coordinate system with $A = (0, 1)$, $B = (1, 1)$, $C = (1,-1)$, and $D = (-1, 0)$. Compute the minimum possible value of $PA + PB + PC + PD$ over all points $P$. [b]p8.[/b] Find the number of distinct real values of $x$ which satisfy $$(x-1)(x-2)(x-3)(x-4)(x-5)(x-6)(x-7)(x-8)(x-9)(x-10)+(1^2 \cdot 3^2\cdot 5^2\cdot 7^2\cdot 9^2)/2^{10} = 0.$$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].