Let $ \left(a_{n} \right)_{n \equal{} 1}^{\infty }$ be a sequence on real numbers such that $ a{}_{n \plus{} 1} \equal{} a_{n} a_{n \plus{} 2}$ for every $ n\ge 1$. The number of elements in the set $ \left\{a_{n} : n\ge 1\right\}$ cannot be $\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ \text{None}$

Given a circle $k$ and two points $A$ and $B$ outside the circle. Specify how to can construct a circle with a compass and ruler, so that $A$ and $B$ lie on that circle and that circle is tangent to $k$.

Let $a, b, c, d$ be real numbers. Prove that is $$(a^2 + b^2 + 1)(c^2 + d^2 + 1) \ge 2(a + c)(b + d).$$

In a convex quadrilateral $ABCD$ the angles $\angle A$ and $\angle C$ are equal and the bisector of $\angle B$ passes through the midpoint of the side $CD$. If it is known that $CD = 3AD$, calculate $\frac{AB}{BC}$.

The cells of some rectangular $M \times n$ array are colored, each by one of two colors, so that for any two columns the number of pairs of cells situated on a same row and bearing the same color is less than the number of pairs of cells situated on a same row and bearing different colors. i) Prove that if $M=2011$ then $n \leq 2012$ (a model for the extremal case $n=2012$ does indeed exist, but you are not asked to exhibit one). ii) Prove that if $M=2011=n$, each of the colors appears at most $1006\cdot 2011$ times, and at least $1005\cdot 2011$ times. iii) Prove that if however $M=2012$ then $n \leq 1007$. ([i]Dan Schwarz[/i])

Pairwise distinct points $P_1,\dots,P_{1024}$, which lie on a circle, are marked by distinct reals $a_1,\dots,a_{1024}$. Let $P_i$ be $Q-$good for a $Q$ on the circle different than $P_1,\dots,P_{1024}$, if and only if $a_i$ is the greatest number on at least one of the two arcs $P_iQ$. Let the score of $Q$ be the number of $Q-$good points on the circle. Determine the greatest $k$ such that regardless of the values of $a_1,\dots,a_{1024}$, there exists a point $Q$ with score at least $k$.

Let $m, n$ be natural numbers and let $m\cdot n$ be a multiple of $4$. A chessboard with $m \times n$ fields are covered with $1 \times 2$ large dominoes without gaps and without overlapping. Show that the number of dominoes that are parallel to a edge of the chess board is fixed . [hide=original wording] Seien m, n natu¨rliche Zahlen und sei m · n ein Vielfaches von 4. Ein Schachbrett mit m × n Feldern sei mit 1 × 2 großen Dominosteinen lu¨ckenlos und u¨berlappungsfrei u¨berdeckt. Zeige, dass die Anzahl der Dominosteine, die zu einer fest gew¨ahlten Kante des Schachbrettes parallel sind, gerade ist. [/hide]

$ a,b,c$ are three different positive real numbers. Prove that:\[ \left|\frac{a\plus{}b}{a\minus{}b}\plus{}\frac{b\plus{}c}{b\minus{}c}\plus{}\frac{c\plus{}a}{c\minus{}a}\right|>1\]

Let $n$ and $k$ be positive integers with $k$ $\le$ $n$. In a group of $n$ people, each one or always speak the truth or always lie. Arnaldo can ask questions for any of these people provided these questions are of the type: “In set $A$, what is the parity of people who speak to true? ”, where $A$ is a subset of size $ k$ of the set of $n$ people. The answer can only be “$even$” or “$odd$”. a) For which values of $n$ and $k$ is it possible to determine which people speak the truth and which people always lie? b) What is the minimum number of questions required to determine which people speak the truth and which people always lie, when that number is finite?

$AB$ and $CD$ are perpendicular diameters of a circle. $L$ is the tangent to the circle at $A$. $M$ is a variable point on the minor arc $AC$. The ray $BM, DM$ meet the line $L$ at $P$ and $Q$ respectively. Show that $AP\cdot AQ = AB\cdot PQ$. Show how to construct the point $M$ which gives$ BQ$ parallel to $DP$. If the lines $OP$ and $BQ$ meet at $N$ find the locus of $N$. The lines $BP$ and $BQ$ meet the tangent at $D$ at $P'$ and $Q'$ respectively. Find the relation between $P'$ and $Q$'. The lines $D$P and $DQ$ meet the line $BC$ at $P"$ and $Q"$ respectively. Find the relation between $P"$ and $Q"$.

