Olympiad problems

2005 South East Mathematical Olympiad, 4

Find all positive integer solutions $(a, b, c)$ to the function $a^{2} + b^{2} + c^{2} = 2005$, where $a \leq b \leq c$.

1969 IMO Longlists, 43

Tags: modular arithmetic , number theory , divisibility

$(MON 4)$ Let $p$ and $q$ be two prime numbers greater than $3.$ Prove that if their difference is $2^n$, then for any two integers $m$ and $n,$ the number $S = p^{2m+1} + q^{2m+1}$ is divisible by $3.$

2008 Gheorghe Vranceanu, 4

Tags: number theory , modular arithmetic

Find the largest natural number $ k $ which has the property that there is a partition of the natural numbers $ \bigcup_{1\le j\le k} V_j, $ an index $ i\in\{ 1,\ldots ,k \} $ and three natural numbers $ a,b,c\in V_i, $ satisfying $ a+2b=4c. $

2014 Postal Coaching, 3

Tags: modular arithmetic , number theory

Find all ordered triplets of positive integers $(a,\ b,\ c)$ such that $2^a+3^b+1=6^c$.

2010 AMC 12/AHSME, 23

Tags: modular arithmetic , algebra , polynomial , number theory

The number obtained from the last two nonzero digits of $ 90!$ is equal to $ n$. What is $ n$? $ \textbf{(A)}\ 12 \qquad \textbf{(B)}\ 32 \qquad \textbf{(C)}\ 48 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 68$

PEN A Problems, 23

Tags: quadratic , gauss , modular arithmetic , number theory , relatively prime , divisibility theory

(Wolstenholme's Theorem) Prove that if \[1+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{p-1}\] is expressed as a fraction, where $p \ge 5$ is a prime, then $p^{2}$ divides the numerator.

1993 China Team Selection Test, 1

Tags: modular arithmetic , number theory

For all primes $p \geq 3,$ define $F(p) = \sum^{\frac{p-1}{2}}_{k=1}k^{120}$ and $f(p) = \frac{1}{2} - \left\{ \frac{F(p)}{p} \right\}$, where $\{x\} = x - [x],$ find the value of $f(p).$

2002 National Olympiad First Round, 30

Tags: modular arithmetic

How many integers $0 \leq x < 125$ are there such that $x^3 - 2x + 6 \equiv 0 \pmod {125}$? $ \textbf{a)}\ 0 \qquad\textbf{b)}\ 1 \qquad\textbf{c)}\ 2 \qquad\textbf{d)}\ 3 \qquad\textbf{e)}\ \text{None of above} $

2004 AMC 10, 21

Tags: modular arithmetic

Let $ 1,4,\cdots$ and $ 9,16,\cdots$ be two arithmetic progressions. The set $ S$ is the union of the first $ 2004$ terms of each sequence. How many distinct numbers are in $ S$? $ \textbf{(A)}\ 3722\qquad \textbf{(B)}\ 3732\qquad \textbf{(C)}\ 3914\qquad \textbf{(D)}\ 3924\qquad \textbf{(E)}\ 4007$

2008 Macedonia National Olympiad, 4

Tags: modular arithmetic , induction , combinatorics

We call an integer $ n > 1$ [i]good[/i] if, for any natural numbers $ 1 \le b_1, b_2, \ldots , b_{n\minus{}1} \le n \minus{} 1$ and any $ i \in \{0, 1, \ldots , n \minus{} 1\}$, there is a subset $ I$ of $ \{1, \ldots , n \minus{} 1\}$ such that $ \sum_{k\in I} b_k \equiv i \pmod n$. (The sum over the empty set is zero.) Find all good numbers.

2013 ELMO Problems, 5

Tags: algebra , polynomial , geometry , 3d geometry , modular arithmetic , number theory

For what polynomials $P(n)$ with integer coefficients can a positive integer be assigned to every lattice point in $\mathbb{R}^3$ so that for every integer $n \ge 1$, the sum of the $n^3$ integers assigned to any $n \times n \times n$ grid of lattice points is divisible by $P(n)$? [i]Proposed by Andre Arslan[/i]

2002 Tuymaada Olympiad, 1

Tags: modular arithmetic , combinatorics

Each of the points $G$ and $H$ lying from different sides of the plane of hexagon $ABCDEF$ is connected with all vertices of the hexagon. Is it possible to mark 18 segments thus formed by the numbers $1, 2, 3, \ldots, 18$ and arrange some real numbers at points $A, B, C, D, E, F, G, H$ so that each segment is marked with the difference of the numbers at its ends? [i]Proposed by A. Golovanov[/i]

2021 JBMO TST - Turkey, 6

Tags: modular arithmetic , number theory

