$A$ and $B$ wish to divide a cake into two pieces. Each wants the largest piece he can get. The cake is a triangular prism with the triangular faces horizontal. $A$ chooses a point $P$ on the top face. $B$ then chooses a vertical plane through the point $P$ to divide the cake. $B$ chooses which piece to take. Which point $P$ should $A $ choose in order to secure as large a slice as possible?

[Help me] Determine the smallest value of the sum M =xy-yz-zx where x; y; z are real numbers satisfying the following condition $x^2+2y^2+5z^2 = 22$.

Consider the set $S = \{1,2,3, ...,1441\}$. 1. Nora counts thoses subsets of $S$ having exactly two elements, tbe sum of which is even. Rania counts those subsets of $S$ having exactly two elements, the sum of which is odd. Determine the numbers counted by Nora and Rania. 2. Let $t$ be the number of subsets of $S$ which have at least two elements and the product of the elements is even. Determine the greatest power of $2$ which divides $t$. 3. Ahmad counts the subsets of $S$ having $77$ elements such that in each subset the sum of the elements is even. Bushra counts the subsets of $S$ having $77$ elements such that in each subset the sum of the elements is odd. Whose number is bigger? Determine the difference between the numbers found by Ahmad and Bushra.

Let $k = 2^6 \cdot 3^5 \cdot 5^2 \cdot 7^3 \cdot 53$. Let $S$ be the sum of $\frac{gcd(m,n)}{lcm(m,n)}$ over all ordered pairs of positive integers $(m, n)$ where $mn = k$. If $S$ can be written in simplest form as $\frac{r}{s}$, compute $r + s$.

Let $P$ be a given point inside the triangle $ABC$. Suppose $L,M,N$ are the midpoints of $BC, CA, AB$ respectively and \[PL: PM: PN= BC: CA: AB.\] The extensions of $AP, BP, CP$ meet the circumcircle of $ABC$ at $D,E,F$ respectively. Prove that the circumcentres of $APF, APE, BPF, BPD, CPD, CPE$ are concyclic.

Determine all tuples of integers $(a,b,c)$ such that: $$(a-b)^3(a+b)^2 = c^2 + 2(a-b) + 1$$

Find the natural solutions of the equation $x^3 - y^3 = xy + 61$.

Find all real parameters $a$ for which all the roots of the equation $$x^6+3x^5+(6-a)x^4+(7-2a)x^3+(6-a)x^2+3x+1$$are real.

It is known about real $a$ and $b$ that the inequality $$a \cos x + b \cos (3x) > 1$$ has no real solutions. Prove that $|b|\le 1$.

A polynomial $P$ is of the form $\pm x^6 \pm x^5 \pm x^4 \pm x^3 \pm x^2 \pm x \pm 1$. Given that $P(2) = 27$, what is $P(3)$?

Find all functions $f: \mathbb {R}^+ \times \mathbb {R}^+ \to \mathbb {R}^+$ that satisfy the following conditions for all positive real numbers $x,y,z:$ $$f\left ( f(x,y),z \right )=x^2y^2f(x,z)$$ $$f\left ( x,1+f(x,y) \right ) \ge x^2 + xyf(x,x)$$ [i]Proposed by Mojtaba Zare, Ali Daei Nabi[/i]

Solve the equation $\{(x + 1)^3\} = x^3$, where $\{z\}$ is the fractional part of the number z, i.e. $\{z\} = z - [z]$.

Nelson is having his friend drop his unique bouncy ball from a $12$ foot building, and Nelson will only catch the ball at the peak of its trajectory between bounces. On any given bounce, there is an $80\%$ chance that the next peak occurs at $\frac13$ the height of the previous peak and a $20\%$ chance that the next peak occurs at $3$ times the height of the previous peak (where the first peak is at $12$ feet). If Nelson can only reach $4$ feet into the air and will catch the ball as soon as possible, the probability that Nelson catches the ball after exactly $13$ bounces is $2^a \times 3^b \times 5^c \times 7^d \times 11^e$ for integers $a, b, c, d$, and $e$. Find $|a| + |b| + |c| + |d| + |e|$.

The vertices of a regular $2012$-gon are labelled with the numbers $1$ through $2012$ in some order. Call a vertex a peak if its label is larger than the label of its two neighbours, and a valley if its label is smaller than the label of its two neighbours. Show that the total number of peaks is equal to the total number of valleys.

