Point $F$ is taken on the extension of side $AD$ of parallelogram $ABCD$. $BF$ intersects diagonal $AC$ at $E$ and side $DC$ at $G$. If $EF = 32$ and $GF = 24$, then $BE$ equals: [asy] size(7cm); pair A = (0, 0), B = (7, 0), C = (10, 5), D = (3, 5), F = (5.7, 9.5); pair G = intersectionpoints(B--F, D--C)[0]; pair E = intersectionpoints(A--C, B--F)[0]; draw(A--D--C--B--cycle); draw(A--C); draw(D--F--B); label("$A$", A, SW); label("$B$", B, SE); label("$C$", C, NE); label("$D$", D, NW); label("$F$", F, N); label("$G$", G, NE); label("$E$", E, SE); //Credit to MSTang for the asymptote [/asy] $\textbf{(A)}\ 4 \qquad \textbf{(B)}\ 8\qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ 12 \qquad \textbf{(E)}\ 16$

Determines the largest integer $n$ that is a multiple of all positive integers less than $\sqrt{n}$.

$x$, $y$, and $z$ are positive real numbers satisfying the equation $x+y+z=\frac{1}{x} + \frac{1}{y} + \frac{1}{z}$. Prove the following inequality: $xy + yz + zx \geq 3$.

For natural $n$, define $f_n=[2^n\sqrt{69}]+[2^n\sqrt{96}]$ Prove that there are infinite even integers and infinite odd integers that appear in number $f_1,f_2,\dots$. [i](tatari/nightmare)[/i]

What is the remainder when $(1 + x)^{2010}$ is divided by $1 + x + x^2$?

There are $6$ points on the plane such that no three of them are collinear. It's known that between every $4$ points of them, there exists a point that it's power with respect to the circle passing through the other three points is a constant value $k$.(Power of a point in the interior of a circle has a negative value.) Prove that $k=0$ and all $6$ points lie on a circle. [i]Proposed by Morteza Saghafian[/I]

Given the circumference $s$ and the straight line $l$, passing through the centre $O$ of $s$. Another circumference $s'$ passes through the point $O$ and has its centre on the $l$. Describe the set of the points $M$, where the common tangent of $s$ and $s'$ touches $s'$.

A [i]calendar[/i] is a (finite) rectangular grid. A calendar is [i]valid[/i] if it satisfies the following conditions: (i) Each square of the calendar is colored white or red, and there are exactly 10 red squares. (ii) Suppose that there are $N$ columns of squares in the calendar. Then if we fill in the numbers $1,2,\ldots$ from the top row to the bottom row, and within each row from left to right, there do not exist $N$ consecutive numbers such that the squares they are in are all white. (iii) Suppose that there are $M$ rows of squares in the calendar. Then if we fill in the numbers $1,2,\ldots$ from the left-most column to the right-most column, and within each column from bottom to top, there do not exist $M$ consecutive numbers such that the squares they are in are all white. In other words, if we rotate the calendar clockwise by $90^{\circ}$, the resulting calendar still satisfies (ii). How many different kinds of valid calendars are there? (Remark: During the actual exam, the contestants were confused about what counts as different calendars. So although this was not in the actual exam, I would like to specify that two calendars are considered different if they have different side lengths or if the $10$ red squares are at different locations.)

Show that, among all triangles whose vertices are at distances 3,5,7 respectively from a given point P, the ones with largest area have P as orthocenter. ([i]You can suppose, without demonstration, the existence of a triangle with maximal area in this question.[/i])

Evaluate the following sum: $$ \frac{1}{1} + \frac{1}{1 + 2} + \frac{1}{1 + 2 + 3} + \frac{1}{1 + 2 + 3 + 4} + \ldots + \frac{1}{1 + 2 + 3 + 4 + \dots + 2025} $$ [i]Proposed by Prudencio Guerrero Fernández[/i]

If the margin made on an article costing $ C$ dollars and selling for $ S$ dollars is $ M\equal{}\frac{1}{n}C$, then the margin is given by: $ \textbf{(A)}\ M\equal{}\frac{1}{n\minus{}1}S \qquad \textbf{(B)}\ M\equal{}\frac{1}{n}S \qquad \textbf{(C)}\ M\equal{}\frac{n}{n\plus{}1}S \\ \textbf{(D)}\ M\equal{}\frac{1}{n\plus{}1}S \qquad \textbf{(E)}\ M\equal{}\frac{n}{n\minus{}1}S$

