Olympiad problems

2024 Israel TST, P3

Tags: algebra , polynomial , number theory , modular arithmetic , prime numbers

Let $n$ be a positive integer and $p$ be a prime number of the form $8k+5$. A polynomial $Q$ of degree at most $2023$ and nonnegative integer coefficients less than or equal to $n$ will be called "cool" if \[p\mid Q(2)\cdot Q(3) \cdot \ldots \cdot Q(p-2)-1.\] Prove that the number of cool polynomials is even.

1979 IMO Longlists, 26

Tags: prime numbers , factorization , number theory

Let $n$ be a positive integer. If $4^n + 2^n + 1$ is a prime, prove that $n$ is a power of three.

1999 Irish Math Olympiad, 2

Tags: function , number theory , prime numbers , algebra proposed , 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.$

2005 AMC 12/AHSME, 18

Tags: number theory , prime numbers

Call a number "prime-looking" if it is composite but not divisible by 2, 3, or 5. The three smallest prime-looking numbers are 49, 77, and 91. There are 168 prime numbers less than 1000. How many prime-looking numbers are there less than 1000? $ \textbf{(A)}\ 100 \qquad \textbf{(B)}\ 102 \qquad \textbf{(C)}\ 104 \qquad \textbf{(D)}\ 106 \qquad \textbf{(E)}\ 108$

2009 Korea Junior Math Olympiad, 8

Tags: number theory , prime numbers , Diophantine Equations

Let a, b, c, d, and e be positive integers. Are there any solutions to $a^2+b^3+c^5+d^7=e^{11}$?

2012 IFYM, Sozopol, 4

Tags: algebra , polynomial , calculus , integration , Gauss , number theory , prime numbers

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.

2004 Regional Competition For Advanced Students, 4

Tags: induction , number theory , prime numbers , algebra unsolved , algebra

The sequence $ < x_n >$ is defined through: $ x_{n \plus{} 1} \equal{} \left(\frac {n}{2004} \plus{} \frac {1}{n}\right)x_n^2 \minus{} \frac {n^3}{2004} \plus{} 1$ for $ n > 0$ Let $ x_1$ be a non-negative integer smaller than $ 204$ so that all members of the sequence are non-negative integers. Show that there exist infinitely many prime numbers in this sequence.

2015 Postal Coaching, Problem 5

Tags: RMM , number theory , prime numbers

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

2023 Turkey EGMO TST, 2

Tags: number theory , prime numbers

Find all pairs of $p,q$ prime numbers that satisfy the equation $$p(p^4+p^2+10q)=q(q^2+3)$$

2012 European Mathematical Cup, 2

Tags: number theory , greatest common divisor , function , prime numbers , number theory proposed

Let $S$ be the set of positive integers. For any $a$ and $b$ in the set we have $GCD(a, b)>1$. For any $a$, $b$ and $c$ in the set we have $GCD(a, b, c)=1$. Is it possible that $S$ has $2012$ elements? [i]Proposed by Ognjen Stipetić.[/i]

2017 China Team Selection Test, 6

Tags: number theory , Polynomials , prime numbers , 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$.

2010 India IMO Training Camp, 8

Tags: number theory , prime numbers , number theory unsolved

Call a positive integer [b]good[/b] if either $N=1$ or $N$ can be written as product of [i]even[/i] number of prime numbers, not necessarily distinct. Let $P(x)=(x-a)(x-b),$ where $a,b$ are positive integers. (a) Show that there exist distinct positive integers $a,b$ such that $P(1),P(2),\cdots ,P(2010)$ are all good numbers. (b) Suppose $a,b$ are such that $P(n)$ is a good number for all positive integers $n$. Prove that $a=b$.

1998 IMO Shortlist, 5

Tags: number theory , prime numbers , algebra , functional equation , IMO , IMO 1998 , IMO Shortlist

Determine the least possible value of $f(1998),$ where $f:\Bbb{N}\to \Bbb{N}$ is a function such that for all $m,n\in {\Bbb N}$, \[f\left( n^{2}f(m)\right) =m\left( f(n)\right) ^{2}. \]

