Rectangle $p*q,$ where $p,q$ are relatively coprime positive integers with $p <q$ is divided into squares $1*1$.Diagonal which goes from lowest left vertice to highest right cuts triangles from some squares.Find sum of perimeters of all such triangles.

Given a real number $x,$ let $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x.$ For a certain integer $k,$ there are exactly $70$ positive integers $n_{1}, n_{2}, \ldots, n_{70}$ such that $k=\lfloor\sqrt[3]{n_{1}}\rfloor = \lfloor\sqrt[3]{n_{2}}\rfloor = \cdots = \lfloor\sqrt[3]{n_{70}}\rfloor$ and $k$ divides $n_{i}$ for all $i$ such that $1 \leq i \leq 70.$ Find the maximum value of $\frac{n_{i}}{k}$ for $1\leq i \leq 70.$

Given an isosceles trapezoid $ABCD$ with $AB = 6$, $CD = 12$, and area $36$, find $BC$.

The positive reals $a, b, c, x, y, z$ satisfy $$5a+4b+3c=5x+4y+3z.$$ Show that $$\frac{a^5}{x^4}+\frac{b^4}{y^3}+\frac{c^3}{z^2} \geq x+y+z.$$ [i]Proposed by Dominik Burek[/i]

Let $n\ge2$ be a natural number. Prove that $$\prod_{k=2}^n\ln k<\frac{\sqrt{n!}}n.$$

Let $ABCD$ be a convex quadrilateral such that $AB=4$, $BC=5$, $CA=6$, and $\triangle{ABC}$ is similar to $\triangle{ACD}$. Let $P$ be a point on the extension of $DA$ past $A$ such that $\angle{BDC}=\angle{ACP}$. Compute $DP^2$. [i]2020 CCA Math Bonanza Lightning Round #4.3[/i]

Let $ ABC$ a triangle. Let $D$ on $AB$ and $E$ on $AC$ such that $DE||BC$. Let line $DE$ intersect circumcircle of $ABC$ at two distinct points $F$ and $G$ so that line segments $BF$ and $CG$ intersect at P. Let circumcircle of $GDP$ and $FEP$ intersect again at $Q$. Prove that $A, P, Q$ are collinear.

A group of 6 students decided to make [i]study groups[/i] and [i]service activity groups[/i] according to the following principle: Each group must have exactly 3 members. For any pair of students, there are same number of study groups and service activity groups that both of the students are members. Supposing there are at least one group and no three students belong to the same study group and service activity group, find the minimum number of groups.

There are eight rooks on a chessboard, no two attacking each other. Prove that some two of the pairwise distances between the rooks are equal. (The distance between two rooks is the distance between the centers of their cell.)

We attempt to cover the plane with an infinite sequence of rectangles, overlapping allowed. (a) Is the task always possible if the area of the $n$th rectangle is $n^2$ for each $n$? (b) Is the task always possible if each rectangle is a square, and for any number $N$, there exist squares with total area greater than $N$?

Suppose $(a,b)$ is an ordered pair of integers such that the three numbers $a$, $b$, and $ab$ form an arithmetic progression, in that order. Find the sum of all possible values of $a$. [i]Proposed by Nathan Xiong[/i]

If $x=t^{(1/(t-1))}$ and $x=t^{(t/(t-1))}$, $t>0$, $t\not=1$, a relation between $x$ and $y$ is $\textbf{(A)}\ y^x=x^{1/y}\qquad \textbf{(B)}\ y^{1/x}=x^{y} \qquad \textbf{(C)}\ y^x=x^{y}\qquad \textbf{(D)}\ x^x=y^y\\ \textbf{(E)}\ \text{none of these}$

$p$ is an odd prime number. Find all $\frac{p-1}2$-tuples $\left(x_1,x_2,\dots,x_{\frac{p-1}2}\right)\in \mathbb{Z}_p^{\frac{p-1}2}$ such that $$\sum_{i = 1}^{\frac{p-1}{2}} x_{i} \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{2} \equiv \cdots \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{\frac{p - 1}{2}} \pmod p.$$ [i]Proposed by Ali Partofard[/i]

