Five pairs of twins are randomly arranged around a circle. Then they perform zero or more swaps, where each swap switches the positions of two adjacent people. They want to reach a state where no one is adjacent to their twin. Compute the expected value of the smallest number of swaps needed to reach such a state.

Let $n$, $d$ be positive integers such that $d>\frac{n}{2}$. Suppose $a_1, a_2,\cdots,a_{d+2}$ is a sequence of integers satisfying $a_{d+1}=a_1$, $a_{d+2}=a_2$, and for all indices $1\le i_1<i_2<\cdots <i_s\le d$, $$a_{i_1}+a_{i_2}+\cdots+a_{i_s}\not\equiv 0\pmod n$$ Prove that there exists $1\le i\le d$ such that $$a_{i+1}\equiv a_i \pmod n \quad \text{or} \quad a_{i+1}\equiv a_i+a_{i+2} \pmod n$$ [i]Proposed by Yeoh Zi Song[/i]

Alice and Bob play the following game. They alternate selecting distinct nonzero digits (from $1$ to $9$) until they have chosen seven such digits, and then consider the resulting seven-digit number by concatenating the digits in the order selected, with the seventh digit appearing last (i.e. $\overline{A_1B_2A_3B_4A_6B_6A_7}$). Alice wins if and only if the resulting number is the last seven decimal digits of some perfect seventh power. Please determine which player has the winning strategy.

Consider polynomial $f(x)={{x}^{2}}-\alpha x+1$ with $\alpha \in \mathbb{R}.$ a) For $\alpha =\frac{\sqrt{15}}{2}$, let write $f(x)$ as the quotient of two polynomials with nonnegative coefficients. b) Find all value of $\alpha $ such that $f(x)$ can be written as the quotient of two polynomials with nonnegative coefficients.

Leo and Paul are at the Berkeley BART station and are racing to San Francisco. Leo is planning to take the line that takes him directly to SF, and because he has terrible BART luck, his train will arrive in some integer number of minutes, with probability $\frac i{210}$ for $1\le i\le20$ at any given minute. Paul will take a second line, whose trains always arrive before Leo’s train, with uniform probability. However, Paul must also make a transfer to a 3rd line, whose trains arrive with uniform probability between $0$ and $10$ minutes after Paul reaches the transfer station. What is the probability that Leo gets to SF before Paul does?

Given a quadrangle $ABCD$. The lengths of all its sides and diagonals are the rational numbers. Let $O$ be the point of its diagonals intersection. Prove that $|AO|$ - the length of the $[AO]$ segment is also rational.

Let $n\in \mathbb{N}$. Prove that the polynom $p(x)=x^{2n}-2x^{2n-1}+3x^{2n-2}-...-2nx+2n+1$ doesn't have real roots.

Prove that the Fibonacci sequence $\{F_n\}^\infty_{n=1}$ defined by $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for all $n \geq 1$ is a divisibility sequence, that is, if $m\mid n$ then $F_m \mid F_n$ for all positive integers $m$ and $n$.

