Found problems: 2008
PEN N Problems, 3
Let $\,n>6\,$ be an integer and $\,a_{1},a_{2},\ldots,a_{k}\,$ be all the natural numbers less than $n$ and relatively prime to $n$. If \[a_{2}-a_{1}=a_{3}-a_{2}=\cdots =a_{k}-a_{k-1}>0,\] prove that $\,n\,$ must be either a prime number or a power of $\,2$.
2015 NIMO Problems, 4
Determine the number of positive integers $a \le 250$ for which the set $\{a+1, a+2, \dots, a+1000\}$ contains
$\bullet$ Exactly $333$ multiples of $3$,
$\bullet$ Exactly $142$ multiples of $7$, and
$\bullet$ Exactly $91$ multiples of $11$.
[i]Based on a proposal by Rajiv Movva[/i]
2005 Junior Balkan Team Selection Tests - Romania, 7
A phone company starts a new type of service. A new customer can choose $k$ phone numbers in this network which are call-free, whether that number is calling or is being called. A group of $n$ students want to use the service.
(a) If $n\geq 2k+2$, show that there exist 2 students who will be charged when speaking.
(b) It $n=2k+1$, show that there is a way to arrange the free calls so that everybody can speak free to anybody else in the group.
[i]Valentin Vornicu[/i]
2024 Auckland Mathematical Olympiad, 5
Prove that the number $2^9 +2^{99}$ is divisible by $100$.
2004 Iran Team Selection Test, 1
Suppose that $ p$ is a prime number. Prove that for each $ k$, there exists an $ n$ such that:
\[ \left(\begin{array}{c}n\\ \hline p\end{array}\right)\equal{}\left(\begin{array}{c}n\plus{}k\\ \hline p\end{array}\right)\]
PEN H Problems, 65
Determine all pairs $(x, y)$ of integers such that \[(19a+b)^{18}+(a+b)^{18}+(19b+a)^{18}\] is a nonzero perfect square.
1977 Germany Team Selection Test, 4
When $4444^{4444}$ is written in decimal notation, the sum of its digits is $ A.$ Let $B$ be the sum of the digits of $A.$ Find the sum of the digits of $ B.$ ($A$ and $B$ are written in decimal notation.)
1985 IMO, 4
Given a set $M$ of $1985$ distinct positive integers, none of which has a prime divisor greater than $23$, prove that $M$ contains a subset of $4$ elements whose product is the $4$th power of an integer.
2007 International Zhautykov Olympiad, 3
Show that there are an infinity of positive integers $n$ such that $2^{n}+3^{n}$ is divisible by $n^{2}$.
PEN A Problems, 56
Let $a, b$, and $c$ be integers such that $a+b+c$ divides $a^2 +b^2 +c^2$. Prove that there are infinitely many positive integers $n$ such that $a+b+c$ divides $a^n +b^n +c^n$.
1998 USAMTS Problems, 3
The integers from $1$ to $9$ can be arranged into a $3\times3$ array (as shown on the right) so that the sum of the numbers in every row, column, and diagonal is a multiple of $9$.
(a.) Prove that the number in the center of the array must be a multiple of $3$.
(b.) Give an example of such an array with $6$ in the center.
[asy]
defaultpen(linewidth(0.7)+fontsize(10));size(100);
int i,j;
for(i=0; i<4; i=i+1) {
draw((0,2i)--(6,2i));
draw((2i,0)--(2i,6));
}
string[] letters={"G", "H", "I", "D", "E", "F", "A", "B", "C"};
for(i=0; i<3; i=i+1) {
for(j=0; j<3; j=j+1) {
label(letters[3i+j], (2j+1, 2i+1));
}}[/asy]
2013 NIMO Problems, 4
Let $\mathcal F$ be the set of all $2013 \times 2013$ arrays whose entries are $0$ and $1$. A transformation $K : \mathcal F \to \mathcal F$ is defined as follows: for each entry $a_{ij}$ in an array $A \in \mathcal F$, let $S_{ij}$ denote the sum of all the entries of $A$ sharing either a row or column (or both) with $a_{ij}$. Then $a_{ij}$ is replaced by the remainder when $S_{ij}$ is divided by two.
Prove that for any $A \in \mathcal F$, $K(A) = K(K(A))$.
[i]Proposed by Aaron Lin[/i]
2002 Austrian-Polish Competition, 5
Let $A$ be the set $\{2,7,11,13\}$. A polynomial $f$ with integer coefficients possesses the following property: for each integer $n$ there exists $p \in A$ such that $p|f(n)$. Prove that there exists $p \in A$ such that $p|f(n)$ for all integers $n$.
2010 Peru IMO TST, 9
Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$,$\ldots$, $a_n$ satisfying: \[a_{k+1}=\frac{a_k^2+1}{a_{k-1}+1}-1\] for every $k$ with $2\leq k\leq n-1$.
[i]Proposed by North Korea[/i]
2011 Canada National Olympiad, 1
Consider $70$-digit numbers with the property that each of the digits $1,2,3,...,7$ appear $10$ times in the decimal expansion of $n$ (and $8,9,0$ do not appear). Show that no number of this form can divide another number of this form.
1993 All-Russian Olympiad, 1
For integers $x$, $y$, and $z$, we have $(x-y)(y-z)(z-x)=x+y+z$. Prove that $27|x+y+z$.
1991 India National Olympiad, 1
Find the number of positive integers $n$ for which
(i) $n \leq 1991$;
(ii) 6 is a factor of $(n^2 + 3n +2)$.
2018 China Team Selection Test, 4
Let $p$ be a prime and $k$ be a positive integer. Set $S$ contains all positive integers $a$ satisfying $1\le a \le p-1$, and there exists positive integer $x$ such that $x^k\equiv a \pmod p$.
Suppose that $3\le |S| \le p-2$. Prove that the elements of $S$, when arranged in increasing order, does not form an arithmetic progression.
2013 North Korea Team Selection Test, 3
Find all $ a, b, c \in \mathbb{Z} $, $ c \ge 0 $ such that $ a^n + 2^n | b^n + c $ for all positive integers $ n $ where $ 2ab $ is non-square.
1985 IMO Shortlist, 4
Each of the numbers in the set $N = \{1, 2, 3, \cdots, n - 1\}$, where $n \geq 3$, is colored with one of two colors, say red or black, so that:
[i](i)[/i] $i$ and $n - i$ always receive the same color, and
[i](ii)[/i] for some $j \in N$, relatively prime to $n$, $i$ and $|j - i|$ receive the same color for all $i \in N, i \neq j.$
Prove that all numbers in $N$ must receive the same color.
2008 Czech and Slovak Olympiad III A, 1
In decimal representation, we call an integer [i]$k$-carboxylic[/i] if and only if it can be represented as a sum of $k$ distinct integers, all of them greater than $9$, whose digits are the same. For instance, $2008$ is [i]$5$-carboxylic[/i] because $2008=1111+666+99+88+44$. Find, with an example, the smallest integer $k$ such that $8002$ is [i]$k$-carboxylic[/i].
2003 CHKMO, 2
In conference there $n>2$ mathematicians. Every two mathematicians communicate in one of the $n$ offical languages of the conference. For any three different offical languages the exists three mathematicians who communicate with each other in these three languages. Find all $n$ such that this is possible.
1998 Brazil Team Selection Test, Problem 1
Let N be a positive integer greater than 2. We number the vertices
of a regular 2n-gon clockwise with the numbers 1, 2, . . . ,N,−N,−N +
1, . . . ,−2,−1. Then we proceed to mark the vertices in the following way.
In the first step we mark the vertex 1. If ni is the vertex marked in the
i-th step, in the i+1-th step we mark the vertex that is |ni| vertices away
from vertex ni, counting clockwise if ni is positive and counter-clockwise
if ni is negative. This procedure is repeated till we reach a vertex that has
already been marked. Let $f(N)$ be the number of non-marked vertices.
(a) If $f(N) = 0$, prove that 2N + 1 is a prime number.
(b) Compute $f(1997)$.
2011 ELMO Shortlist, 4
Let $p>13$ be a prime of the form $2q+1$, where $q$ is prime. Find the number of ordered pairs of integers $(m,n)$ such that $0\le m<n<p-1$ and
\[3^m+(-12)^m\equiv 3^n+(-12)^n\pmod{p}.\]
[i]Alex Zhu.[/i]
[hide="Note"]The original version asked for the number of solutions to $2^m+3^m\equiv 2^n+3^n\pmod{p}$ (still $0\le m<n<p-1$), where $p$ is a Fermat prime.[/hide]
2007 APMO, 1
Let $S$ be a set of $9$ distinct integers all of whose prime factors are at most $3.$ Prove that $S$ contains $3$ distinct integers such that their product is a perfect cube.