Determine all natural numbers $n$ such that for each natural number $a$ relatively prime with $n$ and $a \le 1 + \left\lfloor \sqrt{n} \right\rfloor$ there exists some integer $x$ with $a \equiv x^2 \mod n$. Remark: "Natural numbers" is the set of positive integers.

Given an integer $ n>6$. Consider those integers $ k\in (n(n\minus{}1),n^{2})$ which are coprime with $ n$. Prove that the greatest common divisor of the considered numbers is $ 1$.

Find the smallest positive integer $n$ that satisfies the following: We can color each positive integer with one of $n$ colors such that the equation $w + 6x = 2y + 3z$ has no solutions in positive integers with all of $w, x, y$ and $z$ having the same color. (Note that $w, x, y$ and $z$ need not be distinct.)

Let $f(k)$ be the number of integers $n$ satisfying the following conditions: (i) $0\leq n < 10^k$ so $n$ has exactly $k$ digits (in decimal notation), with leading zeroes allowed; (ii) the digits of $n$ can be permuted in such a way that they yield an integer divisible by $11$. Prove that $f(2m) = 10f(2m-1)$ for every positive integer $m$. [i]Proposed by Dirk Laurie, South Africa[/i]

Show that the set $S$ of natural numbers $n$ for which $\frac{3}{n}$ cannot be written as the sum of two reciprocals of natural numbers ($S =\left\{n |\frac{3}{n} \neq \frac{1}{p} + \frac{1}{q} \text{ for any } p, q \in \mathbb N \right\}$) is not the union of finitely many arithmetic progressions.

Let $A$ be a set of positive integers. $A$ is called "balanced" if [and only if] the number of 3-element subsets of $A$ whose elements add up to a multiple of $3$ is equal to the number of 3-element subsets of $A$ whose elements add up to not a multiple of $3$. a. Find a 9-element balanced set. b. Prove that no set of $2013$ elements can be balanced.

The decimal number $13^{101}$ is given. It is instead written as a ternary number. What are the two last digits of this ternary number?

Let $S(k)$ denote the digit-sum of a positive integer $k$(in base $10$). Determine the smallest positive integer $n$ such that \[S(n^2 ) = S(n) - 7\]

Determine all the pairs $ (p , n )$ of a prime number $ p$ and a positive integer $ n$ for which $ \frac{ n^p + 1 }{p^n + 1} $ is an integer.

Find all prime numbers $p$ and $q$ such that\[p^3-3^q=10.\] [i]Proposed by Md. Fuad Al Alam[/i]

Let $(a_n)_{n=1}^{\infty}$ be an integer sequence such that $a_{n+48} \equiv a_n \pmod {35}$ for every $n \geq 1$. Let $i$ and $j$ be the least numbers satisfying the conditions $a_{n+i} \equiv a_n \pmod {5}$ and $a_{n+j} \equiv a_n \pmod {7}$ for every $n\geq 1$. Which one below cannot be an $(i,j)$ pair? $ \textbf{(A)}\ (16,4) \qquad\textbf{(B)}\ (3,16) \qquad\textbf{(C)}\ (8,6) \qquad\textbf{(D)}\ (1,48) \qquad\textbf{(E)}\ (16,18) $

Find all functions $ f: \mathbb{Z} \minus{} \{ 0 \} \rightarrow \mathbb{Q}$ satisfying: $ f \left( \frac{x\plus{}y}{3} \right)\equal{}\frac {f(x)\plus{}f(y)}{2},$ whenever $ x,y,\frac{x\plus{}y}{3} \in \mathbb{Z} \minus{} \{ 0 \}.$

Let $A$ be a set of $N$ residues $\pmod{N^2}$. Prove that there exists a set $B$ of $N$ residues $\pmod{N^2}$ such that the set $A+B=\{a+b \vert a \in A, b \in B \}$ contains at least half of all the residues $\pmod{N^2}$.

