What is the difference between the maximum value and the minimum value of the sum $a_1 + 2a_2 + 3a_3 + 4a_4 + 5a_5$ where $\{a_1,a_2,a_3,a_4,a_5\} = \{1,2,3,4,5\}$? $ \textbf{(A)}\ 20 \qquad\textbf{(B)}\ 15 \qquad\textbf{(C)}\ 10 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 0 $

Suppose a non-identically zero function $f$ satisfies $f\left(x\right)f\left(y\right)=f\left(\sqrt{x^2+y^2}\right)$ for all $x$ and $y$. Compute $$f\left(1\right)-f\left(0\right)-f\left(-1\right).$$

Let $n$ be a positive integer. A function $f : \{1, 2, \dots, 2n\} \to \{1, 2, 3, 4, 5\}$ is [i]good[/i] if $f(j+2)$ and $f(j)$ have the same parity for every $j = 1, 2, \dots, 2n-2$. Prove that the number of good functions is a perfect square.

On the circle with center 0 and radius 1 the point $A_0$ is fixed and points $A_1, A_2, \ldots, A_{999}, A_{1000}$ are distributed in such a way that the angle $\angle A_00A_k = k$ (in radians). Cut the circle at points $A_0, A_1, \ldots, A_{1000}.$ How many arcs with different lengths are obtained. ?

How many positive roots does polynomial $x^{2002} + a_{2001}x^{2001} + a_{2000}x^{2000} + \cdots + a_1x + a_0$ have such that $a_{2001} = 2002$ and $a_k = -k - 1$ for $0\leq k \leq 2000$? $ \textbf{a)}\ 0 \qquad\textbf{b)}\ 1 \qquad\textbf{c)}\ 2 \qquad\textbf{d)}\ 1001 \qquad\textbf{e)}\ 2002 $

i) Prove that for every sequence $(a_{n})_{n\in \mathbb{N}}$, such that $a_{n}>0$ for all $n \in \mathbb{N}$ and $\sum_{n=1}^{\infty}a_{n}<\infty$, we have $$\sum_{n=1}^{\infty}(a_{1}a_{2} \cdots a_{n})^{\frac{1}{n}}< e\sum_{n=1}^{\infty}a_{n}.$$ ii) Prove that for every $\epsilon>0$ there exists a sequence $(b_{n})_{n\in \mathbb{N}}$ such that $b_{n}>0$ for all $n \in \mathbb{N}$ and $\sum_{n=1}^{\infty}b_{n}<\infty$ and $$\sum_{n=1}^{\infty}(b_{1}b_{2} \cdots b_{n})^{\frac{1}{n}}> (e-\epsilon)\sum_{n=1}^{\infty}b_{n}.$$

Let $(a_n)_{n\ge0}$ be a sequence of positive real numbers such that \[\sum_{k=0}^nC_n^ka_ka_{n-k}=a_n^2,\ \text{for any }n\ge 0.\] Prove that $(a_n)_{n\ge0}$ is a geometric sequence. [i]Lucian Dragomir[/i]

If $ a,b,c,d,e$ are positive numbers bounded by $ p$ and $ q$, i.e, if they lie in $ [p,q], 0 < p$, prove that \[ (a \plus{} b \plus{} c \plus{} d \plus{} e)\left(\frac {1}{a} \plus{} \frac {1}{b} \plus{} \frac {1}{c} \plus{} \frac {1}{d} \plus{} \frac {1}{e}\right) \le 25 \plus{} 6\left(\sqrt {\frac {p}{q}} \minus{} \sqrt {\frac {q}{p}}\right)^2\] and determine when there is equality.

In a certain year, January had exactly four Tuesdays and four Saturdays. On what day did January $ 1$ fall that year? \[ \textbf{(A)}\ \text{Monday} \qquad \textbf{(B)}\ \text{Tuesday} \qquad \textbf{(C)}\ \text{Wednesday} \qquad \textbf{(D)}\ \text{Friday} \qquad \textbf{(E)}\ \text{Saturday} \]

