Prove that the unit square can be tiled with rectangles (not necessarily of the same size) similar to a rectangle of size $1\times(3+\sqrt[3]{3})$.

Let $x$ and $y$ be real numbers such that \[ 2 < \frac{x - y}{x + y} < 5. \] If $\frac{x}{y}$ is an integer, what is its value?

Find all functions $f$ from the positive integers to the positive integers such that such that for all integers $x, y$ we have $$2yf(f(x^2)+x)=f(x+1)f(2xy).$$

Let $a, b, c$ be positive real numbers. Prove that $$8(a+b+c) \left(\frac{a}{b}+\frac{b}{c}+\frac{c}{a} \right) \le 9 \left(1+\frac{a}{b} \right)\left(1+\frac{b}{c} \right)\left(1+\frac{c}{a} \right)$$

How many non-negative integer solutions are there for $x^4-2y^2=1$?

Prove the inequality $ \sqrt {2 \plus{} \sqrt [3]{3 \plus{} ... \plus{} \sqrt [{2008}]{2008}}} < 2$

Functions $ f$ and $ g$ are quadratic, $ g(x) \equal{} \minus{} f(100 \minus{} x)$, and the graph of $ g$ contains the vertex of the graph of $ f$. The four $ x$-intercepts on the two graphs have $ x$-coordinates $ x_1$, $ x_2$, $ x_3$, and $ x_4$, in increasing order, and $ x_3 \minus{} x_2 \equal{} 150$. The value of $ x_4 \minus{} x_1$ is $ m \plus{} n\sqrt p$, where $ m$, $ n$, and $ p$ are positive integers, and $ p$ is not divisible by the square of any prime. What is $ m \plus{} n \plus{} p$? $ \textbf{(A)}\ 602\qquad \textbf{(B)}\ 652\qquad \textbf{(C)}\ 702\qquad \textbf{(D)}\ 752\qquad \textbf{(E)}\ 802$

There are $2025$ people living on the island, each of whom is either a knight, i.e. always tells the truth, or a liar, which means they always lie. Some of the inhabitants of the island know each other, and everyone has at least one acquaintance, but no more than three. Each inhabitant of the island claims that there are exactly two liars among his acquaintances. a) What is the smallest possible number of knights among the inhabitants of the island? b) What is the largest possible number of knights among the inhabitants of the island? [i]Proposed by Oleksii Masalitin[/i]

There are 100 merchants who are selling salmon for Durer dollars around the circular shore of the island of Durerland. Since the beginning of times good and bad years have been alternating on the island. (So after a good year, the next year is bad; and after a bad year, the next year is good.) In every good year all merchants set their price as the maximum value between their own selling price from the year before and the selling price of their left-hand neighbour from the year before. In turn, in every bad year they sell it for the minimum between their own price from the year before and their left-hand neighbour’s price from the year before. Paul and Pauline are two merchants on the island. This year Paul is selling salmon for 17 Durer dollars a kilogram. Prove that there will come a year when Pauline will sell salmon for 17 Durer dollars a kilogram. [i]Note: The merchants are immortal, they have been selling salmon on the island for thousands of years and will continue to do so until the end of time.[/i]

Let $ABC$ be a right triangle with $AB=3$, $BC=4$, and $\angle B = 90^\circ$. Points $P$, $Q$, and $R$ are chosen on segments $AB$, $BC$, and $CA$, respectively, such that $PQR$ is an equilateral triangle, and $BP=BQ$. Given that $BP$ can be written as $\frac{\sqrt{a}-b}{c}$, where $a,b,c$ are positive integers and $\gcd(b,c)=1$, what is $a+b+c$? [i]2021 CCA Math Bonanza Individual Round #6[/i]

In the isosceles triangle $ABC$ where $AB = AC$, the point $I{}$ is the center of the inscribed circle. Through the point $A{}$ all the rays lying inside the angle $BAC$ are drawn. For each such ray, we denote by $X{}$ and $Y{}$ the points of intersection with the arc $BIC$ and the straight line $BC$ respectively. The circle $\gamma$ passing through $X{}$ and $Y{}$, which touches the arc $BIC$ at the point $X{}$ is considered. Prove that all the circles $\gamma$ pass through a fixed point.

Given integers $a,b,c,d,m,n$ such that $ad-bc\ne 0$ and any real $\varepsilon >0$, show that one can find rational numbers $x,y$ such that $0<|ax+by-m|<\varepsilon$ and $0<|cx+dy-n|<\varepsilon$.

Find all functions $f : \mathbb{Z}\to \mathbb{Z}$ that satisfy: $i) f(f(x))=x, \forall x\in\mathbb{Z}$ $ii)$ For any integer $x$ and $y$ such that $x + y$ is odd, it holds that $f(x) + f(y) \ge x + y.$

Let $ ABCD$ be a parellogram with $ AB>AD$. Suposse the ratio between diagonals $ AC$ and $ BD$ is $ \frac {AC} {BD}\equal{}3$. Let $ r$ be the line symmetric to $ AD$ with respect to $ AC$ and $ s$ the line symmetric to $ BC$ with respect to $ BD$. If $ r$ and $ s$ intersect at $ P$ , find the ratio $ \frac {PA} {PB}$ Daniel

