Areas of four surfaces of a tetrahedron are $S_1,S_2,S_3,S_4$. And the largest one of them is $S$. $\lambda=\frac{S_1+S_2+S_3+S_4}{S}$, then $\lambda$ always satisfies $\text{(A)}2<\lambda\leq4\qquad\text{(B)}3<\lambda<4\qquad\text{(C)}2.5<\lambda\leq4.5\qquad\text{(D)}3.5<\lambda<5.5$

Let $p$ be a prime number and $F=\left \{0,1,2,...,p-1 \right \}$. Let $A$ be a proper subset of $F$ that satisfies the following property: if $a,b \in A$, then $ab+1$ (mod $p$) $ \in A$. How many elements can $A$ have? (Justify your answer.)

Given an acute-angled triangle $ABC$, let points $A' , B' , C'$ be located as follows: $A'$ is the point where altitude from $A$ on $BC$ meets the outwards-facing semicircle on $BC$ as diameter. Points $B', C'$ are located similarly. Prove that $A[BCA']^2 + A[CAB']^2 + A[ABC']^2 = A[ABC]^2$ where $A[ABC]$ is the area of triangle $ABC$.

Let $\theta$ be an obtuse angle with $\sin{\theta}=\frac{3}{5}$. If an ant starts at the origin and repeatedly moves $1$ unit and turns by an angle of $\theta$, there exists a region $R$ in the plane such that for every point $P\in R$ and every constant $c>0$, the ant is within a distance $c$ of $P$ at some point in time (so the ant gets arbitrarily close to every point in the set). What is the largest possible area of $R$? [i]2020 CCA Math Bonanza Individual Round #15[/i]

Consider the sytem of equations \[ a_{11}x_1+a_{12}x_2+a_{13}x_3 = 0 \]\[a_{21}x_1+a_{22}x_2+a_{23}x_3 =0\]\[a_{31}x_1+a_{32}x_2+a_{33}x_3 = 0 \] with unknowns $x_1, x_2, x_3$. The coefficients satisfy the conditions: a) $a_{11}, a_{22}, a_{33}$ are positive numbers; b) the remaining coefficients are negative numbers; c) in each equation, the sum ofthe coefficients is positive. Prove that the given system has only the solution $x_1=x_2=x_3=0$.

In $\vartriangle ABC$, the incircle is tangent to the sides $BC, CA, AB$ at $D, E, F$ respectively. Let $P$ and $Q$ be the midpoints of $DF$ and $DE$ respectively. Lines $P C$ and $DE$ intersect at $R$, and lines $BQ$ and$ DF$ intersect at $S$. Prove that a) Points $B, C, P, Q$ lie on a circle. b) Points $P, Q, R, S$ lie on a circle.

A set of $1985$ points is distributed around the circumference of a circle and each of the points is marked with $1$ or $-1$. A point is called “good” if the partial sums that can be formed by starting at that point and proceeding around the circle for any distance in either direction are all strictly positive. Show that if the number of points marked with $-1$ is less than $662$, there must be at least one good point.

Sofia places the dice on a table as shown in the figure, matching faces that have the same number on each die. She circles the table without touching the dice. What is the sum of the numbers of all the faces that she cannot see? $Note$. In all given the numbers on the opposite faces add up to 7.

Find the greatest real $k$ such that, for every tetrahedron $ABCD$ of volume $V$, the product of areas of faces $ABC,ABD$ and $ACD$ is at least $kV^2$.

The vertices of a regular nonagon are colored such that $1)$ adjacent vertices are different colors and $2)$ if $3$ vertices form an equilateral triangle, they are all different colors. Let $m$ be the minimum number of colors needed for a valid coloring, and n be the total number of colorings using $m$ colors. Determine $mn$. (Assume each vertex is distinguishable.)

Consider the set of all rectangles with a given area $S$. Find the largest value o $ M = \frac{16-p}{p^2+2p}$ where $p$ is the perimeter of the rectangle.