The four sets A, B, C, and D each have $400$ elements. The intersection of any two of the sets has $115$ elements. The intersection of any three of the sets has $53$ elements. The intersection of all four sets has $28$ elements. How many elements are there in the union of the four sets?

Determine all finite nonempty sets $S$ of positive integers satisfying \[ {i+j\over (i,j)}\qquad\mbox{is an element of S for all i,j in S}, \] where $(i,j)$ is the greatest common divisor of $i$ and $j$.

In a triangle $ABC$ ($\angle{BCA} = 90^{\circ}$), let $D$ be the intersection of $AB$ with a circumference with diameter $BC$. Let $F$ be the intersection of $AC$ with a line tangent to the circumference. If $\angle{CAB} = 46^{\circ}$, find the measure of $\angle{CFD}$.

[b]p1.[/b] In the correct identity $(x^2 - 1)(x + ...) = (x + 3)(x- 1)(x +...)$ two numbers were replaced with dots. What were these numbers? [b]p2.[/b] A merchant is carrying money from point A to point B. There are robbers on the roads who rob travelers: on one road the robbers take $10\%$ of the amount currently available, on the other - $20\%$, etc. . How should the merchant travel to bring as much of the money as possible to B? What part of the original amount will he bring to B? [img]https://cdn.artofproblemsolving.com/attachments/f/5/ab62ce8fce3d482bc52b89463c953f4271b45e.png[/img] [b]p3.[/b] Find the angle between the hour and minute hands at $7$ hours $38$ minutes. [b]p4.[/b] The lottery game is played as follows. A random number from $1$ to $1000$ is selected. If it is divisible by $2$, they pay a ruble, if it is divisible by $10$ - two rubles, by $12$ - four rubles, by $20$ - eight, if it is divisible by several of these numbers, then they pay the sum. How much can you win (at one time) in such a game? List all options. [b]p5.[/b]The sum of the digits of a positive integer $x$ is equal to $n$. Prove that between $x$ and $10x$ you can find an integer whose sum of digits is $ n + 5$. [b]p6.[/b] $9$ people took part in the campaign, which lasted $12$ days. There were $3$ people on duty every day. At the same time, the duty officers quarreled with each other and no two of them wanted to be on duty together ever again. Nevertheless, the participants of the campaign claim that for all $12$ days they were able to appoint three people on duty, taking into account this requirement. Could this be so? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

Let $0<x<\pi/2$. Prove the inequality \[\sin x>\frac{4x}{x^2+4} .\]

A number of $n > m \geq 1$ soccer teams play a full tournament, each team meeting (once) each other. Points are awarded: $2$ for a victory, $1$ for a tie and $0$ for a loss. At the end, each team has won half of its points against the $m$ teams placed last (including each of these teams, who won half of its points against the other $m-1$). Find all possible values for $n$ and $m$, supported with examples of such tournaments.

Define $f(x)=\int^x_0\int^x_0e^{u^2v^2}dudv$. Calculate $2f''(2)+f'(2)$.

Given a circle and two tangents to this circle. Draw a third tangent to the circle in such a way that its segment contained by the given tangents has the given length $ d $.

Find all monic polynomials $P(x)=x^{2023}+a_{2022}x^{2022}+\ldots+a_1x+a_0$ with real coefficients such that $a_{2022}=0$, $P(1)=1$ and all roots of $P$ are real and less than $1$.

Assume every side length of a triangle $ABC$ is more than $2$ and two of its angles are given by $\angle ABC = 57^\circ$ and $ACB = 63^\circ$. Point $P$ is chosen on side $BC$ with $BP:PC = 2:1$. Points $M,N$ are chosen on sides $AB$ and $AC$, respectively so that $BM = 2$ and $CN = 1$. Let $Q$ be the point on segment $MN$ for which $MQ:QN = 2:1$. Find the value of $PQ$. Your answer must be in simplest form.

There are $2024$ points on a circle. A purple elephant labels the points $P_1,P_2,\ldots,P_{2024}$ in some order, and walks along the points from $P_1$ to $P_{2024}$ in this order, while laying some eggs. To ensure the elephant does not step on the eggs it laid, the chords $P_1P_2, P_2P_3, \ldots, P_{2023}P_{2024}$ must not intersect each other except possibly at their endpoints. How many labellings are there? (Note: Two labellings are the same if one is a rotation of the other.) [i](Proposed by Ho Janson)[/i]