Scalene triangle $ABC$ has incenter $I$ and circumcircle $\Omega$ with center $O$. $H$ is the orthocenter of triangle $BIC$, and $T$ is a point on $\Omega$ for which $\angle ATI=90^\circ$. Circle $(AIO)$ intersects line $IH$ again at $X$. Show that the lines $AX, HT$ intersect on $\Omega$.

Let $ABCD$ be a cyclic quadrilateral whose center of the circumscribed circle is inside this quadrilateral, and its diagonals intersect in point $S{}$. Let $P{}$ and $Q{}$ be the centers of the curcimuscribed circles of triangles $ABS$ and $BCS$. The lines through the points $P{}$ and $Q{}$, which are parallel to the sides $AD$ and $CD$, respectively, intersect at the point $R$. Prove that the point $R$ lies on the line $BD$.

At a certain grocery store, cookies may be bought in boxes of $10$ or $21.$ What is the minimum positive number of cookies that must be bought so that the cookies may be split evenly among $13$ people? [i]Author: Ray Li[/i]

Can you make $2015$ positive integers $1,2, \ldots , 2015$ to be a certain permutation which can be ordered in the circle such that the sum of any two adjacent numbers is a multiple of $4$ or a multiple of $7$?

Let $k$ be a circle centered at $M$ and let $t$ be a tangentline to $k$ through some point $T\in k$. Let $P$ be a point on $t$ and let $g\neq t$ be a line through $P$ intersecting $k$ at $U$ and $V$. Let $S$ be the point on $k$ bisecting the arc $UV$ not containing $T$ and let $Q$ be the the image of $P$ under a reflection over $ST$. Prove that $Q$, $T$, $U$ and $V$ are vertices of a trapezoid.

Let $ABC$ be a triangle such that such that $AB=14, BC=13$, and $AC=15$. Let $X$ be a point inside triangle $ABC$. Compute the minimum possible value of $(\sqrt{2}AX+BX+CX)^2$.

Does there exist a right angled triangle, which hypotenuse is $2016^{2017}$ and two other sides positive integers.

Each square in a $5 \times 5$ grid is either filled or empty, and has up to eight adjacent neighboring squares, where neighboring squares share either a side or a corner. The grid is transformed by the following rules: [list] [*] Any filled square with two or three filled neighbors remains filled. [*] Any empty square with exactly three filled neighbors becomes a filled square. [*] All other squares remain empty or become empty. [/list] A sample transformation is shown in the figure below. [asy] import geometry; unitsize(0.6cm); void ds(pair x) { filldraw(x -- (1,0) + x -- (1,1) + x -- (0,1)+x -- cycle,gray+opacity(0.5),invisible); } ds((1,1)); ds((2,1)); ds((3,1)); ds((1,3)); for (int i = 0; i <= 5; ++i) { draw((0,i)--(5,i)); draw((i,0)--(i,5)); } label("Initial", (2.5,-1)); draw((6,2.5)--(8,2.5),Arrow); ds((10,2)); ds((11,1)); ds((11,0)); for (int i = 0; i <= 5; ++i) { draw((9,i)--(14,i)); draw((i+9,0)--(i+9,5)); } label("Transformed", (11.5,-1)); [/asy] Suppose the $5 \times 5$ grid has a border of empty squares surrounding a $3 \times 3$ subgrid. How many initial configurations will lead to a transformed grid consisting of a single filled square in the center after a single transformation? (Rotations and reflections of the same configuration are considered different.) [asy] import geometry; unitsize(0.6cm); void ds(pair x) { filldraw(x -- (1,0) + x -- (1,1) + x -- (0,1)+x -- cycle,gray+opacity(0.5),invisible); } for (int i = 1; i < 4; ++ i) { for (int j = 1; j < 4; ++j) { label("?",(i + 0.5, j + 0.5)); } } for (int i = 0; i <= 5; ++i) { draw((0,i)--(5,i)); draw((i,0)--(i,5)); } label("Initial", (2.5,-1)); draw((6,2.5)--(8,2.5),Arrow); ds((11,2)); for (int i = 0; i <= 5; ++i) { draw((9,i)--(14,i)); draw((i+9,0)--(i+9,5)); } label("Transformed", (11.5,-1)); [/asy] $$\textbf{(A) 14}~\textbf{(B) 18}~\textbf{(C) 22}~\textbf{(D) 26}~\textbf{(E) 30}$$

In the triangle $ABC$, let $B_1$ be on $AC, E$ on $AB, G$ on $BC$, and let $EG$ be parallel to $AC$. Furthermore, let $EG$ be tangent to the inscribed circle of the triangle $ABB_1$ and intersect $BB_1$ at $F$. Let $r, r_1$, and $r_2$ be the inradii of the triangles $ABC, ABB_1$, and $BFG$, respectively. Prove that $r = r_1 + r_2.$

Find the area enclosed by the graph of $a^2x^4=b^2x^2-y^2\ (a>0,\ b>0).$

For a science project, Sammy observed a chipmunk and a squirrel stashing acorns in holes. The chipmunk hid $3$ acorns in each of the holes it dug. The squirrel hid $4$ acorns in each of the holes it dug. They each hid the same number of acorns, although the squirrel needed $4$ fewer holes. How many acorns did the chipmunk hide? ${{ \textbf{(A)}\ 30\qquad\textbf{(B)}\ 36\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 48}\qquad\textbf{(E)}\ 54} $