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

Let $n$ be an even positive integer. A sequence of $n$ real numbers is called complete if for every integer $m$ with $1 \leq m \leq n$ either the sum of the first $m$ terms of the sum or the sum of the last $m$ terms is integral. Determine the minimum number of integers in a complete sequence of $n$ numbers.

Prove that if the numbers $ a $, $ b $, $ c $ satisfy the equation $$ \frac{1}{ab} + \frac{1}{bc} +\frac{1}{ca} = \frac{1}{ab + bc + ca},$$ then two of them are opposite numbers.

Near the end of a game of Fish, Celia is playing against a team consisting of Alice and Betsy. Each of the three players holds two cards in their hand, and together they have the Nine, Ten, Jack, Queen, King, and Ace of Spades (this set of cards is known by all three players). Besides the two cards she already has, each of them has no information regarding the other two's hands (In particular, teammates Alice and Betsy do not know each other's cards). It is currently Celia's turn. On a player's turn, the player must ask a player on the other team whether she has a certain card that is in the set of six cards but [i]not[/i] in the asker's hand. If the player being asked does indeed have the card, then she must reveal the card and put it in the asker’s hand, and the asker shall ask again (but may ask a different player on the other team); otherwise, she refuses and it is now her turn. Moreover, a card may not be asked if it is known (to the asker) to be not in the asked person's hand. The game ends when all six cards belong to one team, and the team with all the cards wins. Under optimal play, the probability that Celia wins the game is $\frac{p}{q}$ for relatively prime positive integers $p$ and $q$. Find $100p+q$. [i]Proposed by Yannick Yao[/i]

In the convex pentagon $ABCDE$, $AE = AD$, $AB = AC$, and angle $CAD$ equals the sum of angles $AEB$ and $ABE$. Prove that segment $CD$ is double the length of median $AM$ of triangle $ABE$.

[b]p1.[/b] Find the unknown angle $a$ of the triangle inscribed in the square. [img]https://cdn.artofproblemsolving.com/attachments/b/1/4aab5079dea41637f2fa22851984f886f034df.png[/img] [b]p2.[/b] Draw a polygon in the plane and a point outside of it with the following property: no edge of the polygon is completely visible from that point (in other words, the view is obstructed by some other edge). [b]p3.[/b] This problem has two parts. In each part, $2022$ real numbers are given, with some additional property. (a) Suppose that the sum of any three of the given numbers is an integer. Show that the total sum of the $2022$ numbers is also an integer. (b) Suppose that the sum of any five of the given numbers is an integer. Show that 5 times the total sum of the $2022$ numbers is also an integer, but the sum itself is not necessarily an integer. [b]p4.[/b] Replace stars with digits so that the long multiplication in the example below is correct. [img]https://cdn.artofproblemsolving.com/attachments/9/7/229315886b5f122dc0675f6d578624e83fc4e0.png[/img] [b]p5.[/b] Five nodes of a square grid paper are marked (called marked points). Show that there are at least two marked points such that the middle point of the interval connecting them is also a node of the square grid paper [b]p6.[/b] Solve the system $$\begin{cases} \dfrac{xy}{x+y}=\dfrac{8}{3} \\ \dfrac{yz}{y+z}=\dfrac{12}{5} \\\dfrac{xz}{x+z}=\dfrac{24}{7} \end{cases}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Solve $p^n+144=m^2$ where $m,n\in \mathbb{N}$ and $p$ is a prime number.

Let $n,k$ be positive integers such that $n>k$. There is a square-shaped plot of land, which is divided into $n\times n$ grid so that each cell has the same size. The land needs to be plowed by $k$ tractors; each tractor will begin on the lower-left corner cell and keep moving to the cell sharing a common side until it reaches the upper-right corner cell. In addition, each tractor can only move in two directions: up and right. Determine the minimum possible number of unplowed cells.

In a group of $n$ people each one has an Easter Egg. They exchange their eggs in the following way: On each exchange two people exchange the eggs they currently have. Each two exchange eggs between themselves at least once. After a certain amount of such exchanges it turned out that each one of the $n$ people had the same egg he had from the beginning. Determine the least amount of exchanges needed, if: a) $n=5$; b) $n=6$.

The intramural squash league has 5 players, namely Albert, Bassim, Clara, Daniel, and Eugene. Albert has played one game, Bassim has played two games, Clara has played 3 games, and Daniel has played 4 games. Assuming no two players in the league play each other more than one time, how many games has Eugene played?

Suppose that $ a_1$, $ a_2$, $ \ldots$, $ a_n$ are integers such that $ n\mid a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n$. Prove that there exist two permutations $ \left(b_1,b_2,\ldots,b_n\right)$ and $ \left(c_1,c_2,\ldots,c_n\right)$ of $ \left(1,2,\ldots,n\right)$ such that for each integer $ i$ with $ 1\leq i\leq n$, we have \[ n\mid a_i \minus{} b_i \minus{} c_i \] [i]Proposed by Ricky Liu & Zuming Feng, USA[/i]