Find all real solutions to the equation $(x^2-9x+19)^{x^2-3x+2} = 1$.

Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$. Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.

Find all pairs of positive integers $(m,n)$ such that \[m+n-\frac{3mn}{m+n}=\frac{2011}{3}.\]

Let $p$, $q$, and $r$ be the three roots of the polynomial $x^3 -2x^2 + 3x - 2023$. Suppose that the polynomial $x^3 + Bx^2 +Mx + T$ has roots $p + q$, $p + r$, and $q + r$ for real numbers $B$, $M$, and $T$. Compute $B -M + T$.

Square trinomials $P(x) = x^2 + ax + b$ and $Q(x) = x^2 + cx + d$ are such that the equation $P(Q(x)) = Q(P(x))$ has no real roots. Prove that $b \ne d$.

Given $\cos (\alpha + \beta) + sin (\alpha - \beta) = 0$, $\tan \beta =\frac{1}{2000}$, find $\tan \alpha$.

The reals $a, b$ satisfy $$\begin{cases} a^3 - 3a^2 + 5a - 17 = 0 \\ b^3 - 3b^2 + 5b + 11 = 0 .\end{cases}$$ Find $a+b$.

With expressions containing the symbol $*$, the following transformations can be performed: 1) rewrite the expression in the form $x * (y * z) as ((1 * x) * y) * z$; 2) rewrite the expression in the form $x * 1$ as $x$. Conversions can only be performed with an integer expression, but not with its parts. For example, $(1 *1) * (1 *1)$ can be rewritten according to the first rule as $((1 * (1 * 1)) * 1) * 1$ (taking $x = 1 * 1$, $y = 1$ and $z = 1$), but not as $1 * (1 * 1)$ or $(1* 1) * 1$ (in the last two cases, the second rule would be applied separately to the left or right side $1 * 1$). Find all positive integers $n$ for which the expression $\underbrace{1 * (1 * (1 * (...* (1 * 1)...))}_{n units}$ it is possible to lead to a form in which there is not a single asterisk. Note. The expressions $(x * y) * $z and $x * (y * z)$ are considered different, also, in the general case, the expressions $x * y$ and $y * x$ are different.

Find the largest prime factor of $45^5-1.$

Let f be a function that satisfies the following conditions: $(i)$ If $x > y$ and $f(y) - y \geq v \geq f(x) - x$, then $f(z) = v + z$, for some number $z$ between $x$ and $y$. $(ii)$ The equation $f(x) = 0$ has at least one solution, and among the solutions of this equation, there is one that is not smaller than all the other solutions; $(iii)$ $f(0) = 1$. $(iv)$ $f(1987) \leq 1988$. $(v)$ $f(x)f(y) = f(xf(y) + yf(x) - xy)$. Find $f(1987)$. [i]Proposed by Australia.[/i]

Let $n > 1$ and $x_i \in \mathbb{R}$ for $i = 1,\cdots, n$. Set \[S_k = x_1^k+ x^k_2+\cdots+ x^k_n\] for $k \ge 1$. If $S_1 = S_2 =\cdots= S_{n+1}$, show that $x_i \in \{0, 1\}$ for every $i = 1, 2,\cdots, n.$

Show that for any real numbers $a$ and $b$ different from $0$, the inequality $$\bigg \lvert \frac{a}{b} + \frac{b}{a}+ab \bigg \lvert \geq \lvert a+b+1 \rvert$$ holds. When is equality achieved?

There are $100$ numbers from $(0,1)$ on the board. On every move we replace two numbers $a,b$ with roots of $x^2-ax+b=0$(if it has two roots). Prove that process is not endless.

Determine the smallest integer $n$ for which there exist integers $x_1,\ldots,x_n$ and positive integers $a_1,\ldots,a_n$ so that \begin{align*} x_1+\cdots+x_n &=0,\\ a_1x_1+\cdots+a_nx_n&>0, \text{ and }\\ a_1^2x_1+\cdots+a_n^2x_n &<0. \end{align*}

Let $ p\ge 2 $ be a fixed natural number, and let the sequence of functions $ \left( f_n\right)_{n\ge 2}:[0,1]\longrightarrow\mathbb{R} $ defined as $ f_n (x)=f_{n-1}\left( f_1 (x)\right) , $ where $ f_1 (x)=\sqrt[p]{1-x^p} . $ Find $ a\in (0,1) $ such that: [b]a)[/b] exists $ b\ge a $ so that $ f_1:[a,b]\longrightarrow [a,b] $ is bijective. [b]b)[/b] $ \forall x\in [0,1]\quad\exists y\in [0,1]\quad m\in\mathbb{N}\implies \left| f_m(x)-f_m(y)\right| >a|x-y| $

