For the equation $ \frac {1 \plus{} x}{1 \minus{} x} \equal{} \frac {N \plus{} 1}{N}$ to be true where $ N$ is positive, $ x$ can have: $ \textbf{(A)}\ \text{any positive value less than }1 \qquad\textbf{(B)}\ \text{any value less than }1$ $ \textbf{(C)}\ \text{the value zero only} \qquad\textbf{(D)}\ \text{any non \minus{} negative value} \qquad\textbf{(E)}\ \text{any value}$

Each cell of a $3\times n$ table was filled by a number. In each of three rows, the number $1,2,…,n$ appear in some order. It is know that for each column, the sum of pairwise product of three numbers in it is a multiple of $n$. Find all possible value of $n$.

Suppose $X$ is a set with $|X| = 56$. Find the minimum value of $n$, so that for any 15 subsets of $X$, if the cardinality of the union of any 7 of them is greater or equal to $n$, then there exists 3 of them whose intersection is nonempty.

Beto plays the following game with his computer: initially the computer randomly picks $30$ integers from $1$ to $2015$, and Beto writes them on a chalkboard (there may be repeated numbers). On each turn, Beto chooses a positive integer $k$ and some if the numbers written on the chalkboard, and subtracts $k$ from each of the chosen numbers, with the condition that the resulting numbers remain non-negative. The objective of the game is to reduce all $30$ numbers to $0$, in which case the game ends. Find the minimal number $n$ such that, regardless of which numbers the computer chooses, Beto can end the game in at most $n$ turns.

For an invertible $n\times n$ matrix $M$ with integer entries we define a sequence $\mathcal{S}_M=\{M_i\}_{i=0}^{\infty}$ by the recurrence $M_0=M$ ,$M_{i+1}=(M_i^T)^{-1}M_i$ for $i\geq 0$. Find the smallest integer $n\geq 2 $ for wich there exists a normal $n\times n$ matrix with integer entries such that its sequence $\mathcal{S}_M$ is not constant and has period $P=7$ i.e $M_{i+7}=M_i$. ($M^T$ means the transpose of a matrix $M$ . A square matrix is called normal if $M^T M=M M^T$ holds). [i]Proposed by Martin Niepel (Comenius University, Bratislava)..[/i]

Two circumferences of radius $1$ that do not intersect, $c_1$ and $c_2$, are placed inside an angle whose vertex is $O$. $c_1$ is tangent to one of the rays of the angle, while $c_2$ is tangent to the other ray. One of the common internal tangents of $c_1$ and $c_2$ passes through $O$, and the other one intersects the rays of the angle at points $A$ and $B$, with $AO=BO$. Find the distance of point $A$ to the line $OB$.

Find at least one function $f: \mathbb R \rightarrow \mathbb R$ such that $f(0)=0$ and $f(2x+1) = 3f(x) + 5$ for any real $x$.

Given an integer $n \ge 2$ and a regular $2n$-polygon at each vertex of which sitting on an ant. At some points in time, each ant creeps into one of two adjacent peaks (some peaks may have several ants at a time). Through $k$ such operations, it turned out to be an arbitrary line connecting two different ones the vertices of a polygon with ants do not pass through its center. For given $n$ find the lowest possible value of $k$.

Call a positive integer $n$ quixotic if the value of \[\operatorname{lcm}(1,2,...,n)\cdot\left(\frac11+\frac12+\frac13+\dots+\frac1n\right)\]is divisible by 45. Compute the tenth smallest quixotic integer.

In the non-isosceles triangle $ABC$,$D$ is the midpoint of side $BC$,$E$ is the midpoint of side $CA$,$F$ is the midpoint of side $AB$.The line(different from line $BC$) that is tangent to the inscribed circle of triangle $ABC$ and passing through point $D$ intersect line $EF$ at $X$.Define $Y,Z$ similarly.Prove that $X,Y,Z$ are collinear.

Suppose $a,b,c$ are positive integers such that \[\gcd(a,b)+\gcd(a,c)+\gcd(b,c)=b+c+2023\] Prove that $\gcd(b,c)=2023$. [i]Remark.[/i] For positive integers $x$ and $y$, $\gcd(x,y)$ denotes their greatest common divisor. [i]Ivan Novak[/i]

Let $ABC$ be an acute triangle with $AB>AC$. The internal angle bisector of $\angle BAC$ meets $BC$ at $D$. Let $O$ be the circumcenter of $ABC$ and let $AO$ meet $BC$ at $E$. Let $J$ be the incenter of triangle $AED$. Show that if $\angle ADO=45^{\circ}$, then $OJ=JD$.

Let $ \, a_{0}, a_{1}, a_{2},\ldots\,$ be a sequence of positive real numbers satisfying $ \, a_{i\minus{}1}a_{i\plus{}1}\leq a_{i}^{2}\,$ for $ i \equal{} 1,2,3,\ldots\; .$ (Such a sequence is said to be [i]log concave[/i].) Show that for each $ \, n > 1,$ \[ \frac{a_{0}\plus{}\cdots\plus{}a_{n}}{n\plus{}1}\cdot\frac{a_{1}\plus{}\cdots\plus{}a_{n\minus{}1}}{n\minus{}1}\geq\frac{a_{0}\plus{}\cdots\plus{}a_{n\minus{}1}}{n}\cdot\frac{a_{1}\plus{}\cdots\plus{}a_{n}}{n}.\]

