Olympiad problems

2008 Junior Balkan Team Selection Tests - Moldova, 10

Solve in prime numbers: $ \{\begin{array}{c}\ \ 2a - b + 7c = 1826 \ 3a + 5b + 7c = 2007 \end{array}$

2018 Centroamerican and Caribbean Math Olympiad, 3

Tags: number theory , prime number

Let $x, y$ be real numbers such that $x-y, x^2-y^2, x^3-y^3$ are all prime numbers. Prove that $x-y=3$. EDIT: Problem submitted by Leonel Castillo, Panama.

2023 Turkey EGMO TST, 2

Tags: number theory , prime number

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

1994 China Team Selection Test, 2

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.

2008 Czech-Polish-Slovak Match, 3

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

Find all primes $p$ such that the expression \[\binom{p}1^2+\binom{p}2^2+\cdots+\binom{p}{p-1}^2\] is divisible by $p^3$.

2012 Brazil 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]

1992 Romania Team Selection Test, 6

Tags: number theory , prime , integer polynomial , prime number

Let $m,n$ be positive integers and $p$ be a prime number. Show that if $\frac{7^m + p \cdot 2^n}{7^m - p \cdot 2^n}$ is an integer, then it is a prime number.

2019 Switzerland Team Selection Test, 4

Tags: number theory , polynomial , prime number , algebra

Let $p$ be a prime number. Find all polynomials $P$ with integer coefficients with the following properties: $(a)$ $P(x)>x$ for all positive integers $x$. $(b)$ The sequence defined by $p_0:=p$, $p_{n+1}:=P(p_n)$ for all positive integers $n$, satisfies the property that for all positive integers $m$ there exists some $l\geq 0$ such that $m\mid p_l$.

2020 AMC 12/AHSME, 4

Tags: prime number

The acute angles of a right triangle are $a^{\circ}$ and $b^{\circ}$, where $a>b$ and both $a$ and $b$ are prime numbers. What is the least possible value of $b$? $\textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }5\qquad\textbf{(D) }7\qquad\textbf{(E) }11$

2018 Dutch BxMO TST, 3

Tags: number theory , prime number , divisibility

Let $p$ be a prime number. Prove that it is possible to choose a permutation $a_1, a_2,...,a_p$ of $1,2,...,p$ such that the numbers $a_1, a_1a_2, a_1a_2a_3,..., a_1a_2a_3...a_p$ all have different remainder upon division by $p$.

1981 Czech and Slovak Olympiad III A, 4

Tags: number theory , combinatorics , prime number , sequence

Let $n$ be a positive integer. Show that there is a prime $p$ and a sequence $\left(a_k\right)_{k\ge1}$ of positive integers such that the sequence $\left(p+na_k\right)_{k\ge1}$ consists of distinct primes.

2009 Indonesia TST, 3

Tags: prime number , number theory

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

2021 Kyiv City MO Round 1, 8.5

Tags: number theory , prime number

For a prime number $p > 3$, define the following irreducible fraction: $$\frac{m}{n} = \frac{p-1}{2} + \frac{p-2}{3} + \ldots + \frac{2}{p-1} - 1$$ Prove that $m$ is divisible by $p$. [i]Proposed by Oleksii Masalitin[/i]

1987 AMC 8, 9

Tags: number theory , least common multiple , relatively prime , prime number

When finding the sum $\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}+\frac{1}{7}$, the least common denominator used is $\text{(A)}\ 120 \qquad \text{(B)}\ 210 \qquad \text{(C)}\ 420 \qquad \text{(D)}\ 840 \qquad \text{(E)}\ 5040$

2023 Iran MO (3rd Round), 2

Tags: number theory , prime number

Let $N$ be the number of ordered pairs $(x,y)$ st $1 \leq x,y \leq p(p-1)$ and : $$x^{y} \equiv y^{x} \equiv 1 \pmod{p}$$ where $p$ is a fixed prime number. Show that : $$(\phi {(p-1)}d(p-1))^2 \leq N \leq ((p-1)d(p-1))^2$$ where $d(n)$ is the number of divisors of $n$

2003 Iran MO (3rd Round), 3

Tags: prime number , number theory

assume that A is a finite subset of prime numbers, and a is an positive integer. prove that there are only finitely many positive integers m s.t: prime divisors of a^m-1 are contained in A.

1995 AIME Problems, 10

Tags: calculus , integration , number theory , prime number

What is the largest positive integer that is not the sum of a positive integral multiple of 42 and a positive composite integer?

Kvant 2019, M2578

Tags: number theory , prime number

Three prime numbers $p,q,r$ and a positive integer $n$ are given such that the numbers \[ \frac{p+n}{qr}, \frac{q+n}{rp}, \frac{r+n}{pq} \] are integers. Prove that $p=q=r $. [i]Nazar Agakhanov[/i]

2018 Stars of Mathematics, 2

Tags: number theory , prime number

Find the smallest natural $ k $ such that among any $ k $ distinct and pairwise coprime naturals smaller than $ 2018, $ a prime can be found. [i]Vlad Robu[/i]

2019 Polish MO Finals, 2

Tags: number theory , prime number , divisibility

Let $p$ a prime number and $r$ an integer such that $p|r^7-1$. Prove that if there exist integers $a, b$ such that $p|r+1-a^2$ and $p|r^2+1-b^2$, then there exist an integer $c$ such that $p|r^3+1-c^2$.

2010 Canadian Mathematical Olympiad Qualification Repechage, 4

Tags: prime number , number theory

Determine the smallest positive integer $m$ with the property that $m^3-3m^2+2m$ is divisible by both $79$ and $83$.

1990 IMO Shortlist, 27

Tags: number theory , decimal representation , prime number , digit

Find all natural numbers $ n$ for which every natural number whose decimal representation has $ n \minus{} 1$ digits $ 1$ and one digit $ 7$ is prime.

2024 SG Originals, Q5

Tags: combinatorics , grid , number theory , prime number , prime

Let $p$ be a prime number. Determine the largest possible $n$ such that the following holds: it is possible to fill an $n\times n$ table with integers $a_{ik}$ in the $i$th row and $k$th column, for $1\le i,k\le n$, such that for any quadruple $i,j,k,l$ with $1\le i<j\le n$ and $1\le k<l\le n$, the number $a_{ik}a_{jl}-a_{il}a_{jk}$ is not divisible by $p$. [i]Proposed by oneplusone[/i]

1974 Putnam, A3

Tags: number theory , perfect square , prime number

A well-known theorem asserts that a prime $p > 2$ can be written as the sum of two perfect squares ($p = m^2 +n^2$ , with $m$ and $n$ integers) if and only if $p \equiv 1$ (mod $4$). Assuming this result, find which primes $p > 2$ can be written in each of the following forms, using integers $x$ and $y$: a) $x^2 +16y^2, $ b) $4x^2 +4xy+ 5y^2.$

2010 Contests, 4

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

With $\sigma (n)$ we denote the sum of natural divisors of the natural number $n$. Prove that, if $n$ is the product of different prime numbers of the form $2^k-1$ for $k \in \mathbb{N}$($Mersenne's$ prime numbers) , than $\sigma (n)=2^m$, for some $m \in \mathbb{N}$. Is the inverse statement true?