Found problems: 15460
2024 Myanmar IMO Training, 4
Determine all ordered pairs $(a,p)$ of positive integers, with $p$ prime, such that $p^a+a^4$ is a perfect square.
[i]Proposed by Tahjib Hossain Khan, Bangladesh[/i]
2005 AIME Problems, 8
The equation \[2^{333x-2}+2^{111x+2}=2^{222x+1}+1\] has three real roots. Given that their sum is $m/n$ where $m$ and $n$ are relatively prime positive integers, find $m+n$.
VI Soros Olympiad 1999 - 2000 (Russia), 9.6
The sequence of integers $a_1,a_2,a_3 ,.. $such that $a_1 = 1$, $a_2 = 2$ and for every natural $n \ge 1$
$$a_{n+2}=\begin{cases} 2001a_{n+1} - 1999a_n , \text{\,\,if\,\,the\,\,product\,\,} a_{n+1}a_n \text{is\,\,an\,\,even\,\,number} /\\
a_{n+1}-a_n , \text{\,\,if\,\,the\,\,product\,\,} a_{n+1}a_n \text{is\,\,an\,\,odd\,\,number} \end{cases}$$
Is there such a natural $m$ that $a_m= 2000$?
2013 Korea National Olympiad, 5
Find all functions $f : \mathbb{N} \rightarrow \mathbb{N} $ satisfying
\[ f(mn) = \operatorname{lcm} (m,n) \cdot \gcd( f(m), f(n) ) \]
for all positive integer $m,n$.
1991 Bundeswettbewerb Mathematik, 1
Determine all solutions of the equation $4^x + 4^y + 4^z = u^2$ for integers $x,y,z$ and $u$.
2011 Belarus Team Selection Test, 2
Find the least positive integer $n$ for which there exists a set $\{s_1, s_2, \ldots , s_n\}$ consisting of $n$ distinct positive integers such that
\[ \left( 1 - \frac{1}{s_1} \right) \left( 1 - \frac{1}{s_2} \right) \cdots \left( 1 - \frac{1}{s_n} \right) = \frac{51}{2010}.\]
[i]Proposed by Daniel Brown, Canada[/i]
2004 China Girls Math Olympiad, 7
Let $ p$ and $ q$ be two coprime positive integers, and $ n$ be a non-negative integer. Determine the number of integers that can be written in the form $ ip \plus{} jq$, where $ i$ and $ j$ are non-negative integers with $ i \plus{} j \leq n$.
2001 Estonia National Olympiad, 4
We call a triple of positive integers $(a, b, c)$ [i]harmonic [/i] if $\frac{1}{a}=\frac{1}{b}+\frac{1}{c}$. Prove that, for any given positive integer $c$, the number of harmonic triples $(a, b, c)$ is equal to the number of positive divisors of $c^2$.
2021 Purple Comet Problems, 11
There are nonzero real numbers $a$ and $b$ so that the roots of $x^2 + ax + b$ are $3a$ and $3b$. There are relatively prime positive integers $m$ and $n$ so that $a - b = \tfrac{m}{n}$. Find $m + n$.
2015 China Western Mathematical Olympiad, 8
Let $k$ be a positive integer, and $n=\left(2^k\right)!$ .Prove that $\sigma(n)$ has at least a prime divisor larger than $2^k$, where $\sigma(n)$ is the sum of all positive divisors of $n$.
2025 ISI Entrance UGB, 6
Let $\mathbb{N}$ denote the set of natural numbers, and let $\left( a_i, b_i \right)$, $1 \leq i \leq 9$, be nine distinct tuples in $\mathbb{N} \times \mathbb{N}$. Show that there are three distinct elements in the set $\{ 2^{a_i} 3^{b_i} \colon 1 \leq i \leq 9 \}$ whose product is a perfect cube.
2023 Malaysian Squad Selection Test, 7
Find all polynomials with integer coefficients $P$ such that for all positive integers $n$, the sequence $$0, P(0), P(P(0)), \cdots$$ is eventually constant modulo $n$.
[i]Proposed by Ivan Chan Kai Chin[/i]
2021-IMOC, N2
Show that for any two distinct odd primes $p, q$, there exists a positive integer $n$ such that $$\{d(n), d(n + 2) \} = \{p, q\}$$ where $d(n)$ is the smallest prime factor of $n$.
[i]Proposed By - ltf0501[/i]
MathLinks Contest 1st, 3
Let $x_0 = 1$ and $x_1 = 2003$ and define the sequence $(x_n)_{n \ge 0}$ by: $x_{n+1} =\frac{x^2_n + 1}{x_{n-1}}$ , $\forall n \ge 1$
Prove that for every $n \ge 2$ the denominator of the fraction $x_n$, when $x_n$ is expressed in lowest terms is a power of $2003$.
2001 Baltic Way, 18
Let $a$ be an odd integer. Prove that $a^{2^m}+2^{2^m}$ and $a^{2^n}+2^{2^n}$ are relatively prime for all positive integers $n$ and $m$ with $n\not= m$.
2009 Mathcenter Contest, 2
Find all natural numbers that can be written in the form $\frac{4ab}{ab^2+1}$ for some natural $a,b$.
(nooonuii)
2016 Danube Mathematical Olympiad, 4
4.Prove that there exist only finitely many positive integers n such that
$(\frac{n}{1}+1)(\frac{n}{2}+2)...(\frac{n}{n}+n)$ is an integer.
2008 IberoAmerican, 3
Let $ P(x) \equal{} x^3 \plus{} mx \plus{} n$ be an integer polynomial satisfying that if $ P(x) \minus{} P(y)$ is divisible by 107, then $ x \minus{} y$ is divisible by 107 as well, where $ x$ and $ y$ are integers. Prove that 107 divides $ m$.
1977 IMO, 3
Let $n$ be a given number greater than 2. We consider the set $V_n$ of all the integers of the form $1 + kn$ with $k = 1, 2, \ldots$ A number $m$ from $V_n$ is called indecomposable in $V_n$ if there are not two numbers $p$ and $q$ from $V_n$ so that $m = pq.$ Prove that there exist a number $r \in V_n$ that can be expressed as the product of elements indecomposable in $V_n$ in more than one way. (Expressions which differ only in order of the elements of $V_n$ will be considered the same.)
1997 Romania Team Selection Test, 2
Let $a>1$ be a positive integer. Show that the set of integers
\[\{a^2+a-1,a^3+a^2-1,\ldots ,a^{n+1}+a^n-1,\ldots\}\]
contains an infinite subset of pairwise coprime integers.
[i]Mircea Becheanu[/i]
1999 Slovenia National Olympiad, Problem 2
Find all integers $x,y$ such that $2x+3y=185$ and $xy>x+y$.
2019 Benelux, 4
An integer $m>1$ is [i]rich[/i] if for any positive integer $n$, there exist positive integers $x,y,z$ such that $n=mx^2-y^2-z^2$. An integer $m>1$ is [i]poor[/i] if it is not rich.
[list=a]
[*]Find a poor integer.[/*]
[*]Find a rich integer.[/*]
[/list]
2014 Paraguay Mathematical Olympiad, 2
Clau writes all four-digit natural numbers where $3$ and $7$ are always together. How many digits does she write in total?
2015 Peru Cono Sur TST, P5
Find the smallest term of the sequence $a_1, a_2, a_3, \ldots$ defined by $a_1=2014^{2015^{2016}}$ and
$$
a_{n+1}=
\begin{cases}
\frac{a_n}{2} & \text{ if } a_n \text{ is even} \\
a_n + 7 & \text{ if } a_n \text{ is odd} \\
\end{cases}
$$
Fractal Edition 1, P4
Let \( P(x) \) be a polynomial with natural coefficients. We denote by \( d(n) \) the number of positive divisors of the natural number \( n \), and by \( \sigma(n) \), the sum of these divisors. The sequence \( a_n \) is defined as follows:
\[
a_{n+1} \in \left\{
\begin{array}{ll}
\sigma(P(d(a_n))) \\
d(P(\sigma(a_n)))
\end{array}
\right.
\]
That is, \( a_{n+1} \) is one of the two terms above. Show that there exists a constant \( C \), depending on \( a_1 \) and \( P(x) \), such that for all \( i \), \( a_i < C \); in other words, show that the sequence \( a_n \) is bounded.