Olympiad problems

2009 Iran Team Selection Test, 2

Tags: pigeonhole principle , modular arithmetic , inequalities , prime number , diophantine equation , number theory

Let $ a$ be a fix natural number . Prove that the set of prime divisors of $ 2^{2^{n}} \plus{} a$ for $ n \equal{} 1,2,\cdots$ is infinite

2020 Italy National Olympiad, #5

Tags: function , number theory , prime number

Le $S$ be the set of positive integers greater than or equal to $2$. A function $f: S\rightarrow S$ is italian if $f$ satifies all the following three conditions: 1) $f$ is surjective 2) $f$ is increasing in the prime numbers(that is, if $p_1<p_2$ are prime numbers, then $f(p_1)<f(p_2)$) 3) For every $n\in S$ the number $f(n)$ is the product of $f(p)$, where $p$ varies among all the primes which divide $n$ (For instance, $f(360)=f(2^3\cdot 3^2\cdot 5)=f(2)\cdot f(3)\cdot f(5)$). Determine the maximum and the minimum possible value of $f(2020)$, when $f$ varies among all italian functions.

2016 IberoAmerican, 1

Tags: number theory , prime number

Find all prime numbers $p,q,r,k$ such that $pq+qr+rp = 12k+1$

1991 Cono Sur Olympiad, 3

Tags: inequalities , number theory , prime number , algebra

Given a positive integrer number $n$ ($n\ne 0$), let $f(n)$ be the average of all the positive divisors of $n$. For example, $f(3)=\frac{1+3}{2}=2$, and $f(12)=\frac{1+2+3+4+6+12}{6}=\frac{14}{3}$. [b]a[/b] Prove that $\frac{n+1}{2} \ge f(n)\ge \sqrt{n}$. [b]b[/b] Find all $n$ such that $f(n)=\frac{91}{9}$.

2017 China Team Selection Test, 6

Tags: number theory , prime number , algebra , polynomial

For a given positive integer $n$ and prime number $p$, find the minimum value of positive integer $m$ that satisfies the following property: for any polynomial $$f(x)=(x+a_1)(x+a_2)\ldots(x+a_n)$$ ($a_1,a_2,\ldots,a_n$ are positive integers), and for any non-negative integer $k$, there exists a non-negative integer $k'$ such that $$v_p(f(k))<v_p(f(k'))\leq v_p(f(k))+m.$$ Note: for non-zero integer $N$,$v_p(N)$ is the largest non-zero integer $t$ that satisfies $p^t\mid N$.

1987 Czech and Slovak Olympiad III A, 2

Tags: number theory , diophantine equation , prime number , number of solutions

