Let $0<a\leq 1$ be a real number and let $a\leq a_{i}\leq\frac{1}{a_{i}}\forall i=\overline{1,1996}$ are real numbers. Prove that for any nonnegative real numbers $k_{i}(i=1,2,...,1996)$ such that $\sum_{i=1}^{1996}k_{i}=1$ we have $(\sum_{i=1}^{1996}k_{i}a_{i})(\sum_{i=1}^{1996}\frac{k_{i}}{a_{i}})\leq (a+\frac{1}{a})^{2}$.

An ant crawls along the grid lines of an infinite quadrille notebook. One grid point is marked red, this is its starting point. Every time the ant reaches a grid point, it continues forward with probability $\frac13$ , left with probability $\frac13$ , and right with probability $\frac13$. What is the chance that it is after its third turn, but not after its fourth turn that it returns to the red point? If the answer is $\frac{p}{q}$ , where $p$ and $q$ are coprime positive integers, then your answer should be $p + q$. [i]The steps of the ant are independent.[/i]

Georg has bought lots of filled chocolates for a party, and when he counts how many he has, he discovers that the number is a prime number. He distributes so many of the chocolates as possible on $60$ trays with an equal number on each. He notes then that he has more than one piece left and that the number left pieces is not a prime number. How many pieces of chocolate does Georg have left?

Prove that \[ \int^1_0 \int^1_0 \frac { dx \ dy }{ \frac 1x + |\log y| -1 } \leq 1 . \]

The five numbers $17$, $98$, $39$, $54$, and $n$ have a mean equal to $n$. Find $n$.

Consider a convex polyhedron whose faces are triangles. Prove that it is possible to color its edges by either red or blue, in a way that the following property is satisfied: one can travel from any vertex to any other vertex while passing only along red edges, and can also do this while passing only along blue edges.

Rohit is counting the minimum number of lines $m$, that can be drawn so that the number of distinct points of intersection exceeds $2020$. Find $m$. (A)$63$ (B)$64$ (C)$65$ (D)$66$

2008 persons take part in a programming contest. In one round, the 2008 programmers are divided into two groups. Find the minimum number of groups such that every two programmers ever be in the same group.

Call a positive integer [i]challenging[/i] if it can be expressed as $2^a(2^b+1)$, where $a,b$ are positive integers. Prove that if $X$ is a set of challenging numbers smaller than $2^n (n$ is a given positive integer) and $|X|\ge \frac{4}{3}(n-1)$, there exist two disjoint subsets $A,B\subset X$ such that $|A|=|B|$ and $\sum_{a\in A}a=\sum_{b \in B}b$.

Find the smallest positive integer $x$ such that $2^{254}$ divides $x^{2005} + 1$.

In a village $X_0$ there are $80$ tourists who are about to visit $5$ nearby villages $X_1,X_2,X_3,X_4,X_5$.Each of them has chosen to visit only one of them.However,there are cases when the visit in a village forces the visitor to visit other villages among $X_1,X_2,X_3,X_4,X_5$.Each tourist visits only the village he has chosen and the villages he is forced to.If $X_1,X_2,X_3,X_4,X_5$ are totally visited by $40,60,65,70,75$ tourists respectively,then find how many tourists had chosen each one of them and determine all the ordered pairs $(X_i,X_j):i,j\in \{1,2,3,4,5\}$ which are such that,the visit in $X_i$ forces the visitor to visit $X_j$ as well.

Let $n$ be integer, $n>1.$ An element of the set $M=\{ 1,2,3,\ldots,n^2-1\}$ is called [i]good[/i] if there exists some element $b$ of $M$ such that $ab-b$ is divisible by $n^2.$ Furthermore, an element $a$ is called [i]very good[/i] if $a^2-a$ is divisible by $n^2.$ Let $g$ denote the number of [i]good[/i] elements in $M$ and $v$ denote the number of [i]very good[/i] elements in $M.$ Prove that \[v^2+v \leq g \leq n^2-n.\]

$\vartriangle ABC$ satisfies $AB = 16$, $BC = 30$, and $\angle ABC = 90^o$. On the circumcircle of $\vartriangle ABC$, let $P$ be the midpoint of arc $AC$ not containing $B$, and let $X$ and $Y$ lie on lines $AB$ and $BC$, respectively, with $PX \perp AB$ and $PY \perp BC$. Find $XY^2$.

Let $A = \{ 1,2, 3 , \ldots, 100 \}$ and $B$ be a subset of $A$ having $53$ elements. Show that $B$ has 2 distinct elements $x$ and $y$ whose sum is divisible by $11$.

