This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 545

2012 India Regional Mathematical Olympiad, 2

Let $a,b,c$ be positive integers such that $a|b^2, b|c^2$ and $c|a^2$. Prove that $abc|(a+b+c)^{7}$

2023 Poland - Second Round, 1

Find all positive integers $b$ with the following property: there exists positive integers $a,k,l$ such that $a^k + b^l$ and $a^l + b^k$ are divisible by $b^{k+l}$ where $k \neq l$.

2009 Belarus Team Selection Test, 3

Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which \[k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.\] Find the number of elements of the set $A_n$. [i]Proposed by Vidan Govedarica, Serbia[/i]

2022 Malaysia IMONST 2, 5

Let $a, b, r,$ and $s$ be positive integers ($a \ge 2$), where $a$ and $b$ have no common prime factor. Prove that if $a^r + b^r$ is divisible by $a^s + b^s$, then $r$ is divisible by $s$.

2016 Brazil Team Selection Test, 2

Let $a$ and $b$ be positive integers such that $a! + b!$ divides $a!b!$. Prove that $3a \ge 2b + 2$.

IMSC 2024, 6

Let $a\equiv 1\pmod{4}$ be a positive integer. Show that any polynomial $Q\in\mathbb{Z}[X]$ with all positive coefficients such that $$Q(n+1)((a+1)^{Q(n)}-a^{Q(n)})$$ is a perfect square for any $n\in\mathbb{N}^{\ast}$ must be a constant polynomial. [i]Proposed by Vlad Matei, Romania[/i]

1982 IMO Longlists, 31

Prove that if $n$ is a positive integer such that the equation \[ x^3-3xy^2+y^3=n \] has a solution in integers $x,y$, then it has at least three such solutions. Show that the equation has no solutions in integers for $n=2891$.

Kvant 2020, M2616

Let $p>5$ be a prime number. Prove that the sum \[\left(\frac{(p-1)!}{1}\right)^p+\left(\frac{(p-1)!}{2}\right)^p+\cdots+\left(\frac{(p-1)!}{p-1}\right)^p\]is divisible by $p^3$.

2022 IMO Shortlist, N4

Find all triples $(a,b,p)$ of positive integers with $p$ prime and \[ a^p=b!+p. \]

PEN A Problems, 103

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.)

2019 OMMock - Mexico National Olympiad Mock Exam, 4

Find all positive integers $n$ such that it is possible to split the numbers from $1$ to $2n$ in two groups $(a_1,a_2,..,a_n)$, $(b_1,b_2,...,b_n)$ in such a way that $2n\mid a_1a_2\cdots a_n+b_1b_2\cdots b_n-1$. [i]Proposed by Alef Pineda[/i]

2021 IMO Shortlist, N1

Find all positive integers $n\geq1$ such that there exists a pair $(a,b)$ of positive integers, such that $a^2+b+3$ is not divisible by the cube of any prime, and $$n=\frac{ab+3b+8}{a^2+b+3}.$$

2006 Taiwan TST Round 1, 3

Let $a$, $b$ be positive integers such that $b^n+n$ is a multiple of $a^n+n$ for all positive integers $n$. Prove that $a=b$. [i]Proposed by Mohsen Jamali, Iran[/i]

2007 IMO Shortlist, 4

For every integer $ k \geq 2,$ prove that $ 2^{3k}$ divides the number \[ \binom{2^{k \plus{} 1}}{2^{k}} \minus{} \binom{2^{k}}{2^{k \minus{} 1}} \] but $ 2^{3k \plus{} 1}$ does not. [i]Author: Waldemar Pompe, Poland[/i]

2005 Taiwan TST Round 3, 3

Given an integer ${n>1}$, denote by $P_{n}$ the product of all positive integers $x$ less than $n$ and such that $n$ divides ${x^2-1}$. For each ${n>1}$, find the remainder of $P_{n}$ on division by $n$. [i]Proposed by John Murray, Ireland[/i]

2023 Pan-American Girls’ Mathematical Olympiad, 5

Tags: divisibility
Find all pairs of primes $(p,q)$ such that $6pq$ divides $$p^3+q^2+38$$

2014 Canadian Mathematical Olympiad Qualification, 3

Let $1000 \leq n = \text{ABCD}_{10} \leq 9999$ be a positive integer whose digits $\text{ABCD}$ satisfy the divisibility condition: $$1111 | (\text{ABCD} + \text{AB} \times \text{CD}).$$ Determine the smallest possible value of $n$.

2005 India IMO Training Camp, 2

Find all functions $ f: \mathbb{N^{*}}\to \mathbb{N^{*}}$ satisfying \[ \left(f^{2}\left(m\right)+f\left(n\right)\right) \mid \left(m^{2}+n\right)^{2}\] for any two positive integers $ m$ and $ n$. [i]Remark.[/i] The abbreviation $ \mathbb{N^{*}}$ stands for the set of all positive integers: $ \mathbb{N^{*}}=\left\{1,2,3,...\right\}$. By $ f^{2}\left(m\right)$, we mean $ \left(f\left(m\right)\right)^{2}$ (and not $ f\left(f\left(m\right)\right)$). [i]Proposed by Mohsen Jamali, Iran[/i]

2016 Bosnia And Herzegovina - Regional Olympiad, 2

Let $a$ and $b$ be two positive integers such that $2ab$ divides $a^2+b^2-a$. Prove that $a$ is perfect square

2018 Kyiv Mathematical Festival, 4

Do there exist positive integers $a$ and $b$ such that each of the numbers $2^a+3^b,$ $3^a+5^b$ and $5^a+2^b$ is divisible by 29?

2016 Rioplatense Mathematical Olympiad, Level 3, 6

When the natural numbers are written one after another in an increasing way, you get an infinite succession of digits $123456789101112 ....$ Denote $A_k$ the number formed by the first $k$ digits of this sequence . Prove that for all positive integer $n$ there is a positive integer $m$ which simultaneously verifies the following three conditions: (i) $n$ divides $A_m$, (ii) $n$ divides $m$, (iii) $n$ divides the sum of the digits of $A_m$.

1989 Bundeswettbewerb Mathematik, 1

Determine the polynomial $$f(x) = x^k + a_{k-1} x^{k-1}+\cdots +a_1 x +a_0 $$ of smallest degree such that $a_i \in \{-1,0,1\}$ for $0\leq i \leq k-1$ and $f(n)$ is divisible by $30$ for all positive integers $n$.

1960 IMO Shortlist, 1

Determine all three-digit numbers $N$ having the property that $N$ is divisible by 11, and $\dfrac{N}{11}$ is equal to the sum of the squares of the digits of $N$.

2023 Belarus Team Selection Test, 2.1

Find all positive integers $n>2$ such that $$ n! \mid \prod_{ p<q\le n, p,q \, \text{primes}} (p+q)$$

2011 Brazil Team Selection Test, 4

Let $a, b$ be integers, and let $P(x) = ax^3+bx.$ For any positive integer $n$ we say that the pair $(a,b)$ is $n$-good if $n | P(m)-P(k)$ implies $n | m - k$ for all integers $m, k.$ We say that $(a,b)$ is $very \ good$ if $(a,b)$ is $n$-good for infinitely many positive integers $n.$ [list][*][b](a)[/b] Find a pair $(a,b)$ which is 51-good, but not very good. [*][b](b)[/b] Show that all 2010-good pairs are very good.[/list] [i]Proposed by Okan Tekman, Turkey[/i]