An auditorium has two rows of seats, with $50$ seats in each row. $100$ indistinguishable people sit in the seats one at a time, subject to the condition that each person, except for the first person to sit in each row, must sit to the left or right of an occupied seat, and no two people can sit in the same seat. In how many ways can this process occur?

Let $x_1,x_2,...,x_n$ be positive real numbers for which $$\frac{1}{1+x_1}+\frac{1}{1+x_2}+...+\frac{1}{1+x_n}=1$$ Prove that $x_1x_2...x_n \ge (n -1)^n$.

Let $ABC$ be an acute triangle. Circle $k$ with diameter $AB$ intersects $AC$ and $BC$ again at $M$ and $N$ respectively. The tangents to $k$ at $M$ and $N$ meet at point $P$. Given that $CP=MN$, determine $\angle ACB$.

If $\sum_{i=1}^n\cos^{-1}(\alpha_i)=0$, then find $\sum_{i=1}^n\alpha_i$. $\textbf{(A)}~\frac n2$ $\textbf{(B)}~n$ $\textbf{(C)}~n\pi$ $\textbf{(D)}~\frac{n\pi}2$

what maximal number of colors can we use in order to color squares of 10 *10 square board so that each row or column contains squares of at most 5 different colors?

In the accompanying figure, segments $AB$ and $CD$ are parallel, the measure of angle $D$ is twice the measure of angle $B$, and the measures of segments $AB$ and $CD$ are $a$ and $b$ respectively. Then the measure of $AB$ is equal to $\textbf{(A) }\dfrac{1}{2}a+2b\qquad\textbf{(B) }\dfrac{3}{2}b+\dfrac{3}{4}a\qquad\textbf{(C) }2a-b\qquad\textbf{(D) }4b-\dfrac{1}{2}a\qquad \textbf{(E) }a+b$ [asy] size(175); defaultpen(linewidth(0.8)); real r=50, a=4,b=2.5,c=6.25; pair A=origin,B=c*dir(r),D=(a,0),C=shift(b*dir(r))*D; draw(A--B--C--D--cycle); label("$A$",A,SW); label("$B$",B,N); label("$C$",C,E); label("$D$",D,S); label("$a$",D/2,N); label("$b$",(C+D)/2,NW); //Credit to djmathman for the diagram[/asy]

A sequence of real numbers is called a [i]Fibonacci [/i] sequence if $$t_{n+2} = t_{n+1} + t_n$$ for $n= 1,2,3,. .$ . Two Fibonacci sequences are said to be [i]essentially different[/i] if the terms of one sequence cannot be obtained by multiplying the terms of the other by a constant. For example, the Fibonacci sequences $1,2,3,5,8,...$ and $1,3,4,7,11,...$ are essentially different, but the sequences $1,2,3,5,8,...$ and $2,4,6,10,16,...$ are not. (a) Prove that there exist real numbers $p$ and $q$ such that the sequences $1,p,p^2,p^3,...$ and $1,q,q^2,q^3,...$ are essentially different Fibonacci sequences. (b) Let $a_1,a_2,a_3,...$ and $b_1,b_2,b_3,...$ be essentially different Fibonacci sequences. Prove that for every Fibonacci sequence $t_1,t_2,t_3,...$, there exists exactly one number $\alpha$ and exactly one number $\beta$, such that: $$t_n = \alpha a_n + \beta b_n$$ for $n = 1,2,3,...$ (c) $t_1,t_2,t_3,...$, is the Fibonacci sequence with $t_1 = 1$ and $t_2= 2$. Express $t_n$ in terms of $n$.

The product $$\left(\frac{1}{2^3-1}+\frac12\right)\left(\frac{1}{3^3-1}+\frac12\right)\left(\frac{1}{4^3-1}+\frac12\right)\cdots\left(\frac{1}{100^3-1}+\frac12\right)$$ can be written as $\frac{r}{s2^t}$ where $r$, $s$, and $t$ are positive integers and $r$ and $s$ are odd and relatively prime. Find $r+s+t$.

Find necessary and sufficient conditions on positive integers $m$ and $n$ so that \[\sum_{i=0}^{mn-1}(-1)^{\lfloor i/m\rfloor+\lfloor i/n\rfloor}=0.\]

Let $k$ be a positive integer. Consider $k$ not necessarily distinct prime numbers such that their product is ten times their sum. What are these primes and what is the value of $k$?

Triangle $ABC$ has circumcenter $O$. $D$ is an arbitrary point on $BC$, and $AD$ intersects $\odot(ABC)$ at $E$. $S$ is a point on $\odot(ABC)$ such that $D, O, E, S$ are colinear. $AS$ intersects $BC$ at $P$. $Q$ is a point on $BC$ such that $D, O, A, Q$ are concylic. Prove that $\odot(ABC)$ is tangent to $\odot (APQ)$. [i]Proposed by chengbilly[/i]

A sequence of integers $a_0, a_1 …$ is called [i]kawaii[/i] if $a_0 =0, a_1=1,$ and $$(a_{n+2}-3a_{n+1}+2a_n)(a_{n+2}-4a_{n+1}+3a_n)=0$$ for all integers $n \geq 0$. An integer is called [i]kawaii[/i] if it belongs to some kawaii sequence. Suppose that two consecutive integers $m$ and $m+1$ are both kawaii (not necessarily belonging to the same kawaii sequence). Prove that $m$ is divisible by $3,$ and that $m/3$ is also kawaii.

