Olympiad problems

2001 National Olympiad First Round, 23

Which of the followings is false for the sequence $9,99,999,\dots$? $\textbf{(A)}$ The primes which do not divide any term of the sequence are finite. $\textbf{(B)}$ Infinitely many primes divide infinitely many terms of the sequence. $\textbf{(C)}$ For every positive integer $n$, there is a term which is divisible by at least $n$ distinct prime numbers. $\textbf{(D)}$ There is an inteter $n$ such that every prime number greater than $n$ divides infinitely many terms of the sequence. $\textbf{(E)}$ None of above

2021 South East Mathematical Olympiad, 2

Tags: prime number , number theory

Let $p\geq 5$ be a prime number, and set $M=\{1,2,\cdots,p-1\}.$ Define $$T=\{(n,x_n):p|nx_n-1\ \textup{and}\ n,x_n\in M\}.$$ If $\sum_{(n,x_n)\in T}n\left[\dfrac{nx_n}{p}\right]\equiv k \pmod {p},$ with $0\leq k\leq p-1,$ where $\left[\alpha\right]$ denotes the largest integer that does not exceed $\alpha,$ determine the value of $k.$

2014 Contests, 4

Tags: prime number , modular arithmetic , number theory

The sum of two prime numbers is $85$. What is the product of these two prime numbers? $\textbf{(A) }85\qquad\textbf{(B) }91\qquad\textbf{(C) }115\qquad\textbf{(D) }133\qquad \textbf{(E) }166$

2014 Bulgaria National Olympiad, 1

Tags: prime number , number theory

Find all pairs of prime numbers $p\,,q$ for which: \[p^2 \mid q^3 + 1 \,\,\, \text{and} \,\,\, q^2 \mid p^6-1\] [i]Proposed by P. Boyvalenkov[/i]

2024 Czech and Slovak Olympiad III A, 6

Tags: side bash , geometry , congruent triangles , prime number

Find all right triangles with integer side lengths in which two congruent circles with prime radius can be inscribed such that they are externally tangent, both touch the hypotenuse, and each is tangent to another leg of the right triangle.

2024 Bangladesh Mathematical Olympiad, P1

Tags: number theory , diophantine equation , prime number , modular arithmetic

Find all prime numbers $p$ and $q$ such that\[p^3-3^q=10.\] [i]Proposed by Md. Fuad Al Alam[/i]

2009 Turkey Team Selection Test, 1

Tags: abstract algebra , prime number , polynomial , algebra , number theory

For which $ p$ prime numbers, there is an integer root of the polynominal $ 1 \plus{} p \plus{} Q(x^1)\cdot\ Q(x^2)\ldots\ Q(x^{2p \minus{} 2})$ such that $ Q(x)$ is a polynominal with integer coefficients?

2017 Bosnia And Herzegovina - Regional Olympiad, 3

Tags: prime number , number theory

Find prime numbers $p$, $q$, $r$ and $s$, pairwise distinct, such that their sum is prime number and numbers $p^2+qr$ and $p^2+qs$ are perfect squares

2007 Italy TST, 3

Tags: geometric transformation , prime number , inequalities , geometry , reflection , number theory

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 \]

2013 Ukraine Team Selection Test, 3

Tags: number theory , prime number , polynomial , algebra

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

2023 Romania EGMO TST, P2

Tags: prime number , divisibility , power of 2 , prime divisor , number theory

Let $ b, m, n$ be positive integers such that $ b > 1$ and $ m \neq n.$ Prove that if $ b^m \minus{} 1$ and $ b^n \minus{} 1$ have the same prime divisors, then $ b \plus{} 1$ is a power of 2.

2020 International Zhautykov Olympiad, 1

Tags: euler s phi function , order , prime number , zhautykov , number theory

Given natural number n such that, for any natural $a,b$ number $2^a3^b+1$ is not divisible by $n$.Prove that $2^c+3^d$ is not divisible by $n$ for any natural $c$ and $d$

2012-2013 SDML (Middle School), 10

Tags: prime number , number theory

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$

2020-IMOC, N3

Tags: prime number , number theory

