Define the sequence $(x_{n})$: $x_{1}=\frac{1}{3}$ and $x_{n+1}=x_{n}^{2}+x_{n}$. Find $\left[\frac{1}{x_{1}+1}+\frac{1}{x_{2}+1}+\dots+\frac{1}{x_{2007}+1}\right]$, wehere $[$ $]$ denotes the integer part.

Let $n\ge 3$. Suppose $a_1, a_2, ... , a_n$ are $n$ distinct in pairs real numbers. In terms of $n$, find the smallest possible number of different assumed values by the following $n$ numbers: $$a_1 + a_2, a_2 + a_3,..., a_{n- 1} + a_n, a_n + a_1$$

Find the minimum real $x$ that satisfies $$\lfloor x \rfloor <\lfloor x^2 \rfloor <\lfloor x^3 \rfloor < \cdots < \lfloor x^n \rfloor < \lfloor x^{n+1} \rfloor < \cdots$$

If $ P(x),Q(x),R(x)$, and $ S(x)$ are all polynomials such that \[ P(x^5)\plus{}xQ(x^5)\plus{}x^2R(x^5)\equal{}(x^4\plus{}x^3\plus{}x^2\plus{}x\plus{}1)S(x),\] prove that $ x\minus{}1$ is a factor of $ P(x)$.

Find $a$ and $b$ for which the largest and smallest is values of the function $y=\frac{x^2+ax+b}{x^2-x+1}$ are equal to the $2$ and $-3$ respectively.

Consider the sum $$S =\sum^{2021}_{j=1} \left|\sin \frac{2\pi j}{2021}\right|.$$ The value of $S$ can be written as $\tan \left( \frac{c\pi}{d} \right)$ for some relatively prime positive integers $c, d$, satisfying $2c < d$. Find the value of $c + d$.

Prove that for any real numbers $ a_1, a_2, \dots, a_ {100} $ there exists a real number $ b $ such that all numbers $ a_i + b $ ($ 1 \leq i \leq 100 $) are irrational.

Let $f(x)$ be a function such that $f(x)+2f\left(\frac{x+2010}{x-1}\right)=4020 - x$ for all $x \ne 1$. Then the value of $f(2012)$ is (A) $2010$, (B) $2011$, (C) $2012$, (D) $2014$, (E) None of the above.

Let $ \alpha(n)$ be the number of digits equal to one in the binary representation of a positive integer $ n.$ Prove that: (a) the inequality $ \alpha(n) (n^2 ) \leq \frac{1}{2} \alpha(n)(\alpha(n) + 1)$ holds; (b) the above inequality is an equality for infinitely many positive integers, and (c) there exists a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i }$ goes to zero as $ i$ goes to $ \infty.$ [i]Alternative problem:[/i] Prove that there exists a sequence a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i )}$ (d) $ \infty;$ (e) an arbitrary real number $ \gamma \in (0,1)$; (f) an arbitrary real number $ \gamma \geq 0$; as $ i$ goes to $ \infty.$

A collection of regular polygons with sides of equal length is said to "fit" if, when arranged around a common vertex, they exactly complete the surrounding area of the point on the plane. For example, a square fits with two octagons. Determine all possible collections of regular polygons that fit.

Let $(A,+,\cdot)$ a 9 elements ring. Prove that the following assertions are equivalent: (a) For any $x\in A\backslash\{0\}$ there are two numbers $a\in \{-1,0,1\}$ and $b\in \{-1,1\}$ such that $x^2+ax+b=0$. (b) $(A,+,\cdot)$ is a field.

[list=a] [*] Find an example of three positive integers $a,b,c$ satisfying $31a+30b+28c=365$. [*] Prove that any triplet $a,b,c$ satisfying the above condition, also satisfies $a+b+c=12$. [/list]

Find all functions $f$ from real numbers to real numbers such that $$2f((x+y)^2)=f(x+y)+(f(x))^2+(4y-1)f(x)-2y+4y^2$$ holds for all real numbers $x$ and $y$.

Prove that if $ n $ is a natural number greater than $ 2 $, then $$\sqrt[n + 1]{n+1} < \sqrt[n]{n}.$$

Let $ a$, $ b$, $ c$, $ d$ be positive real numbers such that $ abcd \equal{} 1$ and $ a \plus{} b \plus{} c \plus{} d > \dfrac{a}{b} \plus{} \dfrac{b}{c} \plus{} \dfrac{c}{d} \plus{} \dfrac{d}{a}$. Prove that \[ a \plus{} b \plus{} c \plus{} d < \dfrac{b}{a} \plus{} \dfrac{c}{b} \plus{} \dfrac{d}{c} \plus{} \dfrac{a}{d}\] [i]Proposed by Pavel Novotný, Slovakia[/i]

Let non-constant polynomial $f(x)$ with real coefficients is given with the following property: for any positive integer $n$ and $k$, the value of expression $$\frac{f(n + 1)f(n + 2)... f(n + k)}{ f(1)f(2) ... f(k)} \in Z$$ Prove that $f(x)$ is divisible by $x$

Let $ a$, $ b$, $ c$ denote the sides of a triangle. Show that the quantity \[ \frac{a}{b\plus{}c}\plus{}\frac{b}{c\plus{}a}\plus{}\frac{c}{a\plus{}b}\] must lie between the limits $ 3/2$ and 2. Can equality hold at either limits?

