Olympiad problems

1989 Czech And Slovak Olympiad IIIA, 6

Consider a finite sequence $a_1, a_2,...,a_n$ whose terms are natural numbers at most equal to $n$. Determine the maximum number of terms of such a sequence, if you know that every two of its neighboring terms are different and at the same time there is no quartet of terms in it such that $a_p = a_r \ne a_q = a_s$ for $p < q < r < s$.

2024 CAPS Match, 6

Tags: number theory , combinatorics , positive integer , combinatorial number theory , prime number , triplets

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.\]

2016 China Team Selection Test, 6

Tags: combinatorics , combinatorial number theory , number theory

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

2003 Poland - Second Round, 4

Tags: number theory , combinatorics , combinatorial number theory , prime number , pigeonhole principle

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

2018 Iran Team Selection Test, 1

Tags: number theory , combinatorics , combinatorial number theory

Let $A_1, A_2, ... , A_k$ be the subsets of $\left\{1,2,3,...,n\right\}$ such that for all $1\leq i,j\leq k$:$A_i\cap A_j \neq \varnothing$. Prove that there are $n$ distinct positive integers $x_1,x_2,...,x_n$ such that for each $1\leq j\leq k$: $$lcm_{i \in A_j}\left\{x_i\right\}>lcm_{i \notin A_j}\left\{x_i\right\}$$ [i]Proposed by Morteza Saghafian, Mahyar Sefidgaran[/i]

2021 Romanian Master of Mathematics Shortlist, N2

Tags: number theory , combinatorial number theory , prime

We call a set of positive integers [i]suitable [/i] if none of its elements is coprime to the sum of all elements of that set. Given a real number $\varepsilon \in (0,1)$, prove that, for all large enough positive integers $N$, there exists a suitable set of size at least $\varepsilon N$, each element of which is at most $N$.

2019 Czech and Slovak Olympiad III A, 6

Tags: number theory , combinatorial number theory , numbers in a table

Assume we can fill a table $n\times n$ with all numbers $1,2,\ldots,n^2-1,n^2$ in such way that arithmetic means of numbers in every row and every column is an integer. Determine all such positive integers $n$.

2016 China Team Selection Test, 6

Tags: number theory , combinatorics , combinatorial number theory

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

2022 Bulgarian Spring Math Competition, Problem 11.4

Tags: combinatorics , number theory , combinatorial number theory , subset , probabilistic method

Let $n \geq 2$ be a positive integer. The set $M$ consists of $2n^2-3n+2$ positive rational numbers. Prove that there exists a subset $A$ of $M$ with $n$ elements with the following property: $\forall$ $2 \leq k \leq n$ the sum of any $k$ (not necessarily distinct) numbers from $A$ is not in $A$.

2016 Bosnia And Herzegovina - Regional Olympiad, 4

Tags: combinatorics , combinatorial number theory , remainder , set

Let $A$ be a set of $65$ integers with pairwise different remainders modulo $2016$. Prove that exists a subset $B=\{a,b,c,d\}$ of set $A$ such that $a+b-c-d$ is divisible with $2016$