Let $x,y,z$ be positive real numbers satisfying $x+y+z=1$. Find the smallest $k$ such that $\frac{x^2y^2}{1-z}+\frac{y^2z^2}{1-x}+\frac{z^2x^2}{1-y}\leq k-3xyz$.

Let $1000 \leq n = \text{ABCD}_{10} \leq 9999$ be a positive integer whose digits $\text{ABCD}$ satisfy the divisibility condition: $$1111 | (\text{ABCD} + \text{AB} \times \text{CD}).$$ Determine the smallest possible value of $n$.

The picture below shows the way Juan wants to divide a square field in three regions, so that all three of them share a well at vertex $B$. If the side length of the field is $60$ meters, and each one of the three regions has the same area, how far must the points $M$ and $N$ be from $D$? Note: the area of each region includes the area the well occupies. [asy] pair A=(0,0),B=(60,0),C=(60,-60),D=(0,-60),M=(0,-40),N=(20,-60); pathpen=black; D(MP("A",A,W)--MP("B",B,NE)--MP("C",C,SE)--MP("D",D,SW)--cycle); D(B--MP("M",M,W)); D(B--MP("N",N,S)); D(CR(B,3));[/asy]

Let $Q$ be any point on a circle and let $P_1P_2P_3...P_8$ be a regular inscribed octagon. Prove that the sum of the fourth powers of the distances from $Q$ to the diameters $P_1P_5$, $P_2P_6$, $P_3P_7$, $P_4P_8$ is independent of the position of $Q$.

Let triangle $ABC$ have side lengths$ AB = 19$, $BC = 180$, and $AC = 181$, and angle measure $\angle ABC = 90^o$. Let the midpoints of $AB$ and $BC$ be denoted by $M$ and $N$ respectively. The circle centered at $ M$ and passing through point $C$ intersects with the circle centered at the $N$ and passing through point $A$ at points $D$ and $E$. If $DE$ intersects $AC$ at point $P$, find min $(DP,EP)$.

Let $a,b,c$ be the sides of a triangle, $\alpha ,\beta ,\gamma$ the corresponding angles and $r$ the inradius. Prove that $$a\cdot sin\alpha+b\cdot sin\beta+c\cdot sin\gamma\geq 9r$$

Consider the region $A$ in the complex plane that consists of all points $z$ such that both $\frac{z}{40}$ and $\frac{40}{\overline{z}}$ have real and imaginary parts between $0$ and $1$, inclusive. What is the integer that is nearest the area of $A$?

Find all non-integers $x$ such that $x+\frac{13}{x}=[x]+\frac{13}{[x]} . $where$[x]$ mean the greatest integer $n$ , where $n\leq x.$

Find all pairs of natural numbers $(m, n)$ for which $2^m3^n +1$ is the square of some integer.

Marisa has a collection of $2^8-1=255$ distinct nonempty subsets of $\{1, 2, 3, 4, 5, 6, 7, 8\}$. For each step she takes two subsets chosen uniformly at random from the collection, and replaces them with either their union or their intersection, chosen randomly with equal probability. (The collection is allowed to contain repeated sets.) She repeats this process $2^8-2=254$ times until there is only one set left in the collection. What is the expected size of this set?

Find all integers that can be written in the form $\frac{1}{a_1}+\frac{2}{a_2}+...+\frac{9}{a_9}$ where $a_1,a_2, ...,a_9$ are nonzero digits, not necessarily different.

A $\textit{shuffle}$ is a permutation of the integers $1,2,3,4,5$. More formally, a shuffle is a function $f:\{1,2,3,4,5\}\rightarrow\{1,2,3,4,5\}$ such that if $i\neq j$ then $f(i)\neq f(j)$. For example, $12345\mapsto23154$ denotes a shuffle $f$ so that $f(1)=2$, $f(2)=3$, $f(3)=1$, $f(4)=5$, and $f(5)=4$. A shuffle can be repeated some number of times to obtain another shuffle. For example, if $f$ is the shuffle $12345\mapsto23154$ from above, then repeating $f$ twice gives the shuffle $g(x)=f(f(x))$ which is $12345\mapsto31245$. How many shuffles are there that, when repeated $6$ times, give the shuffle $12345\mapsto12345$?

A rectangle with side lengths $1{ }$ and $3,$ a square with side length $1,$ and a rectangle $R$ are inscribed inside a larger square as shown. The sum of all possible values for the area of $R$ can be written in the form $\tfrac mn$, where $m$ and $n$ are relatively prime positive integers. What is $m+n?$ [asy] size(8cm); draw((0,0)--(10,0)); draw((0,0)--(0,10)); draw((10,0)--(10,10)); draw((0,10)--(10,10)); draw((1,6)--(0,9)); draw((0,9)--(3,10)); draw((3,10)--(4,7)); draw((4,7)--(1,6)); draw((0,3)--(1,6)); draw((1,6)--(10,3)); draw((10,3)--(9,0)); draw((9,0)--(0,3)); draw((6,13/3)--(10,22/3)); draw((10,22/3)--(8,10)); draw((8,10)--(4,7)); draw((4,7)--(6,13/3)); label("$3$",(9/2,3/2),N); label("$3$",(11/2,9/2),S); label("$1$",(1/2,9/2),E); label("$1$",(19/2,3/2),W); label("$1$",(1/2,15/2),E); label("$1$",(3/2,19/2),S); label("$1$",(5/2,13/2),N); label("$1$",(7/2,17/2),W); label("$R$",(7,43/6),W); [/asy] $(\textbf{A})\: 14\qquad(\textbf{B}) \: 23\qquad(\textbf{C}) \: 46\qquad(\textbf{D}) \: 59\qquad(\textbf{E}) \: 67$

