Two convex quadrilaterals are called [i]partners[/i] if they have three vertices in common and they can be labeled $ABCD$ and $ABCE$ so that $E$ is the reflection of $D$ across the perpendicular bisector of the diagonal $\overline{AC}$. Is there an infinite sequence of convex quadrilaterals such that each quadrilateral is a partner of its successor and no two elements of the sequence are congruent? [center][img]https://cdn.artofproblemsolving.com/attachments/6/e/cc9da12a49043410c50733cb6843e5ec1005d3.jpeg[/img][/center]

In how many rearrangements of the numbers $1, \ 2, \ 3, \ 4, \ 5,\ 6, \ 7, \ 8,\ 9$ do the numbers form a $\textit{hill}$, that is, the numbers form an increasing sequence at the beginning up to a peak, and then form a decreasing sequence to the end such as in $129876543$ or $258976431$?

A white equilateral triangle is split into $n^2$ equal smaller triangles by lines that are parallel to the sides of the triangle. Denote a [i]line of triangles[/i] to be all triangles that are placed between two adjacent parallel lines that forms the grid. In particular, a triangle in a corner is also considered to be a line of triangles. We are to paint all triangles black by a sequence of operations of the following kind: choose a line of triangles that contains at least one white triangle and paint this line black (a possible situation with $n=6$ after four operations is shown in Figure 1; arrows show possible next operations in this situation). Find the smallest and largest possible number of operations.

A $5779$-dimensional polytope is call a [b]$k$-tope[/b] if it has exactly $k$ $5778$-dimensional faces. Find all sequences $b_{5780}, b_{5781}, \dots, b_{11558}$ of nonnegative integers, not all $0$, such that the following condition holds: It is possible to tesselate every $5779$-dimensional polytope with [u]convex[/u] $5779$-dimensional polytopes, such that the number of $k$-topes in the tessellation is proportional to $b_k$, while there are no $k$-topes in the tessellation if $k\notin \{5780, 5781, \dots, 11558\}$.

Andrew starts with the $2018$-tuple of binary digits $(0,0,\dots,0)$. On each turn, he randomly chooses one index (between $1$ and $2018$) and flips the digit at that index (makes it $1$ if it was a $0$ and vice versa). What is the smallest $k$ such that, after $k$ steps, the expected number of ones in the sequence is greater than $1008?$ You must give your answer as a nonnegative integer. If your answer is $A$ and the correct answer is $C$, then your score will be $\max\{\lfloor18.5-\tfrac{|A-C|^{1.8}}{40}\rfloor,0\}.$

We say that we extend a finite sequence of positive integers $(a_1,\dotsc,a_n)$ if we replace it by \[(1,2,\dotsc,a_1-1,a_1,1,2,\dotsc,a_2-1,a_2,1,2,\dotsc,a_3-1,a_3,\dotsc,1,2,\dotsc,a_n-1,a_n)\] i.e., each element $k$ of the original sequence is replaced by $1,2,\dotsc,k$. Géza takes the sequence $(1,2,\dotsc,9)$ and he extends it $2017$ times. Then he chooses randomly one element of the resulting sequence. What is the probability that the chosen element is $1$?

Find the number of positive integers $n$ for which there exists a sequence $x_1, x_2, \cdots, x_n$ of integers with the following property: if indices $1 \le i \le j \le n$ satisfy $i+j \le n$ and $x_i - x_j$ is divisible by $3$, then $x_{i+j} + x_i + x_j + 1$ is divisible by $3$. [i]Based on a proposal by Ivan Koswara[/i]

Let $(a_n)_{n \in \mathbb{N}}$ be a sequence of real numbers such that $$2(a_1+a_2+…+a_n)=na_{n+1}~\forall~n \ge 1.$$ $\textbf{a)}$ Prove that the given sequence is an arithmetic progression. $\textbf{b)}$ If $\lfloor a_1 \rfloor + \lfloor a_2 \rfloor +…+ \lfloor a_n \rfloor = \lfloor a_1+a_2+…+a_n \rfloor~\forall~ n \in \mathbb{N},$ prove that every term of the sequence is an integer.

