Let $ABCD$ be a parallelogram. Points $X$ and $Y$ lie on segments $AB$ and $AD$ respectively, and $AC$ intersects $XY$ at point $Z$. Prove that \[\frac{AB}{AX} + \frac{AD}{AY} = \frac{AC}{AZ}.\]

If $ 1 \le r \le n$ are integers, prove the identity: $ \displaystyle\sum_{d\equal{}1}^{\infty}\binom {n\minus{}r\plus{}1}{d} \binom {r\minus{}1} {d\minus{}1}\equal{}\binom {n}{r}.$

Prove the following inequality. \[ \ln \frac {\sqrt {2009} \plus{} \sqrt {2010}}{\sqrt {2008} \plus{} \sqrt {2009}} < \int_{\sqrt {2008}}^{\sqrt {2009}} \frac {\sqrt {1 \minus{} e^{ \minus{} x^2}}}{x}\ dx < \sqrt {2009} \minus{} \sqrt {2008}\]

Let $x,y$ be positive real numbers such that $x+y=1$. Prove that$\frac{x}{x^2+y^3}+\frac{y}{x^3+y^2}\leq2(\frac{x}{x+y^2}+\frac{y}{x^2+y})$.

Let $f_1(x)=x^2-1$, and for each positive integer $n \geq 2$ define $f_n(x) = f_{n-1}(f_1(x))$. How many distinct real roots does the polynomial $f_{2004}$ have?

A convex polygon is dissected into a finite number of triangles with disjoint interiors, whose sides have odd integer lengths. The triangles may have multiple vertices on the boundary of the polygon and their sides may overlap partially. [list=a] [*]Prove that the polygon's perimeter is an integer which has the same parity as the number of triangles in the dissection. [*]Determine whether part a) holds if the polygon is not convex. [/list] [i]Proposed by Marius Cavachi[/i] [i]Note: the junior version only included part a), with an arbitrary triangle instead of a polygon.[/i]

How many different positive integers divide $10!$ ?

A certain country wishes to interconnect $2021$ cities with flight routes, which are always two-way, in the following manner: • There is a way to travel between any two cities either via a direct flight or via a sequence of connecting flights. • For every pair $(A, B)$ of cities that are connected by a direct flight, there is another city $C$ such that $(A, C)$ and $(B, C)$ are connected by direct flights. Show that at least $3030$ flight routes are needed to satisfy the two requirements.

A $30$-gon $A_1A_2\cdots A_{30}$ is inscribed in a circle of radius $2$. Prove that one can choose a point $B_k$ on the arc $A_kA_{k+1}$ for $1 \leq k \leq 29$ and a point $B_{30}$ on the arc $A_{30}A_1$, such that the numerical value of the area of the $60$-gon $A_1B_1A_2B_2 \dots A_{30}B_{30}$ is equal to the numerical value of the perimeter of the original $30$-gon.

In triangle $\triangle ABC$ we have $BC=a,CA=b,AB=c$ and $\angle B=4\angle A$ Show that \[ab^2c^3=(b^2-a^2-ac)((a^2-b^2)^2-a^2c^2)\]

Cat and Claire are having a conversation about Cat's favorite number. Cat says, "My favorite number is a two-digit positive integer with distinct nonzero digits, $\overline{AB}$, such that $A$ and $B$ are both factors of $\overline{AB}$." Claire says, "I don't know your favorite number yet, but I do know that among four of the numbers that might be your favorite number, you could start with any one of them, add a second, subtract a third, and get the fourth!" Cat says, "That's cool, and my favorite number is among those four numbers! Also, the square of my number is the product of two of the other numbers among the four you mentioned!" Claire says, "Now I know your favorite number!" What is Cat's favorite number? [i]Proposed by Andrew Wu[/i]

The integers from $1$ to $9$ can be arranged into a $3\times3$ array (as shown on the right) so that the sum of the numbers in every row, column, and diago­nal is a multiple of $9$. (a.) Prove that the number in the center of the array must be a multiple of $3$. (b.) Give an example of such an array with $6$ in the center. [asy] defaultpen(linewidth(0.7)+fontsize(10));size(100); int i,j; for(i=0; i<4; i=i+1) { draw((0,2i)--(6,2i)); draw((2i,0)--(2i,6)); } string[] letters={"G", "H", "I", "D", "E", "F", "A", "B", "C"}; for(i=0; i<3; i=i+1) { for(j=0; j<3; j=j+1) { label(letters[3i+j], (2j+1, 2i+1)); }}[/asy]

Determine all positive integers $n$ such that it is possible to fill the $n \times n$ table with numbers $1, 2$ and $-3$ so that the sum of the numbers in each row and each column is $0$.

Let $w_{1}$ and $w_{2}$ denote the circles $x^{2}+y^{2}+10x-24y-87=0$ and $x^{2}+y^{2}-10x-24y+153=0$, respectively. Let $m$ be the smallest positive value of $a$ for which the line $y=ax$ contains the center of a circle that is externally tangent to $w_{2}$ and internally tangent to $w_{1}$. Given that $m^{2}=p/q$, where $p$ and $q$ are relatively prime integers, find $p+q$.

Let $ a,b,c $ be three positive numbers. Show that the equation $$ a^x+b^x=c^x $$ has, at most, one real solution.