The figures $ F_1$, $ F_2$, $ F_3$, and $ F_4$ shown are the first in a sequence of figures. For $ n\ge3$, $ F_n$ is constructed from $ F_{n \minus{} 1}$ by surrounding it with a square and placing one more diamond on each side of the new square than $ F_{n \minus{} 1}$ had on each side of its outside square. For example, figure $ F_3$ has $ 13$ diamonds. How many diamonds are there in figure $ F_{20}$? [asy]unitsize(3mm); defaultpen(linewidth(.8pt)+fontsize(10pt)); path d=(1/2,0)--(0,sqrt(3)/2)--(-1/2,0)--(0,-sqrt(3)/2)--cycle; marker m=marker(scale(5)*d,Fill); path f1=(0,0); path f2=(0,0)--(-1,1)--(1,1)--(1,-1)--(-1,-1); path[] g2=(-1,1)--(-1,-1)--(0,0)^^(1,-1)--(0,0)--(1,1); path f3=f2--(-2,-2)--(-2,0)--(-2,2)--(0,2)--(2,2)--(2,0)--(2,-2)--(0,-2); path[] g3=g2^^(-2,-2)--(0,-2)^^(2,-2)--(1,-1)^^(1,1)--(2,2)^^(-1,1)--(-2,2); path[] f4=f3^^(-3,-3)--(-3,-1)--(-3,1)--(-3,3)--(-1,3)--(1,3)--(3,3)-- (3,1)--(3,-1)--(3,-3)--(1,-3)--(-1,-3); path[] g4=g3^^(-2,-2)--(-3,-3)--(-1,-3)^^(3,-3)--(2,-2)^^(2,2)--(3,3)^^ (-2,2)--(-3,3); draw(f1,m); draw(shift(5,0)*f2,m); draw(shift(5,0)*g2); draw(shift(12,0)*f3,m); draw(shift(12,0)*g3); draw(shift(21,0)*f4,m); draw(shift(21,0)*g4); label("$F_1$",(0,-4)); label("$F_2$",(5,-4)); label("$F_3$",(12,-4)); label("$F_4$",(21,-4));[/asy]$ \textbf{(A)}\ 401 \qquad \textbf{(B)}\ 485 \qquad \textbf{(C)}\ 585 \qquad \textbf{(D)}\ 626 \qquad \textbf{(E)}\ 761$

$A,B,C$ are points in the plane such that $\angle ABC=90^\circ$. Circles with diameters $BA$ and $BC$ meet at $D$. If $BA=20$ and $BC=21$, then the length of segment $BD$ can be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. What is $m+n$? [i]Ray Li[/i]

In the octagon below all sides have the length $1$ and all angles are equal. Determine the distance between the corners $A$ and $B$. [img]https://1.bp.blogspot.com/-i6TAFDvcQ8w/XzXCRhnV_kI/AAAAAAAAMVw/rKrQMfPYYJIaCwl8hhdVHdqO4fIn8O7cwCLcBGAsYHQ/s0/2011%2BMogh%2Bp2.png[/img]

Welcome to the [b]USAYNO[/b], where each question has a yes/no answer. Choose any subset of the following six problems to answer. If you answer $n$ problems and get them [b]all[/b] correct, you will receive $\max(0, (n-1)(n-2))$ points. If any of them are wrong (or you leave them all blank), you will receive $0$ points. Your answer should be a six-character string containing 'Y' (for yes), 'N' (for no), or 'B' (for blank). For instance if you think 1,2, and 6 are 'yes' and 3 and 4 are 'no', you should answer YYNNBY (and receive $12$ points if all five answers are correct, 0 points if any are wrong). (a) Can $1000$ queens be placed on a $2017\times2017$ chessboard such that every square is attacked by some queen? A square is attacked by a queen if it lies on the same row, column, or diagonal as the queen. (b) A $2017\times2017$ grid of squares originally contains a $0$ in each square. At any step, Kelvin the Frog choose two adjacent squares (two squares are adjacent if they share a side) and increments the numbers in both of them by $1$. Can Kelvin make every square contain a different power of $2$? (c) A [i]tournament[/i] consists of single games between every pair of players, where each game has a winner and a loser with no ties. A set of people is [i]dominated[/i] if there exists a player who beats all of them. Does there exist a tournament in which every set of $2017$ people is dominated? (d) Every cell of a $19\times19$ grid is colored either red, yellow, green, or blue. Does there necessarily exist a rectangle whose sides are parallel to the grid, all of whose vertices are the same color? (e) Does there exist a $c\in\mathbb{R}^+$ such that $\max(|A\cdot A|, |A+A|)\ge c|A|\log^2|A|$ for all finite sets $A\subset \mathbb{Z}$? (f) Can the set $\{1, 2, \dots, 1093\}$ be partitioned into $7$ subsets such that each subset is sum-free (i.e. no subset contains $a,b,c$ with $a+b=c$)? [color = red]The USAYNO disclaimer is only included in problem 33. I have included it here for convenience.[/color]

Does a parallelogram exist such that all pairwise meets of bisectors of its angles are situated outside it?

