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

2012 Singapore Junior Math Olympiad, 5

Suppose $S = \{a_1, a_2,..., a_{15}\}$ is a set of $1 5$ distinct positive integers chosen from $2 , 3, ... , 2012$ such that every two of them are coprime. Prove that $S$ contains a prime number. (Note: Two positive integers $m, n$ are coprime if their only common factor is 1)

2016 Thailand Mathematical Olympiad, 6

Let $m$ and $n$ be positive integers. Prove that if $m^{4^n+1} - 1$ is a prime number, then there exists an integer $t \ge 0$ such that $n = 2^t$.

2019 Centers of Excellency of Suceava, 2

Tags: prime , number theory , gcd
Let $ \left( s_n \right)_{n\ge 1 } $ be a sequence with $ s_1 $ and defined recursively as $ s_{n+1}=s_n^2-s_n+1. $ Prove that any two terms of this sequence are coprime. [i]Dan Nedeianu[/i]

1997 German National Olympiad, 6a

Let us define $f$ and $g$ by $f(x) = x^5 +5x^4 +5x^3 +5x^2 +1$, $g(x) = x^5 +5x^4 +3x^3 -5x^2 -1$. Determine all prime numbers $p$ such that, for at least one integer $x, 0 \le x < p-1$, both $f(x)$ and $g(x)$ are divisible by $p$. For each such $p$, find all $x$ with this property.

2014 Czech-Polish-Slovak Junior Match, 3

Find with all integers $n$ when $|n^3 - 4n^2 + 3n - 35|$ and $|n^2 + 4n + 8|$ are prime numbers.

2023 Indonesia TST, 1

Find all positive integers $n>2$ such that $$ n! \mid \prod_{ p<q\le n, p,q \, \text{primes}} (p+q)$$

2003 IMO Shortlist, 7

The sequence $a_0$, $a_1$, $a_2,$ $\ldots$ is defined as follows: \[a_0=2, \qquad a_{k+1}=2a_k^2-1 \quad\text{for }k \geq 0.\] Prove that if an odd prime $p$ divides $a_n$, then $2^{n+3}$ divides $p^2-1$. [hide="comment"] Hi guys , Here is a nice problem: Let be given a sequence $a_n$ such that $a_0=2$ and $a_{n+1}=2a_n^2-1$ . Show that if $p$ is an odd prime such that $p|a_n$ then we have $p^2\equiv 1\pmod{2^{n+3}}$ Here are some futher question proposed by me :Prove or disprove that : 1) $gcd(n,a_n)=1$ 2) for every odd prime number $p$ we have $a_m\equiv \pm 1\pmod{p}$ where $m=\frac{p^2-1}{2^k}$ where $k=1$ or $2$ Thanks kiu si u [i]Edited by Orl.[/i] [/hide]

2006 Thailand Mathematical Olympiad, 11

Let $p_n$ be the $n$-th prime number. Find the remainder when $\Pi_{n=1}^{2549} 2006^{p^2_{n-1}}$ is divided by $13$

2022 Bulgarian Spring Math Competition, Problem 10.4

Find the smallest odd prime $p$, such that there exist coprime positive integers $k$ and $\ell$ which satisfy \[4k-3\ell=12\quad \text{ and }\quad \ell^2+\ell k +k^2\equiv 3\text{ }(\text{mod }p)\]

2021 Indonesia MO, 3

A natural number is called a [i]prime power[/i] if that number can be expressed as $p^n$ for some prime $p$ and natural number $n$. Determine the largest possible $n$ such that there exists a sequence of prime powers $a_1, a_2, \dots, a_n$ such that $a_i = a_{i - 1} + a_{i - 2}$ for all $3 \le i \le n$.

2017 Balkan MO Shortlist, N5

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$ .

2024 Mexican Girls' Contest, 8

Find all positive integers \(n\) such that among the \(n\) numbers \[ 2n + 1, \, 2^2 n + 1, \, \ldots, \, 2^n n + 1 \] there are \(n\), \(n - 1\), or \(n - 2\) primes.

2013 Hanoi Open Mathematics Competitions, 1

Write $2013$ as a sum of $m$ prime numbers. The smallest value of $m$ is: (A): $2$, (B): $3$, (C): $4$, (D): $1$, (E): None of the above.

2006 Junior Tuymaada Olympiad, 2

Ten different odd primes are given. Is it possible that for any two of them, the difference of their sixteenth powers to be divisible by all the remaining ones ?

1993 Spain Mathematical Olympiad, 4

Prove that for each prime number distinct from $2$ and $5$ there exist infinitely many multiples of $p$ of the form $1111...1$.

2021 New Zealand MO, 3

Let $\{x_1, x_2, x_3, ..., x_n\}$ be a set of $n$ distinct positive integers, such that the sum of any $3$ of them is a prime number. What is the maximum value of $n$?

2024 Singapore MO Open, Q5

Let $p$ be a prime number. Determine the largest possible $n$ such that the following holds: it is possible to fill an $n\times n$ table with integers $a_{ik}$ in the $i$th row and $k$th column, for $1\le i,k\le n$, such that for any quadruple $i,j,k,l$ with $1\le i<j\le n$ and $1\le k<l\le n$, the number $a_{ik}a_{jl}-a_{il}a_{jk}$ is not divisible by $p$. [i]Proposed by oneplusone[/i]

2009 Postal Coaching, 2

Find all pairs $(x, y)$ of natural numbers $x$ and $y$ such that $\frac{xy^2}{x+y}$ is a prime

2025 Bulgarian Spring Mathematical Competition, 9.4

Determine all functions $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ such that $f(a) + 2ab + 2f(b)$ divides $f(a)^2 + 4f(b)^2$ for any positive integers $a$ and $b$.

2012 Mathcenter Contest + Longlist, 3

If $p,p^2+2$ are both primes, how many divisors does $p^5+2p^2$ have? [i](Zhuge Liang)[/i]

2019 India PRMO, 21

Consider the set $E = \{5, 6, 7, 8, 9\}$. For any partition ${A, B}$ of $E$, with both $A$ and $B$ non-empty, consider the number obtained by adding the product of elements of $A$ to the product of elements of $B$. Let $N$ be the largest prime number amonh these numbers. Find the sum of the digits of $N$.

2015 Belarus Team Selection Test, 1

Given $m,n \in N$ such that $M>n^{n-1}$ and the numbers $m+1, m+2, ..., m+n$ are composite. Prove that exist distinct primes $p_1,p_2,...,p_n$ such that $M+k$ is divisible by $p_k$ for any $k=1,2,...,n$. Tuymaada Olympiad 2004, C.A.Grimm. USA

2015 Saudi Arabia BMO TST, 4

Let $n \ge 2$ be an integer and $p_1 < p_2 < ... < p_n$ prime numbers. Prove that there exists an integer $k$ relatively prime with $p_1p_2... p_n$ and such that $gcd (k + p_1p_2...p_i, p_1p_2...p_n) = 1$ for all $i = 1, 2,..., n - 1$. Malik Talbi

1997 Slovenia Team Selection Test, 6

Let $p$ be a prime number and $a$ be an integer. Prove that if $2^p +3^p = a^n$ for some integer $n$, then $n = 1$.

2024 Abelkonkurransen Finale, 2a

Tags: sequence , algebra , prime
Positive integers $a_0<a_1<\dots<a_n$, are to be chosen so that $a_j-a_i$ is not a prime for any $i,j$ with $0 \le i <j \le n$. For each $n \ge 1$, determine the smallest possible value of $a_n$.