Let ABCD be a parallelogram, E the midpoint of AD and F the projection of B on CE. Prove that the triangle ABF is isosceles.

Let $ABC$ be a triangle with $\angle ABC=120^o$ and triangle bisectors $(AA_1),(BB_1),(CC_1)$, respectively. $B_1F \perp A_1C_1$, where $F\in (A_1C_1)$. Let $R,I$ and $S$ be the centers of the circles which are inscribed in triangles $C_1B_1F,C_1B_1A_1, A_1B_1F$, and $B_1S\cap A_1C_1=\{Q\}$. Show that $R,I,S,Q$ are on the same circle.

Let $k,n\ge 1$ be relatively prime integers. All positive integers not greater than $k+n$ are written in some order on the blackboard. We can swap two numbers that differ by $k$ or $n$ as many times as we want. Prove that it is possible to obtain the order $1,2,\dots,k+n-1, k+n$.

An [i]$ n\minus{}m$ society[/i] is a group of $ n$ girls and $ m$ boys. Prove that there exists numbers $ n_0$ and $ m_0$ such that every [i]$ n_0\minus{}m_0$ society[/i] contains a subgroup of five boys and five girls with the following property: either all of the boys know all of the girls or none of the boys knows none of the girls.

Write a list of the first $10$ positive integers in increasing order. Erase any number adjacent to a prime; if two primes are adjacent, do not erase either prime. Apply this process twice. How many positive integers remain in the list? $\textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }4\qquad\textbf{(D) }5\qquad\textbf{(E) }6$

Let $ x$, $ y$ and $ z$ be non negative numbers. Prove that \[ \frac{x^2\plus{}y^2\plus{}z^2\plus{}xy\plus{}yz\plus{}zx}{6}\le \frac{x\plus{}y\plus{}z}{3}\cdot\sqrt{\frac{x^2\plus{}y^2\plus{}z^2}{3}}\]

If \[ \sum_{k=1}^{1000}\left( \frac{k+1}{k}+\frac{k}{k+1}\right)=\frac{m}{n} \] for relatively prime positive integers $m,n$, compute $m+n$. [i]2020 CCA Math Bonanza Lightning Round #2.4[/i]

Determine all natural numbers $n$ and $k > 1$ such that $k$ divides each of the numbers$\binom{n}{1}$,$\binom{n}{2}$,..........,$\binom{n}{n-1}$

[b]p1.[/b] Solve the equation: $\sqrt{x} +\sqrt{x + 1} - \sqrt{x + 2} = 0$. [b]p2.[/b] Solve the inequality: $\ln (x^2 + 3x + 2) \le 0$. [b]p3.[/b] In the trapezoid $ABCD$ ($AD \parallel BC$) $|AD|+|AB| = |BC|+|CD|$. Find the ratio of the length of the sides $AB$ and $CD$ ($|AB|/|CD|$). [b]p4.[/b] Gollum gave Bilbo a new riddle. He put $64$ stones that are either white or black on an $8 \times 8$ chess board (one piece per each of $64$ squares). At every move Bilbo can replace all stones of any horizontal or vertical row by stones of the opposite color (white by black and black by white). Bilbo can make as many moves as he needs. Bilbo needs to get a position when in every horizontal and in every vertical row the number of white stones is greater than or equal to the number of black stones. Can Bilbo solve the riddle and what should be his solution? [b]p5.[/b] Two trolls Tom and Bert caught Bilbo and offered him a game. Each player got a bag with white, yellow, and black stones. The game started with Tom putting some number of stones from his bag on the table, then Bert added some number of stones from his bag, and then Bilbo added some stones from his bag. After that three players started making moves. At each move a player chooses two stones of different colors, takes them away from the table, and puts on the table a stone of the color different from the colors of chosen stones. Game ends when stones of one color only remain on the table. If the remaining stones are white Tom wins and eats Bilbo, if they are yellow, Bert wins and eats Bilbo, if they are black, Bilbo wins and is set free. Can you help Bilbo to save his life by offering him a winning strategy? [b]p6.[/b] There are four roads in Mirkwood that are straight lines. Bilbo, Gandalf, Legolas, and Thorin were travelling along these roads, each along a different road, at a different constant speed. During their trips Bilbo met Gandalf, and both Bilbo and Gandalf met Legolas and Thorin, but neither three of them met at the same time. When meeting they did not stop and did not change the road, the speed, and the direction. Did Legolas meet Thorin? Justify your answer. PS. You should use hide for answers.

Find all integers $n$ for which each cell of $n \times n$ table can be filled with one of the letters $I,M$ and $O$ in such a way that: [LIST] [*] in each row and each column, one third of the entries are $I$, one third are $M$ and one third are $O$; and [/*] [*]in any diagonal, if the number of entries on the diagonal is a multiple of three, then one third of the entries are $I$, one third are $M$ and one third are $O$.[/*] [/LIST] [b]Note.[/b] The rows and columns of an $n \times n$ table are each labelled $1$ to $n$ in a natural order. Thus each cell corresponds to a pair of positive integer $(i,j)$ with $1 \le i,j \le n$. For $n>1$, the table has $4n-2$ diagonals of two types. A diagonal of first type consists all cells $(i,j)$ for which $i+j$ is a constant, and the diagonal of this second type consists all cells $(i,j)$ for which $i-j$ is constant.