Suppose $a, b, c$ are real numbers such that $abc \ne 0$. Determine $x, y, z$ in terms of $a, b, c$ such that $bz + cy = a, cx + az = b, ay + bx = c$. Prove also that $\frac{1 - x^2}{a^2} = \frac{1 - y^2}{b^2} = \frac{1 - z^2}{c^2}$.

Four congruent rectangles are placed as shown. The area of the outer square is $ 4$ times that of the inner square. What is the ratio of the length of the longer side of each rectangle to the length of its shorter side? [asy]unitsize(6mm); defaultpen(linewidth(.8pt)); path p=(1,1)--(-2,1)--(-2,2)--(1,2); draw(p); draw(rotate(90)*p); draw(rotate(180)*p); draw(rotate(270)*p);[/asy]$ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ \sqrt {10} \qquad \textbf{(C)}\ 2 \plus{} \sqrt2 \qquad \textbf{(D)}\ 2\sqrt3 \qquad \textbf{(E)}\ 4$

In a scalene triangle $ABC,$ $I$ is the incenter and $O$ is the circumcenter. The line $IO$ intersects the lines $BC,CA,AB$ at points $D,E,F$ respectively. Let $A_1$ be the intersection of $BE$ and $CF$. The points $B_1$ and $C_1$ are defined similarly. The incircle of $ABC$ is tangent to sides $BC,CA,AB$ at points $X,Y,Z$ respectively. Let the lines $XA_1, YB_1$ and $ZC_1$ intersect $IO$ at points $A_2,B_2,C_2$ respectively. Prove that the circles with diameters $AA_2,BB_2$ and $CC_2$ have a common point.

Compute \[ \left(\frac{4-\log_{36} 4 - \log_6 {18}}{\log_4 3} \right) \cdot \left( \log_8 {27} + \log_2 9 \right). \] [i]2020 CCA Math Bonanza Team Round #4[/i]

A binary sequence is a sequence in which each term is equal to $0$ or $1$. A binary sequence is called $\text{friendly}$ if each term is adjacent to at least on term that is equal to $1$. For example , the sequence $0,1,1,0,0,1,1,1$ is $\text{friendly}$. Let $F_{n}$ denote the number of $\text{friendly}$ binary sequences with $n$ terms. Find the smallest positive integer $n\ge 2$ such that $F_{n}>100$

Let ${n \choose k}$ be the number of ways that $k$ objects can be chosen (regardless of order) from a set of $n$ objects. Prove that if positive integers k and l are greater than $1$ and less than $n$, then integers ${n \choose k}$ and ${n \choose l}$ have a common divisor greater than $1$.

In conference there $n>2$ mathematicians. Every two mathematicians communicate in one of the $n$ offical languages of the conference. For any three different offical languages the exists three mathematicians who communicate with each other in these three languages. Find all $n$ such that this is possible.

Let $x$ and $y$ be real numbers with $x>y$ such that $x^2y^2+x^2+y^2+2xy=40$ and $xy+x+y=8$. Find the value of $x$.

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Let $ a,b\in (0,1) $ and a continuous function $ f:[0,1]\longrightarrow\mathbb{R} $ with the property that $$ \int_0^x f(t)dt=\int_0^{ax} f(t)dt +\int_0^{bx} f(t)dt,\quad\forall x\in [0,1] . $$ [b]a)[/b] Show that if $ a+b<1, $ then $ f=0. $ [b]b)[/b] Show that if $ a+b=1, $ then $ f $ is constant.

Let $\mathcal{S}$ be a set of $2023$ points in a plane, and it is known that the distances of any two different points in $S$ are all distinct. Ivan colors the points with $k$ colors such that for every point $P \in \mathcal{S}$, the closest and the furthest point from $P$ in $\mathcal{S}$ also have the same color as $P$. What is the maximum possible value of $k$? [i]Proposed by Ivan Chan Kai Chin[/i]

Three equally spaced parallel lines intersect a circle, creating three chords of lengths $38, 38,$ and $34.$ What is the distance between two adjacent parallel lines? $\textbf{(A)}\ 5\frac{1}{2} \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 6\frac{1}{2} \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 7\frac{1}{2}$

We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]

Let $ p$ be a prime number such that $ p\minus{}1$ is a perfect square. Prove that the equation $ a^{2}\plus{}(p\minus{}1)b^{2}\equal{}pc^{2}$ has infinite many integer solutions $ a$, $ b$ and $ c$ with $ (a,b,c)\equal{}1$

A data set containing $20$ numbers, some of which are $6$, has mean $45$. When all the 6s are removed, the data set has mean $66$. How many 6s were in the original data set? $\textbf{(A) }4\qquad\textbf{(B) }5\qquad\textbf{(C) }6\qquad\textbf{(D) }7\qquad\textbf{(E) }8$