For the vertex $ A$ of a triangle $ ABC$, let $ l_a$ be the distance between the projections on $ AB$ and $ AC$ of the intersection of the angle bisector of ∠$ A$ with side $ BC$. Define $ l_b$ and $ l_c$ analogously. If $ l$ is the perimeter of triangle $ ABC$, prove that $ \frac{l_a l_b l_c}{l^3}\le\frac{1}{64}$.

Prove that for positive real numbers $ a$, $ b$, $ c$, $ d$, we have \[ \frac{1}{\frac{1}{a}\plus{}\frac{1}{b}}\plus{}\frac{1}{\frac{1}{c}\plus{}\frac{1}{d}}\le\frac{1}{\frac{1}{a\plus{}c}\plus{}\frac{1}{b\plus{}d}}\]

Prove that there exists a positive integer $k>100$, such that for any set $A$ of $k$ positive reals, there exists a subset $B$ of $100$ numbers, so that none of the sums of at least two numbers in $B$ is in the set $A$.

If $ y\equal{}x\plus{}\frac{1}{x}$, then $ x^4\plus{}x^3\minus{}4x^2\plus{}x\plus{}1\equal{}0$ becomes: $ \textbf{(A)}\ x^2(y^2\plus{}y\minus{}2)\equal{}0 \qquad\textbf{(B)}\ x^2(y^2\plus{}y\minus{}3)\equal{}0\\ \textbf{(C)}\ x^2(y^2\plus{}y\minus{}4)\equal{}0 \qquad\textbf{(D)}\ x^2(y^2\plus{}y\minus{}6)\equal{}0\\ \textbf{(E)}\ \text{none of these}$

Let $f : P\to P$ be a bijective map from a plane $P$ to itself such that: (i) $f (r)$ is a line for every line $r$, (ii) $f (r) $ is parallel to $r$ for every line $r$. What possible transformations can $f$ be?

Consider the polynomials \[f(x) =\sum_{k=1}^{n}a_{k}x^{k}\quad\text{and}\quad g(x) =\sum_{k=1}^{n}\frac{a_{k}}{2^{k}-1}x^{k},\] where $a_{1},a_{2},\ldots,a_{n}$ are real numbers and $n$ is a positive integer. Show that if 1 and $2^{n+1}$ are zeros of $g$ then $f$ has a positive zero less than $2^{n}$.

Twenty-one rectangles of size $3\times 1$ are placed on an $8\times 8$ chessboard, leaving only one free unit square. What position can the free square lie at?

Let $n,s,t$ be three positive integers, and let $A_1,\ldots, A_s, B_1,\ldots, B_t$ be non-necessarily distinct subsets of $\{1,2,\ldots,n\}$. For any subset $S$ of $\{1,\ldots,n\}$, define $f(S)$ to be the number of $i\in\{1,\ldots,s\}$ with $S\subseteq A_i$ and $g(S)$ to be the number of $j\in\{1,\ldots,t\}$ with $S\subseteq B_j$. Assume that for any $1\leq x<y\leq n$, we have $f(\{x,y\})=g(\{x,y\})$. Show that if $t<n$, then there exists some $1\leq x\leq n$ so that $f(\{x\})\geq g(\{x\})$. [i]Proposed by usjl[/i]

Find all the triples $(x,y,z)$ of positive integers such that $xy+yz+zx-xyz=2$.

Arithmetic sequences $ (a_n)$ and $ (b_n)$ have integer terms with $ a_1 \equal{} b_1 \equal{} 1 < a_2 \le b_2$ and $ a_nb_n \equal{} 2010$ for some $ n$. What is the largest possible value of $ n$? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 8 \qquad \textbf{(D)}\ 288 \qquad \textbf{(E)}\ 2009$

On the circle $k$, the points $A,B$ are given, while $AB$ is not the diameter of the circle $k$. Point $C$ moves along the long arc $AB$ of circle $k$ so that the triangle $ABC$ is acute. Let $D,E$ be the feet of the altitudes from $A, B$ respectively. Let $F$ be the projection of point $D$ on line $AC$ and $G$ be the projection of point $E$ on line $BC$. (a) Prove that the lines $AB$ and $FG$ are parallel. (b) Determine the set of midpoints $S$ of segment $FG$ while along all allowable positions of point $C$.

