Determine all real solutions of the following system of equations: $$x+y^2=y^3$$ $$y+x^2=x^3$$

The polynomial $$x^{10} + ?x^9 + ?x^8 + ... + ?x + 1$$ is written on the blackboard. Two players substitute (real) numbers instead of one of the question marks in turn. ($9$ turns total.) The first wins if the polynomial will have no real roots. Who wins?

Determine all the possible non-negative integer values that are able to satisfy the expression: $\frac{(m^2+mn+n^2)}{(mn-1)}$ if $m$ and $n$ are non-negative integers such that $mn \neq 1$.

Find all non-negative integers $m,n,p,q$ such that \[ p^mq^n = (p+q)^2 +1 . \]

Given $n \in\mathbb{N}$, find all continuous functions $f : \mathbb{R}\to \mathbb{R}$ such that for all $x\in\mathbb{R},$ \[\sum_{k=0}^{n}\binom{n}{k}f(x^{2^{k}})=0. \]

a) Let $\{a_n\}_{n=1}^\infty$ is sequence of integers bigger than 1. Proove that if $x>0$ is irrational, then $\ds x_n>\frac{1}{a_{n+1}}$ for infinitely many $n$, where $x_n$ is fractional part of $a_na_{n-1}\dots a_1x$. b)Find all sequences $\{a_n\}_{n=1}^\infty$ of positive integers, for which exist infinitely many $x\in(0,1)$ such that $\ds x_n>\frac{1}{a_{n+1}}$ for all $n$. [i]Nikolai Nikolov, Emil Kolev[/i]

Let $x$ and $y$ be integers. Prove that one of the expressions $$2x+3y \text{ and } 9x+5y$$ is divisible by $17$ if and only if so is the other.

Given an infinite sequence of numbers $a_1, a_2, a_3,...$ . For each positive integer $k$ there exists a positive integer $t = t(k)$ such that $a_k = a_{k+t} = a_{k+2t} =...$. Is this sequence necessarily periodic? That is, does a positive integer $T$ exist such that $a_k = a_{k+T}$ for each positive integer k?

The system $\begin{cases} x^2 - y^2 = 0 \\ (x - a)^2 + y^2 = 1 \end{cases}$ generally has four solutions. For which $a$ the number of solutions of the system is equal to three or two?

[b]p1.[/b] A tennis net is made of strings tied up together which make a grid consisting of small squares as shown below. [img]https://cdn.artofproblemsolving.com/attachments/9/4/72077777d57408d9fff0ea5e79be5ecb6fe8c3.png[/img] The size of the net is $100\times 10$ small squares. What is the maximal number of sides of small squares which can be cut without breaking the net into two separate pieces? (The side is cut only in the middle, not at the ends). [b]p2.[/b] What number is bigger $2^{300}$ or $3^{200}$ ? [b]p3.[/b] All noble knights participating in a medieval tournament in Camelot used nicknames. In the tournament each knight had combats with all other knights. In each combat one knight won and the second one lost. At the end of tournament the losers reported their real names to the winners and to the winners of their winners. Was there a person who knew the real names of all knights? [b]p4.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $10$ rocks in the first pile and $12$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game? [b]p5.[/b] There is an interesting $5$-digit integer. With a $1$ after it, it is three times as large as with a $1$ before it. What is the number? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$x$ and $y$ are real numbers such that $6 -x$, $3 + y^2$, $11 + x$, $14 - y^2$ are greater than zero. Find the maximum of the function $$f(x,y) = \sqrt{(6 -x)(3 + y^2)} + \sqrt{(11 + x)(14 - y^2)}.$$

Number $a$ is such that $\forall a_1, a_2, a_3, a_4 \in \mathbb{R}$, there are integers $k_1, k_2, k_3, k_4$ such that $\sum_{1 \leq i < j \leq 4} ((a_i - k_i) - (a_j - k_j))^2 \leq a$. Find the minimum of $a$.

a) Prove that for any positive integer $m > 2$, the equation $$y^3 = x^3_1 + x^3_2 + ... + x^3_m$$ always has a positive integer solution. b) Given a positive integer $n > 1$ and suppose $n \ne 3$. Prove that every rational number $x > 0$ can be expressed as $$x =\frac{a^3_1 + a^3_2 + ... + a^3_n}{b^3_1 + b^3_2 + ... + b^3_n}$$ where $a_i, b_i$ $(i = 1, . . . , n)$ are positive integers.

Let $ \mathbb{N}$ denote the set of all positive integers. Prove that there exists a unique function $ f: \mathbb{N} \mapsto \mathbb{N}$ satisfying \[ f(m \plus{} f(n)) \equal{} n \plus{} f(m \plus{} 95) \] for all $ m$ and $ n$ in $ \mathbb{N}.$ What is the value of $ \sum^{19}_{k \equal{} 1} f(k)?$

