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

2008 Argentina Iberoamerican TST, 2

Set $S = \{1, 2, 3, ..., 2005\}$. If among any $n$ pairwise coprime numbers in $S$ there exists at least a prime number, find the minimum of $n$.

Kvant 2021, M2636

We call a natural number $p{}$ [i]simple[/i] if for any natural number $k{}$ such that $2\leqslant k\leqslant \sqrt{p}$ the inequality $\{p/k\}\geqslant 0,01$ holds. Is the set of simple prime numbers finite? [i]Proposed by M. Didin[/i]

1995 Moldova Team Selection Test, 2

Let $p{}$ be a prime number. Prove that the equation has $x^2-x+3-ps=0$ with $x,s\in\mathbb{Z}$ has solutions if and only if the equation $y^2-y+25-pt=0$ with $y,t\in\mathbb{Z}$ has solutions.

2003 Spain Mathematical Olympiad, Problem 1

Prove that for any prime ${p}$, different than ${2}$ and ${5}$, there exists such a multiple of ${p}$ whose digits are all nines. For example, if ${p = 13}$, such a multiple is ${999999 = 13 * 76923}$.

2019 Macedonia Junior BMO TST, 1

Determine all prime numbers of the form $1 + 2^p + 3^p +...+ p^p$ where $p$ is a prime number.

2010 Slovenia National Olympiad, 1

Find all prime numbers $p, q$ and $r$ such that $p>q>r$ and the numbers $p-q, p-r$ and $q-r$ are also prime.

2021 Azerbaijan EGMO TST, 1

p is a prime number, k is a positive integer Find all (p, k): $k!=(p^3-1)(p^3-p)(p^3-p^2)$

2024 Thailand October Camp, 4

The sequence $(a_n)_{n\in\mathbb{N}}$ is defined by $a_1=3$ and $$a_n=a_1a_2\cdots a_{n-1}-1$$ Show that there exist infinitely many prime number that divide at least one number in this sequences

2010 Pan African, 1

a) Show that it is possible to pair off the numbers $1,2,3,\ldots ,10$ so that the sums of each of the five pairs are five different prime numbers. b) Is it possible to pair off the numbers $1,2,3,\ldots ,20$ so that the sums of each of the ten pairs are ten different prime numbers?

2012 Turkey Team Selection Test, 3

Let $\mathbb{Z^+}$ and $\mathbb{P}$ denote the set of positive integers and the set of prime numbers, respectively. A set $A$ is called $S-\text{proper}$ where $A, S \subset \mathbb{Z^+}$ if there exists a positive integer $N$ such that for all $a \in A$ and for all $0 \leq b <a$ there exist $s_1, s_2, \ldots, s_n \in S$ satisfying $ b \equiv s_1+s_2+\cdots+s_n \pmod a$ and $1 \leq n \leq N.$ Find a subset $S$ of $\mathbb{Z^+}$ for which $\mathbb{P}$ is $S-\text{proper}$ but $\mathbb{Z^+}$ is not.

2017 Iran MO (2nd Round), 1

a) Prove that there doesn't exist sequence $a_1,a_2,a_3,... \in \mathbb{N}$ such that: $\forall i<j: gcd(a_i+j,a_j+i)=1$ b) Let $p$ be an odd prime number. Prove that there exist sequence $a_1,a_2,a_3,... \in \mathbb{N}$ such that: $\forall i<j: p \not | gcd(a_i+j,a_j+i)$

2011 China National Olympiad, 3

Let $m,n$ be positive integer numbers. Prove that there exist infinite many couples of positive integer nubmers $(a,b)$ such that \[a+b| am^a+bn^b , \quad\gcd(a,b)=1.\]

2012-2013 SDML (High School), 5

Palmer correctly computes the product of the first $1,001$ prime numbers. Which of the following is NOT a factor of Palmer's product? $\text{(A) }2,002\qquad\text{(B) }3,003\qquad\text{(C) }5,005\qquad\text{(D) }6,006\qquad\text{(E) }7,007$

2014 All-Russian Olympiad, 1

Call a natural number $n$ [i]good[/i] if for any natural divisor $a$ of $n$, we have that $a+1$ is also divisor of $n+1$. Find all good natural numbers. [i]S. Berlov[/i]