Prove that if $a,b,c \ge 1$ and $a+b+c=9$, then $\sqrt{ab+bc+ca} \le \sqrt{a} +\sqrt{b} + \sqrt{c}$

Find the maximum value of $M =\frac{x}{2x + y} +\frac{y}{2y + z}+\frac{z}{2z + x}$ , $x,y, z > 0$

How many solutions does \[ x^2 - [x^2] = \left(x - [x]\right)^2 \] have satisfying $1 \leq x \leq n$?

Simplify the fraction: $\frac{(1^4+4)\cdot (5^4+4)\cdot (9^4+4)\cdot ... (69^4+4)\cdot(73^4+4)}{(3^4+4)\cdot (7^4+4)\cdot (11^4+4)\cdot ... (71^4+4)\cdot(75^4+4)}$.

Let $f(n)$ be the sum of the first $n$ terms of the sequence \[ 0, 1,1, 2,2, 3,3, 4,4, 5,5, 6,6, \ldots\, . \] a) Give a formula for $f(n)$. b) Prove that $f(s+t)-f(s-t)=st$ where $s$ and $t$ are positive integers and $s>t$.

Given the set of numbers $ \{1, 2, 3, \ldots, 100\} $. From this set, create 10 pairwise disjoint subsets $ N_i = \{a_{i,1}, a_{i,2}, ... a_{i,10} $ ($ i = 1, 2, \ldots, 10 $ ) so that the sum of the products $$ \sum_{i=10}^{10}\prod_{j=1}^{10} a_{i,j} $$ was the biggest.

We consider the two sequences $(a_n)_{n\ge 0}$ and $(b_n) _{n\ge 0}$ of integers, which are given by $a_0 = b_0 = 2$ and $a_1= b_1 = 14$ and for $n\ge 2$ they are defined as $a_n = 14a_{n-1} + a_{n-2}$ , $b_n = 6b_{n-1}-b_{n-2}$. Determine whether there are infinite numbers that occur in both sequences

[b]7.1[/b] Construct a trapezoid given four sides. [b]7.2[/b] Prove that $$(1 + x + x^2 + ...+ x^{100})(1 + x^{102}) - 102x^{101} \ge 0 .$$ [b]7.3 [/b] In a quadrilateral $ABCD$, $M$ is the midpoint of AB, $N$ is the midpoint of $CD$. Lines $AD$ and BC intersect $MN$ at points $P$ and $Q$, respectively. Prove that if $\angle BQM = \angle APM$ , then $BC=AD$. [img]https://cdn.artofproblemsolving.com/attachments/a/2/1c3cbc62ee570a823b5f3f8d046da9fbb4b0f2.png[/img] [b]7.4 / 6.4[/b] Each of the eight given different natural numbers less than $16$. Prove that among their pairwise differences there is at least at least three are the same. [b]7.5 / 8.4[/b] An entire arc of circle is drawn through the vertices $A$ and $C$ of the rectangle $ABCD$ lying inside the rectangle. Draw a line parallel to $AB$ intersecting $BC$ at point $P$, $AD$ at point $Q$, and the arc $AC$ at point $R$ so that the sum of the areas of the figures $AQR$ and $CPR$ is the smallest. [img]https://cdn.artofproblemsolving.com/attachments/1/4/9b5a594f82a96d7eff750e15ca6801a5fc0bf1.png[/img] [b]7.6 / 6.5 [/b]The distance AB is 100 km. From A and B , cyclists simultaneously ride towards each other at speeds of 20 km/h and 30 km/hour accordingly. Together with the first A, a fly flies out with speed 50 km/h, she flies until she meets the cyclist from B, after which she turns around and flies back until she meets the cyclist from A, after which turns around, etc. How many kilometers will the fly fly in the direction from A to B until the cyclists meet? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988083_1967_leningrad_math_olympiad]here[/url].

Find the positive integer $n$ such that $$1 + 2 + 3 +...+ n = (n + 1) + (n + 2) +...+ (n + 35).$$

Let $a_1, a_2, a_3, \ldots$ be a sequence of positive integers satisfying the following property: for all positive integers $k < \ell$, for all distinct integers $m_1, m_2, \ldots, m_k$ and for all distinct integers $n_1, n_2, \ldots, n_\ell$, \[ a_{m_1} + a_{m_2} + \cdots + a_{m_k} \leqslant a_{n_1} + a_{n_2} + \cdots + a_{n_\ell}. \] Prove that there exist two integers $N$ and $b$ such that $a_n = b$ for all $n \geqslant N$.