Found problems: 715
2012 JBMO TST - Macedonia, 1
Find all prime numbers of the form $\tfrac{1}{11} \cdot \underbrace{11\ldots 1}_{2n \textrm{ ones}}$, where $n$ is a natural number.
2007 Italy TST, 3
Let $p \geq 5$ be a prime.
(a) Show that exists a prime $q \neq p$ such that $q| (p-1)^{p}+1$
(b) Factoring in prime numbers $(p-1)^{p}+1 = \prod_{i=1}^{n}p_{i}^{a_{i}}$ show that:
\[\sum_{i=1}^{n}p_{i}a_{i}\geq \frac{p^{2}}2 \]
1982 National High School Mathematics League, 12
Given a circle $C:x^2+y^2=r^2$ ($r$ is an odd number). $P(u,v)\in C$, satisfying: $u=p^m, v=q^n$($p,q$ are prime numbers, $m,n$ are integers, $u>v$).
Define $A,B,C,D,M,N:A(r,0),B(-r,0),C(0,-r),D(0,r),M(u,0),N(0,v)$.
Prove that $|AM|=1,|BM|=9,|CN|=8,|DN|=2$.
1995 AMC 12/AHSME, 29
For how many three-element sets of positive integers $\{a,b,c\}$ is it true that $a \times b \times c = 2310$?
$\textbf{(A)}\ 32 \qquad
\textbf{(B)}\ 36 \qquad
\textbf{(C)}\ 40 \qquad
\textbf{(D)}\ 43 \qquad
\textbf{(E)}\ 45$
2015 Iran MO (3rd round), 5
$p>30$ is a prime number. Prove that one of the following numbers is in form of $x^2+y^2$.
$$ p+1 , 2p+1 , 3p+1 , .... , (p-3)p+1$$
2006 National Olympiad First Round, 2
If $p$ and $p^2+2$ are prime numbers, at most how many prime divisors can $p^3+3$ have?
$
\textbf{(A)}\ 1
\qquad\textbf{(B)}\ 2
\qquad\textbf{(C)}\ 3
\qquad\textbf{(D)}\ 4
\qquad\textbf{(E)}\ 5
$
1994 APMO, 3
Let $n$ be an integer of the form $a^2 + b^2$, where $a$ and $b$ are relatively prime integers and such that if $p$ is a prime, $p \leq \sqrt{n}$, then $p$ divides $ab$. Determine all such $n$.
2016 IMC, 5
Let $S_n$ denote the set of permutations of the sequence $(1,2,\dots, n)$. For every permutation $\pi=(\pi_1, \dots, \pi_n)\in S_n$, let $\mathrm{inv}(\pi)$ be the number of pairs $1\le i < j \le n$ with $\pi_i>\pi_j$; i. e. the number of inversions in $\pi$. Denote by $f(n)$ the number of permutations $\pi\in S_n$ for which $\mathrm{inv}(\pi)$ is divisible by $n+1$.
Prove that there exist infinitely many primes $p$ such that $f(p-1)>\frac{(p-1)!}{p}$, and infinitely many primes $p$ such that $f(p-1)<\frac{(p-1)!}{p}$.
(Proposed by Fedor Petrov, St. Petersburg State University)
2005 Flanders Junior Olympiad, 3
Prove that $2005^2$ can be written in at least $4$ ways as the sum of 2 perfect (non-zero) squares.
2012 Mathcenter Contest + Longlist, 10
The table size $8 \times 8$ contains the numbers $1,2,...,8$ in each amount as much as you want provided that two numbers that are adjacent vertically, horizontally, diagonally are relative primes. Prove that some number appears in the table at least $12$ times.
[i](PP-nine)[/i]
2012 Belarus Team Selection Test, 1
For any integer $d > 0,$ let $f(d)$ be the smallest possible integer that has exactly $d$ positive divisors (so for example we have $f(1)=1, f(5)=16,$ and $f(6)=12$). Prove that for every integer $k \geq 0$ the number $f\left(2^k\right)$ divides $f\left(2^{k+1}\right).$
[i]Proposed by Suhaimi Ramly, Malaysia[/i]
2004 France Team Selection Test, 3
Let $P$ be the set of prime numbers. Consider a subset $M$ of $P$ with at least three elements. We assume that, for each non empty and finite subset $A$ of $M$, with $A \neq M$, the prime divisors of the integer $( \prod_{p \in A} ) - 1$ belong to $M$.
Prove that $M = P$.
2015 JBMO Shortlist, NT4
Find all prime numbers $a,b,c$ and positive integers $k$ satisfying the equation \[a^2+b^2+16c^2 = 9k^2 + 1.\]
Proposed by Moldova
2015 India PRMO, 15
$15.$ Let $n$ be the largest integer that is the product of exactly $3$ distinct prime numbers, $x,y,$ and $10x+y,$ where $x$ and $y$ are digits. What is the sum of digits of $n ?$
2022 AIME Problems, 5
Twenty distinct points are marked on a circle and labeled $1$ through $20$ in clockwise order. A line segment is drawn between every pair of points whose labels differ by a prime number. Find the number of triangles formed whose vertices are among the original $20$ points.
2020 Junior Balkan Team Selection Tests - Moldova, 10
Find all pairs of prime numbers $(p, q)$ for which the numbers $p+q$ and $p+4q$ are simultaneously perfect squares.
2021 Argentina National Olympiad, 1
Determine all pairs of prime numbers $p$ and $q$ greater than $1$ and less than $100$, such that the following five numbers: $$p+6,p+10,q+4,q+10,p+q+1,$$ are all prime numbers.
2016 Turkmenistan Regional Math Olympiad, Problem 3
Find all distinct prime numbers $p,q,r,s$ such that $1-\frac{1}{p} - \frac{1}{q} -\frac{1}{r} - \frac{1}{s} =\frac{1}{pqrs}$
2011 Puerto Rico Team Selection Test, 2
Find all prime numbers $p$ and $q$ such that $2^2+p^2+q^2$ is also prime.
Please remember to hide your solution. (by using the hide tags of course.. I don't literally mean that you should hide it :ninja: )
2006 AMC 8, 25
Barry wrote 6 different numbers, one on each side of 3 cards, and laid the cards on a table, as shown. The sums of the two numbers on each of the three cards are equal. The three numbers on the hidden sides are prime numbers. What is the average of the hidden prime numbers?
[asy]path card=((0,0)--(0,3)--(2,3)--(2,0)--cycle);
draw(card, linewidth(1));
draw(shift(2.5,0)*card, linewidth(1));
draw(shift(5,0)*card, linewidth(1));
label("$44$", (1,1.5));
label("$59$", shift(2.5,0)*(1,1.5));
label("$38$", shift(5,0)*(1,1.5));[/asy]
$ \textbf{(A)}\ 13 \qquad
\textbf{(B)}\ 14 \qquad
\textbf{(C)}\ 15 \qquad
\textbf{(D)}\ 16 \qquad
\textbf{(E)}\ 17$
1991 USAMO, 3
Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[ 2, \; 2^2, \; 2^{2^2}, \; 2^{2^{2^2}}, \ldots (\mbox{mod} \; n) \] is eventually constant.
[The tower of exponents is defined by $a_1 = 2, \; a_{i+1} = 2^{a_i}$. Also $a_i \; (\mbox{mod} \; n)$ means the remainder which results from dividing $a_i$ by $n$.]
2013 National Olympiad First Round, 4
The numbers $1,2,\dots, 49$ are written on unit squares of a $7\times 7$ chessboard such that consequtive numbers are on unit squares sharing a common edge. At most how many prime numbers can a row have?
$
\textbf{(A)}\ 7
\qquad\textbf{(B)}\ 6
\qquad\textbf{(C)}\ 5
\qquad\textbf{(D)}\ 3
\qquad\textbf{(E)}\ 3
$
2015 Junior Balkan MO, 1
Find all prime numbers $a,b,c$ and positive integers $k$ satisfying the equation \[a^2+b^2+16c^2 = 9k^2 + 1.\]
Proposed by Moldova
2015 Romania Masters in Mathematics, 5
Let $p \ge 5$ be a prime number. For a positive integer $k$, let $R(k)$ be the remainder when $k$ is divided by $p$, with $0 \le R(k) \le p-1$. Determine all positive integers $a < p$ such that, for every $m = 1, 2, \cdots, p-1$, $$ m + R(ma) > a. $$
2009 Indonesia TST, 3
Find integer $ n$ with $ 8001 < n < 8200$ such that $ 2^n \minus{} 1$ divides $ 2^{k(n \minus{} 1)! \plus{} k^n} \minus{} 1$ for all integers $ k > n$.