a) prove that every discrete subgroup of $(\mathbb R^2,+)$ is in one of these forms: i-$\{0\}$. ii-$\{mv|m\in \mathbb Z\}$ for a vector $v$ in $\mathbb R^2$. iii-$\{mv+nw|m,n\in \mathbb Z\}$ for tho linearly independent vectors $v$ and $w$ in $\mathbb R^2$.(lattice $L$) b) prove that every finite group of symmetries that fixes the origin and the lattice $L$ is in one of these forms: $\mathcal C_i$ or $\mathcal D_i$ that $i=1,2,3,4,6$ ($\mathcal C_i$ is the cyclic group of order $i$ and $\mathcal D_i$ is the dyhedral group of order $i$).(20 points)

Prove that there is a unique function $f: N\to N$, that verifies $$f(a + b)f(a - b) = f(a^2)$$, for any $a, b\in N$ such that $a > b$.

A driver travels for $2$ hours at $60$ miles per hour, during which her car gets $30$ miles per gallon of gasoline. She is paid $\$0.50$ per mile, and her only expense is gasoline at $\$2.00$ per gallon. What is her net rate of pay, in dollars per hour, after this expense? $\textbf{(A) }20 \qquad\textbf{(B) }22 \qquad\textbf{(C) }24 \qquad\textbf{(D) } 25\qquad\textbf{(E) } 26$

Let $(a_n)_{n\geq 1}$ be a sequence for real numbers given by $a_1=1/2$ and for each positive integer $n$ \[ a_{n+1}=\frac{a_n^2}{a_n^2-a_n+1}. \] Prove that for every positive integer $n$ we have $a_1+a_2+\cdots + a_n<1$.

Let be a finite set $ A $ of real numbers, and define the sets $ S_{\pm }=\{ x\pm y| x,y\in A \} . $ Show that $ \left| A \right|\cdot\left| S_{-} \right| \le \left| S_{+} \right|^2 . $

Let $A_1A_2A_3A_4$ be a rectangle and let $S_1,S_2,S_3,S_4$ four circumferences inside of the rectangle such that $S_k$ and $S_{k+1}$ are tangent to each other and tangent to the side $A_kA_{k+1}$ for $k=1,2,3,4$, where $A_5=A_1$ and $S_5=S_1$. Prove that $A_1A_2A_3A_4$ is a square.

Consider an infinite strip, divided into unit squares. A finite number of nuts is placed in some of these squares. In a step, we choose a square $A$ which has more than one nut and take one of them and put it on the square on the right, take another nut (from $A$) and put it on the square on the left. The procedure ends when all squares has at most one nut. Prove that, given the initial configuration, any procedure one takes will end after the same number of steps and with the same final configuration.

Let $a,b,c,n$ be positive integers such that the following conditions hold (i) numbers $a,b,c,a+b+c$ are pairwise coprime, (ii) number $(a+b)(b+c)(c+a)(a+b+c)(ab+bc+ca)$ is a perfect $n$-th power. Prove, that the product $abc$ can be expressed as a difference of two perfect $n$-th powers.

Let $R$ be a commutative ring with $1$ such that the number of elements of $R$ is equal to $p^3$ where $p$ is a prime number. Prove that if the number of elements of $\text{zd}(R)$ be in the form of $p^n$ ($n \in \mathbb{N^*}$) where $\text{zd}(R) = \{a \in R \mid \exists 0 \neq b \in R, ab = 0\}$, then $R$ has exactly one maximal ideal.

Four circles $\omega,$ $\omega_{A},$ $\omega_{B},$ and $\omega_{C}$ with the same radius are drawn in the interior of triangle $ABC$ such that $\omega_{A}$ is tangent to sides $AB$ and $AC$, $\omega_{B}$ to $BC$ and $BA$, $\omega_{C}$ to $CA$ and $CB$, and $\omega$ is externally tangent to $\omega_{A},$ $\omega_{B},$ and $\omega_{C}$. If the sides of triangle $ABC$ are $13,$ $14,$ and $15,$ the radius of $\omega$ can be represented in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

The incircle of triangle $ABC$ touches $BC$ at $D$ and $AC$ at $E$. Let $K$ be the point on $CB$ with $CK=BD$, and $L$ be the point on $CA$ with $AE=CL$. Lines $AK$ and $BL$ meet at $P$. If $Q$ is the midpoint of $BC$, $I$ the incenter, and $G$ the centroid of $\triangle ABC$, show that: $(a)$ $IQ$ and $AK$ are parallel, $(b)$ the triangles $AIG$ and $QPG$ have equal area.

The Fibonacci sequence is given by $x_1 = x_2 = 1$ and $x_{k+2} = x_{k+1} + x_k$ for each $k \in N$. (a) Prove that there are Fibonacci numbes that end in a $9$ in the decimal system. (b) Determine for which $n$ can a Fibonacci number end in $n$ $9$-s in the decimal system.

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Prove that exists a infinity of triplets $a, b, c\in\mathbb{R}$ satisfying simultaneously the relations $a+b+c=0$ and $a^4+b^4+c^4=50$. Moldova National Math Olympiad 2010, 12th grade

