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

Prove that if the product $1\cdot 2\cdot ...\cdot n$ ($n> 3$) is not divisible by $n + 1$, then $n + 1$ is prime.
Assume $p$ is a prime number. If there is a positive integer $a$ such that $p!|(a^p + 1)$, prove that : (1) $(a+1, \frac{a^p+1}{a+1}) = p$ (2) $\frac{a^p+1}{a+1}$ has no prime factors less than $p$. (3) $p!|(a +1) $.
Let $x, y$ be two non-negative integers. Prove that $47$ divides $3^x - 2^y$ if and only if $23$ divides $4x + y$.
Let $a, b, m$ be integers such that gcd $(a, b) = 1$ and $5 | ma^2 + b^2$ . Show that there exists an integer $n$ such that $5 | m - n^2$.
Find all sets of natural numbers $(a, b, c)$ such that $$a+1|b^2+c^2\,\, , b+1|c^2+a^2\,\,, c+1|a^2+b^2.$$
a) Show that the product of $5$ consecutive even integers is divisible by $15$. b) Determine the largest integer $D$ such that the product of $5$ consecutive even integers is always divisible by $D$.
Prove that $2014$ divides $53n^{55}- 57n^{53} + 4n$ for all integer $n$.
Find all natural numbers $n$ for which equality holds $n + d (n) + d (d (n)) +... = 2021$, where $d (0) = d (1) = 0$ and for $k> 1$, $ d (k)$ is the [i]superdivisor [/i] of the number $k$ (i.e. its largest divisor of $d$ with property $d <k$). (Tomáš Bárta)
Prove that it is impossible to divide a scalene triangle into two equal triangles.
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$.
A pair of numbers are [i]twin primes[/i] if they differ by two, and both are prime. Prove that, except for the pair $\{3, 5\}$, the sum of any pair of twin primes is a multiple of $ 12$.
What is the largest number $N$ for which there exist $N$ consecutive positive integers such that the sum of the digits in the $k$-th integer is divisible by $k$ for $1 \le k \le N$ ? (S Tokarev)
We want to write down as many distinct positive integers as possible, so that no two numbers on our list have a sum or a difference divisible by $2019$. At most how many integers can appear on such a list?
Determine all pairs $(m, n)$ of positive integers for which $(m + n)^3 / 2n (3m^2 + n^2) + 8$
Let $n$ be a nonnegative integer and $M =\{n^3, n^3+1, n^3+2, ..., n^3+n\}$. Consider $A$ and $B$ two nonempty, disjoint subsets of $M$ such that the sum of elements of the set $A$ divides the sum of elements of the set $B$. Prove that the number of elements of the set $A$ divides the number of elements of the set $B$.
Arithmetic progression $a_1, a_2, . . . , $ consisting of natural numbers is such that for any $n$ the product $a_n \cdot a_{n+31}$ is divisible by $2005$. Is it possible to say that all terms of the progression are divisible by $2005$?
How many of the numbers $1\cdot 2\cdot 3$, $2\cdot 3\cdot 4$,..., $2020 \cdot 2021 \cdot 2022$ are divisible by $2020$?
Show that if $m$ and $n$ are integers such that $m^2 + mn + n^2$ is divisible by $9$, then they must both be divisible by $3$.
Find all ordered pairs of positive integers $(m, n)$ such that $2m$ divides the number $3n - 2$, and $2n$ divides the number $3m - 2$.
Let $f(x) = x^{1998} - x^{199}+x^{19}+ 1$. Prove that there is an infinite set of prime numbers, each dividing at least one of the integers $f(1), f(2), f(3), f(4), ...$
Strings $a_1, a_2, ... , a_{2016}$ and $b_1, b_2, ... , b_{2016}$ each contain all natural numbers from $1$ to $2016$ exactly once each (in other words, they are both permutations of the numbers $1, 2, ..., 2016$). Prove that different indices $i$ and $j$ can be found such that $a_ib_i- a_jb_j$ is divisible by $2017$.
A natural number $N$ is written in its decimal representation . It is known that for each digit in this representation , this digit divides exactly into the number $N$ (the digit $0$ is not encountered). What is the maximum number of different digits which there can be in such a representation of $N$? (S . Fomin, Leningrad)
For each positive integer $n$, let $a_n$ be the number of permutations $\tau$ of $\{1, 2, ... , n\}$ such that $\tau (\tau (\tau (x))) = x$ for $x = 1, 2, ..., n$. The first few values are $a_1 = 1, a_2 = 1, a_3 = 3, a_4 = 9$. Prove that $3^{334}$ divides $a_{2001}$. (A permutation of $\{1, 2, ... , n\}$ is a rearrangement of the numbers $\{1, 2, ... , n\}$ or equivalently, a one-to-one and onto function from $\{1, 2, ... , n\}$ to $\{1, 2, ... , n\}$. For example, one permutation of $\{1, 2, 3\}$ is the rearrangement $\{2, 1, 3\}$, which is equivalent to the function $\sigma : \{1, 2, 3\} \to \{1, 2, 3\}$ defined by $\sigma (1) = 2, \sigma (2) = 1, \sigma (3) = 3$.)
The greatest common divisor $d$ and the least common multiple $u$ of positive integers $m$ and $n$ satisfy the equality $3m + n = 3u + d$. Prove that $m$ is divisible by $n$.
Determine the smallest natural number $n$ such that $n^n$ is not a divisor of the product $1\cdot 2\cdot 3\cdot ... \cdot 2015\cdot 2016$.