One afternoon a bakery finds that it has $300$ cups of flour and $300$ cups of sugar on hand. Annie and Sam decide to use this to make and sell some batches of cookies and some cakes. Each batch of cookies will require $1$ cup of flour and $3$ cups of sugar. Each cake will require $2$ cups of flour and $1$ cup of sugar. Annie thinks that each batch of cookies should sell for $2$ dollars and each cake for $1$ dollar, but Sam thinks that each batch of cookies should sell for $1$ dollar and each cake should sell for $3$ dollars. Find the difference between the maximum dollars of income they can receive if they use Sam's selling plan and the maximum dollars of income they can receive if they use Annie's selling plan.

Let $P$ be a $10$-degree monic polynomial with roots $r_1, r_2, . . . , r_{10} \ne $ and let $Q$ be a $45$-degree monic polynomial with roots $\frac{1}{r_i}+\frac{1}{r_j}-\frac{1}{r_ir_j}$ where $i < j$ and $i, j \in \{1, ... , 10\}$. If $P(0) = Q(1) = 2$, then $\log_2 (|P(1)|)$ can be written as $a/b$ for relatively prime integers $a, b$. Find $a + b$.

[b]8.1[/b] In the parallelogram $ABCD$ , the diagonal $AC$ is greater than the diagonal $BD$. The point $M$ on the diagonal $AC$ is such that around the quadrilateral $BCDM$ one can circumscribe a circle. Prove that $BD$ is the common tangent of the circles circumscribed around the triangles $ABM$ and $ADM$. [img]https://cdn.artofproblemsolving.com/attachments/b/3/9f77ff1f2198c201e5c270ec5b091a9da4d0bc.png[/img] [b]8.2 [/b] $A$ is an odd integer, $x$ and $y$ are roots of equation $t^2+At-1=0$. Prove that $x^4 + y^4$ and $x^5+ y^5$ are coprime integer numbers. [b]8.3[/b] A regular triangle is reflected symmetrically relative to one of its sides. The new triangle is again reflected symmetrically about one of its sides. This is repeated several times. It turned out that the resulting triangle coincides with the original one. Prove that an even number of reflections were made. [b]8.4 /7.6[/b] Several circles are arbitrarily placed in a circle of radius $3$, the sum of their radii is $25$. Prove that there is a straight line that intersects at least $9$ of these circles. [b]8.5 [/b] All two-digit numbers that do not end in zero are written one after another so that each subsequent number begins with that the same digit with which the previous number ends. Prove that you can do this and find the sum of the largest and smallest of all multi-digit numbers that can be obtained in this way. [url=https://artofproblemsolving.com/community/c6h3390996p32049528]8,6*[/url] (asterisk problems in separate posts) PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988084_1968_leningrad_math_olympiad]here[/url].

Let be four functions $ f,g,s,i:\mathbb{N}\longrightarrow\mathbb{N} $ such that $ s(x)=\max (f(x),g(x)) $ and $ i(x)=\min (f(x),g(x)) , $ for any natural number $ x. $ Prove that $ f=g $ if $ s $ is surjective and $ i $ injective.

Justify if continuity can be affirmed, denied or cannot be decided in the point$ x = 0$ of a real function $f(x)$ of real variable, in each of the three (independent) cases . a) It is known only that for all natural $n$: $f\left( \frac{1}{2n}\right)= 1$ and $f\left( \frac{1}{2n+1}\right)= -1$. b) It is known that for all nonnegative real $x$ is $f(x) = x^2$ and for negative real $x$ is $f(x) = 0$. c) It is only known that for all natural $n$ it is $f\left( \frac{1}{n}\right)= 1$.

$\sqrt[3]{x+\sqrt[3]{x+\sqrt[3]{x+ \sqrt[3]{x ...}}}}= 8$. Find $x$.

Let $a_0=0<a_1<a_2<...<a_n$ be real numbers . Supppose $p(t)$ is a real valued polynomial of degree $n$ such that $\int_{a_j}^{a_{j+1}} p(t)\,dt = 0\ \ \forall \ 0\le j\le n-1$ Show that , for $0\le j\le n-1$ , the polynomial $p(t)$ has exactly one root in the interval $ (a_j,a_{j+1})$

Let $\alpha$ be an arbitrary angle and let $x = cos\alpha, y = cosn\alpha$ ($n \in Z$). i) Prove that to each value $x \in [-1, 1]$ corresponds one and only one value of $y$. Thus we can write $y$ as a function of $x, y = T_n(x)$. Compute $T_1(x), T_2(x)$ and prove that $T_{n+1}(x) = 2xT_n(x) - T_{n-1}(x)$. From this it follows that $T_n(x)$ is a polynomial of degree $n$. ii) Prove that the polynomial $T_n(x$) has $n$ distinct roots in $[-1, 1]$.

Let \[f(x)=\frac{(x-18)(x-72)(x-98)(x-k)}{x}.\] There exist exactly three positive real values of $k$ such that $f$ has a minimum at exactly two real values of $x$. Find the sum of these three values of $k$.

Let $a + bi$ and $c + di$ be two roots of the equation $x^n = 1990$, where $n \geq 3$ is an integer and $a,b,c,d \in \mathbb R$. Under the linear transformation $f =\left(\begin{array}{cc}a&c\\b &d\end{array}\right)$, we have $(2, 1) \to (1, 2)$. Denote $r$ to be the distance from the image of $(2, 2)$ to the origin. Find the range of $r.$

For every integer $n > 1$, the sequence $\left( {{S}_{n}} \right)$ is defined by ${{S}_{n}}=\left\lfloor {{2}^{n}}\underbrace{\sqrt{2+\sqrt{2+...+\sqrt{2}}}}_{n\ radicals} \right\rfloor $ where $\left\lfloor x \right\rfloor$ denotes the floor function of $x$. Prove that ${{S}_{2001}}=2\,{{S}_{2000}}+1$. .