A rectangular box with side lengths $1$, $2$, and $16$ is cut into two congruent smaller boxes with integer side lengths. Compute the square of the largest possible length of the space diagonal of one of the smaller boxes. [i]2020 CCA Math Bonanza Lightning Round #2.2[/i]

[i]Nocycleland[/i] is a country with $500$ cities and $2013$ two-way roads, each one of them connecting two cities. A city $A$ [i]neighbors[/i] $B$ if there is one road that connects them, and a city $A$ [i]quasi-neighbors[/i] $B$ if there is a city $C$ such that $A$ neighbors $C$ and $C$ neighbors $B$. It is known that in Nocycleland, there are no pair of cities connected directly with more than one road, and there are no four cities $A$, $B$, $C$ and $D$ such that $A$ neighbors $B$, $B$ neighbors $C$, $C$ neighbors $D$, and $D$ neighbors $A$. Show that there is at least one city that quasi-neighbors at least $57$ other cities.

Prove that for any positive integer $n\ge $, $2 \cdot \sqrt3 \cdot \sqrt[3]{4} ...\sqrt[n-1]{n} > n$

The point P lies on the side $CD$ of the parallelogram $ABCD$ with $\angle DBA = \angle CBP$. Point $O$ is the center of the circle passing through the points $D$ and $P$ and tangent to the straight line $AD$ at point $D$. Prove that $AO = OC$.

Draw a tangent with positive slope to a parabola $y=x^2+1$. Find the $x$-coordinate such that the area of the figure bounded by the parabola, the tangent and the coordinate axisis is $\frac{11}{3}.$

In a fish shop with 28 kinds of fish, there are 28 fish sellers. In every seller, there exists only one type of each fish kind, depending on where it comes, Mediterranean or Black Sea. Each of the $k$ people gets exactly one fish from each seller and exactly one fish of each kind. For any two people, there exists a fish kind which they have different types of it (one Mediterranean, one Black Sea). What is the maximum possible number of $k$?

Let $S$ be a set of $\displaystyle { 2n \choose n } + 1$ real numbers, where $n$ is an positive integer. Prove that there exists a monotone sequence $\{a_i\}_{1\leq i \leq n+2} \subset S$ such that \[ |x_{i+1} - x_1 | \geq 2 | x_i - x_1 | , \] for all $i=2,3,\ldots, n+1$.

Let $D_{1}, D_{2}, . . . , D_{n}$ be rectangular parallelepipeds in space, with edges parallel to the $x, y, z$ axes. For each $D_{i}$, let $x_{i} , y_{i} , z_{i}$ be the lengths of its projections onto the $x, y, z$ axes, respectively. Suppose that for all pairs $D_{i}$ , $D_{j}$, if at least one of $x_{i} < x_{j}$ , $y_{i} < y_{j}$, $z_{i} < z_{j}$ holds, then $x_{i} \leq x_{j}$ , $y_{i} \leq y_{j}$, and $z_{i} < z_{j}$ . If the volume of the region $\bigcup^{n}_{i=1}{D_{i}}$ equals 1997, prove that there is a subset $\{D_{i_{1}}, D_{i_{2}}, . . . , D_{i_{m}}\}$ of the set $\{D_{1}, . . . , D_{n}\}$ such that $(i)$ if $k \not= l $ then $D_{i_{k}} \cap D_{i_{l}} = \emptyset $, and $(ii)$ the volume of $\bigcup^{m}_{k=1}{D_{i_{k}}}$ is at least 73.

Let $ n\ge 3 $ be a natural number and $ A_0A_1...A_{n-1} $ a regular polygon. Consider $ B_0 $ on the segment $ A_0A_1 $ such that $ A_0B_0<\frac{1}{2}A_0A_1; B_1 $ on $ A_1A_2 $ so that $ A_1B_1<\frac{1}{2} A_1A_2; $ etc.; $ B_{n-2} $ on $ A_{n-2}A_{n-1} $ so that $ A_{n-2}B_{n-2} <\frac{1}{2} A_{n-2}A_{n-1} , $ and $ B_{n-1} $ on $ A_{n-1}A_0 $ with $ A_{n-1}B_{n-1} <\frac{1}{2} A_{n-1}A_{0} . $ Show that the perimeter of any ploygon that has its vertices on the segments $ A_1B_1,A_2B_2,...,A_{n-1}B_{n-1}, $ is equal or greater than the perimeter of $ B_0B_1...B_{n-1} . $

Find the sum of all integers $n$ with this property: both $n$ and $n + 2021$ are perfect squares.

There are four points $A, B, C, D$ on a circle. Circles are drawn through each pair of neighboring points. Denote the intersection points of neighboring circles by $A_1, B_1, C_1, D_1$. (Some of these points may coincide with previously given ones.) Prove that points $A_1, B_1, C_1, D_1$ lie on one circle.