Call admissible a set $A$ of integers that has the following property: If $x,y \in A$ (possibly $x=y$) then $x^2+kxy+y^2 \in A$ for every integer $k$. Determine all pairs $m,n$ of nonzero integers such that the only admissible set containing both $m$ and $n$ is the set of all integers. [i]Proposed by Warut Suksompong, Thailand[/i]

An eccentric mathematician has a ladder with $ n$ rungs that he always ascends and descends in the following way: When he ascends, each step he takes covers $ a$ rungs of the ladder, and when he descends, each step he takes covers $ b$ rungs of the ladder, where $ a$ and $ b$ are fixed positive integers. By a sequence of ascending and descending steps he can climb from ground level to the top rung of the ladder and come back down to ground level again. Find, with proof, the minimum value of $ n,$ expressed in terms of $ a$ and $ b.$

Let $\mathbb Z_{\ge 0}$ be the set of non-negative integers, and let $f:\mathbb Z_{\ge 0}\times \mathbb Z_{\ge 0} \to \mathbb Z_{\ge 0}$ be a bijection such that whenever $f(x_1,y_1) > f(x_2, y_2)$, we have $f(x_1+1, y_1) > f(x_2 + 1, y_2)$ and $f(x_1, y_1+1) > f(x_2, y_2+1)$. Let $N$ be the number of pairs of integers $(x,y)$ with $0\le x,y<100$, such that $f(x,y)$ is odd. Find the smallest and largest possible values of $N$.

Suppose that a sequence $(a_n)_{n=1}^{\infty}$ of integers has the following property: For all $n$ large enough (i.e. $n \ge N$ for some $N$ ), $a_n$ equals the number of indices $i$, $1 \le i < n$, such that $a_i + i \ge n$. Find the maximum possible number of integers which occur infinitely many times in the sequence.

Let $P$ be a non-constant polynomial with integer coefficients such that if $n$ is a perfect power, so is $P(n)$. Prove that $P(x) = x$ or $P$ is a perfect power of a polynomial with integer coefficients. A perfect power is an integer $n^k$, where $n \in \mathbb Z$ and $k \ge 2$. A perfect power of a polynomial is a polynomial $P(x)^k$, where $P$ has integer coefficients and $k \ge 2$.

Let $n$ and $k$ be relatively prime positive integers with $k<n$. Each number in the set $M=\{1,2,3,\ldots,n-1\}$ is colored either blue or white. For each $i$ in $M$, both $i$ and $n-i$ have the same color. For each $i\ne k$ in $M$ both $i$ and $|i-k|$ have the same color. Prove that all numbers in $M$ must have the same color.

8. You have been kidnapped by a witch and are stuck in the [i]Terrifying Tower[/i], which has an infinite number of floors, starting with floor 1, each initially having 0 boxes. The witch allows you to do the following two things:[list] [*] For a floor $i$, put 2 boxes on floor $i+5$, 6 on floor $i+4$, 13 on floor $i+3$, 12 on floor $i+2$, 8 on floor $i+1$, and 1 on floor $i$, or remove the corresponding number of boxes from each floor if possible. [*] For a floor $i$, put 1 box on floor $i+4$, put 3 boxes on floor $i+3$, 6 on floor $i+2$, 5 on floor $i+1$, and 3 on floor $i$, or remove the corresponding number of boxes from each floor if possible. [/list] At the end, suppose the witch wishes to have exactly $n$ boxes in the tower. Specifically, she wants them to be on the first 10 floors. Let $T(n)$ be the number of distinct distributions of these $n$ boxes that you can make. Find $\displaystyle\sum_{n=1}^{15} T(n)$. [i]Proposed by Monkey_king1[/i]

Prove that in a scalene acute-angled triangle, the orthocenter, the incenter, and the circumcenter are not collinear.

Two farmers agree that pigs are worth $ \$300$ and that goats are worth $ \$210$. When one farmer owes the other money, he pays the debt in pigs or goats, with ``change'' received in the form of goats or pigs as necessary. (For example, a $ \$390$ debt could be paid with two pigs, with one goat received in change.) What is the amount of the smallest positive debt that can be resolved in this way? $ \textbf{(A) } \$5\qquad \textbf{(B) } \$10\qquad \textbf{(C) } \$30\qquad \textbf{(D) } \$90\qquad \textbf{(E) } \$210$

Let $a_1, a_2, a_3, \ldots$ be a sequence of positive real numbers, and $s$ be a positive integer, such that \[a_n = \max \{ a_k + a_{n-k} \mid 1 \leq k \leq n-1 \} \ \textrm{ for all } \ n > s.\] Prove there exist positive integers $\ell \leq s$ and $N$, such that \[a_n = a_{\ell} + a_{n - \ell} \ \textrm{ for all } \ n \geq N.\] [i]Proposed by Morteza Saghafiyan, Iran[/i]

Let $n$ be a positive integer.Consider the polynomial $p(x)=x^2+x+1$. What is the remainder of $ x^3$ when divided by $x^2+x+1$.For what positive integers values of $n$ is $ x^{2n}+x^n+1$ divisible by $p(x)$? Post no:[size=300]$100$[/size]

The natural number $n>1$ is such that there exist $a\in \mathbb{N}$ and a prime number $q$ which satisfy the following conditions: 1) $q$ divides $n-1$ and $q>\sqrt{n}-1$ 2) $n$ divides $a^{n-1}-1$ 3) $gcd(a^\frac{n-1}{q}-1,n)=1$. Is it possible for $n$ to be a composite number?

Prove that the expression \[ \dfrac {\text {gcd}(m, n)}{n} \dbinom {n}{m} \] is an integer for all pairs of integers $ n \ge m \ge 1 $.

Let $2\mathbb{Z} + 1$ denote the set of odd integers. Find all functions $f:\mathbb{Z} \mapsto 2\mathbb{Z} + 1$ satisfying \[ f(x + f(x) + y) + f(x - f(x) - y) = f(x+y) + f(x-y) \] for every $x, y \in \mathbb{Z}$.

Let $m,n$ be naturals satisfying $n \geq m \geq 2$ and let $S$ be a set consisting of $n$ naturals. Prove that $S$ has at least $2^{n-m+1}$ distinct subsets, each whose sum is divisible by $m$. (The zero set counts as a subset).