Found problems: 1362
2007 Czech-Polish-Slovak Match, 4
For any real number $p\geq1$ consider the set of all real numbers $x$ with
\[p<x<\left(2+\sqrt{p+\frac{1}{4}}\right)^2.\]
Prove that from any such set one can select four mutually distinct natural numbers $a, b, c, d$ with $ab=cd.$
2004 Bulgaria National Olympiad, 6
Let $ p$ be a prime number and let $ 0\leq a_{1}< a_{2}<\cdots < a_{m}< p$ and $ 0\leq b_{1}< b_{2}<\cdots < b_{n}< p$ be arbitrary integers. Let $ k$ be the number of distinct residues modulo $ p$ that $ a_{i}\plus{}b_{j}$ give when $ i$ runs from 1 to $ m$, and $ j$ from 1 to $ n$. Prove that
a) if $ m\plus{}n > p$ then $ k \equal{} p$;
b) if $ m\plus{}n\leq p$ then $ k\geq m\plus{}n\minus{}1$.
1999 South africa National Olympiad, 5
Let $S$ be the set of all rational numbers whose denominators are powers of 3. Let $a$, $b$ and $c$ be given non-zero real numbers. Determine all real-valued functions $f$ that are defined for $x \in S$, satisfy \[ f(x) = af(3x) + bf(3x - 1) + cf(3x - 2) \textrm{ if }0 \leq x \leq 1, \] and are zero elsewhere.
1983 IMO Longlists, 22
Does there exist an infinite number of sets $C$ consisting of $1983$ consecutive natural numbers such that each of the numbers is divisible by some number of the form $a^{1983}$, with $a \in \mathbb N, a \neq 1?$
1994 Hungary-Israel Binational, 1
Let $ m$ and $ n$ be two distinct positive integers. Prove that there exists a real number $ x$ such that $ \frac {1}{3}\le\{xn\}\le\frac {2}{3}$ and $ \frac {1}{3}\le\{xm\}\le\frac {2}{3}$. Here, for any real number $ y$, $ \{y\}$ denotes the fractional part of $ y$. For example $ \{3.1415\} \equal{} 0.1415$.
2003 Vietnam Team Selection Test, 3
Let $n$ be a positive integer. Prove that the number $2^n + 1$ has no prime divisor of the form $8 \cdot k - 1$, where $k$ is a positive integer.
2013 Kazakhstan National Olympiad, 2
Prove that for all natural $n$ there exists $a,b,c$ such that $n=\gcd (a,b)(c^2-ab)+\gcd (b,c)(a^2-bc)+\gcd (c,a)(b^2-ca)$.
2004 China Team Selection Test, 3
The largest one of numbers $ p_1^{\alpha_1}, p_2^{\alpha_2}, \cdots, p_t^{\alpha_t}$ is called a $ \textbf{Good Number}$ of positive integer $ n$, if $ \displaystyle n\equal{} p_1^{\alpha_1} \cdot p_2^{\alpha_2} \cdots p_t^{\alpha_t}$, where $ p_1$, $ p_2$, $ \cdots$, $ p_t$ are pairwisely different primes and $ \alpha_1, \alpha_2, \cdots, \alpha_t$ are positive integers. Let $ n_1, n_2, \cdots, n_{10000}$ be $ 10000$ distinct positive integers such that the $ \textbf{Good Numbers}$ of $ n_1, n_2, \cdots, n_{10000}$ are all equal.
Prove that there exist integers $ a_1, a_2, \cdots, a_{10000}$ such that any two of the following $ 10000$ arithmetical progressions $ \{ a_i, a_i \plus{} n_i, a_i \plus{} 2n_i, a_i \plus{} 3n_i, \cdots \}$($ i\equal{}1,2, \cdots 10000$) have no common terms.
2009 ISI B.Math Entrance Exam, 5
Let $p$ be a prime number bigger than $5$. Suppose, the decimal expansion of $\frac{1}{p}$ looks like $0.\overline{a_1a_2\cdots a_r}$ where the line denotes a recurring decimal. Prove that $10^r$ leaves a remainder of $1$ on dividing by $p$.
2013 Dutch IMO TST, 4
Determine all positive integers $n\ge 2$ satisfying $i+j\equiv\binom ni +\binom nj \pmod{2}$ for all $i$ and $j$ with $0\le i\le j\le n$.
2014 Contests, 1
For each positive integer $n$, let $s(n)$ be the sum of the digits of $n$. Find the smallest positive integer $k$ such that
\[s(k) = s(2k) = s(3k) = \cdots = s(2013k) = s(2014k).\]
2009 Baltic Way, 17
Find the largest integer $n$ for which there exist $n$ different integers such that none of them are divisible by either of $7,11$ or $13$, but the sum of any two of them is divisible by at least one of $7,11$ and $13$.