Prove that for every integer $k \ge 2$ there are $k$ different natural numbers $n_1$, $n_2$, $...$ , $n_k$ such that: $$\frac{1}{n_1}+\frac{1}{n_2}+...+\frac{1}{n_k}=\frac{3}{17}$$

Find all positive integers $k$ for which there exists a nonlinear function $f:\mathbb{Z} \rightarrow\mathbb{Z}$ such that the equation $$f(a)+f(b)+f(c)=\frac{f(a-b)+f(b-c)+f(c-a)}{k}$$ holds for any integers $a,b,c$ satisfying $a+b+c=0$ (not necessarily distinct). [i]Evan Chen[/i]

$100$ schoolchildren took part in the Mathematical Olympiad. $4$ tasks were proposed. The first problem was solved by $90$ people, the second by $80$, the third by $70$ and the fourth by $60$. However, no one solved all the problems. Students who solved both the third and fourth questions received an award. How many students were awarded?

Find all pairs of integers $(x,y)$ such that $x \geq 0$ and \[ (6^x-y)^2 = 6^{x+1}-y. \]

Find a polynomial $P$ of lowest possible degree such that (a) $P$ has integer coefficients, (b) all roots of $P$ are integers, (c) $P(0) = -1$, (d) $P(3) = 128$.

Find all polynomials P(x) satisfying the equation $(2x-1)P(x) = (x-1)P(2x), \forall x.$

Let $n$ be an even positive integer. An $n$-degree monic polynomial $P(x)$ has $n$ real roots (not necessarily distinct). Suppose $y$ is a positive real number such that for any real number $t<y$, we have $P(t)>0$. Prove that \[P(0)^{\frac{1}{n}}-P(y)^{\frac{1}{n}}\ge y.\]

Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$ for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$ [i]Proposed by Krit Boonsiriseth[/i]

