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

2006 Peru MO (ONEM), 3

A pair $(m, n)$ of positive integers is called “[i]linked[/i]” if $m$ divides $3n + 1$ and $n$ divides $3m + 1$. If $a, b, c$ are distinct positive integers such that $(a, b)$ and $( b, c)$ are linked pairs, prove that the number $1$ belongs to the set $\{a, b, c\}$

1994 Poland - Second Round, 6

Let $p$ be a prime number. Prove that there exists $n \in Z$ such that $p | n^2 -n+3$ if and only if there exists $m \in Z$ such that $p | m^2 -m+25$.

2003 Junior Balkan Team Selection Tests - Romania, 3

A set of $2003$ positive integers is given. Show that one can find two elements such that their sum is not a divisor of the sum of the other elements.

2003 Austrian-Polish Competition, 4

A positive integer $m$ is alpine if $m$ divides $2^{2n+1} + 1$ for some positive integer $n$. Show that the product of two alpine numbers is alpine.

2023 Francophone Mathematical Olympiad, 4

Find all integers $n \geqslant 0$ such that $20n+2$ divides $2023n+210$.

1999 Denmark MO - Mohr Contest, 5

Is there a number whose digits are only $1$'s and which is divided by $1999$?

2023 Peru MO (ONEM), 1

We define the set $M = \{1^2,2^2,3^2,..., 99^2, 100^2\}$. a) What is the smallest positive integer that divides exactly two elements of $M$? b) What is the largest positive integer that divides exactly two elements of $M$?

2011 Saudi Arabia Pre-TST, 3.1

Let $n$ be a positive integer such that $2011^{2011}$ divides $n!$. Prove that $2011^{2012} $divides $n!$ .

2019 Canadian Mathematical Olympiad Qualification, 8

For $t \ge 2$, defi ne $S(t)$ as the number of times $t$ divides into $t!$. We say that a positive integer $t$ is a [i]peak[/i] if $S(t) > S(u)$ for all values of $u < t$. Prove or disprove the following statement: For every prime $p$, there is an integer $k$ for which $p$ divides $k$ and $k$ is a peak.

2021 Durer Math Competition Finals, 8

Benedek wrote the following $300 $ statements on a piece of paper. $2 | 1!$ $3 | 1! \,\,\, 3 | 2!$ $4 | 1! \,\,\, 4 | 2! \,\,\, 4 | 3!$ $5 | 1! \,\,\, 5 | 2! \,\,\, 5 | 3! \,\,\, 5 | 4!$ $...$ $24 | 1! \,\,\, 24 | 2! \,\,\, 24 | 3! \,\,\, 24 | 4! \,\,\, · · · \,\,\, 24 | 23!$ $25 | 1! \,\,\, 25 | 2! \,\,\, 25 | 3! \,\,\, 25 | 4! \,\,\, · · · \,\,\, 25 | 23! \,\,\, 25 | 24!$ How many true statements did Benedek write down? The symbol | denotes divisibility, e.g. $6 | 4!$ means that $6$ is a divisor of number $4!$.

2021 Saudi Arabia JBMO TST, 3

We have $n > 2$ nonzero integers such that everyone of them is divisible by the sum of the other $n - 1$ numbers, Show that the sum of the $n$ numbers is precisely $0$.

2019 Federal Competition For Advanced Students, P2, 6

Find the smallest possible positive integer n with the following property: For all positive integers $x, y$ and $z$ with $x | y^3$ and $y | z^3$ and $z | x^3$ always to be true that $xyz| (x + y + z) ^n$. (Gerhard J. Woeginger)

2021 Saudi Arabia Training Tests, 34

Let coefficients of the polynomial$ P (x) = a_dx^d + ... + a_2x^2 + a_0$ where $d \ge 2$, are positive integers. The sequences $(b_n)$ is defined by $b_1 = a_0$ and $b_{n+1} = P (b_n)$ for $n \ge 1$. Prove that for any $n \ge 2$, there exists a prime number $p$ such that $p|b_n$ but it does not divide $b_1, b_2, ..., b_{n-1}$.

1983 Austrian-Polish Competition, 8

(a) Prove that $(2^{n+1}-1)!$ is divisible by $ \prod_{i=0}^n (2^{n+1-i}-1)^{2^i }$, for every natural number n (b) Define the sequence ($c_n$) by $c_1=1$ and $c_{n}=\frac{4n-6}{n}c_{n-1}$ for $n\ge 2$. Show that each $c_n$ is an integer.

2011 QEDMO 10th, 3

Let $a, b$ be positive integers such that $a^2 + ab + 1$ a multiple of $b^2 + ab + 1$. Prove that $a = b$.

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.

1998 Estonia National Olympiad, 4

Prove that if for a positive integer $n$ is $5^n + 3^n + 1$ is prime number, then $n$ is divided by $12$.

2005 Estonia National Olympiad, 2

Let $a, b$, and $n$ be integers such that $a + b$ is divisible by $n$ and $a^2 + b^2$ is divisible by $n^2$. Prove that $a^m + b^m$ is divisible by $n^m$ for all positive integers $m$.

1993 Czech And Slovak Olympiad IIIA, 1

Find all natural numbers $n$ for which $7^n -1$ is divisible by $6^n -1$

1996 Singapore Team Selection Test, 3

Let $S = \{0, 1, 2, .., 1994\}$. Let $a$ and $b$ be two positive numbers in $S$ which are relatively prime. Prove that the elements of $S$ can be arranged into a sequence $s_1, s_2, s_3,... , s_{1995}$ such that $s_{i+1} - s_i \equiv \pm a$ or $\pm b$ (mod $1995$) for $i = 1, 2, ... , 1994$

1985 Czech And Slovak Olympiad IIIA, 6

Prove that for every natural number $n > 1$ there exists a suquence $a_1$,$a_2$, $...$, $a_n$ of the numbers $1,2,...,n$ such that for each $k \in \{1,2,...,n-1\}$ the number $a_{k+1}$ divides $a_1+a_2+...+a_k$.

2013 Junior Balkan Team Selection Tests - Romania, 1

Find all pairs of integers $(x,y)$ satisfying the following condition: [i]each of the numbers $x^3 + y$ and $x + y^3$ is divisible by $x^2 + y^2$ [/i] Tournament of Towns

2004 Thailand Mathematical Olympiad, 15

Find the largest positive integer $n \le 2004$ such that $3^{3n+3} - 27$ is divisible by $169$.

2019 Costa Rica - Final Round, 5

We have an a sequence such that $a_n = 2 \cdot 10^{n + 1} + 19$. Determine all the primes $p$, with $p \le 19$, for which there exists some $n \ge 1$ such that $p$ divides $a_n$.

2015 Denmark MO - Mohr Contest, 2

The numbers $1, 2, 3, . . . , 624$ are paired in such a way that the sum of the two numbers in each pair is $625$. For example $1$ and $624$ form a pair, and $30$ and $595$ form a pair. In how many of the $312$ pairs does the smaller number evenly divide the larger?