Olympiad problems

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.

1999 Irish Math Olympiad, 2

Tags: function , number theory , prime number , algebra

A function $ f: \mathbb{N} \rightarrow \mathbb{N}$ satisfies: $ (a)$ $ f(ab)\equal{}f(a)f(b)$ whenever $ a$ and $ b$ are coprime; $ (b)$ $ f(p\plus{}q)\equal{}f(p)\plus{}f(q)$ for all prime numbers $ p$ and $ q$. Prove that $ f(2)\equal{}2,f(3)\equal{}3$ and $ f(1999)\equal{}1999.$

2012 IFYM, Sozopol, 4

Tags: algebra , polynomial , calculus , integration , gauss , number theory , prime number

Given distinct prime numbers $p$ and $q$ and a natural number $n \geq 3$, find all $a \in \mathbb{Z}$ such that the polynomial $f(x) = x^n + ax^{n-1} + pq$ can be factored into 2 integral polynomials of degree at least 1.

2012 Belarus Team Selection Test, 1

Tags: algorithm , number theory , prime number , divisibility , number of divisors

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]

2019 Centers of Excellency of Suceava, 1

Tags: number theory , prime number

Prove that if a prime is the sum of four perfect squares then the product of two of these is equal to the product of the other two. [i]Gherghe Stoica[/i]

2019 Brazil Team Selection Test, 4

Tags: number theory , prime number , sum of squares , set

Let $p \geq 7$ be a prime number and $$S = \bigg\{jp+1 : 1 \leq j \leq \frac{p-5}{2}\bigg\}.$$ Prove that at least one element of $S$ can be written as $x^2+y^2$, where $x, y$ are integers.

1996 Bulgaria National Olympiad, 1

Tags: number theory , prime number

Find all prime numbers $p,q$ for which $pq$ divides $(5^p-2^p)(5^q-2^q)$.

2019 Pan-African, 2

Tags: number theory , prime number , sums and products

Let $k$ be a positive integer. Consider $k$ not necessarily distinct prime numbers such that their product is ten times their sum. What are these primes and what is the value of $k$?

2020 Kosovo National Mathematical Olympiad, 4

Tags: number theory , prime number , compos

Let $p$ and $q$ be prime numbers. Show that $p^2+q^2+2020$ is composite.

2023 Silk Road, 3

Tags: prime number , quadratic , quadratic residue , directed graph , number theory

Let $p$ be a prime number. We construct a directed graph of $p$ vertices, labeled with integers from $0$ to $p-1$. There is an edge from vertex $x$ to vertex $y$ if and only if $x^2+1\equiv y \pmod{p}$. Let $f(p)$ denotes the length of the longest directed cycle in this graph. Prove that $f(p)$ can attain arbitrarily large values.

2004 Finnish National High School Mathematics Competition, 4

Tags: prime number , number theory

The numbers $2005! + 2, 2005! + 3, ... , 2005! + 2005$ form a sequence of $2004$ consequtive integers, none of which is a prime number. Does there exist a sequence of $2004$ consequtive integers containing exactly $12$ prime numbers?

2008 Argentina Iberoamerican TST, 2

Tags: number theory , prime number , relatively prime

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

2016 IFYM, Sozopol, 2

Tags: polynomial , prime number , number theory , algebra

We are given a polynomial $f(x)=x^6-11x^4+36x^2-36$. Prove that for an arbitrary prime number $p$, $f(x)\equiv 0\pmod{p}$ has a solution.

2021 Iran Team Selection Test, 4

Tags: number theory , polynomial , prime number , function , algebra , combi

Assume $\Omega(n),\omega(n)$ be the biggest and smallest prime factors of $n$ respectively . Alireza and Amin decided to play a game. First Alireza chooses $1400$ polynomials with integer coefficients. Now Amin chooses $700$ of them, the set of polynomials of Alireza and Amin are $B,A$ respectively . Amin wins if for all $n$ we have : $$\max_{P \in A}(\Omega(P(n))) \ge \min_{P \in B}(\omega(P(n)))$$ Who has the winning strategy. Proposed by [i]Alireza Haghi[/i]

2021 Bolivia Ibero TST, 3

Tags: number theory , modular arithmetic , prime number

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$

2015 Turkey Junior National Olympiad, 3

Tags: number theory , diophantine equation , prime number

Find all pairs $(p,n)$ so that $p$ is a prime number, $n$ is a positive integer and \[p^3-2p^2+p+1=3^n \] holds.

2022 Brazil Team Selection Test, 3

Tags: number theory , prime number , sequence

Let $p$ be an odd prime number and suppose that $2^h \not \equiv 1 \text{ (mod } p\text{)}$ for all integer $1 \leq h \leq p-2$. Let $a$ be an even number such that $\frac{p}{2} < a < p$. Define the sequence $a_0, a_1, a_2, \ldots$ as $$a_0 = a, \qquad a_{n+1} = p -b_n, \qquad n = 0,1,2, \ldots,$$ where $b_n$ is the greatest odd divisor of $a_n$. Show that the sequence is periodic and determine its period.

2018 Tuymaada Olympiad, 5

Tags: number theory , divisible , prime number

A prime $p$ and a positive integer $n$ are given. The product $$(1^3+1)(2^3+1)...((n-1)^3+1)(n^3+1)$$ is divisible by $p^3$. Prove that $p \leq n+1$. [i]Proposed by Z. Luria[/i]

2006 Estonia Team Selection Test, 6

Tags: number theory , prime number , prime factorization

Denote by $d(n)$ the number of divisors of the positive integer $n$. A positive integer $n$ is called highly divisible if $d(n) > d(m)$ for all positive integers $m < n$. Two highly divisible integers $m$ and $n$ with $m < n$ are called consecutive if there exists no highly divisible integer $s$ satisfying $m < s < n$. (a) Show that there are only finitely many pairs of consecutive highly divisible integers of the form $(a, b)$ with $a\mid b$. (b) Show that for every prime number $p$ there exist infinitely many positive highly divisible integers $r$ such that $pr$ is also highly divisible.

2007 Pre-Preparation Course Examination, 19

Tags: function , induction , prime number , number theory

Find all functions $f : \mathbb N \to \mathbb N$ such that: i) $f^{2000}(m)=f(m)$ for all $m \in \mathbb N$, ii) $f(mn)=\dfrac{f(m)f(n)}{f(\gcd(m,n))}$, for all $m,n\in \mathbb N$, and iii) $f(m)=1$ if and only if $m=1$.

1990 Irish Math Olympiad, 2

Tags: number theory , prime number , arithmetic sequence

Suppose that $p_1<p_2<\dots <p_{15}$ are prime numbers in arithmetic progression, with common difference $d$. Prove that $d$ is divisible by $2,3,5,7,11$ and $13$.