Given two angles $ACT$ and $TCB$, where $A$, $C$ and $B$ lie on a line in that order. A circle $\alpha$ is inscribed in the first angle, and $\beta$ in the second. $\alpha$ is tangent to $AB$ and $CT$ at points $A$ and $E$, and $\beta$ is tangent to $AE$ and $BF$ at $B$ and $F \neq E$. Lines $AE$ and $BF$ intersect at $P$. Circumcircle $\omega$ of triangle $PEF$ intersects $\alpha$ and $\beta$ at $X$ and $Y$ respectively. Prove that $AX$ and $BY$ intersect on $\omega$. [i]Matsvei Zorka[/i]

For which finite group G does there exist natural number s with the following property: for any subgroup H of a finite direct power of G, each subgroup of H is produced as an intersection of subgroups of H with index at most s. not sure of translation.

A function $f:\{ 1,2,3,\cdots ,2016\}\rightarrow \{ 1,2,3,\cdots , 2016\}$ is called [i]good[/i] if the function $g(n)=|f(n)-n|$ is injective. Furthermore, a good function $f$ is called [i]excellent[/i] if there exists another good function $f'$ such that $f(n)-f'(n)$ is nonzero for exactly one value of $n$. Let $N$ be the number of good functions that are not excellent. Find the remainder when $N$ is divided by $1000$. [i]Proposed by Nathan Ramesh

Let $AL$ and $BK$ be the angle bisectors in a non-isosceles triangle $ABC,$ where $L$ lies on $BC$ and $K$ lies on $AC.$ The perpendicular bisector of $BK$ intersects the line $AL$ at $M$. Point $N$ lies on the line $BK$ such that $LN$ is parallel to $MK.$ Prove that $LN=NA.$

The point $ O$ is the center of the circle circumscribed about $ \triangle ABC$, with $ \angle BOC \equal{} 120^\circ$ and $ \angle AOB \equal{} 140^\circ$, as shown. What is the degree measure of $ \angle ABC$? [asy]unitsize(2cm); defaultpen(linewidth(.8pt)+fontsize(10pt)); pair B=dir(80), A=dir(220), C=dir(320), O=(0,0); draw(unitcircle); draw(A--B--C--O--A--C); draw(O--B); draw(anglemark(C,O,A,2)); label("$A$",A,SW); label("$B$",B,NNE); label("$C$",C,SE); label("$O$",O,S); label("$140^{\circ}$",O,NW,fontsize(8pt)); label("$120^{\circ}$",O,ENE,fontsize(8pt));[/asy]$ \textbf{(A)}\ 35 \qquad \textbf{(B)}\ 40 \qquad \textbf{(C)}\ 45 \qquad \textbf{(D)}\ 50 \qquad \textbf{(E)}\ 60$

Is there a tetrahedron $ABCD$ such that $AB+BC+CD+DA=12\text{ cm}$ with volume $\mathrm V\ge2\sqrt3\text{ cm}^3?$

Let n be a set of integers. $S(n)$ is defined as the sum of the elements of n. $T=\{1,2,3,4,5,6,7,8,9\}$ and A and B are subsets of T such that A $\cup$ $B=T$ and A $\cap$ $B=\varnothing$. The probability that $S(A)\geq4S(B)$ can be expressed as $\frac{p}{q}$. Compute $p+q$. [i]2022 CCA Math Bonanza Team Round #8[/i]

A paper triangle with the angles $20^o$, $20^o$ and $140^o$ is cut into two triangles by the bisector of one of its angles. Then one of these triangles is cut into two by its bisector, and so on. Prove that it is impossible to get a triangle similar to the initial one. (AI Galochkin)

Determine all pairs $\{a, b\}$ of positive integers with the property that, in whatever manner you color the positive integers with two colors $A$ and $B$, there always exist two positive integers of color $A$ having their difference equal to $a$ [b]or[/b] of color $B$ having their difference equal to $b$.

Let {$a_1, a_2,\cdots,a_n$} be a set of $n$ real numbers whos sym equals S. It is known that each number in the set is less than $\frac{S}{n-1}$. Prove that for any three numbers $a_i$, $a_j$ and $a_k$ in the set, $a_i+a_j>a_k$.

Consider the sequence defined recursively by $(x_1,y_1)=(0,0)$, $(x_{n+1},y_{n+1})=\left(\left(1-\frac{2}{n}\right)x_n-\frac{1}{n}y_n+\frac{4}{n},\left(1-\frac{1}{n}\right)y_n-\frac{1}{n}x_n+\frac{3}{n}\right)$. Find $\lim_{n\to \infty}(x_n,y_n)$.