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: 387

2016 Saudi Arabia Pre-TST, 2.4

Let $n$ be a given positive integer. Prove that there are infinitely many pairs of positive integers $(a, b)$ with $a, b > n$ such that $$\prod_{i=1}^{2015} (a + i) | b(b + 2016), \prod_{i=1}^{2015}(a + i) \nmid b, \prod_{i=1}^{2015} (a + i)\mid (b + 2016)$$.

2013 Cuba MO, 8

Prove that there are infinitely many pairs $(a, b)$ of positive integers with the following properties: $\bullet$ $a+b$ divides $ab+1$, $\bullet$ $a-b$ divides $ab -1$, $\bullet$ $b > 2$ and $a > b\sqrt3 - 1$.

1996 Tournament Of Towns, (509) 2

Do there exist three different prime numbers $p$, $q$ and $r$ such that $p^2 + d$ is divisible by $qr$, $q^2 + d$ is divisible by $rp$ and $r^2 + d$ is divisible by $pq$, if (a) $d = 10$; (b) $d = 11$? (V Senderov)

2013 Balkan MO Shortlist, N8

Suppose that $a$ and $b$ are integers. Prove that there are integers $c$ and $d$ such that $a+b+c+d=0$ and $ac+bd=0$, if and only if $a-b$ divides $2ab$.

1988 Poland - Second Round, 4

Prove that for every natural number $ n $, the number $ n^{2n} - n^{n+2} + n^n - 1 $ is divisible by $ (n - 1 )^3 $.

2018 Puerto Rico Team Selection Test, 3

Let $A$ be a set of $m$ positive integers where $m\ge 1$. Show that there exists a nonempty subset $B$ of $A$ such that the sum of all the elements of $B$ is divisible by $m$.

2011 QEDMO 9th, 6

Show that there are infinitely many pairs $(m, n)$ of natural numbers $m, n \ge 2$, for $m^m- 1$ is divisible by $n$ and $n^n- 1$ is divisible by $m$.

1951 Polish MO Finals, 2

What digits should be placed instead of zeros in the third and fifth places in the number $3000003$ to obtain a number divisible by $13$?

2011 Saudi Arabia BMO TST, 4

Let $(F_n )_{n\ge o}$ be the sequence of Fibonacci numbers: $F_0 = 0$, $F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ , for every $n \ge 0$. Prove that for any prime $p \ge 3$, $p$ divides $F_{2p} - F_p$ .

2021 Austrian MO Regional Competition, 4

Determine all triples $(x, y, z)$ of positive integers satisfying $x | (y + 1)$, $y | (z + 1)$ and $z | (x + 1)$. (Walther Janous)

2013 Danube Mathematical Competition, 2

Let $a, b, c, n$ be four integers, where n$\ge 2$, and let $p$ be a prime dividing both $a^2+ab+b^2$ and $a^n+b^n+c^n$, but not $a+b+c$. for instance, $a \equiv b \equiv -1 (mod \,\, 3), c \equiv 1 (mod \,\, 3), n$ a positive even integer, and $p = 3$ or $a = 4, b = 7, c = -13, n = 5$, and $p = 31$ satisfy these conditions. Show that $n$ and $p - 1$ are not coprime.

1953 Kurschak Competition, 2

$n$ and $d$ are positive integers such that $d$ divides $2n^2$. Prove that $n^2 + d$ cannot be a square.

1951 Kurschak Competition, 2

For which $m > 1$ is $(m -1)!$ divisible by $m$?

2008 Regional Olympiad of Mexico Center Zone, 5

Each positive integer number $n \ ge 1$ is assigned the number $p_n$ which is the product of all its non-zero digits. For example, $p_6 = 6$, $p_ {32} = 6$, $p_ {203} = 6$. Let $S = p_1 + p_2 + p_3 + \dots + p_ {999}$. Find the largest prime that divides $S $.

1989 Tournament Of Towns, (217) 1

Find a pair of $2$ six-digit numbers such that, if they are written down side by side to form a twelve-digit number , this number is divisible by the product of the two original numbers. Find all such pairs of six-digit numbers. ( M . N . Gusarov, Leningrad)

2005 Thailand Mathematical Olympiad, 12

Find the number of even integers n such that $0 \le n \le 100$ and $5 | n^2 \cdot 2^{{2n}^2}+ 1$.

2000 Tournament Of Towns, 3

The least common multiple of positive integers $a, b, c$ and $d$ is equal to $a + b + c + d$. Prove that $abcd$ is divisible by at least one of $3$ and $5$. ( V Senderov)

2002 Portugal MO, 4

The Blablabla set contains all the different seven-digit numbers that can be formed with the digits $2, 3, 4, 5, 6, 7$ and $8$. Prove that there are not two Blablabla numbers such that one of them is divisible by the other.

2019 Austrian Junior Regional Competition, 4

Let $p, q, r$ and $s$ be four prime numbers such that $$5 <p <q <r <s <p + 10.$$ Prove that the sum of the four prime numbers is divisible by $60$. (Walther Janous)

2002 Junior Balkan Team Selection Tests - Romania, 1

Let $n$ be an even positive integer and let $a, b$ be two relatively prime positive integers. Find $a$ and $b$ such that $a + b$ is a divisor of $a^n + b^n$.

1927 Eotvos Mathematical Competition, 1

Let the integers $a, b, c, d$ be relatively prime to $$m = ad - bc.$$ Prove that the pairs of integers $(x,y)$ for which $ax+by$ is a multiple of $m$ are identical with those for which $cx + dy$ is a multiple of $m$.

2008 Thailand Mathematical Olympiad, 4

Let $n$ be a positive integer. Show that $${2n+1 \choose 1} -{2n+1 \choose 3}2008 + {2n+1 \choose 5}2008^2- ...+(-1)^{n}{2n+1 \choose 2n+1}2008^n $$ is not divisible by $19$.

2007 IMAC Arhimede, 4

Prove that for any given number $a_k, 1 \le k \le 5$, there are $\lambda_k \in \{-1, 0, 1\}, 1 \le k \le 5$, which are not all equal zero, such that $11 | \lambda_1a_1^2+\lambda_2a_2^2+\lambda_3a_3^2+\lambda_4a_4^2+\lambda_5a_5^2$

2003 Junior Balkan Team Selection Tests - Romania, 2

Consider the prime numbers $n_1< n_2 <...< n_{31}$. Prove that if $30$ divides $n_1^4 + n_2^4+...+n_{31}^4$, then among these numbers one can find three consecutive primes.

1995 Chile National Olympiad, 1

Let $a,b,c,d$ be integers. Prove that $ 12$ divides $ (a-b) (a-c) (a-d) (b- c) (b-d) (c-d)$.