Given a prime $p>3$ and an odd integer $n>0$, show that the equation $$xyz=p^n(x+y+z)$$ has at least $3(n+1)$ different solutions up to symmetry. (That is, if $(x',y',z')$ is a solution and $(x'',y'',z'')$ is a permutation of the previous, they are considered to be the same solution.)

2012 JBMO ShortLists, 2

Tags: prime number , number theory

Do there exist prime numbers $p$ and $q$ such that $p^2(p^3-1)=q(q+1)$ ?

2004 China Western Mathematical Olympiad, 4

Tags: function , euler , search , number theory , totient function , prime number , logarithm

Let $\mathbb{N}$ be the set of positive integers. Let $n\in \mathbb{N}$ and let $d(n)$ be the number of divisors of $n$. Let $\varphi(n)$ be the Euler-totient function (the number of co-prime positive integers with $n$, smaller than $n$). Find all non-negative integers $c$ such that there exists $n\in\mathbb{N}$ such that \[ d(n) + \varphi(n) = n+c , \] and for such $c$ find all values of $n$ satisfying the above relationship.

2014 Romania Team Selection Test, 4

Tags: function , induction , relatively prime , prime number , number theory

Let $f$ be the function of the set of positive integers into itself, defined by $f(1) = 1$, $f(2n) = f(n)$ and $f(2n + 1) = f(n) + f(n + 1)$. Show that, for any positive integer $n$, the number of positive odd integers m such that $f(m) = n$ is equal to the number of positive integers[color=#0000FF][b] less or equal to [/b][/color]$n$ and coprime to $n$. [color=#FF0000][mod: the initial statement said less than $n$, which is wrong.][/color]

2016 LMT, 6

Tags: number theory , prime number

A positive integer is called [i]cool[/i] if it can be expressed in the form $a!\cdot b!+315$ where $a,b$ are positive integers. For example, $1!\cdot 1!+315=316$ is a cool number. Find the sum of all cool numbers that are also prime numbers. [i]Proposed by Evan Fang

1992 AIME Problems, 1

Tags: search , function , number theory , relatively prime , prime number , totient function

Find the sum of all positive rational numbers that are less than $10$ and that have denominator $30$ when written in lowest terms.

2020 Iran Team Selection Test, 6

Tags: prime number , number theory

$p$ is an odd prime number. Find all $\frac{p-1}2$-tuples $\left(x_1,x_2,\dots,x_{\frac{p-1}2}\right)\in \mathbb{Z}_p^{\frac{p-1}2}$ such that $$\sum_{i = 1}^{\frac{p-1}{2}} x_{i} \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{2} \equiv \cdots \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{\frac{p - 1}{2}} \pmod p.$$ [i]Proposed by Ali Partofard[/i]

2013 Korea Junior Math Olympiad, 4

Tags: number theory , prime number , minimum , divide

Prove that there exists a prime number $p$ such that the minimum positive integer $n$ such that $p|2^n -1$ is $3^{2013}$.

2015 Iran MO (3rd round), 5

Tags: number theory , prime number

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

2017 Germany, Landesrunde - Grade 11/12, 3

Tags: number theory , prime number , exponent , power , catalan

Find the smallest prime number that can not be written in the form $\left| 2^a-3^b \right|$ with non-negative integers $a,b$.

PEN C Problems, 4

Tags: floor function , quadratic , inequalities , number theory , prime number , quadratic residue

Let $M$ be an integer, and let $p$ be a prime with $p>25$. Show that the set $\{M, M+1, \cdots, M+ 3\lfloor \sqrt{p} \rfloor -1\}$ contains a quadratic non-residue to modulus $p$.

2009 Miklós Schweitzer, 2

Tags: modular arithmetic , number theory , prime number , combinatorics

Let $ p_1,\dots,p_k$ be prime numbers, and let $ S$ be the set of those integers whose all prime divisors are among $ p_1,\dots,p_k$. For a finite subset $ A$ of the integers let us denote by $ \mathcal G(A)$ the graph whose vertices are the elements of $ A$, and the edges are those pairs $ a,b\in A$ for which $ a \minus{} b\in S$. Does there exist for all $ m\geq 3$ an $ m$-element subset $ A$ of the integers such that (i) $ \mathcal G(A)$ is complete? (ii) $ \mathcal G(A)$ is connected, but all vertices have degree at most 2?

2011 Czech-Polish-Slovak Match, 3

Tags: prime number , relatively prime , number theory

Let $a$ be any integer. Prove that there are infinitely many primes $p$ such that \[ p\,|\,n^2+3\qquad\text{and}\qquad p\,|\,m^3-a \] for some integers $n$ and $m$.

2005 Flanders Junior Olympiad, 3

Tags: complex number , prime number , number theory , geometry

Prove that $2005^2$ can be written in at least $4$ ways as the sum of 2 perfect (non-zero) squares.

2007 ITest, 1

Tags: number theory , prime number

A twin prime pair is a pair of primes $(p,q)$ such that $q = p + 2$. The Twin Prime Conjecture states that there are infinitely many twin prime pairs. What is the arithmetic mean of the two primes in the smallest twin prime pair? (1 is not a prime.) $\textbf{(A) }4$

2012 JBMO TST - Macedonia, 1

Tags: prime number , number theory

Find all prime numbers of the form $\tfrac{1}{11} \cdot \underbrace{11\ldots 1}_{2n \textrm{ ones}}$, where $n$ is a natural number.

2002 Korea Junior Math Olympiad, 2

Tags: number theory , prime number

Find all prime number $p$ such that $p^{2002}+2003^{p-1}-1$ is a multiple of $2003p$.

2018 AMC 10, 5

Tags: number theory , prime number

How many subsets of $\{2,3,4,5,6,7,8,9\}$ contain at least one prime number? $\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$

2021 South East Mathematical Olympiad, 2

Tags: number theory , prime number

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

2019 IMEO, 4

Tags: polynomial , prime number , algebra

Call a two-element subset of $\mathbb{N}$ [i]cute[/i] if it contains exactly one prime number and one composite number. Determine all polynomials $f \in \mathbb{Z}[x]$ such that for every [i]cute[/i] subset $ \{ p,q \}$, the subset $ \{ f(p) + q, f(q) + p \} $ is [i]cute[/i] as well. [i]Proposed by Valentio Iverson (Indonesia)[/i]