Let $n$ be a given positive integer. Luca, the lazy flea sits on one of the vertices of a regular $2n$-gon. For each jump, Luca picks an axis of symmetry of the polygon, and reflects herself on the chosen axis of symmetry. Let $P(n)$ denote the number of different ways Luca can make $2n$ jumps such that she returns to her original position in the end, and does not pick the same axis twice. (It is possible that Luca's jump does not change her position, however, it still counts as a jump.) [b]a)[/b] Find the value of $P(n)$ if $n$ is odd. [b]b)[/b] Prove that if $n$ is even, then \[P(n)=(n-1)!\cdot n!\cdot \sum_{d\mid n}\left(\varphi\left(\frac{n}d\right)\binom{2d}{d}\right).\] [i]Proposed by Péter Csikvári and Kartal Nagy, Budapest[/i]

What is the sum of real roots of the equation \[ \left ( x + 1\right )\left ( x + \dfrac 14\right )\left ( x + \dfrac 12\right )\left ( x + \dfrac 34\right )= \dfrac {45}{32}? \] $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ -1 \qquad\textbf{(C)}\ -\dfrac {3}{2} \qquad\textbf{(D)}\ -\dfrac {5}{4} \qquad\textbf{(E)}\ -\dfrac {7}{12} $

Determine all functions $f: \mathbb R \to \mathbb R$, such that $$ f (f (x + y) - f (x - y)) = xy$$ for all real $x$ and $y$.

In an acute triangle $ABC$, points $D$ and $E$ lie on side $BC$ with $BD<BE$. Let $O_1, O_2, O_3, O_4, O_5, O_6$ be the circumcenters of triangles $ABD, ADE, AEC, ABE, ADC, ABC$, respectively. Prove that $O_1, O_3, O_4, O_5$ are con-cyclic if and only if $A, O_2, O_6$ are collinear.

Find integer solutions $(x,y)$ of the equation ($1964$ times "$\sqrt{}$"): $$\sqrt{x+\sqrt{x+\sqrt{....\sqrt{x+\sqrt{x}}}}}=y$$

A certain frog that was placed on a vertex of a convex polygon chose to jump to another vertex, either clockwise skipping one vertex, either counterclockwise skipping two vertexes, and repeated the procedure. If the number of jumps that the frog made is equal to the number of sides of the polygon, the frog has passed through all its vertexes and ended up on the initial vertex, what´s the set formed by all the possible values that this number can take? [i]Andrei Eckstein[/i]

In the cyclic quadrilateral $ABCD$, the diagonal $BD$ is divided in half by the diagonal $AC$. The points $E, F, G$ and $H{}$ are the midpoints of the sides $AB, BC, CD{}$ and $DA$ respectively. Let $P = AD \cap BC$ and $Q = AB \cap CD{}$. The bisectors of the angles $APC$ and $AQC$ intersect the segments $EG$ and $FH$ at the points $X{}$ and $Y{}$ respectively. Prove that $XY \parallel BD$.

Three points inside a rectangle determine a triangle. A fourth point is taken inside the triangle. Prove that at least one of the three concave quadrilaterals formed by these four points has perimeter lesser than that of the rectangle. [i](Dan Schwarz)[/i]

Bamal, Halvan, and Zuca are playing [i]The Game[/i]. To start, they‘re placed at random distinct vertices on regular hexagon $ABCDEF$. Two or more players collide when they‘re on the same vertex. When this happens, all the colliding players lose and the game ends. Every second, Bamal and Halvan teleport to a random vertex adjacent to their current position (each with probability $\dfrac{1}{2}$), and Zuca teleports to a random vertex adjacent to his current position, or to the vertex directly opposite him (each with probability $\dfrac{1}{3}$). What is the probability that when [i]The Game[/i] ends Zuca hasn‘t lost? [i]Proposed by Edwin Zhao[/i] [hide=Solution][i]Solution.[/i] $\boxed{\dfrac{29}{90}}$ Color the vertices alternating black and white. By a parity argument if someone is on a different color than the other two they will always win. Zuca will be on opposite parity from the others with probability $\dfrac{3}{10}$. They will all be on the same parity with probability $\dfrac{1}{10}$. At this point there are $2 \cdot 2 \cdot 3$ possible moves. $3$ of these will lead to the same arrangement, so we disregard those. The other $9$ moves are all equally likely to end the game. Examining these, we see that Zuca will win in exactly $2$ cases (when Bamal and Halvan collide and Zuca goes to a neighboring vertex). Combining all of this, the answer is $$\dfrac{3}{10}+\dfrac{2}{9} \cdot \dfrac{1}{10}=\boxed{\dfrac{29}{90}}$$ [/hide]

Let $T = \{n \in N|$n consists of $2$ digits $\}$ and $$P = \{x|x = n(n + 1)... (n + 7); n,n + 1,..., n + 7 \in T\}.$$ Determine the gcd of the elements of $P$.

Let $A$ and $B$ be points on the same branch of the hyperbola $xy=1.$ Suppose that $P$ is a point lying between $A$ and $B$ on this hyperbola, such that the area of the triangle $APB$ is as large as possible. Show that the region bounded by the hyperbola and the chord $AP$ has the same area as the region bounded by the hyperbola and the chord $PB.$

Find, with proof, the maximal length of a non-constant arithmetic progression with all the terms squares of positive integers.

Brennan chooses a set $A = \{a, b,c, d, e \}$ of five real numbers with $a \leq b \leq c \leq d \leq e.$ Delaney determines the subsets of $A$ containing three numbers and adds up the numbers in these subsets. She obtains the sums $0, 3; 4, 8; 9, 10, 11, 12, 14, 19.$ What are the five numbers in Brennan's set?