p1. It is known that $f$ is a function such that $f(x)+2f\left(\frac{1}{x}\right)=3x$ for every $x\ne 0$. Find the value of $x$ that satisfies $f(x) = f(-x)$. p2. It is known that ABC is an acute triangle whose vertices lie at circle centered at point $O$. Point $P$ lies on side $BC$ so that $AP$ is the altitude of triangle ABC. If $\angle ABC + 30^o \le \angle ACB$, prove that $\angle COP + \angle CAB < 90^o$. p3. Find all natural numbers $a, b$, and $c$ that are greater than $1$ and different, and fulfills the property that $abc$ divides evenly $bc + ac + ab + 2$. p4. Let $A, B$, and $ P$ be the nails planted on the board $ABP$ . The length of $AP = a$ units and $BP = b$ units. The board $ABP$ is placed on the paths $x_1x_2$ and $y_1y_2$ so that $A$ only moves freely along path $x_1x_2$ and only moves freely along the path $y_1y_2$ as in following image. Let $x$ be the distance from point $P$ to the path $y_1y_2$ and y is with respect to the path $x_1x_2$ . Show that the equation for the path of the point $P$ is $\frac{x^2}{b^2}+\frac{y^2}{a^2}=1$. [img]https://cdn.artofproblemsolving.com/attachments/4/6/d88c337370e8c3bc5a1833bc9588d3fb047bd0.png[/img] p5. There are three boxes $A, B$, and $C$ each containing $3$ colored white balls and $2$ red balls. Next, take three ball with the following rules: 1. Step 1 Take one ball from box $A$. 2. Step 2 $\bullet$ If the ball drawn from box $A$ in step 1 is white, then the ball is put into box $B$. Next from box $B$ one ball is drawn, if it is a white ball, then the ball is put into box $C$, whereas if the one drawn is red ball, then the ball is put in box $A$. $\bullet$ If the ball drawn from box $A$ in step 1 is red, then the ball is put into box $C$. Next from box $C$ one ball is taken. If what is drawn is a white ball then the ball is put into box $A$, whereas if the ball drawn is red, the ball is placed in box $B$. 3. Step 3 Take one ball each from squares $A, B$, and $C$. What is the probability that all the balls drawn in step 3 are colored red?

Let $k\ge 2$, $n\ge 1$, $a_1, a_2,\dots, a_k$ and $b_1, b_2, \dots, b_n$ be integers such that $1<a_1<a_2<\dots <a_k<b_1<b_2<\dots <b_n$. Prove that if $a_1+a_2+\dots +a_k>b_1+b_2+\dots + b_n$, then $a_1\cdot a_2\cdot \ldots \cdot a_k>b_1\cdot b_2 \cdot \ldots \cdot b_n$.

Let $x$, $y$, and $z$ be real numbers (not necessarily positive) such that $x^4+y^4+z^4+xyz=4$. Show that $x\le2$ and $\sqrt{2-x}\ge\frac{y+z}{2}$. [i]Proposed by Alyazeed Basyoni[/i]

Find all solutions $x_1, x_2, x_3, x_4, x_5$ of the system \[ x_5+x_2=yx_1 \] \[ x_1+x_3=yx_2 \] \[ x_2+x_4=yx_3 \] \[ x_3+x_5=yx_4 \] \[ x_4+x_1=yx_5 \] where $y$ is a parameter.

A sequence $a_1, a_2, \ldots$ satisfies $a_1 = \dfrac 52$ and $a_{n + 1} = {a_n}^2 - 2$ for all $n \ge 1.$ Let $M$ be the integer which is closest to $a_{2023}.$ The last digit of $M$ equals $$ \mathrm a. ~ 0\qquad \mathrm b.~2\qquad \mathrm c. ~4 \qquad \mathrm d. ~6 \qquad \mathrm e. ~8 $$

When $ x^9\minus{}x$ is factored as completely as possible into polynomials and monomials with integral coefficients, the number of factors is: $ \textbf{(A)}\ \text{more than 5} \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 2$

Show that for any non-negative real numbers $a,b,c,d$ such that $a^2+b^2+c^2+d^2=1$ the following inequality hold: $$a+b+c+d-1\geq 16abcd$$ When does equality hold?