Suppose that the automorphism group of the finite undirected graph $ X\equal{}(P, E)$ is isomorphic to the quaternion group (of order $ 8$). Prove that the adjacency matrix of $ X$ has an eigenvalue of multiplicity at least $ 4$. ($ P\equal{} \{ 1,2,\ldots, n \}$ is the set of vertices of the graph $ X$. The set of edges $ E$ is a subset of the set of all unordered pairs of elements of $ P$. The group of automorphisms of $ X$ consists of those permutations of $ P$ that map edges to edges. The adjacency matrix $ M\equal{}[m_{ij}]$ is the $ n \times n$ matrix defined by $ m_{ij}\equal{}1$ if $ \{ i,j \} \in E$ and $ m_{i,j}\equal{}0$ otherwise.) [i]L. Babai[/i]

In a $12\times 12$ grid, colour each unit square with either black or white, such that there is at least one black unit square in any $3\times 4$ and $4\times 3$ rectangle bounded by the grid lines. Determine, with proof, the minimum number of black unit squares.

[b]5.[/b] Determine the functions $G$ defined on the set of all non-zero real numbers the values of which are regular matrices of order $2$, and the functions $f$ mapping the two-dimensional real vector space $E_2$ into itself, such that for any vector $y \in E_2$ and for any regular matrix $X$ of order $2$, $f(X_y)= G(det X)Xf(y)$ ($det X $ denotes the determinant of $X$).[b](A. 5)[/b]

Let $a,b$ be integers greater than 2. Prove that there exists a positive integer $k$ and a finite sequence $n_1, n_2, \dots, n_k$ of positive integers such that $n_1 = a$, $n_k = b$, and $n_i n_{i+1}$ is divisible by $n_i + n_{i+1}$ for each $i$ ($1 \leq i < k$).

In a $50\times 50$ checkered square, each cell is colored in one of the 100 given colors so that all colors are used and there does not exist a monochromatic domino. Galia wants to repaint all the cells of one of the colors in a different color (from the given 100 colors) so that a monochromatic domino still won't exist. Is it true that Galia will surely be able to do this [i]Proposed by G. Sharafutdinova[/i]

Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that $$f(x+y)\leq f(x^2+y)$$ for all $x,y$.

Let $ABC$ be a triangle with incenter $I$. Let $P$ and $Q$ be points such that $IP\perp AC$, $IQ\perp AB$, and $IA\perp PQ$. Assume that $BP$ and $CQ$ intersect at the point $R\neq A$ on the circumcircle of $ABC$ such that $AR\parallel BC$. Given that $\angle B-\angle C=36^\circ$, the value of $\cos A$ can be expressed in the form $\frac{m-\sqrt n}{p}$ for positive integers $m,n,p$ and where $n$ is not divisible by the square of any prime. Find the value of $100m+10n+p$. [i]Proposed by Michael Ren[/i]

In the isosceles triangle $ABC$ ($AC = BC$), $AB =\sqrt3$ and the altitude $CD =\sqrt2$. Let $E$ and $F$ be the midpoints of $BC$ and $DB$, respectively and $G$ be the intersection of $AE$ and $CF$. Prove that $D$ belongs to the angle bisector of $\angle AGF$.

If we define $\otimes(a,b,c)$ by \begin{align*} \otimes(a,b,c) = \frac{\max(a,b,c)- \min(a,b,c)}{a+b+c-\min(a,b,c)-\max(a,b,c)}, \end{align*} compute $\otimes(\otimes(7,1,3),\otimes(-3,-4,2),1)$.

Given a convex quadrilateral $ABCD$, find the locus of the points $P$ inside the quadrilateral such that \[S_{PAB}\cdot S_{PCD} = S_{PBC}\cdot S_{PDA}\] (where $S_X$ denotes the area of triangle $X$).

A family of sets $F$ is called perfect if the following condition holds: For every triple of sets $X_1, X_2, X_3\in F$, at least one of the sets $$ (X_1\setminus X_2)\cap X_3,$$ $$(X_2\setminus X_1)\cap X_3$$ is empty. Show that if $F$ is a perfect family consisting of some subsets of a given finite set $U$, then $\left\lvert F\right\rvert\le\left\lvert U\right\rvert+1$. [i]Proposed by Michał Pilipczuk[/i]