[u]Round 1[/u] [b]p1.[/b] Ash is running around town catching Pokémon. Each day, he may add $3, 4$, or $5$ Pokémon to his collection, but he can never add the same number of Pokémon on two consecutive days. What is the smallest number of days it could take for him to collect exactly $100$ Pokémon? [b]p2.[/b] Jack and Jill have ten buckets. One bucket can hold up to $1$ gallon of water, another can hold up to $2$ gallons, and so on, with the largest able to hold up to $10$ gallons. The ten buckets are arranged in a line as shown below. Jack and Jill can pour some amount of water into each bucket, but no bucket can have less water than the one to its left. Is it possible that together, the ten buckets can hold 36 gallons of water? [img]https://cdn.artofproblemsolving.com/attachments/f/8/0b6524bebe8fe859fe7b1bc887ac786106fc17.png[/img] [b]p3.[/b] There are $2023$ knights and liars standing in a row. Knights always tell the truth and liars always lie. Each of them says, “the number of liars to the left of me is greater than the number of knights to the right.” How many liars are there? [b]p4.[/b] Camila has a deck of $101$ cards numbered $1, 2, ..., 101$. She starts with $50$ random cards in her hand and the rest on a table with the numbers visible. In an exchange, she replaces all $50$ cards in her hand with her choice of $50$ of the $51$ cards from the table. Show that Camila can make at most 50 exchanges and end up with cards $1, 2, ..., 50$. [img]https://cdn.artofproblemsolving.com/attachments/0/6/c89e65118764f3b593da45264bfd0d89e95067.png[/img] [b]p5.[/b] There are $101$ pirates on a pirate ship: the captain and $100$ crew. Each pirate, including the captain, starts with $1$ gold coin. The captain makes proposals for redistributing the coins, and the crew vote on these proposals. The captain does not vote. For every proposal, each crew member greedily votes “yes” if he gains coins as a result of the proposal, “no” if he loses coins, and passes otherwise. If strictly more crew members vote “yes” than “no,” the proposal takes effect. The captain can make any number of proposals, one after the other. What is the largest number of coins the captain can accumulate? [u]Round 2[/u] [b]p6.[/b] The town of Lumenville has $100$ houses and is preparing for the math festival. The Tesla wiring company will lay lengths of power wire in straight lines between the houses so that power flows between any two houses, possibly by passing through other houses. The Edison lighting company will hang strings of lights in straight lines between pairs of houses so that each house is connected by a string to exactly one other. Show that however the houses are arranged, the Edison company can always hang their strings of lights so that the total length of the strings is no more than the total length of the power wires the Tesla company used. [img]https://cdn.artofproblemsolving.com/attachments/9/2/763de9f4138b4dc552247e9316175036c649b6.png[/img] [b]p7.[/b] You are given a sequence of $16$ digits. Is it always possible to select one or more digits in a row, so that multiplying them results in a square number? [img]https://cdn.artofproblemsolving.com/attachments/d/1/f4fcda2e1e6d4a1f3a56cd1a04029dffcd3529.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let the real numbers $a$, $b$, and $c$ satisfy the equations $(a+b)(b+c)(c+a)=abc$ and $(a^9+b^9)(b^9+c^9)(c^9+a^9)=(abc)^9$. Prove that at least one of $a$, $b$, and $c$ equals $0$.

Let $A=\{(x,y): 0\le x,y < 1\}.$ For $(x,y)\in A,$ let \[S(x,y)=\sum_{\frac12\le\frac mn\le2}x^my^n,\] where the sum ranges over all pairs $(m,n)$ of positive integers satisfying the indicated inequalities. Evaluate \[\lim_{(x,y)\to(1,1),(x,y)\in A}(1-xy^2)(1-x^2y)S(x,y).\]

If $x, y, z \in \mathbb{R}$ are solutions to the system of equations $$\begin{cases} x - y + z - 1 = 0\\ xy + 2z^2 - 6z + 1 = 0\\ \end{cases}$$ what is the greatest value of $(x - 1)^2 + (y + 1)^2$?

Find all surjective functions $f: \mathbb R \to \mathbb R$ such that for every $x,y\in \mathbb R,$ we have \[f(x+f(x)+2f(y))=f(2x)+f(2y).\]

Suppose $P(x)$ is a quadratic polynomial with integer coefficients satisfying the identity \[P(P(x)) - P(x)^2 = x^2+x+2016\] for all real $x$. What is $P(1)$?

Let $P(z)=a_d z^d+\dots+ a_1z+a_0$ be a polynomial with complex coefficients. The $reverse$ of $P$ is defined by $$P^*(z)=\overline{a_0}z^d+\overline{a_1}z^{d-1}+\dots+\overline{a_d}$$ (a) Prove that $$P^*(z)=z^d \overline{ P\left( \frac{1}{\overline{z}} \right) } $$ (b) Let $m$ be a positive integer and let $q(z)$ be a monic nonconstant polynomial with complex coefficients. Suppose that all roots of $q(z)$ lie inside or on the unit circle. Prove that all roots of the polynomial $$Q(z)=z^m q(z)+ q^*(z)$$ lie on the unit circle.

Determine all integers $x$ satisfying \[ \left[\frac{x}{2}\right] \left[\frac{x}{3}\right] \left[\frac{x}{4}\right] = x^2. \] ($[y]$ is the largest integer which is not larger than $y.$)