A positive integer $n$ is called $nice$, if the sum of the squares of all its positive divisors is equal to $(n+3)^2$. Prove that if $n=pq$ is nice, where $p, q$ are not necessarily distinct primes, then $n+2$ and $2(n+1)$ are simultaneously perfect squares.

Assume $ABC$ is an isosceles triangle that $AB=AC$ Suppose $P$ is a point on extension of side $BC$. $X$ and $Y$ are points on $AB$ and $AC$ that: \[PX || AC \ , \ PY ||AB \] Also $T$ is midpoint of arc $BC$. Prove that $PT \perp XY$

Each point of the plane is colored by one of the two colors. Show that there exists an equilateral triangle with monochromatic vertices.

Let $n$ be a fixed positive integer. - Show that there exist real polynomials $p_1, p_2, p_3, \cdots, p_k \in \mathbb{R}[x_1, \cdots, x_n]$ such that \[(x_1 + x_2 + \cdots + x_n)^2 + p_1(x_1, \cdots, x_n)^2 + p_2(x_1, \cdots, x_n)^2 + \cdots + p_k(x_1, \cdots, x_n)^2 = n(x_1^2 + x_2^2 + \cdots + x_n^2)\] - Find the least natural number $k$, depending on $n$, such that the above polynomials $p_1, p_2, \cdots, p_k$ exist.

Sristan Thin is walking around the Cartesian plane. From any point $\left(x,y\right)$, Sristan can move to $\left(x+1,y\right)$ or $\left(x+1,y+3\right)$. How many paths can Sristan take from $\left(0,0\right)$ to $\left(9,9\right)$? [i]2019 CCA Math Bonanza Individual Round #3[/i]

Let $S$ be the set of lattice points $(a,b)$ in the coordinate plane such that $1\le a\le 30$ and $1\le b\le 30$. What is the maximum number of lattice points in $S$ such that no four points form a square of side length 2? [i]Proposed by Harry Kim[/i]

Let $n \geqslant 2$ be an integer. We consider a square grid of size $2n \times 2n$ divided into $4n^2$ unit squares. The grid is called [i]balanced[/i] if: [list] [*]Each cell contains a number equal to $-1$, $0$ or $1$. [*]The absolute value of the sum of the numbers in the grid does not exceed $4n$. [/list] Determine, as a function of $n$, the smallest integer $k \geqslant 1$ such that any balanced grid always contains an $n \times n$ square whose absolute sum of the $n^2$ cells is less than or equal to $k$.

Let $MN$ be a chord of the circle $\Gamma$ and let $S$ be the midpoint of $MN$. Let $A, B, C, D$ be points on $\Gamma$ such that $AC$ and $BD$ intersect at $S$ and $A$ and $B$ are on the same side of $MN$. Let $d_A, d_B, d_C , d_D$ be the distances from $MN$ to $A, B, C,$ and $D,$ respectively. Prove that $\frac{1}{d_A}+\frac{1}{d_D}=\frac{1}{d_B}+\frac{1}{d_C}$.

Show that $(x + y + z) \big(\frac{1}{x}+\frac{1}{y}+\frac{1}{z}\big) \ge 4 \big(\frac{x}{xy+1}+\frac{y}{yz+1}+\frac{z}{zx+1}\big)^2$ , for all real positive numbers $x, y $ and $z$.

What is the ones digit of \[222{,}222-22{,}222-2{,}222-222-22-2?\] $\textbf{(A) }0\qquad\textbf{(B) }2\qquad\textbf{(C) }4\qquad\textbf{(D) }6\qquad\textbf{(E) }8$

In an island there are $n$ castles, and each castle is in country $A$ or $B$. There is one commander per castle, and each commander belongs to the same country as the castle he's initially in. There are some (two-way) roads between castles (there may be roads between castles of different countries), and call two castles adjacent if there is a road between them. Prove that the following two statements are equivalent: (1) If some commanders from country $B$ move to attack an adjacent castle in country $A$, some commanders from country $A$ could appropriately move in defense to adjacent castles in country $A$ so that in every castle of country $A$, the number of country $A$'s commanders defending that castle is not less than the number of country $B$'s commanders attacking that castle. (Each commander can defend or attack only one castle at a time.) (2) For any arbitrary set $X$ of castles in country $A$, the number of country $A$'s castles that are in $X$ or adjacent to at least one of the castle in $X$ is not less than the number of country $B$'s castles that are adjacent to at least one of the castles in $X$.

In convex quadrilateral $ ABCD$, $ AB\equal{}a$, $ BC\equal{}b$, $ CD\equal{}c$, $ DA\equal{}d$, $ AC\equal{}e$, $ BD\equal{}f$. If $ \max \{a,b,c,d,e,f \}\equal{}1$, then find the maximum value of $ abcd$.