A pair of numbers are [i]twin primes[/i] if they differ by two, and both are prime. Prove that, except for the pair $\{3, 5\}$, the sum of any pair of twin primes is a multiple of $ 12$.

Prove that these two statements are equivalent for an $n$ dimensional vector space $V$: [b]$\cdot$[/b] For the linear transformation $T:V\longrightarrow V$ there exists a base for $V$ such that the representation of $T$ in that base is an upper triangular matrix. [b]$\cdot$[/b] There exist subspaces $\{0\}\subsetneq V_1 \subsetneq ...\subsetneq V_{n-1}\subsetneq V$ such that for all $i$, $T(V_i)\subseteq V_i$.

In a right-angled triangle in which all side lengths are integers, one has a cathetus length $1994$. Determine the length of the hypotenuse.

The points $A_1, A_2,.. , A_{2n}$ are equally spaced in that order along a straight line with $A_1A_2 = k$. $P$ is chosen to minimise $\sum PA_i$. Find the minimum.

$ABC$ is a triangle, $H$ its orthocenter, $I$ its incenter, $O$ its circumcenter and $\omega$ its circumcircle. Line $CI$ intersects circle $\omega$ at point $D$ different from $C$. Assume that $AB = ID$ and $AH = OH$. Find the angles of triangle $ABC$.

In a class among 80 students number of boys is 40 and number of girls is 40. 50 of the students use spectacles. Which of the following is correct? [list=1] [*] Only 10 boys use spectacles [*] Only 20 girls use spectacles [*] At most 25 boys do not use spectacles [*] At most 30 girls do not use spectacles [/list]

Five identical circles are placed in a line inside a larger one as shown. If the shown chord has length $16,$ find the radius of the large circle.

Find the largest real number $c$ such that \[\sum_{i=1}^{101}x_i^2\geq cM^2\] whenever $x_1,\ldots,x_{101}$ are real numbers such that $x_1+\cdots+x_{101}=0$ and $M$ is the median of $x_1,\ldots,x_{101}$.

When counting from $3$ to $201$, $53$ is the $51^{\text{st}}$ number counted. When counting backwards from $201$ to $3$, $53$ is the $n^{\text{th}}$ number counted. What is $n$? $\textbf{(A) }146\qquad \textbf{(B) } 147\qquad\textbf{(C) } 148\qquad\textbf{(D) }149\qquad\textbf{(E) }150$

Let a, b, c be the sidelengths and S the area of a triangle ABC. Denote $x=a+\frac{b}{2}$, $y=b+\frac{c}{2}$ and $z=c+\frac{a}{2}$. Prove that there exists a triangle with sidelengths x, y, z, and the area of this triangle is $\geq\frac94 S$.

Find all pairs of positive integers \((a,b)\) with the following property: there exists an integer \(N\) such that for any integers \(m\ge N\) and \(n\ge N\), every \(m\times n\) grid of unit squares may be partitioned into \(a\times b\) rectangles and fewer than \(ab\) unit squares. [i]Proposed by Holden Mui[/i]

4. A positive integer n is given.Find the smallest $k$ such that we can fill a $3*k$ gird with non-negative integers such that: $\newline$ $i$) Sum of the numbers in each column is $n$. $ii$) Each of the numbers $0,1,\dots,n$ appears at least once in each row.

Let $F$ be the set of all polynomials $\Gamma$ such that all the coefficients of $\Gamma (x)$ are integers and $\Gamma (x) = 1$ has integer roots. Given a positive intger $k$, find the smallest integer $m(k) > 1$ such that there exist $\Gamma \in F$ for which $\Gamma (x) = m(k)$ has exactly $k$ distinct integer roots.

A society created in the help to the police contains $100$ men exactly. Every evening $3$ men are on duty. Prove that you can not organise duties in such a way, that every couple will meet on duty once exactly.

Find $$ \lim_{t\to \infty} e^{-t} \int_{0}^{t} \int_{0}^{t} \frac{e^x -e^y }{x-y} \,dx\,dy,$$ or show that the limit does not exist.

A partition of a set \( A \) is a family of non-empty subsets of \( A \), such that any two distinct subsets in the family are disjoint, and the union of all subsets equals \( A \). We say that a partition of a set of integers \( B \) is [i]separated[/i] if each subset in the partition does [b]not[/b] contain consecutive integers. Prove that, for every positive integer \( n \), the number of partitions of the set \( \{1, 2, \dots, n\} \) is equal to the number of separated partitions of the set \( \{1, 2, \dots, n+1\} \). For example, \( \{\{1,3\}, \{2\}\} \) is a separated partition of the set \( \{1,2,3\} \). On the other hand, \( \{\{1,2\}, \{3\}\} \) is a partition of the same set, but it is not separated since \( \{1,2\} \) contains consecutive integers.

A positive integer $n$ is called almost-square if $n$ can be represented as $n=ab$ where $a,b$ are positive integers that $a\leq b\leq 1.01a$. Prove that there exists infinitely many positive integers $m$ that there’re no almost-square positive integer among $m,m+1,…,m+198$.

At least one of the coefficients of a polynomial $P(x)$ is negative. Can all of the coefficients of all of its powers $(P(x))^n$, $n > 1$, be positive? (0 Kryzhanovskij)

$3$ players take turns drawing lines that connect vertices of a regular $n$-gon. No player may draw a line that intersects another line at a point other than a vertex of the $n-$gon. The last player able to draw a line wins. For how many $n$ in the range $4\le n \le 100$ does the first player have a winning strategy?

Consider $m+1$ horizontal and $n+1$ vertical lines ($m,n\ge 4$) in the plane forming an $m\times n$ table. Cosider a closed path on the segments of this table such that it does not intersect itself and also it passes through all $(m-1)(n-1)$ interior vertices (each vertex is an intersection point of two lines) and it doesn't pass through any of outer vertices. Suppose $A$ is the number of vertices such that the path passes through them straight forward, $B$ number of the table squares that only their two opposite sides are used in the path, and $C$ number of the table squares that none of their sides is used in the path. Prove that \[A=B-C+m+n-1.\] [i]Proposed by Ali Khezeli[/i]

Dividing a three-digit number by the number obtained from it by swapping its first and last digit we get $3$ as the quotient and the sum of digits of the original number as the remainder. Find all three-digit numbers with this property.

In a triangle $ABC$ with medians $AD$ and $BE$ , holds that $\angle CAD= \angle CBE=30^o$. Prove that triangle $ABC$ is equilateral.

Find all functions such that $ f: \mathbb{R}^\plus{} \rightarrow \mathbb{R}^\plus{}$ and $ f(x\plus{}f(y))\equal{}yf(xy\plus{}1)$ for every $ x,y\in \mathbb{R}^\plus{}$.

Triangle $ABC$ is equilateral with side length $\sqrt{3}$ and circumcenter at $O$. Point $P$ is in the plane such that $(AP)(BP)(CP) = 7$. Compute the difference between the maximum and minimum possible values of $OP$. [i]2015 CCA Math Bonanza Team Round #8[/i]

Let $M$ be the midpoint of the side $BC$ of the $\triangle ABC$. The perpendicular at $A$ to $AM$ meets $(ABC)$ at $K$. The altitudes $BE,CF$ of the triangle $ABC$ meet $AK$ at $P, Q$. Show that the radical axis of the circumcircles of the triangles $PKE, QKF$ is perpendicular to $BC$.