For any set $A=\{a_1,a_2,\cdots,a_m\}$, let $P(A)=a_1a_2\cdots a_m$. Let $n={2010\choose99}$, and let $A_1, A_2,\cdots,A_n$ be all $99$-element subsets of $\{1,2,\cdots,2010\}$. Prove that $2010|\sum^{n}_{i=1}P(A_i)$.

Find the remainder when \[\sum_{k=1}^{2^{16}}\binom{2k}{k}(3\cdot 2^{14}+1)^k (k-1)^{2^{16}-1}\]is divided by $2^{16}+1$. ([i]Note:[/i] It is well-known that $2^{16}+1=65537$ is prime.) [i]Victor Wang.[/i]

A circular disk is partitioned into $ 2n$ equal sectors by $ n$ straight lines through its center. Then, these $ 2n$ sectors are colored in such a way that exactly $ n$ of the sectors are colored in blue, and the other $ n$ sectors are colored in red. We number the red sectors with numbers from $ 1$ to $ n$ in counter-clockwise direction (starting at some of these red sectors), and then we number the blue sectors with numbers from $ 1$ to $ n$ in clockwise direction (starting at some of these blue sectors). Prove that one can find a half-disk which contains sectors numbered with all the numbers from $ 1$ to $ n$ (in some order). (In other words, prove that one can find $ n$ consecutive sectors which are numbered by all numbers $ 1$, $ 2$, ..., $ n$ in some order.) [hide="Problem 8 from CWMO 2007"]$ n$ white and $ n$ black balls are placed at random on the circumference of a circle.Starting from a certain white ball,number all white balls in a clockwise direction by $ 1,2,\dots,n$. Likewise number all black balls by $ 1,2,\dots,n$ in anti-clockwise direction starting from a certain black ball.Prove that there exists a chain of $ n$ balls whose collection of numbering forms the set $ \{1,2,3\dots,n\}$.[/hide]

Evaluate \[\sqrt{2013+276\sqrt{2027+278\sqrt{2041+280\sqrt{2055+\ldots}}}}\]

Find the number of integers $n$ with $n \ge 2$ such that the remainder when $2013$ is divided by $n$ is equal to the remainder when $n$ is divided by $3$. [i]Proposed by Michael Kural[/i]

Four consecutive even numbers are removed from the set \[A=\{ 1, 2, 3, \cdots, n \}.\] If the arithmetic mean of the remaining numbers is $51.5625$, which four numbers were removed?

Are there any integers $a,b$ and $c$, not all of them $0$, such that $$a^2=2021b^2+2022c^2~~?$$ [i] (Cosmin Gavrilă)[/i]

Let $m$ be a positive integer. Prove that there are integers $a, b, k$, such that both $a$ and $b$ are odd, $k\geq0$ and \[2m=a^{19}+b^{99}+k\cdot2^{1999}\]

Prove that if the odd prime $p$ divides $a^{b}-1$, where $a$ and $b$ are positive integers, then $p$ appears to the same power in the prime factorization of $b(a^{d}-1)$, where $d=\gcd(b,p-1)$.

Let $v(n)$ be the order of $2$ in $n!$. Prove that for any positive integers $a$ and $m$ there exists $n$ ($n>1$) such that $v(n) \equiv a (\mod m)$. I have a book with Mongolian problems from this year, and this problem appeared in it. Perhaps I am terribly misinterpreting this problem, but it seems like it is wrong. Any ideas?

Let $ a$ be the greatest positive root of the equation $ x^3 \minus{} 3 \cdot x^2 \plus{} 1 \equal{} 0.$ Show that $ \left[a^{1788} \right]$ and $ \left[a^{1988} \right]$ are both divisible by 17. Here $ [x]$ denotes the integer part of $ x.$

Find all pairs $(m,n)$ of nonnegative integers for which \[m^2 + 2 \cdot 3^n = m\left(2^{n+1} - 1\right).\] [i]Proposed by Angelo Di Pasquale, Australia[/i]