Determine all polynomials $P (x)$ with real coefficients that apply $P (x^2) + 2P (x) = P (x)^2 + 2$.

Let $f: \mathbb{Z}_{>0} \rightarrow \mathbb{Z}$ be a function with the following properties: (i) $f(1) = 0$ (ii) $f(p) = 1$ for all prime numbers $p$ (iii) $f(xy) = y \cdot f(x) + x \cdot f(y)$ for all $x,y$ in $\mathbb{Z}_{>0}$ Determine the smallest integer $n \ge 2015$ that satisfies $f(n) = n$. (Gerhard J. Woeginger)

Let $P(x) = x^4 + a_1x^3 + a_2x^2 + a_3x + a_4$ be a polynomial with rational coefficients. Show that if $P(x)$ has exactly one real root $\xi$, then $\xi$ is a rational number.

Let $N = 2^{\left(2^2\right)}$ and $x$ be a real number such that $N^{\left(N^N\right)} = 2^{(2^x)}$. Find $x$.

Let $a_1, a_2, a_3$ be three distinct real numbers. Define $$\begin{cases} b_1=\left(1+\dfrac{a_1a_2}{a_1-a_2}\right)\left(1+\dfrac{a_1a_3}{a_1-a_3}\right) \\ \\ b_2=\left(1+\dfrac{a_2a_3}{a_2-a_3}\right)\left(1+\dfrac{a_2a_1}{a_2-a_1}\right) \\ \\ b_3=\left(1+\dfrac{a_3a_1}{a_3-a_1}\right)\left(1+\dfrac{a_3a_2}{a_3-a_2}\right) \end {cases}$$ Prove that $$1 + |a_1b_1+a_2b_2+a_3b_3| \le (1+|a_1|) (1+|a_2|)(1+|a_3|)$$ When does equality hold?

Find the largest positive integer $k$ such that $\phi ( \sigma ( 2^k)) = 2^k$. ($\phi(n)$ denotes the number of positive integers that are smaller than $n$ and relatively prime to $n$, and $\sigma(n)$ denotes the sum of divisors of $n$). As a hint, you are given that $641|2^{32}+1$.

Find all functions $f : \mathbb{R} \to \mathbb{Z}$ which satisfy the conditions: $f(x+y) < f(x) + f(y)$ $f(f(x)) = \lfloor {x} \rfloor + 2$

The $n$-th digit of number $a = 0.12457...$ equals the first digit of the integer part of the number $n\sqrt2$. Prove that $a$ is irrational number. (6)

Let $f:\mathbb{R}^+\to\mathbb{R}^+$ be such that $$f(x+f(y))^2\geq f(x)\left(f(x+f(y))+f(y)\right)$$ for all $x,y\in\mathbb{R}^+$. Show that $f$ is [i]unbounded[/i], i.e. for each $M\in\mathbb{R}^+$, there exists $x\in\mathbb{R}^+$ such that $f(x)>M$.

Let $r, s, t, u$ be the distinct roots of the polynomial $x^4 + 2x^3 + 3x^2 + 3x + 5$. For $n \ge 1$, define $s_n = r^n + s^n + t^n + u^n$ and $t_n = s_1 + s_2 + ...+ s_n$. Compute $t_4 + 2t_3 + 3t_2 + 3t_1 + 5$.

Let $a_0$ be an irrational number such that $0 < a_0 < \frac 12$ . Define $a_n = \min \{2a_{n-1},1 - 2a_{n-1}\}$ for $n \geq 1$. [list][b](a)[/b] Prove that $a_n < \frac{3}{16}$ for some $n$. [b](b)[/b] Can it happen that $a_n > \frac{7}{40}$ for all $n$?[/list]

[b]p1.[/b] A right triangle has hypotenuse of length $12$ cm. The height corresponding to the right angle has length $7$ cm. Is this possible? [img]https://cdn.artofproblemsolving.com/attachments/0/e/3a0c82dc59097b814a68e1063a8570358222a6.png[/img] [b]p2.[/b] Prove that from any $5$ integers one can choose $3$ such that their sum is divisible by $3$. [b]p3.[/b] Two players play the following game on an $8\times 8$ chessboard. The first player can put a knight on an arbitrary square. Then the second player can put another knight on a free square that is not controlled by the first knight. Then the first player can put a new knight on a free square that is not controlled by the knights on the board. Then the second player can do the same, etc. A player who cannot put a new knight on the board loses the game. Who has a winning strategy? [b]p4.[/b] Consider a regular octagon $ABCDEGH$ (i.e., all sides of the octagon are equal and all angles of the octagon are equal). Show that the area of the rectangle $ABEF$ is one half of the area of the octagon. [img]https://cdn.artofproblemsolving.com/attachments/d/1/674034f0b045c0bcde3d03172b01aae337fba7.png[/img] [b]p5.[/b] Can you find a positive whole number such that after deleting the first digit and the zeros following it (if they are) the number becomes $24$ times smaller? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Assume $a,b,c$ are odd integers. Show that the quadratic equation \[ ax^2 + bx + c = 0 \] has no rational solutions. (A number is said to be [i]rational[/i], if it can be written as a fraction: $\frac{\text{integer}}{\text{integer}}$.)

A set $M$ of real numbers will be called [i]special [/i] if it has the properties: (i) for each $x, y \in M, x\ne y$, the numbers $x + y$ and $xy$ are not zero and exactly one of them is rational; (ii) for each $x \in M, x^2$ is irrational. Find the maximum number of elements of a [i]special [/i] set.