A set of $2003$ positive numbers is such that for any two numbers $a$ and $b$ included in it ($a > b$) at least one of the numbers $a + b$ or $a - b$ also included in the set. Prove that if these numbers are ordered by increasing, then the differences between adjacent numbers will be the same.

A polygon is [b]gridded[/b] if the internal angles of the polygon are either $90$ or $270$, it has integer side lengths and its sides don't intersect with each other. Prove that for all $n \ge 8$, it exist a gridded polygon with area $2n$ and perimeter $2n$.

For which real numbers $x$ and $\alpha$ inequality holds: $$\log _2 {x}+\log _x {2}+2\cos{\alpha} \leq 0$$

Find all real solutions of the system: $ x^2\plus{}2yz\equal{}x,$ $ y^2\plus{}2zx\equal{}y,$ $ z^2\plus{}2xy\equal{}z.$

Rodolfo and Gabriela have $9$ chips numbered from $1$ to $9$ and they have fun with the following game: They remove the chips one by one and alternately (until they have $3$ chips each), with the following rules: $\bullet$ Rodolfo begins the game, choosing a chip and in the following moves he must remove, each time, a chip three units greater than the last chip drawn by Gabriela. $\bullet$ Gabriela, on her turn, chooses a first chip and in the following times she must draw, each time, a chip two units smaller than the last chip that she herself drew. $\bullet$ The game is won by whoever gets the highest number by adding up their three tokens. $\bullet$ If the game cannot be completed, a tie is declared. If they play without making mistakes, how should Rodolfo play to be sure he doesn't lose?

An integer $a$ is a quadratic nonresidue modulo a prime $p$ if there does not exist $x \in Z$ such that $x^2 \equiv a$ (mod $p$). How many ordered pairs $(a, b)$ modulo $29$ exist such that $$a + b\equiv 1 \,\,\, (mod \,\,\, 29)$$ where both $a$ and $b$ are quadratic nonresidues modulo $29$?

In $\triangle ABC$, $AB = 8$, $BC = 7$, $CA = 6$ and side $BC$ is extended, as shown in the figure, to a point $P$ so that $\triangle PAB$ is similar to $\triangle PCA$. The length of $PC$ is [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=origin, P=(1.5,5), B=(8,0), C=P+2.5*dir(P--B); draw(A--P--C--A--B--C); label("$A$", A, W); label("$B$", B, E); label("$C$", C, NE); label("$P$", P, NW); label("$6$", 3*dir(A--C), SE); label("$7$", B+3*dir(B--C), NE); label("$8$", (4,0), S);[/asy] $ \textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11$

Find all real numbers $a$ such that there exist $f:\mathbb{R} \to \mathbb{R}$ with $$f(x-f(y))=f(x)+a[y]$$ for all $x,y\in \mathbb{R}$

Consider a tree with $n$ vertices, labeled with $1,\ldots,n$ in a way that no label is used twice. We change the labeling in the following way - each time we pick an edge that hasn't been picked before and swap the labels of its endpoints. After performing this action $n-1$ times, we get another tree with its labeling a permutation of the first graph's labeling. Prove that this permutation contains exactly one cycle.

$100$ students came to a party. The students who did not have friends among other students left the party first. Then those with one friend among remaining students left. Then those with $2,3, \ldots 99$ friends among remaining students left. What is the maximal number of students that can still remain at the party after that? (If $A$ is a friend of $B$, then $B$ is a friend of $A$).

Two angles are supplementary, and one angle is $9$ times as large as the other. What is the number of degrees in the measure of the larger angle?

A sequence $(a_n)^{\infty}_0$ of real numbers is called [i]convex[/i] if $2a_n\le a_{n-1}+a_{n+1}$ for all positive integers $n$. Let $(b_n)^{\infty}_0$ be a sequence of positive numbers and assume that the sequence $(\alpha^nb_n)^{\infty}_0$ is convex for any choice of $\alpha > 0$. Prove that the sequence $(\log b_n)^{\infty}_0$ is convex.