What is the largest number of regions into which a plane can be divided by drawing $n$ pairs of parallel lines?

Identical rectangular cardboard pieces are handed out to $30$ students, one to each. Each student cuts (parallel to the edges) his or her piece into equally large squares. Two different students’ squares do not necessarily have the same size. After all the cutting it turns out that the total number of squares is a prime. Prove that the original cardboard pieces must have been quadratic.

i) Given line segments $A,B,C,D$ with $A$ the longest, construct a quadrilateral with these sides and with $A$ and $B$ parallel, when possible. ii) Given any acute-angled triangle $ABC$ and one altitude $AH$, select any point $D$ on $AH$, then draw $BD$ and extend until it intersects $AC$ in $E$, and draw $CD$ and extend until it intersects $AB$ in $F$. Prove that $\angle AHE = \angle AHF$.

Function $f(x)$ is defined on $[0,1]$, $f(0)=f(1)$. For any $x_1,x_2\in [0,1], |f(x_1)-f(x_2)|<|x_1-x_2|(x_1\neq x_2)$. Prove that $|f(x_1)-f(x_2)|<\frac{1}{2}$.

Determine all functions $f$ from the set of non-negative integers to itself such that $f(a + b) = f(a) + f(b) + f(c) + f(d)$, whenever $a, b, c, d$, are non-negative integers satisfying $2ab = c^2 + d^2$.

Let $x_n$ the sequence defined by any nonnegatine integer $x_0$ and $x_{n+1}=1+\prod_{0 \leq i \leq n}{x_i}$ Show that there exists prime $p$ such that $p\not|x_n$ for any $n$.

In the nation of Onewaynia, certain pairs of cities are connected by roads. Every road connects exactly two cities (roads are allowed to cross each other, e.g., via bridges). Some roads have a traffic capacity of 1 unit and other roads have a traffic capacity of 2 units. However, on every road, traffic is only allowed to travel in one direction. It is known that for every city, the sum of the capacities of the roads connected to it is always odd. The transportation minister needs to assign a direction to every road. Prove that he can do it in such a way that for every city, the difference between the sum of the capacities of roads entering the city and the sum of the capacities of roads leaving the city is always exactly one. [i]Proposed by Zuming Feng and Yufei Zhao[/i]

$\pi(n)$ is the number of primes that are not bigger than $n$. For $n=2,3,4,6,8,33,\dots$ we have $\pi(n)|n$. Does exist infinitely many integers $n$ that $\pi(n)|n$?

Let $ m:[0,1]\longrightarrow\mathbb{R} $ be a metric map. [b]a)[/b] Prove that $ -\text{identity} +m $ is continuous and nonincreasing. [b]b)[/b] Show that $ \int_0^1\int_0^x (-t+m(t))dtdx=\int_0^1 (x-1)(x-m(x))dx. $ [b]c)[/b] Demonstrate that $ \int_0^1\int_0^x m(t)dtdx -\frac{1}{2}\int_0^1 m(x)dx\ge -\frac{1}{12} . $ [i]Gabriela Constantinescu[/i] and [i]Nelu Chichirim[/i]