[b]p1.[/b] Compute $$\left(\frac{1}{10}\right)^{\frac12}\left(\frac{1}{10^2}\right)^{\frac{1}{2^4}}\left(\frac{1}{10^3}\right)^{\frac{1}{2^3}} ...$$ [b]p2.[/b] Consider the sequence $1, 2, 2, 3, 3, 3, 4, 4, 4, 4,...,$ where the positive integer $m$ appears $m$ times. Let $d(n)$ denote the $n$th element of this sequence starting with $n = 1$. Find a closed-form formula for $d(n)$. [b]p3.[/b] Let $0 < \theta < \frac{\pi}{2}$, prove that $$ \left( \frac{\sin^2 \theta}{2}+\frac{2}{\cos^2 \theta} \right)^{\frac14}+ \left( \frac{\cos^2 \theta}{2}+\frac{2}{\sin^2 \theta} \right)^{\frac14} \ge (68)^{\frac14} $$ and determine the value of \theta when the inequality holds as equality. [b]p4.[/b] In $\vartriangle ABC$, parallel lines to $AB$ and $AC$ are drawn from a point $Q$ lying on side $BC$. If $a$ is used to represent the ratio of the area of parallelogram $ADQE$ to the area of the triangle $\vartriangle ABC$, (i) find the maximum value of $a$. (ii) find the ratio $\frac{BQ}{QC}$ when $a =\frac{24}{49}.$ [img]https://cdn.artofproblemsolving.com/attachments/5/8/eaa58df0d55e6e648855425e581a6ba0ad3ea6.png[/img] [b]p5.[/b] Prove the following inequality $$\frac{1}{2009} < \frac{1}{2} \cdot \frac{3}{4} \cdot \frac{5}{6} \cdot \frac{7}{8}...\frac{2007}{2008}<\frac{1}{40}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].Thanks to gauss202 for sending the problems.

Let $n$ be a positive integer. A square $ABCD$ is divided into $n^2$ identical small squares by drawing $(n-1)$ equally spaced lines parallel to the side $AB$ and another $(n- 1)$ equally spaced lines parallel to $BC$, thus giving rise to $(n+1)^2$ intersection points. The points $A, C$ are coloured red and the points $B, D$ are coloured blue. The rest of the intersection points are coloured either red or blue. Prove that the number of small squares having exactly $3$ vertices of the same colour is even.

There are scales and $(n+1)$ weights with the total weight $2n$. Each weight is an integer. We put all the weights in turn on the lighter side of the scales, starting from the heaviest one, and if the scales is in equilibrium -- on the left side. Prove that when all the weights will be put on the scales, they will be in equilibrium.

There are eight identical Black Queens in the first row of a chessboard and eight identical White Queens in the last row. The Queens move one at a time, horizontally, vertically or diagonally by any number of squares as long as no other Queens are in the way. Black and White Queens move alternately. What is the minimal number of moves required for interchanging the Black and White Queens? [i](5 points)[/i]

Let $f(n)=n^2+100.$ Compute the remainder when $\underbrace{f(f(\cdots f(f(}_{2025 \ f\text{'s}}1))\cdots ))$ is divided by $10^4.$

Determine all solutions in non-zero integers $a$ and $b$ of the equation \[(a^2+b)(a+b^2) = (a-b)^3.\]

In a right triangle with legs $a$, $b$ and hypotenuse $c$, draw semicircles with diameters on the sides of the triangle as indicated in the figure. The purple areas have values $X,Y$ . Calculate $X + Y$. [img]https://cdn.artofproblemsolving.com/attachments/1/a/5086dc7172516b0a986ef1af192c15eba4d6fc.png[/img]

A cube has edges of length $120\text{ cm}$. The cube gets chopped up into some number of smaller cubes, all of equal size, such that each edge of one of the smaller cubes has an integer length. One of those smaller cubes is then chopped up into some number of $\textit{even smaller}$ cubes, all of equal size. If the edge length of one of those $\textit{even smaller}$ cubes is $n\text{ cm}$, where $n$ is an integer, find the number of possible values of $n$.

Among all eight-digit multiples of four, are there more numbers with the digit $1$ or without the digit $1$ in their decimal representation?

10 geese are numbered 1-10. One goose leaves the pack, and the remaining nine geese assemble in a symmetric V-shaped formation with four geese on each side. Given that the product of the geese on both halves of the "V" are the same, what is the sum of the possible values of the goose that left? [i]2022 CCA Math Bonanza Lightning Round 2.4[/i]

A house worth $ \$9000$ is sold by Mr. A to Mr. B at a $ 10\%$ loss. Mr. B sells the house back to Mr. A at a $ 10\%$ gain. The result of the two transactions is: $ \textbf{(A)}\ \text{Mr. A breaks even} \qquad\textbf{(B)}\ \text{Mr. B gains }\$900 \qquad\textbf{(C)}\ \text{Mr. A loses }\$900\\ \textbf{(D)}\ \text{Mr. A loses }\$810 \qquad\textbf{(E)}\ \text{Mr. B gains }\$1710$

Let $ ABC$ be an acute-angled triangle with altitude $ AK$. Let $ H$ be its ortho-centre and $ O$ be its circum-centre. Suppose $ KOH$ is an acute-angled triangle and $ P$ its circum-centre. Let $ Q$ be the reflection of $ P$ in the line $ HO$. Show that $ Q$ lies on the line joining the mid-points of $ AB$ and $ AC$.

$20$ players enter a chess tournament in which each player will play every other player exactly once. Some competitors are cheaters and will cheat in every game they play, but the rest of the competitors are not cheaters. A game is cheating if both players cheat, and a game is half-cheating if one player cheats and one player does not. If there were $68$ more half-cheating games than cheating games, how many of the players are cheaters?

Bartek patiently performs operations on fractions. In each move, he adds its inverse to the current result, obtaining a new result. Bartek starts with the number $1$: after the first move, he receives the result 2, after the second move, the result is $\frac{5}{2}$, after the third move $\frac{29}{10}$, etc. After $300$ moves, Bartek receives the result $x$. Determine the largest integer not greater than $x$.