For each positive integer $k$, let $n_k$ be the smallest positive integer such that there exists a finite set $A$ of integers satisfy the following properties: [list] [*]For every $a\in A$, there exists $x,y\in A$ (not necessary distinct) that $$n_k\mid a-x-y$$[/*] [*]There's no subset $B$ of $A$ that $|B|\leq k$ and $$n_k\mid \sum_{b\in B}{b}.$$ [/list] Show that for all positive integers $k\geq 3$, we've $$n_k<\Big( \frac{13}{8}\Big)^{k+2}.$$

Find the number of pairs $(n, q)$, where $n$ is a positive integer and $q$ a non-integer rational number with $0 < q < 2000$, that satisfy $\{q^2\}=\left\{\frac{n!}{2000}\right\}$

Find all sets of real numbers $\{a_1,a_2,\ldots, _{1375}\}$ such that \[2 \left( \sqrt{a_n - (n-1)}\right) \geq a_{n+1} - (n-1), \quad \forall n \in \{1,2,\ldots,1374\},\] and \[2 \left( \sqrt{a_{1375}-1374} \right) \geq a_1 +1.\]

Let $ABC$ be an equilateral triangle. For an arbitrary line $\ell$. through $B$, the orthogonal projections of $A$ and $C$ on $\ell$ are denoted by $D$ and $E$ respectively. If $D\ne E$, equilateral triangles $DEP$ and $DET$ are constructed on different sides of $\ell$. Find the loci of $P$ and $T$.

We consider triangles $ABC$, in which the point $M$ lies on the side $AB$, $AM = a$, $BM = b$, $CM = c$ ($c <a, c <b$). Find the smallest radius of the circumcircle of such triangles.

Bob proposes the following game to Johanna. The board in the figure is an equilateral triangle subdivided in turn into $256$ small equilateral triangles, one of which is painted in black. Bob chooses any point inside the board and places a small token. Johanna can make three types of plays. Each of them consists of choosing any of the $3$ vertices of the board and move the token to the midpoint between the current position of the tile and the chosen vertex. In the second figure we see an example of a move in which Johana chose vertex $A$. Johanna wins if she manages to place her piece inside the triangle black. Prove that Johanna can always win in at most $4$ moves. [asy] unitsize(8 cm); pair A, B, C; int i; A = dir(60); C = (0,0); B = (1,0); fill((6/16*(1,0) + 1/16*dir(60))--(7/16*(1,0) + 1/16*dir(60))--(6/16*(1,0) + 2/16*dir(60))--cycle, gray(0.7)); draw(A--B--C--cycle); for (i = 1; i <= 15; ++i) { draw(interp(A,B,i/16)--interp(A,C,i/16)); draw(interp(B,C,i/16)--interp(B,A,i/16)); draw(interp(C,A,i/16)--interp(C,B,i/16)); } label("$A$", A, N); label("$B$", B, SE); label("$C$", C, SW); [/asy] [asy] unitsize(8 cm); pair A, B, C, X, Y, Z; int i; A = dir(60); C = (0,0); B = (1,0); X = 9.2/16*(1,0) + 3.3/16*dir(60); Y = (A + X)/2; Z = rotate(60,X)*(Y); fill((6/16*(1,0) + 1/16*dir(60))--(7/16*(1,0) + 1/16*dir(60))--(6/16*(1,0) + 2/16*dir(60))--cycle, gray(0.7)); draw(A--B--C--cycle); for (i = 1; i <= 15; ++i) { draw(interp(A,B,i/16)--interp(A,C,i/16)); draw(interp(B,C,i/16)--interp(B,A,i/16)); draw(interp(C,A,i/16)--interp(C,B,i/16)); } draw(A--X, dotted); draw(arc(Z,abs(X - Y),-12,40), Arrow(6)); label("$A$", A, N); label("$B$", B, SE); label("$C$", C, SW); dot(A); dot(X); dot(Y); [/asy]

Discuss the solvability of the equations \begin{align*}\lambda x+y+z&=a\\x+\lambda y+z&=b\\x+y+\lambda z&=c\end{align*}for all numbers $\lambda,a,b,c\in\mathbb R$.

[color=blue][size=150]PERU TST IMO - 2006[/size] Saturday, may 20.[/color] [b]Question 04[/b] In an actue-angled triangle $ABC$ draws up: its circumcircle $w$ with center $O$, the circumcircle $w_1$ of the triangle $AOC$ and the diameter $OQ$ of $w_1$. The points are chosen $M$ and $N$ on the straight lines $AQ$ and $AC$, respectively, in such a way that the quadrilateral $AMBN$ is a parallelogram. Prove that the intersection point of the straight lines $MN$ and $BQ$ belongs the circumference $w_1.$ --- [url=http://www.mathlinks.ro/Forum/viewtopic.php?t=88513]Spanish version[/url] $\text{\LaTeX}{}$ed by carlosbr

Consider the following array: \[ 3, 5\\3, 8, 5\\3, 11, 13, 5\\3, 14, 24, 18, 5\\3, 17, 38, 42, 23, 5\\ \ldots \] Find the 5-th number on the $ n$-th row with $ n>5$.

Let $p$ be a prime number and $A$ an infinite subset of the natural numbers. Let $f_A(n)$ be the number of different solutions of $x_1+x_2+\ldots +x_p=n$, with $x_1,x_2,\ldots x_p\in A$. Does there exist a number $N$ for which $f_A(n)$ is constant for all $n<N$?

Let $A_1$ be the center of the square inscribed in acute triangle $ABC$ with two vertices of the square on side $BC$. Thus one of the two remaining vertices of the square is on side $AB$ and the other is on $AC$. Points $B_1,\ C_1$ are defined in a similar way for inscribed squares with two vertices on sides $AC$ and $AB$, respectively. Prove that lines $AA_1,\ BB_1,\ CC_1$ are concurrent.

Consider points $ P$ which are inside the square with side length $ a$ such that the distance from $ P$ to the center of the square equals to the least distance from $ P$ to each side of the square.Find the area of the figure formed by the whole points $ P$.

Ten test papers are to be prepared for the National Olympiad. Each paper has 4 problems, and no two papers have more than 1 problem in common. At least how many problems are needed?

Find the number of ways to partition $S = \{1, 2, 3, \dots, 2020\}$ into two disjoint sets $A$ and $B$ with $A \cup B = S$ so that if you choose an element $a$ from $A$ and an element $b$ from $B$, $a+b$ is never a multiple of $20$. $A$ or $B$ can be the empty set, and the order of $A$ and $B$ doesn't matter. In other words, the pair of sets $(A,B)$ is indistinguishable from the pair of sets $(B,A)$. [i]Proposed by Timothy Qian[/i]