$\textbf{N3:}$ For any positive integer $n$, define $rad(n)$ to be the product of all prime divisors of $n$ (without multiplicities), and in particular $rad(1)=1$. Consider an infinite sequence of positive integers $\{a_n\}_{n=1}^{\infty}$ satisfying that \begin{align*} a_{n+1} = a_n + rad(a_n), \: \forall n \in \mathbb{N} \end{align*} Show that there exist positive integers $t,s$ such that $a_t$ is the product of the $s$ smallest primes. [i]Proposed by ltf0501[/i]

1987 Czech and Slovak Olympiad III A, 4

Tags: inequality , prime number , inequalities , factorial , algebra , number theory

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

2023 Brazil Team Selection Test, 3

Tags: prime factorization , prime number , prime , function , number theory

Let $Q$ be a set of prime numbers, not necessarily finite. For a positive integer $n$ consider its prime factorization: define $p(n)$ to be the sum of all the exponents and $q(n)$ to be the sum of the exponents corresponding only to primes in $Q$. A positive integer $n$ is called [i]special[/i] if $p(n)+p(n+1)$ and $q(n)+q(n+1)$ are both even integers. Prove that there is a constant $c>0$ independent of the set $Q$ such that for any positive integer $N>100$, the number of special integers in $[1,N]$ is at least $cN$. (For example, if $Q=\{3,7\}$, then $p(42)=3$, $q(42)=2$, $p(63)=3$, $q(63)=3$, $p(2022)=3$, $q(2022)=1$.)

2018 PUMaC Individual Finals A, 3

Tags: prime number , number theory

We say that the prime numbers $p_1,\dots,p_n$ construct the graph $G$ if we can assign to each vertex of $G$ a natural number whose prime divisors are among $p_1,\dots,p_n$ and there is an edge between two vertices in $G$ if and only if the numbers assigned to the two vertices have a common divisor greater than $1$. What is the minimal $n$ such that there exist prime numbers $p_1,\dots,p_n$ which construct any graph $G$ with $N$ vertices?

2017 Iran Team Selection Test, 4

Tags: prime number , modular arithmetic , number theory

We arranged all the prime numbers in the ascending order: $p_1=2<p_2<p_3<\cdots$. Also assume that $n_1<n_2<\cdots$ is a sequence of positive integers that for all $i=1,2,3,\cdots$ the equation $x^{n_i} \equiv 2 \pmod {p_i}$ has a solution for $x$. Is there always a number $x$ that satisfies all the equations? [i]Proposed by Mahyar Sefidgaran , Yahya Motevasel[/i]

2020-21 KVS IOQM India, 11

Tags: prime number , number theory

The prime numbers $a,b$ and $c$ are such that $a+b^2=4c^2$. Determine the sum of all possible values of $a+b+c$.

2003 Spain Mathematical Olympiad, Problem 1

Tags: number theory , prime number

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

1989 IMO Longlists, 93

Tags: modular arithmetic , prime number , sequence , power of number , number theory

Prove that for each positive integer $ n$ there exist $ n$ consecutive positive integers none of which is an integral power of a prime number.

2016 IMC, 5

Tags: prime number , permutation

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)

1998 National Olympiad First Round, 18

Tags: modular arithmetic , prime number , number theory

Let $ p_{1} <p_{2} <\ldots <p_{24}$ be the prime numbers on the interval $ \left[3,100\right]$. Find the smallest value of $ a\ge 0$ such that $ \sum _{i\equal{}1}^{24}p_{i}^{99!} \equiv a\, \, \left(mod\, 100\right)$. $\textbf{(A)}\ 24 \qquad\textbf{(B)}\ 25 \qquad\textbf{(C)}\ 48 \qquad\textbf{(D)}\ 50 \qquad\textbf{(E)}\ 99$

1988 IMO Longlists, 94

Tags: prime number , perfect square , number theory

Let $n+1, n \geq 1$ positive integers be formed by taking the product of $n$ given prime numbers (a prime number can appear several times or also not appear at all in a product formed in this way.) Prove that among these $n+1$ one can find some numbers whose product is a perfect square.

2019 Moroccan TST, 4

Tags: number theory , prime number

Let $p$ be a prime number. Find all the positive integers $n$ such that $p+n$ divides $pn$