Olympiad problems

1994 IMO Shortlist, 3

Tags: modular arithmetic , number theory , prime numbers , Combinatorial Number Theory , IMO , IMO 1994 , combinatorics

Show that there exists a set $ A$ of positive integers with the following property: for any infinite set $ S$ of primes, there exist [i]two[/i] positive integers $ m$ in $ A$ and $ n$ not in $ A$, each of which is a product of $ k$ distinct elements of $ S$ for some $ k \geq 2$.

2001 Baltic Way, 17

Tags: number theory proposed , number theory , Combinatorial Number Theory

Let $n$ be a positive integer. Prove that at least $2^{n-1}+n$ numbers can be chosen from the set $\{1, 2, 3,\ldots ,2^n\}$ such that for any two different chosen numbers $x$ and $y$, $x+y$ is not a divisor of $x\cdot y$.

2018 EGMO, 6

Tags: number theory , Combinatorial Number Theory , EGMO , EGMO 2018 , Hi

[list=a] [*]Prove that for every real number $t$ such that $0 < t < \tfrac{1}{2}$ there exists a positive integer $n$ with the following property: for every set $S$ of $n$ positive integers there exist two different elements $x$ and $y$ of $S$, and a non-negative integer $m$ (i.e. $m \ge 0 $), such that \[ |x-my|\leq ty.\] [*]Determine whether for every real number $t$ such that $0 < t < \tfrac{1}{2} $ there exists an infinite set $S$ of positive integers such that \[|x-my| > ty\] for every pair of different elements $x$ and $y$ of $S$ and every positive integer $m$ (i.e. $m > 0$).

2014 Contests, 3

Tags: quadratics , number theory , Divisors , Combinatorial Number Theory , EGMO , EGMO 2014

We denote the number of positive divisors of a positive integer $m$ by $d(m)$ and the number of distinct prime divisors of $m$ by $\omega(m)$. Let $k$ be a positive integer. Prove that there exist infinitely many positive integers $n$ such that $\omega(n) = k$ and $d(n)$ does not divide $d(a^2+b^2)$ for any positive integers $a, b$ satisfying $a + b = n$.

1998 All-Russian Olympiad Regional Round, 11.8

Tags: Combinatorial Number Theory , combinatorics , algebra , inequalities , number theory

A sequence $a_1,a_2,\cdots$ of positive integers contains each positive integer exactly once. Moreover for every pair of distinct positive integer $m$ and $n$, $\frac{1}{1998} < \frac{|a_n- a_m|}{|n-m|} < 1998$, show that $|a_n - n | <2000000$ for all $n$.

2016 China Team Selection Test, 6

Tags: Combinatorial Number Theory , number theory , combinatorics

Let $m,n$ be naturals satisfying $n \geq m \geq 2$ and let $S$ be a set consisting of $n$ naturals. Prove that $S$ has at least $2^{n-m+1}$ distinct subsets, each whose sum is divisible by $m$. (The zero set counts as a subset).

1988 Czech And Slovak Olympiad IIIA, 4

Tags: combinatorics , Coloring , number theory , Combinatorial Number Theory

Prove that each of the numbers $1, 2, 3, ..., 2^n$ can be written in one of two colors (red and blue) such that no non-constant $2n$-term arithmetic sequence chosen from these numbers is monochromatic .

2003 Poland - Second Round, 4

Tags: number theory , combinatorics , Combinatorial Number Theory , Poland , pigeonhole principle , prime numbers

Prove that for any prime number $p > 3$ exist integers $x, y, k$ that meet conditions: $0 < 2k < p$ and $kp + 3 = x^2 + y^2$.

2019 Iran Team Selection Test, 2

Tags: Combinatorial Number Theory , number theory , combinatorics

Hesam chose $10$ distinct positive integers and he gave all pairwise $\gcd$'s and pairwise ${\text lcm}$'s (a total of $90$ numbers) to Masoud. Can Masoud always find the first $10$ numbers, just by knowing these $90$ numbers? [i]Proposed by Morteza Saghafian [/i]

2024 CAPS Match, 6

Tags: combinatorics , number theory , international competitions , Combinatorial Number Theory , prime numbers , triplets , positive integers

Determine whether there exist infinitely many triples $(a, b, c)$ of positive integers such that every prime $p$ divides \[\left\lfloor\left(a+b\sqrt{2024}\right)^p\right\rfloor-c.\]