2009 Miklós Schweitzer, 2

Tags: modular arithmetic , number theory , prime numbers , combinatorics proposed , 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?

2000 Saint Petersburg Mathematical Olympiad, 10.7

Tags: number theory , prime numbers , Divisibility

We'll call a positive integer "almost prime", if it is not divisible by any prime from the interval $[3,19]$. We'll call a number "very non-prime", if it has at least 2 primes from interval $[3,19]$ dividing it. What is the greatest amount of almost prime numbers can be selected, such that the sum of any two of them is a very non-prime number? [I]Proposed by S. Berlov, S. Ivanov[/i]

2017 Germany, Landesrunde - Grade 11/12, 3

Tags: number theory , prime numbers , exponent , Power , Germany , 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$.

2016 LMT, 6

Tags: number theory , prime numbers

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

2003 APMO, 3

Tags: number theory , prime numbers , APMO

Let $k\ge 14$ be an integer, and let $p_k$ be the largest prime number which is strictly less than $k$. You may assume that $p_k\ge 3k/4$. Let $n$ be a composite integer. Prove: (a) if $n=2p_k$, then $n$ does not divide $(n-k)!$; (b) if $n>2p_k$, then $n$ divides $(n-k)!$.

1993 IMO Shortlist, 2

Tags: modular arithmetic , number theory , Divisibility , prime numbers , composite numbers , IMO Shortlist

A natural number $n$ is said to have the property $P,$ if, for all $a, n^2$ divides $a^n - 1$ whenever $n$ divides $a^n - 1.$ a.) Show that every prime number $n$ has property $P.$ b.) Show that there are infinitely many composite numbers $n$ that possess property $P.$

2023 Grosman Mathematical Olympiad, 4

Tags: quadratics , number theory , prime numbers

Let $q$ be an odd prime number. Prove that it is impossible for all $(q-1)$ numbers \[1^2+1+q, 2^2+2+q, \dots, (q-1)^2+(q-1)+q\] to be products of two primes (not necessarily distinct).

2022 USAJMO, 5

Tags: number theory , Diophantine equation , prime numbers

Find all pairs of primes $(p, q)$ for which $p-q$ and $pq-q$ are both perfect squares.

2023 Kazakhstan National Olympiad, 5

Tags: number theory , prime numbers

Solve the given equation in prime numbers $$p^3+q^3+r^3=p^2qr$$

2014 AMC 8, 23

Tags: number theory , prime numbers , AMC

Three members of the Euclid Middle School girls' softball team had the following conversation. Ashley: I just realized that our uniform numbers are all $2$-digit primes. Bethany: And the sum of your two uniform numbers is the date of my birthday earlier this month. Caitlin: That's funny. The sum of your two uniform numbers is the date of my birthday later this month. Ashley: And the sum of you two uniform numbers is today's date. What number does Caitlin wear? $\textbf{(A) }11\qquad\textbf{(B) }13\qquad\textbf{(C) }17\qquad\textbf{(D) }19\qquad \textbf{(E) }23$

2023 Moldova EGMO TST, 4

Tags: number theory , prime numbers , algebra , system of equations

Find all triplets of prime numbers $(m, n, p)$, that satisfy the system of equations: $$\left\{\begin{matrix} 2m-n+13p=2072,\\3m+11n+13p=2961.\end{matrix}\right.$$

2016 Lusophon Mathematical Olympiad, 5

Tags: number theory , prime numbers , prime , Sequence

A numerical sequence is called lusophone if it satisfies the following three conditions: i) The first term of the sequence is number $1$. ii) To obtain the next term of the sequence we can multiply the previous term by a positive prime number ($2,3,5,7,11, ...$) or add $1$. (iii) The last term of the sequence is the number $2016$. For example: $1\overset{{\times 11}}{\to}11 \overset{{\times 61}}{\to} 671 \overset{{+1}}{\to}672 \overset{{\times 3}}{\to}2016$ How many Lusophone sequences exist in which (as in the example above) the add $1$ operation was used exactly once and not multiplied twice by the same prime number?