Prove that if the equation $$x^4 + ax + b = 0$$ has two equal roots, then $$\left( \frac{a}{4} \right)^4 =\left( \frac{b}{3} \right)^3.$$

Using an escalator to go down to the Metro station and walking with a regular pace, I find that I need $50$ steps to go down. if i come back later to run up it, at a speed $5$ times my previous normal pace, I check that I need $125$ steps to reach the top. How many visible steps does the mechanical staircase have when it is stopped?

Define the sequence sequence $a_0,a_1, a_2,....,a_{2018}, a_{2019}$ of real numbers as follows: $\bullet$ $a_0 = 1$. $\bullet$ $a_{n + 1} = a_n - \frac{a_n^2}{2019}$ for $n = 0, 1, ...,2018$. Prove that $a_{2019} < \frac12 <a_{2018}$.

For which positive integers $n$ can the polynomial $p(x) = 1 + x^n + x^{2n}$ is written as a product of two polynomials with integer coefficients (of degree $\ge 1$)?

Let $f : \left[ 0,1 \right] \to \mathbb R$ be an integrable function such that \[ \int_0^1 f(x) \, dx = \int_0^1 x f(x) \, dx = 1 . \] Prove that \[ \int_0^1 f^2 (x) \, dx \geq 4 . \] [i]Ion Rasa[/i]

The sum of distinct real roots of the polynomial $x^5+x^4-4x^3-7x^2-7x-2$ is $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ -2 \qquad\textbf{(E)}\ 7$

Let $(a_n)_{n=1}^{\infty}$ be a sequence with $a_n \in \{0,1\}$ for every $n$. Let $F:(-1,1) \to \mathbb{R}$ be defined by \[F(x)=\sum_{n=1}^{\infty} a_nx^n\] and assume that $F\left(\frac{1}{2}\right)$ is rational. Show that $F$ is the quotient of two polynomials with integer coefficients.

Find all functions $f: \mathbb{N} \mapsto \mathbb{N}$ so that for any positive integer $n$ and finite sequence of positive integers $a_0, \dots, a_n$, whenever the polynomial $a_0+a_1x+\dots+a_nx^n$ has at least one integer root, so does \[f(a_0)+f(a_1)x+\dots+f(a_n)x^n.\] [i]Proposed by Sutanay Bhattacharya[/i]

We will call the sequence of positive real numbers. $a_1,a_2,\dots ,a_n$ of [i]length [/i] $n$ when $$a_1\geq \frac{a_1+a_2}{2}\geq \dots \geq \frac{a_1+a_2+\cdots +a_n}{n}.$$ Let $x_1,x_2,\dots ,x_n$ and $y_1,y_2,\dots ,y_n$ be sequences of length $n.$ Prove that $$\sum_{i = 1}^{n}x_iy_i\geq\frac{1}{n}\left(\sum_{i = 1}^{n}x_i\right)\left(\sum_{i = 1}^{n}y_i\right).$$ [i](tatari/nightmare)[/i]

Let $n$ be a positive integer, and $a_j$, for $j=1,2,\ldots,n$ are complex numbers. Suppose $I$ is an arbitrary nonempty subset of $\{1,2,\ldots,n\}$, the inequality $\left|-1+ \prod_{j\in I} (1+a_j) \right| \leq \frac 12$ always holds. Prove that $\sum_{j=1}^n |a_j| \leq 3$.

Let $ABC$ be a triangle and $k < 1$ a positive real number. Let $A_1$, $B_1$, $C_1$ be points on the sides $BC$, $AC$, $AB$ such that $$\frac{A_1B}{BC} = \frac{B_1C}{AC} = \frac{C_1A}{AB} = k.$$ [b](a)[/b] Compute, in terms of $k$, the ratio between the areas of the triangles $A_1B_1C_1$ and $ABC$. [b](b)[/b] Generally, for each $n \ge 1$, the triangle $A_{n+1}B_{n+1}C_{n+1}$ is built such that $A_{n+1}$, $B_{n+1}$, $C_{n+1}$ are points on the sides $B_nC_n$, $A_nC_n$ e $A_nB_n$ satisfying $$\frac{A_{n+1}B_n}{B_nC_n} = \frac{B_{n+1}C_n}{A_nC_n} = \frac{C_{n+1}A_n}{A_nB_n} = k.$$ Compute the values of $k$ such that the sum of the areas of every triangle $A_nB_nC_n$, for $n = 1, 2, 3, \dots$ is equal to $\dfrac{1}{3}$ of the area of $ABC$.