Found problems: 2008
2004 Tournament Of Towns, 4
A positive integer $a > 1$ is given (in decimal notation). We copy it twice and obtain a number $b = \overline{aa}$ which happens to be a multiple of $a^2$. Find all possible values of $b/a^2$.
1971 Canada National Olympiad, 6
Show that, for all integers $n$, $n^2+2n+12$ is not a multiple of 121.
2005 Romania Team Selection Test, 1
Solve the equation $3^x=2^xy+1$ in positive integers.
PEN A Problems, 8
The integers $a$ and $b$ have the property that for every nonnegative integer $n$ the number of $2^n{a}+b$ is the square of an integer. Show that $a=0$.
2007 China Western Mathematical Olympiad, 4
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]
2014 National Olympiad First Round, 10
How many non-negative integer triples $(m,n,k)$ are there such that $m^3-n^3=9^k+123$?
$
\textbf{(A)}\ 1
\qquad\textbf{(B)}\ 2
\qquad\textbf{(C)}\ 3
\qquad\textbf{(D)}\ 4
\qquad\textbf{(E)}\ \text{None of the preceding}
$
2022 China Team Selection Test, 3
Given a positive integer $n \ge 2$. Find all $n$-tuples of positive integers $(a_1,a_2,\ldots,a_n)$, such that $1<a_1 \le a_2 \le a_3 \le \cdots \le a_n$, $a_1$ is odd, and
(1) $M=\frac{1}{2^n}(a_1-1)a_2 a_3 \cdots a_n$ is a positive integer;
(2) One can pick $n$-tuples of integers $(k_{i,1},k_{i,2},\ldots,k_{i,n})$ for $i=1,2,\ldots,M$ such that for any $1 \le i_1 <i_2 \le M$, there exists $j \in \{1,2,\ldots,n\}$ such that $k_{i_1,j}-k_{i_2,j} \not\equiv 0, \pm 1 \pmod{a_j}$.
1996 Hungary-Israel Binational, 2
$ n>2$ is an integer such that $ n^2$ can be represented as a difference of cubes of 2 consecutive positive integers. Prove that $ n$ is a sum of 2 squares of positive integers, and that such $ n$ does exist.
1998 Hungary-Israel Binational, 1
Find all positive integers $ x$ and $ y$ such that $ 5^{x}-3^{y}= 16$.
2009 IMO Shortlist, 3
Let $f$ be a non-constant function from the set of positive integers into the set of positive integer, such that $a-b$ divides $f(a)-f(b)$ for all distinct positive integers $a$, $b$. Prove that there exist infinitely many primes $p$ such that $p$ divides $f(c)$ for some positive integer $c$.
[i]Proposed by Juhan Aru, Estonia[/i]
2009 AIME Problems, 6
Let $ m$ be the number of five-element subsets that can be chosen from the set of the first $ 14$ natural numbers so that at least two of the five numbers are consecutive. Find the remainder when $ m$ is divided by $ 1000$.
2013 National Olympiad First Round, 34
How many triples of positive integers $(a,b,c)$ are there such that $a!+b^3 = 18+c^3$?
$
\textbf{(A)}\ 4
\qquad\textbf{(B)}\ 3
\qquad\textbf{(C)}\ 2
\qquad\textbf{(D)}\ 1
\qquad\textbf{(E)}\ 0
$
2009 JBMO TST - Macedonia, 1
On a board, the numbers from 1 to 2009 are written. A couple of them are erased and instead of them, on the board is written the remainder of the sum of the erased numbers divided by 13. After a couple of repetition of this erasing, only 3 numbers are left, of which two are 9 and 999. Find the third number.
2005 Flanders Math Olympiad, 1
For all positive integers $n$, find the remainder of $\dfrac{(7n)!}{7^n \cdot n!}$ upon division by 7.
2003 AMC 10, 16
What is the units digit of $ 13^{2003}$?
$ \textbf{(A)}\ 1 \qquad
\textbf{(B)}\ 3 \qquad
\textbf{(C)}\ 7 \qquad
\textbf{(D)}\ 8 \qquad
\textbf{(E)}\ 9$
2013 China Team Selection Test, 1
Let $p$ be a prime number and $a, k$ be positive integers such that $p^a<k<2p^a$. Prove that there exists a positive integer $n$ such that \[n<p^{2a}, C_n^k\equiv n\equiv k\pmod {p^a}.\]
2009 Canada National Olympiad, 4
Find all ordered pairs of integers $(a,b)$ such that $3^a + 7^b$ is a perfect square.
1998 Baltic Way, 5
Let $a$ be an odd digit and $b$ an even digit. Prove that for every positive integer $n$ there exists a positive integer, divisible by $2^n$, whose decimal representation contains no digits other than $a$ and $b$.
2004 Germany Team Selection Test, 3
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]
1990 IMO Longlists, 26
Prove that there exist infinitely many positive integers $n$ such that the number $\frac{1^2+2^2+\cdots+n^2}{n}$ is a perfect square. Obviously, $1$ is the least integer having this property. Find the next two least integers having this property.
2004 Brazil National Olympiad, 5
Consider the sequence $(a_n)_{n\in \mathbb{N}}$ with $a_0=a_1=a_2=a_3=1$ and $a_na_{n-4}=a_{n-1}a_{n-3} + a^2_{n-2}$. Prove that all the terms of this sequence are integer numbers.
2012 Romanian Masters In Mathematics, 4
Prove that there are infinitely many positive integers $n$ such that $2^{2^n+1}+1$ is divisible by $n$ but $2^n+1$ is not.
[i](Russia) Valery Senderov[/i]
2011 International Zhautykov Olympiad, 2
Let $n$ be integer, $n>1.$ An element of the set $M=\{ 1,2,3,\ldots,n^2-1\}$ is called [i]good[/i] if there exists some element $b$ of $M$ such that $ab-b$ is divisible by $n^2.$ Furthermore, an element $a$ is called [i]very good[/i] if $a^2-a$ is divisible by $n^2.$ Let $g$ denote the number of [i]good[/i] elements in $M$ and $v$ denote the number of [i]very good[/i] elements in $M.$ Prove that
\[v^2+v \leq g \leq n^2-n.\]
2009 Hungary-Israel Binational, 1
For a given prime $ p > 2$ and positive integer $ k$ let \[ S_k \equal{} 1^k \plus{} 2^k \plus{} \ldots \plus{} (p \minus{} 1)^k\] Find those values of $ k$ for which $ p \, |\, S_k$.
1998 Romania Team Selection Test, 2
An infinite arithmetic progression whose terms are positive integers contains the square of an integer and the cube of an integer. Show that it contains the sixth power of an integer.