Denote by $ \mathcal{H}$ a set of sequences $ S\equal{}\{s_n\}_{n\equal{}1}^{\infty}$ of real numbers having the following properties: (i) If $ S\equal{}\{s_n\}_{n\equal{}1}^{\infty}\in \mathcal{H}$, then $ S'\equal{}\{s_n\}_{n\equal{}2}^{\infty}\in \mathcal{H}$; (ii) If $ S\equal{}\{s_n\}_{n\equal{}1}^{\infty}\in \mathcal{H}$ and $ T\equal{}\{t_n\}_{n\equal{}1}^{\infty}$, then $ S\plus{}T\equal{}\{s_n\plus{}t_n\}_{n\equal{}1}^{\infty}\in \mathcal{H}$ and $ ST\equal{}\{s_nt_n\}_{n\equal{}1}^{\infty}\in \mathcal{H}$; (iii) $ \{\minus{}1,\minus{}1,\dots,\minus{}1,\dots\}\in \mathcal{H}$. A real valued function $ f(S)$ defined on $ \mathcal{H}$ is called a quasi-limit of $ S$ if it has the following properties: If $ S\equal{}{c,c,\dots,c,\dots}$, then $ f(S)\equal{}c$; If $ s_i\geq 0$, then $ f(S)\geq 0$; $ f(S\plus{}T)\equal{}f(S)\plus{}f(T)$; $ f(ST)\equal{}f(S)f(T)$, $ f(S')\equal{}f(S)$ Prove that for every $ S$, the quasi-limit $ f(S)$ is an accumulation point of $ S$.

Let $f(x) = \frac{1}{1-\frac{3x}{16}}$. Consider the sequence $\{ 0, f(0), f(f(0)), f^3(0), \dots \}$ Find the smallest $L$ such that $f^n(0) \leq L$ for all $n$. If the sequence is unbounded, write none as your answer.

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

The side lengths of a triangle are the roots of a cubic polynomial with rational coefficients. Prove that the altitudes of this triangle are roots of a polynomial of sixth degree with rational coefficients.

Let $ n\ge 3$ be a natural number. Find all nonconstant polynomials with real coeficcietns $ f_{1}\left(x\right),f_{2}\left(x\right),\ldots,f_{n}\left(x\right)$, for which \[ f_{k}\left(x\right)f_{k+ 1}\left(x\right) = f_{k +1}\left(f_{k + 2}\left(x\right)\right), \quad 1\le k\le n,\] for every real $ x$ (with $ f_{n +1}\left(x\right)\equiv f_{1}\left(x\right)$ and $ f_{n + 2}\left(x\right)\equiv f_{2}\left(x\right)$).

Let $a$ and $b$ be natural numbers. We consider the set $M$ of the points of the plane with an integer $x$-coordinate from $1$ to $a$ and integer $y$-coordinate from $1$ to $b$. For two points $P = (x, y)$ and $Q = (\tilde x, \tilde y)$ in M we write $P\le Q$ if $x\le \tilde x$ and $y \le \tilde y$, we say $P$ is [i]less [/i] than $Q$ when $P\le Q$ and $P \ne Q$. A subset $S$ of $M$ is now called [i]cute [/i] if for every point $P \in S$ it also contains all smaller points. From an arbitrary subset $S$ of $M$ we can now create new subsets in four ways to construct: (a) the complement $K (S) = \overline{S}$, (b) the subset $\min (S)$ of its minima, i.e. those points for which there is no smaller in $S$ occurs, (c) the cute set $P (S)$ of all those points in M that are less than or equal to some point are from $S$, (d) you do all these things one after the other and get a set $Z (S) = P (\min (K (S)))$. Let $S$ be cute. Prove that $$\underset{a+b\,\, times\,\, Z}{Z(Z(...(Z(S))...))=S}$$

Let $f(x) = x^n$ where $n$ is a fixed positive integer and $x =1, 2, \cdots .$ Is the decimal expansion $a = 0.f (1)f(2)f(3) . . .$ rational for any value of $n$ ? The decimal expansion of a is defined as follows: If $f(x) = d_1(x)d_2(x) \cdots d_{r(x)}(x)$ is the decimal expansion of $f(x)$, then $a = 0.1d_1(2)d_2(2) \cdots d_{r(2)}(2)d_1(3) . . . d_{r(3)}(3)d_1(4) \cdots .$

Let $a<b<c<d$ be positive integers which satisfy $ad=bc.$ Prove that $2a+\sqrt{a}+\sqrt{d}<b+c+1.$ [i]Marius Mînea[/i]

Prove that there exists a polynomial with integer coefficients satisfying the following conditions: (a)$f(x)=0$ has no rational root. (b) For any positive integer $n$, there always exists an integer $m$ such that $n\mid f(m)$.

Given a subset of $\{1,2,...,n\}$, we define its [i]alternating sum [/i] in the following way: we order the elements of the subset in descending order and, starting with the largest, we alternately add and subtract the successive numbers. For example, the [i]alternating sum[/i] of the set $\{1,3,4,6,8\}$ is $8-6+4-3+1 = 4$. Determines the sum of the alternating sums of all subsets of $\{1,2,...,10\}$ with an odd number of elements.

