Found problems: 1362
1972 IMO Longlists, 34
If $p$ is a prime number greater than $2$ and $a, b, c$ integers not divisible by $p$, prove that the equation
\[ax^2 + by^2 = pz + c\]
has an integer solution.
1998 Greece JBMO TST, 6
Prove that if the number $A = 111 \cdots 1$ ($n$ digits) is prime, then $n$ is prime. Is the converse true?
2014 Contests, 1
Tarik and Sultan are playing the following game. Tarik thinks of a number that is greater than $100$. Then Sultan is telling a number greater than $1$. If Tarik’s number is divisible by Sultan’s number, Sultan wins, otherwise Tarik subtracts Sultan’s number from his number and Sultan tells his next number. Sultan is forbidden to repeat his numbers. If Tarik’s number becomes negative, Sultan loses. Does Sultan have a winning strategy?
2011 Albania National Olympiad, 2
Find all the values that can take the last digit of a "perfect" even number. (The natural number $n$ is called "perfect" if the sum of all its natural divisors is equal twice the number itself.For example: the number $6$ is perfect ,because $1+2+3+6=2\cdot6$).
2014 Contests, 1
$a_1,a_2,...,a_{2014}$ is a permutation of $1,2,3,...,2014$. What is the greatest number of perfect squares can have a set ${ a_1^2+a_2,a_2^2+a_3,a_3^2+a_4,...,a_{2013}^2+a_{2014},a_{2014}^2+a_1 }?$
2011 Tuymaada Olympiad, 4
Prove that, among $100000$ consecutive $100$-digit positive integers, there is an integer $n$ such that the length of the period of the decimal expansion of $\frac1n$ is greater than $2011$.
2012 Indonesia TST, 4
Let $\mathbb{N}$ be the set of positive integers. For every $n \in \mathbb{N}$, define $d(n)$ as the number of positive divisors of $n$. Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that:
a) $d(f(x)) = x$ for all $x \in \mathbb{N}$
b) $f(xy)$ divides $(x-1)y^{xy-1}f(x)$ for all $x,y \in \mathbb{N}$
1994 Polish MO Finals, 1
$m, n$ are relatively prime. We have three jugs which contain $m$, $n$ and $m+n$ liters. Initially the largest jug is full of water. Show that for any $k$ in $\{1, 2, ... , m+n\}$ we can get exactly $k$ liters into one of the jugs.
2004 South africa National Olympiad, 5
For $n\ge 2$, find the number of integers $x$ with $0\le x<n$, such that $x^2$ leaves a remainder of $1$ when divided by $n$.
1993 China Team Selection Test, 1
For all primes $p \geq 3,$ define $F(p) = \sum^{\frac{p-1}{2}}_{k=1}k^{120}$ and $f(p) = \frac{1}{2} - \left\{ \frac{F(p)}{p} \right\}$, where $\{x\} = x - [x],$ find the value of $f(p).$
2012 Baltic Way, 17
Let $d(n)$ denote the number of positive divisors of $n$. Find all triples $(n,k,p)$, where $n$ and $k$ are positive integers and $p$ is a prime number, such that
\[n^{d(n)} - 1 = p^k.\]
2003 Germany Team Selection Test, 3
Let $N$ be a natural number and $x_1, \ldots , x_n$ further natural numbers less than $N$ and such that the least common multiple of any two of these $n$ numbers is greater than $N$. Prove that the sum of the reciprocals of these $n$ numbers is always less than $2$: $\sum^n_{i=1} \frac{1}{x_i} < 2.$
2019 Turkey MO (2nd round), 6
Given an integer $n>2$ and an integer $a$, if there exists an integer $d$ such that $n\mid a^d-1$ and $n\nmid a^{d-1}+\cdots+1$, we say [i]$a$ is $n-$separating[/i]. Given any n>2, let the [i]defect of $n$[/i] be defined as the number of integers $a$ such that $0<a<n$, $(a,n)=1$, and $a$ is not [i] $n-$separating[/i]. Determine all integers $n>2$ whose defect is equal to the smallest possible value.
2013 Kurschak Competition, 1
Let $a,b$ be positive real numbers satisfying $2ab=a-b$. Denote for any positive integer $k$ $x_k$ and $y_k$ to be the closest integer to $ak$ and $bk$, respectively (if there are two closest integers, choose the larger one). Prove that any positive integer $n$ appears in the sequence $(x_k)_{k\ge 1}$ if and only if it appears at least three times in the sequence $(y_k)_{k\ge 1}$.
2010 Malaysia National Olympiad, 9
Show that there exist integers $m$ and $n$ such that \[\dfrac{m}{n}=\sqrt[3]{\sqrt{50}+7}-\sqrt[3]{\sqrt{50}-7}.\]
2011 Puerto Rico Team Selection Test, 4
Given 11 natural numbers under 21, show that you can choose two such that one divides the other.
2002 Hong kong National Olympiad, 4
Let $p$ be a prime number such that $p\equiv 1\pmod{4}$. Determine $\sum_{k=1}^{\frac{p-1}{2}}\left \lbrace \frac{k^2}{p} \right \rbrace$, where $\{x\}=x-[x]$.
1999 All-Russian Olympiad, 5
Four natural numbers are such that the square of the sum of any two of them is divisible by the product of the other two numbers. Prove that at least three of these numbers are equal.
2005 Germany Team Selection Test, 3
We have $2p-1$ integer numbers, where $p$ is a prime number. Prove that we can choose exactly $p$ numbers (from these $2p-1$ numbers) so that their sum is divisible by $p$.
2003 Polish MO Finals, 6
Let $n$ be an even positive integer. Show that there exists a permutation $(x_1, x_2, \ldots, x_n)$ of the set $\{1, 2, \ldots, n\}$, such that for each $i \in \{1, 2, \ldots, n\}, x_{i+1}$ is one of the numbers $2x_i, 2x_{i}-1, 2x_i - n, 2x_i - n - 1$, where $x_{n+1} = x_1.$
2000 Greece National Olympiad, 2
Find all prime numbers $p$ such that $1 +p+p^2 +p^3 +p^4$ is a perfect square.
2003 China Team Selection Test, 3
Given $S$ be the finite lattice (with integer coordinate) set in the $xy$-plane. $A$ is the subset of $S$ with most elements such that the line connecting any two points in $A$ is not parallel to $x$-axis or $y$-axis. $B$ is the subset of integer with least elements such that for any $(x,y)\in S$, $x \in B$ or $y \in B$ holds. Prove that $|A| \geq |B|$.
2007 Pre-Preparation Course Examination, 4
$a,b \in \mathbb Z$ and for every $n \in \mathbb{N}_0$, the number $2^na+b$ is a perfect square. Prove that $a=0$.
2013 ELMO Shortlist, 3
Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer.
Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers.
[i]Proposed by Matthew Babbitt[/i]
2003 Iran MO (3rd Round), 3
assume that A is a finite subset of prime numbers, and a is an positive integer.
prove that there are only finitely many positive integers m s.t: prime divisors of a^m-1 are contained in A.