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

If $p,p^2+2$ are both primes, how many divisors does $p^5+2p^2$ have? [i](Zhuge Liang)[/i]
A quadruple $(p, a, b, c)$ of positive integers is called a Leiden quadruple if - $p$ is an odd prime number, - $a, b$, and $c$ are distinct and - $ab + 1, bc + 1$ and $ca + 1$ are divisible by $p$. a) Prove that for every Leiden quadruple $(p, a, b, c)$ we have $p + 2 \le \frac{a+b+c}{3}$ . b) Determine all numbers $p$ for which a Leiden quadruple $(p, a, b, c)$ exists with $p + 2 = \frac{a+b+c}{3} $
How many integers from $1$ to $2008$ have the sum of their digits divisible by $5$ ?
Find the number of integers $n > 1$ which divide $a^{25} - a$ for every integer $a$.
Let $a, b, c$ be integers such that the number $a^2 +b^2 +c^2$ is divisible by $6$ and the number $ab + bc + ca$ is divisible by $3$. Prove that the number $a^3 + b^3 + c^3$ is divisible by $6$.
Let $n$ and $k$ be positive integers for which we have $4$ statements: $i)$ $n+1$ is divisible with $k$ $ii)$ $n=2k+5$ $iii)$ $n+k$ is divisible with $3$ $iv)$ $n+7k$ is prime Determine all possible values for $n$ and $k$, if out of the $4$ statements, three of them are true and one is false
Let $p$ be a prime greater than $2$. Prove that there is a prime $q < p$ such that $q^{p-1} - 1$ is not divisible by $p^2$
Do they exist natural numbers $m,x,y$ such that $$m^2 +25 \vdots (2011^x-1007^y) ?$$ S. Finskii
Call a natural number $n$ a [i]magic [/i] number if the number obtained by putting $n$ on the right of any natural number is divisible by $n$. Find the number of magic numbers less than $500$. Justify your answer
Prove that for every integer $n$ the expression $n^3-9n + 27$ is not divisible by $81$.
For positive integers $x,y$, find all pairs $(x,y)$ such that $x^2y + x$ is a multiple of $xy^2 + 7$.
Find all integers $a$ such that there is a prime number of $p\ge 5$ that divides ${p-1 \choose 2}$ $+ {p-1 \choose 3} a$ $+{p-1 \choose 4} a^2$+ ...+$ {p-1 \choose p-3} a^{p-5} .$
For every positive integer $n$, find the maximum power of $2$ that divides the number $$1 + 2019 + 2019^2 + 2019^3 +.. + 2019^{n-1}.$$
On the squares $a1, a2,... , a8$ of a chessboard there are respectively $2^0, 2^1, ..., 2^7$ grains of oat, on the squares $b8, b7,..., b1$ respectively $2^8, 2^9, ..., 2^{15}$ grains of oat, on the squares $c1, c2,..., c8$ respectively $2^{16}, 2^{17}, ..., 2^{23}$ grains of oat etc. (so there are $2^{63}$ grains of oat on the square $h1$). A knight starts moving from some square and eats after each move all the grains of oat on the square to which it had jumped, but immediately after the knight leaves the square the same number of grains of oat reappear. With the last move the knight arrives to the same square from which it started moving. Prove that the number of grains of oat eaten by the knight is divisible by $3$.
Let $a,b,c$ be positive integers such that $a|b^3, b|c^3$ and $c|a^3$. Prove that $abc|(a+b+c)^{13}$
Fix an odd integer $n > 1$. For a permutation $p$ of the set $\{1,2,...,n\}$, let S be the number of pairs of indices $(i, j)$, $1 \le i \le j \le n$, for which $p_i +p_{i+1} +...+p_j$ is divisible by $n$. Determine the maximum possible value of $S$. Croatia
Determine all pairs $(a, b)$ of integers having the following property: there is an integer $d \ge 2$ such that $a^n + b^n + 1$ is divisible by $d$ for all positive integers $n$.
The six-digit decimal number contains six different non-zero digits and is divisible by $37$. Prove that having transposed its digits you can obtain at least $23$ more numbers divisible by $37$
Let $p$ be an odd prime number and $c$ an integer for which $2c -1$ is divisible by $p$. Prove that $$(-1)^{\frac{p+1}{2}}+\sum_{n=0}^{\frac{p-1}{2}} {2n \choose n}c^n$$ is divisible by $p$.
The digits $2,3,4,5,6,7,8,9$ are written down in some order. When read in that order, the digits form an $8$-digit, base $10$ positive integer. if this integer is divisible by $44$, how many ways could the digits have been initially ordered? [i]Proposed by Evan Chang (squareman), USA[/i]
Prove that for every nonnegative integer $ k$ there is a product $$(k + 1)(k + 2)...(k + 1980)$$ divisible by $ 1980^{197}$.
Let $a, b,c,d$ be positive integers such that $ac+bd$ is divisible by $a^2 +b^2$. Prove that $gcd(c^2 + d^2, a^2 + b^2) > 1$. Trần Nam Dũng
Suppose that we have a set $S$ of $756$ arbitrary integers between $1$ and $2008$ ($1$ and $2008$ included). Prove that there are two distinct integers $a$ and $b$ in $S$ such that their sum $a + b$ is divisible by $8$.
Prove that if $n$ is a natural number such that both $3n+1$ and $4n+1$ are squares, then $n$ is divisible by $56$.