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

Find all pairs of prime numbers $p, q$ such that the number $pq + p - 6$ is also prime.
Determine with proof all triples $(a, b, c)$ of positive integers satisfying $\frac{1}{a}+ \frac{2}{b} +\frac{3}{c} = 1$, where $a$ is a prime number and $a \le b \le c$.
Find the exponent of $37$ in the representation of the number $111...... 11$ with $3\cdot 37^{2000}$ digits equals to $1$, as product of prime powers
Let $p>3$ be a prime and $n$ a positive integer such that $p^n$ has $20$ digits. Prove that at least one digit appears more than twice in this number.
Find all natural numbers $N$ (in decimal system) with the following properties: (i) $N =\overline{aabb}$, where $\overline{aab}$ and $\overline{abb}$ are primes, (ii) $N = P_1P_2P_3$, where $P_k (k = 1,2,3)$ is a prime consisting of $k$ (decimal) digits.
Find all natural numbers $n$, $n < 10^7$, for which: If natural number $m$, $1 < m < n$, is not divisible by $n$, then $m$ is prime.
$p$ is an odd prime. Show that $p$ divides $n(n+1)(n+2)(n+3) + 1$ for some integer $n$ iff $p$ divides $m^2 - 5$ for some integer $m$.
Let $p > 10^9$ be a prime number such that $4p + 1$ is also prime. Prove that the decimal expansion of $\frac{1}{4p+1}$ contains all the digits $0,1, \ldots, 9$.
Let $p=2^n+1$ and $3^{(p-1)/2}+1\equiv 0 \pmod p$. Show that $p$ is a prime. [i](Zhuge Liang) [/i]
Prove that a positive integer $n$ is composite if and only if there exist positive integers $a,b,x,y$ such that $a+b = n$ and $\frac{x}{a}+\frac{y}{b}= 1$.
Find all positive integers $n$ such that there exists a prime number $p$, such that $p^n-(p-1)^n$ is a power of $3$. Note. A power of $3$ is a number of the form $3^a$ where $a$ is a positive integer.
Specified natural number $a$. Prove that there are an infinite number of prime numbers $p$ such that for some natural $n$ the number $2^{2^n} + a$ is divisible by $p$.
Given a positive odd integer $n$, show that the arithmetic mean of fractional parts $\{\frac{k^{2n}}{p}\}, k=1,..., \frac{p-1}{2}$ is the same for infinitely many primes $p$ .
Find all positive integers $n>2$ such that $$ n! \mid \prod_{ p<q\le n, p,q \, \text{primes}} (p+q)$$
The numbers $p$ and $q$ are prime and satisfy \[\frac{p}{{p + 1}} + \frac{{q + 1}}{q} = \frac{{2n}}{{n + 2}}\] for some positive integer $n$. Find all possible values of $q-p$. [i]Luxembourg (Pierre Haas)[/i]
Let $p$ be a positive prime integer, $S(p)$ be the number of triples $(x,y,z)$ such that $x,y,z\in\{0,1,..., p-1\}$ and $x^2+y^2+z^2$ is divided by $p$. Prove that $S(p) \ge 2p- 1$. (I. Bliznets)
From the set of numbers $1 , 2, 3, . . . , 1985$ choose the largest subset such that the difference between any two numbers in the subset is not a prime number (the prime numbers are $2, 3 , 5 , 7,... , 1$ is not a prime number) .
Find the largest integer that divides $p^4 - 1$ for all primes $p > 4$
Suppose that primes $a_1, a_2, . . . , a_p$ form an increasing arithmetic progression and $a_1 > p$. Prove that if $p$ is a prime, then the difference of the progression is divisible by $p$.
For each positive integer $n$ larger than $1$ with prime factorization $p_1^{\alpha_1}p_2^{\alpha_2}\cdots p_k^{\alpha_k}$, its [i]signature[/i] is defined as the sum $\alpha_1+\alpha_2+\cdots+\alpha_k$. Does there exist $2020$ consecutive positive integers such that among them, there are exactly $1812$ integers whose signatures are strictly smaller than $11$?
Decide if there are primes $p, q, r$ such that $(p^2 + p) (q^2 + q) (r^2 + r)$ is a square of an integer.
Find all pairs of positive integers \(a, b\) such that the numbers \(a+1\), \(b+1\), \(2a+1\), \(2b+1\), \(a+3b\), and \(b+3a\) are all prime numbers.
Consider the sequence $a_1, a_2, \dots$ of positive integers such that $a_1=2$ and $a_{n+1}=a_n^4+a_n^3-3a_n^2-a_n+2$, for all $n\geqslant 1$. Prove that there exist infinitely many prime numbers that don't divide any term of the sequence. [i]Proposed by Pavel Ciurea[/i]
Find all triples of positive integers $(m,p,q)$ such that $2^mp^2 + 27 = q^3$ and $p$ is a prime.
Find all positive integers n such that $n^5 + n + 1$ is prime.