Integers $a_1, a_2, \dots a_n$ are different at $\text{mod n}$. If $a_1, a_2-a_1, a_3-a_2, \dots a_n-a_{n-1}$ are also different at $\text{mod n}$, we call the ordered $n$-tuple $(a_1, a_2, \dots a_n)$ [i]lucky[/i]. For which positive integers $n$, one can find a lucky $n$-tuple?

2002 India IMO Training Camp, 14

Tags: modular arithmetic , number theory

Let $p$ be an odd prime and let $a$ be an integer not divisible by $p$. Show that there are $p^2+1$ triples of integers $(x,y,z)$ with $0 \le x,y,z < p$ and such that $(x+y+z)^2 \equiv axyz \pmod p$

PEN H Problems, 28

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

Let $a, b, c$ be positive integers such that $a$ and $b$ are relatively prime and $c$ is relatively prime either to $a$ or $b$. Prove that there exist infinitely many triples $(x, y, z)$ of distinct positive integers such that \[x^{a}+y^{b}= z^{c}.\]

1997 Turkey MO (2nd round), 1

Tags: quadratic , modular arithmetic , number theory

Find all pairs of integers $(x, y)$ such that $5x^{2}-6xy+7y^{2}=383$.

2008 Balkan MO Shortlist, N2

Tags: inequalities , algebra , polynomial , modular arithmetic , induction , number theory , relatively prime

Let $ c$ be a positive integer. The sequence $ a_1,a_2,\ldots$ is defined as follows $ a_1\equal{}c$, $ a_{n\plus{}1}\equal{}a_n^2\plus{}a_n\plus{}c^3$ for all positive integers $ n$. Find all $ c$ so that there are integers $ k\ge1$ and $ m\ge2$ so that $ a_k^2\plus{}c^3$ is the $ m$th power of some integer.

2014 Contests, 4

Tags: modular arithmetic , number theory , prime number

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$

2011 Spain Mathematical Olympiad, 3

Tags: algebra , polynomial , induction , floor function , modular arithmetic , number theory

The sequence $S_0,S_1,S_2,\ldots$ is defined by[list][*]$S_n=1$ for $0\le n\le 2011$, and [*]$S_{n+2012}=S_{n+2011}+S_n$ for $n\ge 0$.[/list]Prove that $S_{2011a}-S_a$ is a multiple of $2011$ for all nonnegative integers $a$.

1999 Romania Team Selection Test, 10

Tags: modular arithmetic , number theory , divisibility

Determine all positive integers $n$ for which there exists an integer $m$ such that ${2^{n}-1}$ is a divisor of ${m^{2}+9}$.

Oliforum Contest II 2009, 1

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

Let $ \sigma(\cdot): \mathbb{N}_0 \to \mathbb{N}_0$ be the function from every positive integer $ n$ to the sum of divisors $ \sum_{d \mid n}{d}$ (i.e. $ \sigma(6) \equal{} 6 \plus{} 3 \plus{} 2 \plus{} 1$ and $ \sigma(8) \equal{} 8 \plus{} 4 \plus{} 2 \plus{} 1$). Find all primes $ p$ such that $ p \mid \sigma(p \minus{} 1)$. [i](Salvatore Tringali)[/i]

2013 NIMO Problems, 4

Tags: modular arithmetic , euler

Let $S = \{1,2,\cdots,2013\}$. Let $N$ denote the number $9$-tuples of sets $(S_1, S_2, \dots, S_9)$ such that $S_{2n-1}, S_{2n+1} \subseteq S_{2n} \subseteq S$ for $n=1,2,3,4$. Find the remainder when $N$ is divided by $1000$. [i]Proposed by Lewis Chen[/i]

2013 India IMO Training Camp, 2

Tags: modular arithmetic , number theory , equation

An integer $a$ is called friendly if the equation $(m^2+n)(n^2+m)=a(m-n)^3$ has a solution over the positive integers. [b]a)[/b] Prove that there are at least $500$ friendly integers in the set $\{ 1,2,\ldots ,2012\}$. [b]b)[/b] Decide whether $a=2$ is friendly.

2011 Kosovo Team Selection Test, 4

Tags: modular arithmetic , number theory

From the number $7^{1996}$ we delete its first digit, and then add the same digit to the remaining number. This process continues until the left number has ten digits. Show that the left number has two same digits.

1987 IMO Longlists, 44

Tags: trigonometry , modular arithmetic , inequalities

Let $\theta_1,\theta_2,\cdots,\theta_n$ be $n$ real numbers such that $\sin \theta_1+\sin \theta_2+\cdots+\sin \theta_n=0$. Prove that \[|\sin \theta_1+2 \sin \theta_2+\cdots +n \sin \theta_n| \leq \left[ \frac{n^2}{4} \right]\]