Olympiad problems

2004 Rioplatense Mathematical Olympiad, Level 3, 2

Find the smallest integer $n$ such that each subset of $\{1,2,\ldots, 2004\}$ with $n$ elements has two distinct elements $a$ and $b$ for which $a^2-b^2$ is a multiple of $2004$.

1981 All Soviet Union Mathematical Olympiad, 322

Tags: number theory , greatest common divisor , consecutive

Find $n$ such that each of the numbers $n,(n+1),...,(n+20)$ has the common divider greater than one with the number $30030 = 2\cdot 3\cdot 5\cdot 7\cdot 11\cdot 13$.

KoMaL A Problems 2018/2019, A. 732

Tags: number theory , algebra

Does there exist an infinite sequence $a_1,a_2,\dotsc$ of real numbers which is bounded, not periodic, and satisfies the recursion $a_{n+1}=a_na_{n-1}+1$?

2004 Putnam, B1

Tags: algebra , polynomial , number theory , relatively prime , rational root theorem

Let $P(x)=c_nx^n+c_{n-1}x^{n-1}+\cdots+c_0$ be a polynomial with integer coefficients. Suppose that $r$ is a rational number such that $P(r)=0$. Show that the $n$ numbers $c_nr, c_nr^2+c_{n-1}r, c_nr^3+c_{n-1}r^2+c_{n-1}r, \dots, c_nr^n+c_{n-1}r^{n-1}+\cdots+c_1r$ are all integers.

2016 NIMO Problems, 1

Tags: remainder , number theory , divisor

Let $m$ be a positive integer less than $2015$. Suppose that the remainder when $2015$ is divided by $m$ is $n$. Compute the largest possible value of $n$. [i] Proposed by Michael Ren [/i]

2002 India IMO Training Camp, 16

Tags: sum , modular arithmetic , number theory , additive number theory

Is it possible to find $100$ positive integers not exceeding $25,000$, such that all pairwise sums of them are different?

2017 Dutch IMO TST, 1

Tags: number theory

Let $a, b,c$ be distinct positive integers, and suppose that $p = ab+bc+ca$ is a prime number. $(a)$ Show that $a^2,b^,c^2$ give distinct remainders after division by $p$. (b) Show that $a^3,b^3,c^3$ give distinct remainders after division by $p$.

2018 Korea Winter Program Practice Test, 3

Tags: number theory

Let $n$ be a "Good Number" if sum of all divisors of $n$ is less than $2n$ for $n\in \mathbb{Z}.$ Does there exist an infinite set $M$ that satisfies the following? For all $a,b\in M,$ $a+b$ is good number. ($a=b$ is allowed.)

2017 Peru IMO TST, 10

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

Let $P (n)$ and $Q (n)$ be two polynomials (not constant) whose coefficients are integers not negative. For each positive integer $n$, define $x_n = 2016^{P (n)} + Q (n)$. Prove that there exist infinite primes $p$ for which there is a positive integer $m$, squarefree, such that $p | x_m$. Clarification: A positive integer is squarefree if it is not divisible by the square of any prime number.

2000 Poland - Second Round, 5

Tags: algebra , number theory , function

Decide whether exists function $f: \mathbb{N} \rightarrow \mathbb{N}$, such that for each $n \in \mathbb{N}$ is $f(f(n) )= 2n$.

1941 Moscow Mathematical Olympiad, 085

Tags: prime , remainder , number theory

Prove that the remainder after division of the square of any prime $p > 3$ by $12$ is equal to $1$.

2017 District Olympiad, 3

Tags: arithmetic sequence , number theory

Denote $ S_n $ as being the sum of the squares of the first $ n\in\mathbb{N} $ terms of a given arithmetic sequence of natural numbers. [b]a)[/b] If $ p\ge 5 $ is a prime, then $ p\big| S_p. $ [b]b)[/b] $ S_5 $ is not a perfect square.

2015 Korea National Olympiad, 4

Tags: inequalities , number theory , relatively prime , prime number , coprime integers

For a positive integer $n$, $a_1, a_2, \cdots a_k$ are all positive integers without repetition that are not greater than $n$ and relatively prime to $n$. If $k>8$, prove the following. $$\sum_{i=1}^k |a_i-\frac{n}{2}|<\frac{n(k-4)}{2}$$

2015 IMO Shortlist, N4

Tags: number theory , greatest common divisor

Suppose that $a_0, a_1, \cdots $ and $b_0, b_1, \cdots$ are two sequences of positive integers such that $a_0, b_0 \ge 2$ and \[ a_{n+1} = \gcd{(a_n, b_n)} + 1, \qquad b_{n+1} = \operatorname{lcm}{(a_n, b_n)} - 1. \] Show that the sequence $a_n$ is eventually periodic; in other words, there exist integers $N \ge 0$ and $t > 0$ such that $a_{n+t} = a_n$ for all $n \ge N$.

