An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that \[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1 \] for every pair of distinct nonnegative integers $ i, j$.

Luke and Carissa are finding the sum of the first $20$ positive integers by adding them one at a time. Luke forgets to add a number and gets an answer of $207$. Carissa adds a number twice by mistake and gets an answer of $225$. What is the sum of the number that Luke forgot and the number that Carissa added twice?

[b]Q[/b] Let $p,q,r$ be non negative reals such that $pqr=1$. Find the maximum value for the expression $$\sum_{cyc} p[r^{4}+q^{4}-p^{4}-p]$$ [i]Proposed by Aritra12[/i]

Given a string of at least one character in which each character is either A or B, Kathryn is allowed to make these moves: [list] [*] she can choose an appearance of A, erase it, and replace it with BB, or [*] she can choose an appearance of B, erase it, and replace it with AA. [/list] Kathryn starts with the string A. Let $a_n$ be the number of strings of length $n$ that Kathryn can reach using a sequence of zero or more moves. (For example, $a_1=1$, as the only string of length 1 that Kathryn can reach is A.) Then $\sum_{n=1}^{\infty} \frac{a_n}{5^n} = \frac{m}{n}$, where $m$ and $n$ are positive integers with $\gcd(m,n)=1$. Compute $100m+n$. [i]Proposed by Luke Robitaille[/i]

Let $n\in \mathbb{N}$. Prove that $lcm [1,2,..,n]=lcm [\binom{n}{1},\binom{n}{2},...,\binom{n}{n}]$ if and only if $n+1$ is a prime number.

Let $a,b,c$ be 3 integers, $b$ odd, and define the sequence $\{x_n\}_{n\geq 0}$ by $x_0=4$, $x_1=0$, $x_2=2c$, $x_3=3b$ and for all positive integers $n$ we have \[ x_{n+3} = ax_{n-1}+bx_n + cx_{n+1} . \] Prove that for all positive integers $m$, and for all primes $p$ the number $x_{p^m}$ is divisible by $p$.

For an arbitrary ordinal number $\alpha$ let $H(\alpha)$ denote the set of functions $f\colon \alpha \rightarrow \{ -1,0,1\}$ that map all but finitely many elements of $\alpha$ to $0$. Order $H(\alpha)$ according to the last difference, that is, for $f, g\in H(\alpha)$ let $f\prec g$ if $f(\beta) < g(\beta)$ holds for the maximum ordinal number $\beta < \alpha$ with $f(\beta) \neq g(\beta)$. Prove that the ordered set $(H(\alpha), \prec)$ is scattered (i.e. it doesn't contain a subset isomorphic to the set of rational numbers with the usual order), and that any scattered order type can be embedded into some $(H(\alpha), \prec)$.

$n$ students, numbered from $1$ to $n$ are sitting next to each other in a class. In the beginning the $1$st student has $n$ pieces of paper in one pile. The goal of the students is to distribute the $n$ pieces in a way that everyone gets exactly one. The teacher claps once in a minute and for each clap the students can choose one of the following moves (or do nothing): $\bullet$ They divide one of their piles of paper into two smaller piles. $\bullet$ They give one of their piles of paper to the student with the next number. At least how many times does the teacher need to clap in order to make it possible for the students to distribute all the pieces of paper amongst themselves?

Five times $A$'s money added to $B$'s money is more than $\$51.00$. Three times $A$'s money minus $B$'s money is $\$21.00$. If $a$ represents $A$'s money in dollars and $b$represents $B$'s money in dollars, then: $ \textbf{(A)}\ a>9, b>6 \qquad\textbf{(B)}\ a>9, b<6 \qquad\textbf{(C)}\ a>9, b=6\qquad$ $\textbf{(D)}\ a>9, \text{but we can put no bounds on} \text{ } b\qquad\textbf{(E)}\ 2a=3b $

Let $ p$ be a positive integer. Define the function $ f: \mathbb{N}\to\mathbb{N}$ by $ f(n)\equal{}a_1^p\plus{}a_2^p\plus{}\cdots\plus{}a_m^p$, where $ a_1, a_2,\ldots, a_m$ are the decimal digits of $ n$ ($ n\equal{}\overline{a_1a_2\ldots a_m}$). Prove that every sequence $ (b_k)^\infty_{k\equal{}0}$ of positive integer that satisfy $ b_{k\plus{}1}\equal{}f(b_k)$ for all $ k\in\mathbb{N}$, has a finite number of distinct terms. $ \mathbb{N}\equal{}\{1,2,3\ldots\}$

A rectangular table $ 9$ rows $ \times$ $ 2008$ columns is fulfilled with numbers $ 1$, $ 2$, ...,$ 2008$ in a such way that each number appears exactly $ 9$ times in table and difference between any two numbers from same column is not greater than $ 3$. What is maximum value of minimum sum in column (with minimal sum)?

Let $ABC$ be a triangle such that $\vert AB\vert \ne \vert AC\vert$. Prove that there exists a point $D \ne A$ on its circumcircle satisfying the following property: For any points $M, N$ outside the circumcircle on the rays $AB$ and $AC$, respectively, satisfying $\vert BM\vert=\vert CN\vert$, the circumcircle of $AMN$ passes through $D$.

In a triangle $ABC$, $T$ is the centroid and $ \angle TAB = \angle ACT$. Find the maximum possible value of $sin \angle CAT +sin \angle CBT$.

There are two piles of cards, one with $n$ cards and the other with $m$ cards. $A$ and $B$ play alternately, performing one of the following actions in each turn. following operations: a) Remove a card from a pile. b) Remove one card from each pile. c) Move a card from one pile to the other. Player $A$ always starts the game and whoever takes the last one letter wins . Determine if there is a winning strategy based on $m$ and $n$, so that one of the players following her can win always.

A lattice point in the plane is a point both of whose coordinates are integers. Each lattice point has four neighboring points: upper, lower, left, and right. Let $k$ be a circle with radius $r \geq 2$, that does not pass through any lattice point. An interior boundary point is a lattice point lying inside the circle $k$ that has a neighboring point lying outside $k$. Similarly, an exterior boundary point is a lattice point lying outside the circle $k$ that has a neighboring point lying inside $k$. Prove that there are four more exterior boundary points than interior boundary points.

Let $w$-circumcircle of triangle $ABC$ with an obtuse angle $C$ and $C '$symmetric point of point $C$ with respect to $AB$. $M$ midpoint of $AB$. $C'M$ intersects $w$ at $N$ ($C '$ between $M$ and $N$). Let $BC'$ second crossing point $w$ in $F$, and $AC'$ again crosses the $w$ at point $E$. $K$-midpoint $EF$. Prove that the lines $AB, CN$ and$ KC'$are concurrent.