Define a sequence $\{x_n\}$ as: $\left\{\begin{aligned}& x_1=3 \\ & x_n=\frac{n+2}{3n}(x_{n-1}+2)\ \ \text{for} \ n\geq 2.\end{aligned}\right.$ Prove that this sequence has a finite limit as $n\to+\infty.$ Also determine the limit.

For any given integers $m,n$ such that $2\leq m<n$ and $(m,n)=1$. Determine the smallest positive integer $k$ satisfying the following condition: for any $m$-element subset $I$ of $\{1,2,\cdots,n\}$ if $\sum_{i\in I}i> k$, then there exists a sequence of $n$ real numbers $a_1\leq a_2 \leq \cdots \leq a_n$ such that $$\frac1m\sum_{i\in I} a_i>\frac1n\sum_{i=1}^na_i$$

Let $S$ be a finite set of positive integers such that none of them has a prime factor greater than three. Show that the sum of the reciprocals of the elements in $S$ is smaller than three.

[u]Round 1[/u] [b]p1.[/b] Alice and Bob compiled a list of movies that exactly one of them saw, then Cindy and Dale did the same. To their surprise, these two lists were identical. Prove that if Alice and Cindy list all movies that exactly one of them saw, this list will be identical to the one for Bob and Dale. [b]p2.[/b] Several whole rounds of cheese were stored in a pantry. One night some rats sneaked in and consumed $10$ of the rounds, each rat eating an equal portion. Some were satisfied, but $7$ greedy rats returned the next night to finish the remaining rounds. Their portions on the second night happened to be half as large as on the first night. How many rounds of cheese were initially in the pantry? [b]p3.[/b] You have $100$ pancakes, one with a single blueberry, one with two blueberries, one with three blueberries, and so on. The pancakes are stacked in a random order. Count the number of blueberries in the top pancake, and call that number N. Pick up the stack of the top N pancakes, and flip it upside down. Prove that if you repeat this counting-and-flipping process, the pancake with one blueberry will eventually end up at the top of the stack. [b]p4.[/b] There are two lemonade stands along the $4$-mile-long circular road that surrounds Sour Lake. $100$ children live in houses along the road. Every day, each child buys a glass of lemonade from the stand that is closest to her house, as long as she does not have to walk more than one mile along the road to get there. A stand's [u]advantage [/u] is the difference between the number of glasses it sells and the number of glasses its competitor sells. The stands are positioned such that neither stand can increase its advantage by moving to a new location, if the other stand stays still. What is the maximum number of kids who can't buy lemonade (because both stands are too far away)? [b]p5.[/b] Merlin uses several spells to move around his $64$-room castle. When Merlin casts a spell in a room, he ends up in a different room of the castle. Where he ends up only depends on the room where he cast the spell and which spell he cast. The castle has the following magic property: if a sequence of spells brings Merlin from some room $A$ back to room $A$, then from any other room $B$ in the castle, that same sequence brings Merlin back to room $B$. Prove that there are two different rooms $X$ and $Y$ and a sequence of spells that both takes Merlin from $X$ to $Y$ and from $Y$ to $X$. [u]Round 2[/u] [b]p6.[/b] Captains Hook, Line, and Sinker are deciding where to hide their treasure. It is currently buried at the $X$ in the map below, near the lairs of the three pirates. Each pirate would prefer that the treasure be located as close to his own lair as possible. You are allowed to propose a new location for the treasure to the pirates. If at least two out of the three pirates prefer the new location (because it moves closer to their own lairs), then the treasure will be moved there. Assuming the pirates’ lairs form an acute triangle, is it always possible to propose a sequence of new locations so that the treasure eventually ends up in your backyard (wherever that is)? [img]https://cdn.artofproblemsolving.com/attachments/c/c/a9e65624d97dec612ef06f8b30be5540cfc362.png[/img] [b]p7.[/b] Homer went on a Donut Diet for the month of May ($31$ days). He ate at least one donut every day of the month. However, over any stretch of $7$ consecutive days, he did not eat more than $13$ donuts. Prove that there was some stretch of consecutive days over which Homer ate exactly $30$ donuts. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given positive integers $k,n$ and a real number $\ell$, where $k,n \geq 1$. Given are also pairwise different positive real numbers $a_1,a_2,\ldots, a_k$. Let $S = \{a_1,a_2,\ldots,a_k, -a_1, -a_2,\ldots, -a_k\}$. Let $A$ be the number of solutions of the equation $$x_1 + x_2 + \ldots + x_{2n} = 0,$$ where $x_1,x_2,\ldots, x_{2n} \in S$. Let $B$ be the number of solutions of the equation $$x_1 + x_2 + \ldots + x_{2n} = \ell,$$ where $x_1,x_2,\ldots,x_{2n} \in S$. Prove that $A \geq B$. Solutions of an equation with only difference in the permutation are different.

Let $f(x)$ be a periodic function with periods $T$ and $1$($0<T<1$).Prove that: (1)If $T$ is rational,then there exists a prime $p$ such that $\frac{1}{p}$ is also a period of $f$; (2)If $T$ is irrational,then there exists a strictly decreasing infinite sequence {$a_n$},with $1>a_n>0$ for all positive integer $n$,such that all $a_n$ are periods of $f$.

Of the students attending a school athletic event, $80\%$ of the boys were dressed in the school colors, $60\%$ of the girls were dressed in the school colors, and $45\% $ of the students were girls. Find the percentage of students attending the event who were wearing the school colors.

If in applying the quadratic formula to a quadratic equation \[ f(x)\equiv ax^2 \plus{} bx \plus{} c \equal{} 0, \] it happens that $ c \equal{} \frac {b^2}{4a}$, then the graph of $ y \equal{} f(x)$ will certainly: $ \textbf{(A)}\ \text{have a maximum} \qquad\textbf{(B)}\ \text{have a minimum} \qquad\textbf{(C)}\ \text{be tangent to the x \minus{} axis} \\ \qquad\textbf{(D)}\ \text{be tangent to the y \minus{} axis} \qquad\textbf{(E)}\ \text{lie in one quadrant only}$

Let $p$ be a prime. Show that $\sqrt[3]{p} +\sqrt[3]{p^5} $ is irrational.

$a$ and $b$ are natural numbers such that $b > a > 1$, and $a$ does not divide $b$. The sequence of natural numbers $\{b_n\}_{n=1}^\infty$ satisfies $b_{n + 1} \geq 2b_n \forall n \in \mathbb{N}$. Does there exist a sequence $\{a_n\}_{n=1}^\infty$ of natural numbers such that for all $n \in \mathbb{N}$, $a_{n + 1} - a_n \in \{a, b\}$, and for all $m, l \in \mathbb{N}$ ($m$ may be equal to $l$), $a_m + a_l \not\in \{b_n\}_{n=1}^\infty$?

Decide, whether every positive rational number can present in the form $\frac{a^2 + b^3}{c^5 + d^7}$, where $a, b, c, d$ are positive integers.

An isosceles triangle $T$ has the following property: it is possible to draw a line through one of the three vertices of $T$ that splits it into two smaller isosceles triangles $R$ and $S$, neither of which are similar to $T$. Find all possible values of the vertex (apex) angle of $T$.

Let $n\geq 2$ be some fixed positive integer and suppose that $a_1, a_2,\dots,a_n$ are positive real numbers satisfying $a_1+a_2+\cdots+a_n=2^n-1$. Find the minimum possible value of $$\frac{a_1}{1}+\frac{a_2}{1+a_1}+\frac{a_3}{1+a_1+a_2}+\cdots+\frac{a_n}{1+a_1+a_2+\cdots+a_{n-1}}$$

Find all functions $f : Q \to Q$, such that $$f(x + f (y + f(z))) = y + f(x + z)$$ for all $x ,y ,z \in Q$ . (I. Voronovich)

Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for any two reals $x$ and $y$, we have $f\left( f\left( x+y\right) \right) +xy=f\left( x+y\right) +f\left( x\right) f\left( y\right) $.

The quadratic equation $ax^2 + bx + c = 0$ has its roots in the interval $[0, 1]$. Find the maximum of $\frac{(a - b)(2a - b)}{a(a - b + c)}$.

Given reals numbers $a$, $b$, $c$. Prove that at least one of three equations $x^{2}+(a-b)x+(b-c)=0$, $x^{2}+(b-c)x+(c-a)=0$, $x^{2}+(c-a)x+(a-b)=0$ has a real root. [i]O. Podlipsky[/i]