Solve in natural numbers $a,b,c$ the system \[\left\{ \begin{array}{l}a^3 -b^3 -c^3 = 3abc \\ a^2 = 2(a+b+c)\\ \end{array} \right. \]

Prove that the equation $\prod_{cyc} (x_1-x_2)= \prod_{cyc} (x_1-x_3)$ has a solution in natural numbers where all $x_i$ are different.

In the figure, $[ABC]$ and $[DEC]$ are right triangles . Knowing that $EB = 1/2, EC = 1$ and $AD = 1$, calculate $DC$. [img]https://1.bp.blogspot.com/-nAOrVnK5JmI/X4UMb2CNTyI/AAAAAAAAMmk/TtaBESxYyJ0FsBoY2XaCGlCTc6mgmA5TQCLcBGAsYHQ/s0/2000%2Bportugal%2Bp5.png[/img]

Let $A_{1}A_{2}B_{1}B_{2}$ be a convex quadrilateral. At adjacent vertices $A_{1}$ and $A_{2}$ there are two Argentinian cities. At adjacent vertices $B_{1}$ and $B_{2}$ there are two Brazilian cities. There are $a$ Argentinian cities and $b$ Brazilian cities in the quadrilateral interior, no three of which collinear. Determine if it's possible, independently from the cities position, to build straight roads, each of which connects two Argentinian cities ou two Brazilian cities, such that: $\bullet$ Two roads does not intersect in a point which is not a city; $\bullet$ It's possible to reach any Argentinian city from any Argentinian city using the roads; and $\bullet$ It's possible to reach any Brazilian city from any Brazilian city using the roads. If it's always possible, construct an algorithm that builds a possible set of roads.

Let $ABC$ be a triangle with $AB=13$, $BC=14$, and $AC=15$. Denote by $\omega$ its incircle. A line $\ell$ tangent to $\omega$ intersects $\overline{AB}$ and $\overline{AC}$ at $X$ and $Y$ respectively. Suppose $XY=5$. Compute the positive difference between the lengths of $\overline{AX}$ and $\overline{AY}$.

Two sums, each consisting of $n$ addends , are shown below: $S = 1 + 2 + 3 + 4 + ...$ $T = 100 + 98 + 96 + 94 +...$ . For what value of $n$ is it true that $S = T$ ?

Show that the number $ 3^{{4}^{5}} \plus{} 4^{{5}^{6}}$ can be expresed as the product of two integers greater than $ 10^{2009}$

The sum of the numerical coefficients in the complete expansion of $ (x^2 \minus{} 2xy \plus{} y^2)^7$ is: $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 7 \qquad \textbf{(C)}\ 14 \qquad \textbf{(D)}\ 128 \qquad \textbf{(E)}\ 128^2$

Consider the sequence $(x_n)_{n\in\mathbb{N^*}}$ such that $$x_0=0,\quad x_1=2024,\quad x_n=x_{n-1}+x_{n-2}, \forall n\geq2.$$ Prove that there is an infinity of terms in this sequence that end with $2024.$

Show that for every convex $ n$-gon $ ( n \ge 4)$, the arithmetic mean of the lengths of its sides is less than the arithmetic mean of the lengths of all its diagonals.

Let $p_{1}, p_{2}, \cdots, p_{n}$ be distinct primes greater than $3$. Show that \[2^{p_{1}p_{2}\cdots p_{n}}+1\] has at least $4^{n}$ divisors.

Let $N$ denote the number of ordered pairs of sets $(A, B)$ such that $A \cup B$ is a size-$999$ subset of $\{1,2,\dots,1997\}$ and $(A \cap B) \cap \{1,2\} = \{1\}$. If $m$ and $k$ are integers such that $3^m5^k$ divides $N$, compute the the largest possible value of $m+k$. [i]Proposed by Michael Tang[/i]

Seller reduced price of one shirt for $20\%$,and they raised it by $10\%$. Does he needs to reduce or raise the price and how many, so that price of shirt will be reduced by $10\%$ from the original price

Let $S_n=\int_0^{\pi} \sin ^ n x\ dx\ (n=1,\ 2,\ ,\ \cdots).$ Find $\lim_{n\to\infty} nS_nS_{n+1}.$

If $x,y,z$ are real numbers and \begin{align*} 2x+y+z\leq66\\ x+2y+z\leq60\\ x+y+2z\leq70\\ x+2y+3z\leq110\\ 3x+y+2z\leq98\\ 2x+3y+z\leq89\\ \end{align*} What is the maximum possible value of $x+y+z$?

It is given positive real number $a$ such that: $$\left\{\frac{1}{a}\right\}=\{a^2\}$$ $$ 2<a^2<3$$ Find the value of $$a^{12}-\frac{144}{a}$$