Chandler the Octopus along with his friends Maisy the Bear and Jeff the Frog are solving LMT problems. It takes Maisy $3$ minutes to solve a problem, Chandler $4$ minutes to solve a problem and Jeff $5$ minutes to solve a problem. They start at $12:00$ pm, and Chandler has a dentist appointment from $12:10$ pm to $12:30$, after which he comes back and continues solving LMT problems. The time it will take for them to finish solving $50$ LMT problems, in hours, is $m/n$ ,where $m$ and $n$ are relatively prime positive integers. Find $m +n$. [b]Note:[/b] they may collaborate on problems. [i]Proposed by Aditya Rao[/i]

Show that there exists no function $f:\mathbb {R}\rightarrow \mathbb {R}$ that satisfies $f(f(x))-x^2+x+3=0$ for arbitrary real variable $x$. (Same as KMO 2004 P1)

Given $I_0 = \{-1,1\}$, define $I_n$ recurrently as the set of solutions $x$ of the equations $x^2 -2xy+y^2- 4^n = 0$, where $y$ ranges over all elements of $I_{n-1}$. Determine the union of the sets $I_n$ over all nonnegative integers $n$.

Let $a,b,c$ be real numbers such that $$a^2-bc=b^2-ca=c^2-ab=2$$. Find the value of $$ab+bc+ca$$ and find at least one triplet $(a,b,c)$ that satisfy those conditions.

[b]9.[/b] Find all pairs of linear polynomials $f(x)$, $g(x)$ with integer coefficients for which there exist two polynomials $u(x)$, $v(x)$ with integer coefficients such that $f(x)u(x)+g(x)v(x)=1$. [b](A. 8)[/b]

[b]p1.[/b] Find the number of ordered triples $(a, b, c)$ satisfying $\bullet$ $a, b, c$ are are single-digit positive integers, and $\bullet$ $a \cdot b + c = a + b \cdot c$. [b]p2.[/b] In their class Introduction to Ladders at Greendale Community College, Jan takes four tests. They realize that their test scores in chronological order form an increasing arithmetic progression with integer terms, and that the average of those scores is an integer greater than or equal to $94$. How many possible combinations of test scores could they have had? (Test scores at Greendale range between $0$ and $100$, inclusive.) [b]p3.[/b] Suppose that $a + \frac{1}{b} = 2$ and $b +\frac{1}{a} = 3$. If$ \frac{a}{b} + \frac{b}{a}$ can be expressed as $\frac{p}{q}$ in simplest terms, find $p + q$. [b]p4.[/b] Suppose that $A$ and $B$ are digits between $1$ and $9$ such that $$0.\overline{ABABAB...}+ B \cdot (0.\overline{AAA...}) = A \cdot (0.\overline{B_1B_1B_1...}) + 1$$ Find the sum of all possible values of $10A + B$. [b]p5.[/b] Let $ABC$ be an isosceles right triangle with $m\angle ABC = 90^o$. Let $D$ and $E$ lie on segments $AC$ and $BC$, respectively, such that triangles $\vartriangle ADB$ and $\vartriangle CDE$ are similar and $DE = EB$. If $\frac{AC}{AD} = 1 +\frac{\sqrt{a}}{b}$ with $a, b$ positive integers and a squarefree, then find $a + b$. [b]p6.[/b] Five bowling pins $P_1$, $P_2$,..., $P_5$ are lined up in a row. Each turn, Jemma picks a pin at random from the standing pins, and throws a bowling ball at that pin; that pin and each pin directly adjacent to it are knocked down. If the expected value of the number of turns Jemma will take to knock down all the pins is a b where a and b are relatively prime, find $a + b$. (Pins $P_i$ and $P_j$ are adjacent if and only if $|i -j| = 1$.) [b]p7.[/b] Let triangle $ABC$ have side lengths $AB = 10$, $BC = 24$, and $AC = 26$. Let $I$ be the incenter of $ABC$. If the maximum possible distance between $I$ and a point on the circumcircle of $ABC$ can be expressed as $a +\sqrt{b}$ for integers $a$ and $b$ with $b$ squarefree, find $a + b$. (The incenter of any triangle $XY Z$ is the intersection of the angle bisectors of $\angle Y XZ$, $\angle XZY$, and $\angle ZY X$.) [b]p8.[/b] How many terms in the expansion of $$(1 + x + x^2 + x^3 +... + x^{2021})(1 + x^2 + x^4 + x^6 + ... + x^{4042})$$ have coefficients equal to $1011$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Α half-mile long train is traveling at a speed of $90$ miles per hour. As it enters a $1$ mile long tunnel, Steve starts running from the back of the train to the front of the train at a speed of $10$ miles per hour. When Steve is out of the tunnel, he stops running. How far along the train has Steve run in miles?

Let $\mathbb{Z} _{>0}$ be the set of positive integers. Find all functions $f: \mathbb{Z} _{>0}\rightarrow \mathbb{Z} _{>0}$ such that \[ m^2 + f(n) \mid mf(m) +n \] for all positive integers $m$ and $n$.