For a positive integer $n$, denote with $b(n)$ the smallest positive integer $k$, such that there exist integers $a_1, a_2, \ldots, a_k$, satisfying $n=a_1^{33}+a_2^{33}+\ldots+a_k^{33}$. Determine whether the set of positive integers $n$ is finite or infinite, which satisfy: a) $b(n)=12;$ b) $b(n)=12^{12^{12}}.$

Let $ABC$ be an acute scalene triangle with circumcenter $O$. Let $D$ be the foot of the altitude from $A$ to the side $BC$. The lines $BC$ and $AO$ intersect at $E$. Let $s$ be the line through $E$ perpendicular to $AO$. The line $s$ intersects $AB$ and $AC$ at $K$ and $L$, respectively. Denote by $\omega$ the circumcircle of triangle $AKL$. Line $AD$ intersects $\omega$ again at $X$. Prove that $\omega$ and the circumcircles of triangles $ABC$ and $DEX$ have a common point.

Determine all real numbers $x{}$ satisfying $2^{x-1}+2^{1/\sqrt{x}}=3$.

If $a,b,c$ are real numbers such that $a^2+2b=7$, $b^2+4c=-7$, and $c^2+6a=-14$, find $a^2+b^2+c^2$. $\textbf{(A) }14\qquad\textbf{(B) }21\qquad\textbf{(C) }28\qquad\textbf{(D) }35\qquad\textbf{(E) }49$

[b]p1.[/b] Consider a $4 \times 4$ lattice on the coordinate plane. At $(0,0)$ is Mori’s house, and at $(4,4)$ is Mori’s workplace. Every morning, Mori goes to work by choosing a path going up and right along the roads on the lattice. Recently, the intersection at $(2, 2)$ was closed. How many ways are there now for Mori to go to work? [b]p2.[/b] Given two integers, define an operation $*$ such that if a and b are integers, then a $*$ b is an integer. The operation $*$ has the following properties: 1. $a * a$ = 0 for all integers $a$. 2. $(ka + b) * a = b * a$ for integers $a, b, k$. 3. $0 \le b * a < a$. 4. If $0 \le b < a$, then $b * a = b$. Find $2017 * 16$. [b]p3.[/b] Let $ABC$ be a triangle with side lengths $AB = 13$, $BC = 14$, $CA = 15$. Let $A'$, $B'$, $C'$, be the midpoints of $BC$, $CA$, and $AB$, respectively. What is the ratio of the area of triangle $ABC$ to the area of triangle $A'B'C'$? [b]p4.[/b] In a strange world, each orange has a label, a number from $0$ to $10$ inclusive, and there are an infinite number of oranges of each label. Oranges with the same label are considered indistinguishable. Sally has 3 boxes, and randomly puts oranges in her boxes such that (a) If she puts an orange labelled a in a box (where a is any number from 0 to 10), she cannot put any other oranges labelled a in that box. (b) If any two boxes contain an orange that have the same labelling, the third box must also contain an orange with that labelling. (c) The three boxes collectively contain all types of oranges (oranges of any label). The number of possible ways Sally can put oranges in her $3$ boxes is $N$, which can be written as the product of primes: $$p_1^{e_1} p_2^{e_2}... p_k^{e_k}$$ where $p_1 \ne p_2 \ne p_3 ... \ne p_k$ and $p_i$ are all primes and $e_i$ are all positive integers. What is the sum $e_1 + e_2 + e_3 +...+ e_k$? [b]p5.[/b] Suppose I want to stack $2017$ identical boxes. After placing the first box, every subsequent box must either be placed on top of another one or begin a new stack to the right of the rightmost pile. How many different ways can I stack the boxes, if the order I stack them doesn’t matter? Express your answer as $$p_1^{e_1} p_2^{e_2}... p_n^{e_n}$$ where $p_1, p_2, p_3, ... , p_n$ are distinct primes and $e_i$ are all positive integers. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].