2006 JBMO ShortLists, 13

Tags: greatest common divisor , algorithm , modular arithmetic , number theory

Let $ A$ be a subset of the set $ \{1, 2,\ldots,2006\}$, consisting of $ 1004$ elements. Prove that there exist $ 3$ distinct numbers $ a,b,c\in A$ such that $ gcd(a,b)$: a) divides $ c$ b) doesn't divide $ c$

2021 JBMO TST - Turkey, 5

Tags: function , number theory

$d(n)$ shows the number of positive integer divisors of positive integer $n$. For which positive integers $n$ one cannot find a positive integer $k$ such that $\underbrace{d(\dots d(d}_{k\ \text{times}} (n) \dots )$ is a perfect square.

2012 ELMO Shortlist, 2

Tags: function , relatively prime , number theory

For positive rational $x$, if $x$ is written in the form $p/q$ with $p, q$ positive relatively prime integers, define $f(x)=p+q$. For example, $f(1)=2$. a) Prove that if $f(x)=f(mx/n)$ for rational $x$ and positive integers $m, n$, then $f(x)$ divides $|m-n|$. b) Let $n$ be a positive integer. If all $x$ which satisfy $f(x)=f(2^nx)$ also satisfy $f(x)=2^n-1$, find all possible values of $n$. [i]Anderson Wang.[/i]

2021 Peru PAGMO TST, P5

Tags: number theory

Prove that there are infinitely many positive integers $a, b$ and $c$ such that their greatest common divisor is $1$ (ie: $gcd(a, b, c) = 1$) and satisfy that: $$a^2=b^2+c^2+bc$$

2008 Korea Junior Math Olympiad, 6

Tags: number theory , sum of powers , sum , divisible , divisor

If $d_1,d_2,...,d_k$ are all distinct positive divisors of $n$, we define $f_s(n) = d_1^s+d_2^s+..+d_k^s$. For example, we have $f_1(3) = 1 + 3 = 4, f_2(4) = 1 + 2^2 + 4^2 = 21$. Prove that for all positive integers $n$, $n^3f_1(n) - 2nf_9(n) + n^2f_3(n)$ is divisible by $8$.

2013 Online Math Open Problems, 31

Tags: probability , number theory , relatively prime

Beyond the Point of No Return is a large lake containing 2013 islands arranged at the vertices of a regular $2013$-gon. Adjacent islands are joined with exactly two bridges. Christine starts on one of the islands with the intention of burning all the bridges. Each minute, if the island she is on has at least one bridge still joined to it, she randomly selects one such bridge, crosses it, and immediately burns it. Otherwise, she stops. If the probability Christine burns all the bridges before she stops can be written as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, find the remainder when $m+n$ is divided by $1000$. [i]Evan Chen[/i]

2018 Czech-Polish-Slovak Junior Match, 1

Tags: number theory , divide , divisible

For natural numbers $a, b c$ it holds that $(a + b + c)^2 | ab (a + b) + bc (b + c) + ca(c + a) + 3abc$. Prove that $(a + b + c) |(a - b)^2 + (b - c)^2 + (c - a)^2$

2010 Postal Coaching, 2

Tags: arithmetic sequence , number theory

Call a triple $(a, b, c)$ of positive integers a [b]nice[/b] triple if $a, b, c$ forms a non-decreasing arithmetic progression, $gcd(b, a) = gcd(b, c) = 1$ and the product $abc$ is a perfect square. Prove that given a nice triple, there exists some other nice triple having at least one element common with the given triple.

2012 IMAC Arhimede, 1

Tags: permutation , number theory , greatest common divisor , combinatorics

Let $a_1,a_2,..., a_n$ be different integers and let $(b_1,b_2,..., b_n),(c_1,c_2,..., c_n)$ be two of their permutations, different from the identity. Prove that $$(|a_1-b_1|+|a_2-b_2|+...+|a_n-b_n| , |a_1-c_1|+|a_2-c_2|+...+|a_n-c_n| ) \ge 2$$ where $(x,y)$ denotes the greatest common divisor of the numbers $x,y$

2020 Stars of Mathematics, 3

Tags: number theory , quadratic residue

Determine the primes $p$ for which the numbers $2\lfloor p/k\rfloor - 1, \ k = 1,2,\ldots, p,$ are all quadratic residues modulo $p.$ [i]Vlad Matei[/i]

2011 Purple Comet Problems, 6

Tags: number theory , relatively prime

Working alone, the expert can paint a car in one day, the amateur can paint a car in two days, and the beginner can paint a car in three days. If the three painters work together at these speeds to paint three cars, it will take them $\frac{m}{n}$ days where $m$ and $n$ are relatively prime positive integers. Find $m + n.$