Suppose $f$ is a nonconstant polynomial with integer coefficients with the following property: [list] [*]$f(0)$ and $f(1)$ are both odd. [*]Define a sequence of integers with $a_k = f(1)f(2) \cdots f(k)+1$ [/list] Prove that there are infinitely many prime numbers dividing at least one element of the sequence. [i]Proposed by Sayandeep Shee[/i]

Let $A$ be a solid $a\times b\times c$ rectangular brick, where $a,b,c>0$. Let $B$ be the set of all points which are a distance of at most one from some point of $A$. Express the volume of $B$ as a polynomial in $a,b,$ and $c$.

Find the value of \[\sum_{a = 1}^{\infty} \sum_{b = 1}^{\infty} \sum_{c = 1}^{\infty} \frac{ab(3a + c)}{4^{a+b+c} (a+b)(b+c)(c+a)}.\]

Find all $f: \mathbb{N}\rightarrow \mathbb{N}$, for which $f(f(n)+m)=n+f(m+2014)$ for $\forall$ $m,n\in \mathbb{N}$.

Given the following real numbers $a. b, c $ greater than one that $a + b + c = 6$. Prove the inequality $$\frac{a}{b^2-1}+\frac{b}{c^2-1}+\frac{c}{a^2-1}\ge 2$$

The continuous function $f:[0,1]\rightarrow\mathbb{R}$ has the property: \[\lim_{x\rightarrow\infty}\ n\left(f\left(x+\frac{1}{n}\right)-f(x)\right)=0 \] for every $x\in [0,1)$. Show that: a) For every $\epsilon >0$ and $\lambda\in (0,1)$, we have: \[ \sup\ \{x\in[0,\lambda )\mid |f(x)-f(0)|\le \epsilon x \}=\lambda \] b) $f$ is a constant function.

A group of $6$ friends sit in the back row of an otherwise empty movie theater. Each row in the theater contains $8$ seats. Euler and Gauss are best friends, so they must sit next to each other, with no empty seat between them. However, Lagrange called them names at lunch, so he cannot sit in an adjacent seat to either Euler or Gauss. In how many different ways can the $6$ friends be seated in the back row? $\text{(A) }2520\qquad\text{(B) }3600\qquad\text{(C) }4080\qquad\text{(D) }5040\qquad\text{(E) }7200$

It is known that, for all positive integers $k,$ \[1^{2}+2^{2}+3^{2}+\cdots+k^{2}=\frac{k(k+1)(2k+1)}{6}. \]Find the smallest positive integer $k$ such that $1^{2}+2^{2}+3^{2}+\cdots+k^{2}$ is a multiple of $200.$

Let $\mathcal{F}$ be the set of the differentiable functions $f: \mathbb{R} \to \mathbb{R}$ satisfying $f(x) \ge f(x+ \sin x)$ for any $x \in \mathbb{R}.$ a) Prove that there exist nonconstant functions in $\mathcal{F}.$ b) Prove that if $f \in \mathcal{F},$ then the set of solutions of the equation $f'(x)=0$ is infinite.

Given trapezoid $ ABCD$ with parallel sides $ AB$ and $ CD$, assume that there exist points $ E$ on line $ BC$ outside segment $ BC$, and $ F$ inside segment $ AD$ such that $ \angle DAE \equal{} \angle CBF$. Denote by $ I$ the point of intersection of $ CD$ and $ EF$, and by $ J$ the point of intersection of $ AB$ and $ EF$. Let $ K$ be the midpoint of segment $ EF$, assume it does not lie on line $ AB$. Prove that $ I$ belongs to the circumcircle of $ ABK$ if and only if $ K$ belongs to the circumcircle of $ CDJ$. [i]Proposed by Charles Leytem, Luxembourg[/i]

The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?

Consider rectangle $ABCD$.$ E$ is the mid-point of $AD$ and $F$ is the mid-point of $ED$. $CE$ cuts $AB$ in $G$ and $BF$ cuts $CD$ in $H$ point. We can write ratio of areas of $BCG$ and $BCH$ triangles as $\frac{m}{n}$. Find the value of $10m + 10n + mn$.