Show that $\frac{x^2}{1 - x}+\frac{(1 - x)^2}{x} \ge 1$ for all real numbers $x$, where $0 < x < 1$

Two sequences of integers, $ a_1, a_2, a_3, \ldots$ and $ b_1, b_2, b_3, \ldots$, satisfy the equation \[ (a_n \minus{} a_{n \minus{} 1})(a_n \minus{} a_{n \minus{} 2}) \plus{} (b_n \minus{} b_{n \minus{} 1})(b_n \minus{} b_{n \minus{} 2}) \equal{} 0 \] for each integer $ n$ greater than $ 2$. Prove that there is a positive integer $ k$ such that $ a_k \equal{} a_{k \plus{} 2008}$.

The sequence of integers $\{a_i\}_{i = 0}^{\infty}$ satisfies $a_0 = 3$, $a_1 = 4$, and \[a_{n+2} = a_{n+1} a_n + \left\lceil \sqrt{a_{n+1}^2 - 1} \sqrt{a_n^2 - 1}\right\rceil\] for $n \ge 0$. Evaluate the sum \[\sum_{n = 0}^{\infty} \left(\frac{a_{n+3}}{a_{n+2}} - \frac{a_{n+2}}{a_n} + \frac{a_{n+1}}{a_{n+3}} - \frac{a_n}{a_{n+1}}\right).\]

Marley practices exactly one sport each day of the week. She runs three days a week but never on two consecutive days. On Monday she plays basketball and two days later golf. She swims and plays tennis, but she never plays tennis the day after running or swimming. Which day of the week does Marley swim? $\textbf{(A) } \text{Sunday} \qquad\textbf{(B) } \text{Tuesday} \qquad\textbf{(C) } \text{Thursday} \qquad\textbf{(D) } \text{Friday} \qquad\textbf{(E) } \text{Saturday} $

In a triangle $\triangle{ABC}$ with all its sides of different length, $D$ is on the side $AC$, such that $BD$ is the angle bisector of $\sphericalangle{ABC}$. Let $E$ and $F$, respectively, be the feet of the perpendicular drawn from $A$ and $C$ to the line $BD$ and let $M$ be the point on $BC$ such that $DM$ is perpendicular to $BC$. Show that $\sphericalangle{EMD}=\sphericalangle{DMF}$.

Let $p$ a prime number and $d$ a divisor of $p-1$. Find the product of elements in $\mathbb Z_p$ with order $d$. ($\mod p$). (10 points)

In a club, some pairs of members are friends. Given an integer $k \geqslant 3$, we say a club is $k$-[i]friendly[/i] if, in any group of $k$ members, they can be seated at a round table such that each pair of neighbors are friends. [list=a] [*]Prove that if a club is $6$-friendly, then it is also $7$-friendly. [*]Is it true that if a club is $9$-friendly, then it is also $10$-friendly? [/list]

Given a fixed circle $(O)$ and two fixed points $B, C$ on that circle, let $A$ be a moving point on $(O)$ such that $\triangle ABC$ is acute and scalene. Let $I$ be the midpoint of $BC$ and let $AD, BE, CF$ be the three heights of $\triangle ABC$. In two rays $\overrightarrow{FA}, \overrightarrow{EA}$, we pick respectively $M,N$ such that $FM = CE, EN = BF$. Let $L$ be the intersection of $MN$ and $EF$, and let $G \neq L$ be the second intersection of $(LEN)$ and $(LFM)$. a) Show that the circle $(MNG)$ always goes through a fixed point. b) Let $AD$ intersects $(O)$ at $K \neq A$. In the tangent line through $D$ of $(DKI)$, we pick $P,Q$ such that $GP \parallel AB, GQ \parallel AC$. Let $T$ be the center of $(GPQ)$. Show that $GT$ always goes through a fixed point.

Define a sequence $<x_n>$ by $x_0 = 0$ and $$\large x_n = \left\{ \begin{array}{ll} x_{n-1} + \frac{3^r-1}{2} & if \,\,n = 3^{r-1}(3k + 1)\\ & \\ x_{n-1} - \frac{3^r+1}{2} & if \,\, n = 3^{r-1}(3k + 2)\\ \end{array} \right. $$ where $k, r$ are integers. Prove that every integer occurs exactly once in the sequence.

Let $m,n$ be co-prime integers, such that $m$ is even and $n$ is odd. Prove that the following expression does not depend on the values of $m$ and $n$: \[ \frac 1{2n} + \sum^{n-1}_{k=1} (-1)^{\left[ \frac{mk}n \right]} \left\{ \frac {mk}n \right\} . \] [i]Bogdan Enescu[/i]

$n\ge 3$ guests met at a party. Some of them know each other but there is no quartet of different guests $a, b, c, d$ such that in pairs $\lbrace a, b \rbrace, \lbrace b, c \rbrace, \lbrace c, d \rbrace, \lbrace d, a \rbrace$ guests know each other but in pairs $\lbrace a, c \rbrace, \lbrace b, d \rbrace$ guests don't know each other. We say a nonempty set of guests $X$ is an [i]ingroup[/i], when guests from $X$ know each other pairwise and there are no guests not from $X$ knowing all guests from $X$. Prove that there are at most $\frac{n(n-1)}{2}$ different ingroups at that party.

SEEMOUS 2016 COMPETITION PROBLEMS