Let $ p,q,n$ be three positive integers with $ p \plus{} q < n$. Let $ (x_{0},x_{1},\cdots ,x_{n})$ be an $ (n \plus{} 1)$-tuple of integers satisfying the following conditions : (a) $ x_{0} \equal{} x_{n} \equal{} 0$, and (b) For each $ i$ with $ 1\leq i\leq n$, either $ x_{i} \minus{} x_{i \minus{} 1} \equal{} p$ or $ x_{i} \minus{} x_{i \minus{} 1} \equal{} \minus{} q$. Show that there exist indices $ i < j$ with $ (i,j)\neq (0,n)$, such that $ x_{i} \equal{} x_{j}$.

For each positive integer $ n$, the mean of the first $ n$ terms of a sequence is $ n$. What is the $ 2008$th term of the sequence? $ \textbf{(A)}\ 2008 \qquad \textbf{(B)}\ 4015 \qquad \textbf{(C)}\ 4016 \qquad \textbf{(D)}\ 4,030,056 \qquad \textbf{(E)}\ 4,032,064$

If the binary representations of the positive integers $k$ and $n$ are $k = \sum_{i=0}^{\infty} k_i 2^i$ and $n = \sum_{i=0}^{\infty} n_i 2^i$, then the logical sum of these numbers is \[ k \oplus n =\sum_{i=0}^{\infty} |k_i-n_i|2^i. \] Let $N$ be an arbitrary positive integer and $(c_k)_{k \in \mathbb{N}}$ be a sequence of complex numbers such that for all $k \in \mathbb{N}$, $ |c_k| \le 1$. Prove that there exist positive constants $C$ and $\delta$ such that \[ \int_{[-\pi,\pi] \times [-\pi, \pi]} \sup_{n<N, n \in \mathbb{N}} \frac{1}{N} \Big| \sum_{k=1}^{n} c_k e^{i(kx+(k \oplus n) y)} \Big| \mathrm d(x,y) \le C \cdot N^{-\delta} \] holds.

In the sequence in the previous problem, how many of $u_1,u_2,u_3,\ldots, u_{2008}$ are pentagonal numbers?

The sequences $a_n$, $b_n$ and $c_n$ are defined recursively in the following way: $a_0 = 1/6$, $b_0 = 1/2$, $c_0 = 1/3,$ $$a_{n+1}= \frac{(a_n + b_n)(a_n + c_n)}{(a_n - b_n)(a_n - c_n)},\,\, b_{n+1}= \frac{(b_n + a_n)(b_n + c_n)}{(b_n - a_n)(b_n - c_n)},\,\, c_{n+1}= \frac{(c_n + a_n)(c_n + b_n)}{(c_n - a_n)(c_n - b_n)}$$ For each natural number $N$, the following polynomials are defined: $A_n(x) =a_o+a_1 x+ ...+ a_{2N}x^{2N}$ $B_n(x) =b_o+a_1 x+ ...+ a_{2N}x^{2N}$ $C_n(x) =a_o+a_1 x+ ...+ a_{2N}x^{2N}$ Assume the sequences are well defined. Show that there is no real $c$ such that $A_N(c) = B_N(c) = C_N(c) = 0$.

Let be a sequence of real numbers $ \left( x_n \right)_{n\ge 1} $ chosen such that the limit of the sequence $ \left( x_{n+2011}-x_n \right)_{n\ge 1} $ exists. Calculate $ \lim_{n\to\infty } \frac{x_n}{n} . $ [i]Cosmin Nițu[/i]

You are given the existence of an unsorted sequence $a_1,\ldots, a_5$ of five distinct real numbers. The Erdos-Szekeres theorem states that there exists a subsequence of length $3$ which is either strictly increasing or strictly decreasing. You do not have access to the $a_i$, but you do have an oracle which, when given two indexes $1\leq i < j\leq 5$, will tell you whether $a_i < a_j$ or $a_i > a_j$. What is the minimum number of calls to the oracle needed in order to identify an ordered triple of integers $(r,s,t)$ such that $a_r,a_s,a_t$ is one such sequence?