[b]3.[/b] Let $f(z)$ with $f(0)=1$ be regular in the unit disk and let $\left [\frac{\partial^2 \mid f(z)\mid}{\partial x\partial y} \right ] _{z=0} =1$. Show thatthe area of the image of the unit disk by $w= f(z)$ (taken with multiplicity) is not less than $\frac {1} {2}$ .[b](f. 6)[/b]

Let $ x$, $ y$ be two integers with $ 2\le x, y\le 100$. Prove that $ x^{2^n} \plus{} y^{2^n}$ is not a prime for some positive integer $ n$.

For $n \ge 2$ consider $n \times n$ board and mark all $n^2$ centres of all unit squares. What is the maximal possible number of marked points that we can take such that there don't exist three taken points which form right triangle? [i]Proposed by Mykhailo Shtandenko[/i]

Three circles of equal radius have a common point $O$ and lie inside a given triangle. Each circle touches a pair of sides of the triangle. Prove that the incenter and the circumcenter of the triangle are collinear with the point $O$.

Let $(a_1,a_2,a_3,a_4,a_5)$ be a random permutation of the integers from $1$ to $5$ inclusive. Find the expected value of $$\sum^5_{i=1} |a_i -i | = |a_1 -1|+|a_2 -2|+|a_3 -3|+|a_4 -4|+|a_5 -5|.$$ [i]Proposed by Muztaba Syed[/i]

Given that real numbers $a$, $b$, and $c$ satisfy $ab=3$, $ac=4$, and $b+c=5$, the value of $bc$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$. [i]2021 CCA Math Bonanza Team Round #2[/i]

Find the sum of all positive integers $x$ such that $3 \times 2^x = n^2 -1$ for some positive integer $n$.

Denote by $C,\ l$ the graphs of the cubic function $C: y=x^3-3x^2+2x$, the line $l: y=ax$. (1) Find the range of $a$ such that $C$ and $l$ have intersection point other than the origin. (2) Denote $S(a)$ by the area bounded by $C$ and $l$. If $a$ move in the range found in (1), then find the value of $a$ for which $S(a)$ is minimized. 50 points

For any positive integer $n$ let $f(n)$ be the number of divisors of $n$ ending with $1$ or $9$ in base $10$ and let $g(n)$ be the number of divisors of $n$ ending with digit $3$ or $7$ in base $10$. Prove that $f(n)\geqslant g(n)$ for all nonnegative integers $n$. [i](Swiss Mathematical Olympiad 2011, Final round, problem 9)[/i]

Given is an isosceles trapezoid $ABCD$, such that $AD$ and $BC$ are bases and $AD=2AB$, and it is inscribed in a circle $c$. Points $E$ and $F$ are selected on a circle $c$ so that $AC$ || $DE$ and $BD$ || $AF$. The line $BE$ intersects lines $AC$ and $AF$ at points $X$ and $Y$, respectively. Prove that the circumcircles of triangles $BCX$ and $EFY$ are tangent to each other.

Let $h$ be a semicircle with diameter $AB$. Let $P$ be an arbitrary point inside the diameter $AB$. The perpendicular through $P$ on $AB$ intersects $h$ at point $C$. The line $PC$ divides the semicircular area into two parts. A circle will be inscribed in each of them that touches $AB, PC$ and $h$. The points of contact of the two circles with $AB$ are denoted by $D$ and $E$, where $D$ lies between $A$ and $P$. Prove that the size of the angle $DCE$ does not depend on the choice of $P$. (Walther Janous)

The measures, in degrees, of the angles , $\alpha, \beta$ and $\theta$ are greater than $0$ less than $60$. Find the value of $\theta$ knowing, also, that $\alpha + \beta = 2\theta$ and that $$\sin \alpha \sin \beta \sin \theta = \sin(60 - \alpha ) \sin(60 - \beta) \sin(60 - \theta ).$$

Given $a,b,c>0$ such that $$a+b+c+\frac{1}{abc}=\frac{19}{2}$$ What is the greatest value for $a$?

Find all real numbers $x$ such that $\left\lfloor x^2 \right\rfloor + \left\lceil x^2 \right\rceil = 2003$.

In a triangle $[ABC]$, $\angle C = 2\angle A$. A point $D$ is marked on the side $[AC]$ such that $\angle ABD = \angle DBC$. Knowing that $AB = 10$ and $CD = 3$, what is the length of the side $[BC]$?

Suppose $X, Y, Z$ are collinear points in that order such that $XY = 1$ and $YZ = 3$. Let $W$ be a point such that $YW = 5$, and define $O_1$ and $O_2$ as the circumcenters of triangles $\triangle WXY$ and $\triangle WYZ$, respectively. What is the minimum possible length of segment $\overline{O_1O_2}$?

Find all $n\in\mathbb{Z}$ such that the number $\sqrt{\frac{4n-2}{n+5}}$ is rational.

Determine whether or not there exist two different sets $A,B$, each consisting of at most $2011^2$ positive integers, such that every $x$ with $0 < x < 1$ satisfies the following inequality: \[\left| \sum_{a \in A} x^a - \sum_{b \in B} x^b \right| < (1-x)^{2011}.\]

A point $P$ in the interior of a convex polyhedron in Euclidean space is called a [i]pivot point[/i] of the polyhedron if every line through $P$ contains exactly $0$ or $2$ vertices of the polyhedron. Determine, with proof, the maximum number of pivot points that a polyhedron can contain.

Consider the following two-player game: player $A$ (first mover) and $B$ take turns to write a positive integer less than or equal to $10$ on the blackboard. The integer written at any step cannot be a factor of any existing integer on board. Determine, with proof, who wins.

Point $M$ is chosen in triangle $ABC$ so that the radii of the circumcircles of triangles $AMC, BMC$, and $BMA$ are no smaller than the radius of the circumcircle of $ABC$. Prove that all four radii are equal.

A sleeping rabbit lies in the interior of a convex $2024$-gon. A hunter picks three vertices of the polygon and he lays a trap which covers the interior and the boundary of the triangular region determined by them. Determine the minimum number of times he needs to do this to guarantee that the rabbit will be trapped. [i]Proposed by Anant Mudgal and Rohan Goyal[/i]

Find all positive integers $a, b, c$ such that $a < b$, $a < 4c$, and $b c^3 \le a c^3 + b$.

The line $L$ is parallel to the plane $y=z$ and meets the parabola $2x=y^2 ,z=0$ and the parabola $3x=z^2, y=0$. Prove that if $L$ moves freely subject to these constraints then it generates the surface $x=(y-z)\left(\frac{y}{2}-\frac{z}{3}\right)$.

a) A certain locker room contains $n$ lockers numbered $1,2,\ldots,n$ and all are originally locked. An attendant performs a sequence of operations $T_1, T_2 ,\ldots, T_n$, whereby with the operation $T_k$ the state of those lockers whose number is divisible by $k$ is swapped. After all $n$ operations have been performed, it is observed that all lockers whose number is a perfect square (and only those lockers) are open. Prove this. b) Investigate in a meaningful mathematical way a procedure or set of operations similar to those above which will produce the set of cubes, or the set of numbers of the form $2 m^2 $, or the set of numbers of the form $m^2 +1$, or some nontrivial similar set of your own selection.