The Bank of Oslo issues two types of coin: aluminum (denoted A) and bronze (denoted B). Marianne has $n$ aluminum coins and $n$ bronze coins arranged in a row in some arbitrary initial order. A chain is any subsequence of consecutive coins of the same type. Given a fixed positive integer $k \leq 2n$, Gilberty repeatedly performs the following operation: he identifies the longest chain containing the $k^{th}$ coin from the left and moves all coins in that chain to the left end of the row. For example, if $n=4$ and $k=4$, the process starting from the ordering $AABBBABA$ would be $AABBBABA \to BBBAAABA \to AAABBBBA \to BBBBAAAA \to ...$ Find all pairs $(n,k)$ with $1 \leq k \leq 2n$ such that for every initial ordering, at some moment during the process, the leftmost $n$ coins will all be of the same type.

In triangle $ABC$, points $M$ and $N$ are on segments $AB$ and $AC$ respectively such that $AM = MC$ and $AN = NB$. Let $P$ be the point such that $PB$ and $PC$ are tangent to the circumcircle of $ABC$. Given that the perimeters of $PMN$ and $BCNM$ are $21$ and $29$ respectively, and that $PB = 5$, compute the length of $BC$.

Let $n\ge 3$ be an integer. In a country there are $n$ airports and $n$ airlines operating two-way flights. For each airline, there is an odd integer $m\ge 3$, and $m$ distinct airports $c_1, \dots, c_m$, where the flights offered by the airline are exactly those between the following pairs of airports: $c_1$ and $c_2$; $c_2$ and $c_3$; $\dots$ ; $c_{m-1}$ and $c_m$; $c_m$ and $c_1$. Prove that there is a closed route consisting of an odd number of flights where no two flights are operated by the same airline.

Find all real numbers $x$ such that exactly one of the four numbers $x-\sqrt 2$, $x-\dfrac{1}{x}$, $x+\dfrac{1}{x}$ and $x^2+2\sqrt{2}$ is [b]not[/b] an integer.

Are there prime $p$ and $q$ larger than $3$, such that $p^2-1$ is divisible by $q$ and $q^2-1$ divided by $p$?

Let $ABCD$ be a trapezoid and a tangential quadrilateral such that $AD || BC$ and $|AB|=|CD|$. The incircle touches $[CD]$ at $N$. $[AN]$ and $[BN]$ meet the incircle again at $K$ and $L$, respectively. What is $\dfrac {|AN|}{|AK|} + \dfrac {|BN|}{|BL|}$? $ \textbf{(A)}\ 8 \qquad\textbf{(B)}\ 9 \qquad\textbf{(C)}\ 10 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ 16 $

[i]George the grasshopper[/i] lives of the real line, starting at $0$ . He is given the following sequence of numbers: $2, 3, 4, 8, 9, ... ,$ which are all the numbers of the form $2^k$ or $3^l$, $k, l \in \mathbb{N}$, arranged in increasing order. Starting from $2$, for each number $x$ in the sequence in order, he (currently at $a$) must choose to jump to either $a+x$ or $a-x$. Show that [i]George the grasshopper[/i] can jump in a way that he reaches every integer on the real line.

Let $\displaystyle{N = \prod_{k=1}^{1000} (4^k - 1)}$. Determine the largest positive integer $n$ such that $5^n$ divides evenly into $N$.

Congruent circles $\Gamma_1$ and $\Gamma_2$ have radius $2012,$ and the center of $\Gamma_1$ lies on $\Gamma_2.$ Suppose that $\Gamma_1$ and $\Gamma_2$ intersect at $A$ and $B$. The line through $A$ perpendicular to $AB$ meets $\Gamma_1$ and $\Gamma_2$ again at $C$ and $D$, respectively. Find the length of $CD$. [i]Author: Ray Li[/i]

Determine all integers $n$ such that both of the numbers: $$|n^3 - 4n^2 + 3n - 35| \text{ and } |n^2 + 4n + 8|$$ are both prime numbers.

See all the problems from 5-th Kyiv math festival [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=506789#p506789]here[/url] The number $123456789$ is written on the blackboard. At each step it is allowed to choose its digits $a$ and $b$ of the same parity and to replace each of them by $\frac{a+b}{2}.$ Is it possible to obtain a number larger then a)$800000000$; b)$880000000$ by such replacements?

Two circles, both with the same radius $r$, are placed in the plane without intersecting each other. A line in the plane intersects the first circle at the points $A,B$ and the other at points $C,D$, so that $|AB|=|BC|=|CD|=14\text{cm}$. Another line intersects the circles at $E,F$, respectively $G,H$ so that $|EF|=|FG|=|GH|=6\text{cm}$. Find the radius $r$.

Let $A, B \in \mathbb{N}$. Consider a sequence $x_1, x_2, \ldots$ such that for all $n\geq 2$, $$x_{n+1}=A \cdot \gcd(x_n, x_{n-1})+B. $$ Show that the sequence attains only finitely many distinct values.

Let $ m,n$ be positive integers. Prove that the number $ 5^n\plus{}5^m$ can be represented as sum of two perfect squares if and only if $ n\minus{}m$ is even. [i]Vasile Zidaru[/i]