Find the value of $n$ such that $\frac{2019 + n}{2019 - n}= 5$

Determine all $n$ for which the system with of equations can be solved in $\mathbb{R}$: \[\sum^{n}_{k=1} x_k = 27\] and \[\prod^{n}_{k=1} x_k = \left( \frac{3}{2} \right)^{24}.\]

Let $n\geq 2$ be an integer and consider an array composed of $n$ rows and $2n$ columns. Half of the elements in the array are colored in red. Prove that for each integer $k$, $1<k\leq \dsp \left\lfloor \frac n2\right\rfloor+1$, there exist $k$ rows such that the array of size $k\times 2n$ formed with these $k$ rows has at least \[ \frac { k! (n-2k+2) } {(n-k+1)(n-k+2)\cdots (n-1)} \] columns which contain only red cells.

Let $m>1$ and $n>1$ be integers. Suppose that the product of the solutions for $x$ of the equation \[8(\log_n x)(\log_m x) - 7 \log_n x - 6 \log_m x - 2013 = 0\] is the smallest possible integer. What is $m+n$? ${ \textbf{(A)}\ 12\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 24\qquad\textbf{(D}}\ 48\qquad\textbf{(E)}\ 272 $

Compute \[\sum_{n=1}^\infty \dfrac{1}{n\cdot(n+1)\cdot(n+1)!}.\]

Given a triangle $ABC.$ The incircle $(I)$ of $\triangle ABC$ touch the sides $CA,AB$ at $E,F.$ A point $P$ moving on the segment $EF$. The line $PB$ intersects $CA$ at $M$; the line $MI$ intersects the line passing through $C$ and perpendicular to $AC$ at $N.$ Prove that: if $P$ is moving, the line passing through $N$ and perpendicular to $PC$ always passes a fixed point.

Let $ n>1$ be an odd integer and define: \[ N\equal{}\{\minus{}n,\minus{}(n\minus{}1),\dots,\minus{}1,0,1,\dots,(n\minus{}1),n\}.\] A subset $ P$ of $ N$ is called [i]basis[/i] if we can express every element of $ N$ as the sum of $ n$ different elements of $ P$. Find the smallest positive integer $ k$ such that every $ k\minus{}$elements subset of $ N$ is basis.

Prove that for all $a, b$ and $x_0$ positive integers, in the sequence $x_1, x_2, x_3, \cdots$ defined by $$x_{n+1}=ax_n+b, n\geq 0$$ Exist an $x_i$ that is not prime for some $i\geq 1$

Let $AXYZB$ be a convex pentagon inscribed in a semicircle of diameter $AB$. Denote by $P$, $Q$, $R$, $S$ the feet of the perpendiculars from $Y$ onto lines $AX$, $BX$, $AZ$, $BZ$, respectively. Prove that the acute angle formed by lines $PQ$ and $RS$ is half the size of $\angle XOZ$, where $O$ is the midpoint of segment $AB$.

Jason rolls three fair standard six-sided dice. Then he looks at the rolls and chooses a subset of the dice (possibly empty, possibly all three dice) to reroll. After rerolling, he wins if and only if the sum of the numbers face up on the three dice is exactly $7$. Jason always plays to optimize his chances of winning. What is the probability that he chooses to reroll exactly two of the dice? $\textbf{(A) } \frac{7}{36} \qquad\textbf{(B) } \frac{5}{24} \qquad\textbf{(C) } \frac{2}{9} \qquad\textbf{(D) } \frac{17}{72} \qquad\textbf{(E) } \frac{1}{4}$

$64$ numbers (not necessarily distinct) are placed on the squares of a chessboard such that the sum of the numbers in every $2\times2$ square is $7$. What is the sum of the four numbers in the corners of the board?

Let $x_1,\cdots, x_n$ be nonzero vectors of a vector space $V$ and $\varphi:V\to V$ be a linear transformation such that $\varphi x_1 = x_1$, $\varphi x_k = x_k - x_{k-1}$ for $k = 2, 3,\ldots,n$. Prove that the vectors $x_1,\ldots,x_n$ are linearly independent.

(a) Two players take turns taking $1, 2$ or $3$ stones at random from a given set of $3$ piles, in which initially on $11, 22$ and $33$ stones. If after the move of one of the players in any two groups the same number of stones will remain, this player has won. Who will win with the right game of both players? (b) Two players take turns taking $1$ or $2$ stones from one pile, randomly selected from a given set of $3$ ordered piles, in which at first $100, 200$ and $300$ stones, in order from left to right. Additionally it is forbidden to make a course at which, for some pair of the next handfuls, quantity of stones in the left will be more than the number of stones in the right. If after the move of one of the players of the stones in handfuls will not remain, then this player won. Who will win with the right game of both players? [hide=original wording] 1. Два гравця по черзi беруть 1, 2 чи 3 камiнця довiльним чином з заданого набору з 3 купок, в яких спочатку по 11, 22 i 33 камiнцiв. Якщо пiсля хода одного з гравцiв в якихось двух купках залишиться однакова кiлькiсть камiнцiв, то цей гравець виграв. Хто виграє при правильнiй грi обох гравцiв? 2. Два гравця по черзi беруть 1 чи 2 камiнця з одної купки, довiльної вибраної з заданого набору з 3 впорядкованих купок, в яких спочатку по 100, 200 i 300 камiнцiв, в порядку злiва направо. Додатково забороняется робити ход при якому, для деякої пари сусiднiх купок, кiлькiсть камiнцiв в лiвiй стане бiльше нiж кiлькiсть камiнцiв в правiй. Якщо пiсля ходу одного з гравцiв камiнцiв в купках не залишиться, то цей гравець виграв. Хто виграє при правильнiй грi обох гравцiв?[/hide]

Let $a, b, c$ be positive real numbers such that $a^2+b^2+c^2+(a+b+c)^2\leq4$. Prove that \[\frac{ab+1}{(a+b)^2}+\frac{bc+1}{(b+c)^2}+\frac{ca+1}{(c+a)^2}\geq 3.\]

Let $n$ be a positive integer. Bolek draws $2n$ points in the plane, no two of them defining a vertical or a horizontal line. Then Lolek draws for each of these $2n$ points two rays emanating from them, one of them vertically and the other one horizontally. Lolek wants to maximize the number of regions in which these rays divide the plane. Determine the largest number $k$ such that Lolek can obtain at least $k$ regions independent of the points chosen by Bolek.

You are participating in a virtual stock market, with many different stocks. For a stock $S$, there is a list of prices where the $i$th number is the price of the stock on day $i$. On each day $i$, you are given the stock's current price (in dollars), and you can either buy a share of stock $S$, sell your share of stock $S$, or do nothing, but you may only take one of these actions per day, and you may not have more than one share of stock $S$ at a time. Each stock is independent, so for example on the first day, you may buy a share of $S$ and a share of $T$, and on the second day you may sell your share of $T$. At USMCA Trading LLC, you are given $2021!$ different stocks, where each stock's list of prices corresponds to a unique permutation of the first $2021$ positive integers, to trade for $2021$ days. You start out with $M$ dollars, and at the end of $2021$ days, you end up with $N$ dollars. Assume $M$ is large enough so that you can never run out of money during the $2021$ days. What is the maximum possible value of $N - M$?

a) If positive integer $N$ is a perfect cube and is not divisible by $10$, then $N=(10m+n)^2$ where $m,n \in N$ with $1\le n\le 9$ b) Find all the positive integers $N$ which are perfect cubes, are not divisible by $10$, such that the number obtained by erasing the last three digits to be also also a perfect cube.