2017 Dutch IMO TST, 2

Let $n \geq 4$ be an integer. Consider a regular $2n-$gon for which to every vertex, an integer is assigned, which we call the value of said vertex. If four distinct vertices of this $2n-$gon form a rectangle, we say that the sum of the values of these vertices is a rectangular sum. Determine for which (not necessarily positive) integers $m$ the integers $m + 1, m + 2, . . . , m + 2n$ can be assigned to the vertices (in some order) in such a way that every rectangular sum is a prime number. (Prime numbers are positive by definition.)

2013 Ukraine Team Selection Test, 3

For a nonnegative integer $n$ define $\operatorname{rad}(n)=1$ if $n=0$ or $n=1$, and $\operatorname{rad}(n)=p_1p_2\cdots p_k$ where $p_1<p_2<\cdots <p_k$ are all prime factors of $n$. Find all polynomials $f(x)$ with nonnegative integer coefficients such that $\operatorname{rad}(f(n))$ divides $\operatorname{rad}(f(n^{\operatorname{rad}(n)}))$ for every nonnegative integer $n$.

1996 National High School Mathematics League, 3

For a prime number $p$, there exists $n\in\mathbb{Z}_+$, $\sqrt{p+n}+\sqrt{n}$ is an integer, then $\text{(A)}$ there is no such $p$ $\text{(B)}$ there in only one such $p$ $\text{(C)}$ there is more than one such $p$, but finitely many $\text{(D)}$ there are infinitely many such $p$

2018 Malaysia National Olympiad, A2

Let $a$ and $b$ be prime numbers such that $a+b = 10000$. Find the sum of the smallest possible value of $a$ and the largest possible value of $a$.

2021 Bolivia Ibero TST, 3

Let $p=ab+bc+ac$ be a prime number where $a,b,c$ are different two by two, show that $a^3,b^3,c^3$ gives different residues modulo $p$

2000 Saint Petersburg Mathematical Olympiad, 10.7

We'll call a positive integer "almost prime", if it is not divisible by any prime from the interval $[3,19]$. We'll call a number "very non-prime", if it has at least 2 primes from interval $[3,19]$ dividing it. What is the greatest amount of almost prime numbers can be selected, such that the sum of any two of them is a very non-prime number? [I]Proposed by S. Berlov, S. Ivanov[/i]

2016 IFYM, Sozopol, 3

Find the least natural number $n\geq 5$, for which $x^n\equiv 16\, (mod\, p)$ has a solution for any prime number $p$.

2024 Kyiv City MO Round 1, Problem 2

Write the numbers from $1$ to $16$ in the cells of a of a $4 \times 4$ square so that: 1. Each cell contains exactly one number; 2. Each number is written exactly once; 3. For any two cells that are symmetrical with respect to any of the perpendicular bisectors of sides of the original $4 \times 4$ square, the sum of numbers in them is a prime number The figure below shows examples of such pairs of cells, sums of numbers in which have to be prime. [img]https://i.ibb.co/fqX05dY/Kyiv-MO-2024-Round-1-8-2.png[/img] [i]Proposed by Mykhailo Shtandenko[/i]

2023 Junior Macedonian Mathematical Olympiad, 2

A positive integer is called [i]superprime[/i] if the difference between any two of its consecutive positive divisors is a prime number. Determine all superprime integers. [i]Authored by Nikola Velov[/i]

1987 Czech and Slovak Olympiad III A, 4

Given an integer $n\ge3$ consider positive integers $x_1,\ldots,x_n$ such that $x_1<x_2<\cdots<x_n<2x_1$. If $p$ is a prime and $r$ is a positive integer such that $p^r$ divides the product $x_1\cdots x_n$, prove that $$\frac{x_1\cdots x_n}{p^r}>n!.$$

2019 Dürer Math Competition (First Round), P2

For a positive integer $n$ let $P(n)$ denote the set of primes $p$ for which there exist positive integers $a, b$ such that $n=a^p+b^p$ . Is it true that for any finite set $H$ consisting of primes, there is an n such that $P(n) = H$?