Let $ a$ and $b$ be positive integers. Prove that there exist positive integers $ x $ and $ y $ such that \[ \binom{x+y}{2} = ax + by . \]

In a rectangle $ABCD$ be a rectangle and $BC = 2AB$, let $E$ be the midpoint of $BC$ and $P$ an arbitrary inner point of $AD$. Let $F$ and $G$ be the feet of perpendiculars drawn correspondingly from $A$ to $BP$ and from $D$ to $CP$. Prove that the points $E,F,P,G$ are concyclic.

Let $x, y, z$ non-zero real numbers such that $xy$, $yz$, $zx$ are rational. [list=a] [*] Show that the number $x^{2}+y^{2}+z^{2}$ is rational. [*] If the number $x^{3}+y^{3}+z^{3}$ is also rational, show that $x$, $y$, $z$ are rational. [/list]

On some cells of a $2n \times 2n$ board are placed white and black markers (at most one marker on every cell). We first remove all black markers which are in the same column with a white marker, then remove all white markers which are in the same row with a black one. Prove that either the number of remaining white markers or that of remaining black markers does not exceed $n^2$.

Given a set $M$ of $1985$ distinct positive integers, none of which has a prime divisor greater than $23$, prove that $M$ contains a subset of $4$ elements whose product is the $4$th power of an integer.

Ten different odd primes are given. Is it possible that for any two of them, the difference of their sixteenth powers to be divisible by all the remaining ones ?

Let ${a_1,a_2,\dots,a_n}$ be positive real numbers, ${n>1}$. Denote by $g_n$ their geometric mean, and by $A_1,A_2,\dots,A_n$ the sequence of arithmetic means defined by \[ A_k=\frac{a_1+a_2+\cdots+a_k}{k},\qquad k=1,2,\dots,n. \] Let $G_n$ be the geometric mean of $A_1,A_2,\dots,A_n$. Prove the inequality \[ n \root n\of{\frac{G_n}{A_n}}+ \frac{g_n}{G_n}\le n+1 \] and establish the cases of equality. [i]Proposed by Finbarr Holland, Ireland[/i]

In the following system of equations $$|x+y|+|y|=|x-1|+|y-1|=2,$$ find the sum of all possible $x$.