Olympiad problems

2012 Romania National Olympiad, 4

[i]Reduced name[/i] of a natural number $A$ with $n$ digits ($n \ge 2$) a number of $n-1$ digits obtained by deleting one of the digits of $A$: For example, the [i]reduced names[/i] of $1024$ is $124$, $104$ and $120$. Determine how many seven-digit numbers cannot be written as the sum of one natural numbers $A$ and a [i]reduced name[/i] of $A$.

2011 Iran MO (3rd Round), 1

Tags: algorithm , number theory

Suppose that $S\subseteq \mathbb Z$ has the following property: if $a,b\in S$, then $a+b\in S$. Further, we know that $S$ has at least one negative element and one positive element. Is the following statement true? There exists an integer $d$ such that for every $x\in \mathbb Z$, $x\in S$ if and only if $d|x$. [i]proposed by Mahyar Sefidgaran[/i]

1985 AMC 12/AHSME, 26

Tags: algorithm , number theory , euclidean algorithm

Find the least positive integer $ n$ for which $ \frac{n\minus{}13}{5n\plus{}6}$ is non-zero reducible fraction. $ \textbf{(A)}\ 45 \qquad \textbf{(B)}\ 68 \qquad \textbf{(C)}\ 155 \qquad \textbf{(D)}\ 226 \qquad \textbf{(E)}\ \text{none of these}$

2000 IMO Shortlist, 5

Tags: diophantine equation , number theory , inradius , perimeter , triangle

Prove that there exist infinitely many positive integers $ n$ such that $ p \equal{} nr,$ where $ p$ and $ r$ are respectively the semiperimeter and the inradius of a triangle with integer side lengths.

2015 Postal Coaching, Problem 5

Tags: number theory , prime number

Let $p \ge 5$ be a prime number. For a positive integer $k$, let $R(k)$ be the remainder when $k$ is divided by $p$, with $0 \le R(k) \le p-1$. Determine all positive integers $a < p$ such that, for every $m = 1, 2, \cdots, p-1$, $$ m + R(ma) > a. $$

2019 Regional Olympiad of Mexico Southeast, 6

Tags: number theory , prime number

Let $p\geq 3$ a prime number, $a$ and $b$ integers such that $\gcd(a, b)=1$. Let $n$ a natural number such that $p$ divides $a^{2^n}+b^{2^n}$, prove that $2^{n+1}$ divides $p-1$.

2007 Mathematics for Its Sake, 1

Tags: floor function , real analysis , sequence , parity , number theory

Prove that the parity of each term of the sequence $ \left( \left\lfloor \left( \lfloor \sqrt q \rfloor +\sqrt{q} \right)^n \right\rfloor \right)_{n\ge 1} $ is opposite to the parity of its index, where $ q $ is a squarefree natural number.

2016 Junior Balkan Team Selection Tests - Moldova, 6

Tags: diophantine , diophantine equation , number theory

Determine all pairs $(x, y)$ of natural numbers satisfying the equation $5^x=y^4+4y+1$.

2021 China Team Selection Test, 4

Tags: inequality , number theory function , number theory , floor function , inequalities

Proof that $$ \sum_{m=1}^n5^{\omega (m)} \le \sum_{k=1}^n\lfloor \frac{n}{k} \rfloor \tau (k)^2 \le \sum_{m=1}^n5^{\Omega (m)} .$$

2004 Estonia Team Selection Test, 5

Tags: number theory , lcm , power of 2 , divisor

Find all natural numbers $n$ for which the number of all positive divisors of the number lcm $(1,2,..., n)$ is equal to $2^k$ for some non-negative integer $k$.

2009 China Team Selection Test, 1

Tags: number theory

Let $ n$ be a composite. Prove that there exists positive integer $ m$ satisfying $ m|n, m\le\sqrt {n},$ and $ d(n)\le d^3(m).$ Where $ d(k)$ denotes the number of positive divisors of positive integer $ k.$

Kvant 2022, M2719

Tags: number theory , residue

For an odd positive integer $n>1$ define $S_n$ to be the set of the residues of the powers of two, modulo $n{}$. Do there exist distinct $n{}$ and $m{}$ whose corresponding sets $S_n$ and $S_m$ coincide? [i]Proposed by D. Kuznetsov[/i]

1990 IMO Shortlist, 21

Tags: number theory , divisibility , binary representation , minimization

Let $ n$ be a composite natural number and $ p$ a proper divisor of $ n.$ Find the binary representation of the smallest natural number $ N$ such that \[ \frac{(1 \plus{} 2^p \plus{} 2^{n\minus{}p})N \minus{} 1}{2^n}\] is an integer.

1985 Czech And Slovak Olympiad IIIA, 2

Tags: subset , combinatorics , number theory

Let $A_1, A_2, A_3$ be nonempty sets of integers such that for $\{i, j, k\} = \{1, 2, 3\}$ holds $$(x \in A_i, y\in A_j) \Rightarrow (x + y \in A_k, x - y \in A_k).$$ Prove that at least two of the sets $A_1, A_2, A_3$ are equal. Can any of these sets be disjoint?

2011 QEDMO 8th, 3

Tags: number theory , rational

Show that every rational number $r$ can be written as the sum of numbers in the form $\frac{a}{p^k}$ where $p$ is prime, $a$ is an integer and $k$ is natural.

2014 NIMO Problems, 1

Tags: number theory , relatively prime

Define $H_n = 1+\frac{1}{2}+\cdots+\frac{1}{n}$. Let the sum of all $H_n$ that are terminating in base 10 be $S$. If $S = m/n$ where m and n are relatively prime positive integers, find $100m+n$. [i]Proposed by Lewis Chen[/i]

1981 Swedish Mathematical Competition, 1

Tags: perfect square , number theory

Let $N = 11\cdots 122 \cdots 25$, where there are $n$ $1$s and $n+1$ $2$s. Show that $N$ is a perfect square.

2010 APMO, 2

Tags: number theory , perfect power , additive number theory

For a positive integer $k,$ call an integer a $pure$ $k-th$ $power$ if it can be represented as $m^k$ for some integer $m.$ Show that for every positive integer $n,$ there exists $n$ distinct positive integers such that their sum is a pure $2009-$th power and their product is a pure $2010-$th power.

2024 Indonesia TST, N

Tags: function , number theory , complete residue system , residue , fe nt

Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$ such that for every prime number $p$ and natural number $x$, $$\{ x,f(x),\cdots f^{p-1}(x) \} $$ is a complete residue system modulo $p$. With $f^{k+1}(x)=f(f^k(x))$ for every natural number $k$ and $f^1(x)=f(x)$. [i]Proposed by IndoMathXdZ[/i]

2004 Singapore MO Open, 2

Tags: number theory , diophantine , diophantine equation

Find the number of ordered pairs $(a, b)$ of integers, where $1 \le a, b \le 2004$, such that $x^2 + ax + b = 167 y$ has integer solutions in $x$ and $y$. Justify your answer.

2022 Princeton University Math Competition, A8

Tags: number theory

For $n \ge 2,$ let $\omega(n)$ denote the number of distinct prime factors of $n.$ We set $\omega(1) = 0.$ Compute the absolute value of $$\sum_{n=1}^{160} (-1)^{\omega(n)} \left\lfloor \frac{160}{n} \right\rfloor.$$

2011 District Round (Round II), 1

Tags: number theory , logarithm

Among all eight-digit multiples of four, are there more numbers with the digit $1$ or without the digit $1$ in their decimal representation?

2015 Polish MO Finals, 3

Tags: number theory

Prove that for each positive integer $a$ there exists such an integer $b>a$, for which $1+2^a+3^a$ divides $1+2^b+3^b$.

1998 Baltic Way, 2

Tags: number theory

A triple $(a,b,c)$ of positive integers is called [i]quasi-Pythagorean[/i] if there exists a triangle with lengths of the sides $a,b,c$ and the angle opposite to the side $c$ equal to $120^{\circ}$. Prove that if $(a,b,c)$ is a quasi-Pythagorean triple then $c$ has a prime divisor bigger than $5$.

2005 MOP Homework, 1

Tags: number theory

Let $a0$, $a1$, ..., $a_n$ be integers, not all zero, and all at least $-1$. Given that $a_0+2a_1+2^2a_2+...+2^na_n =0$, prove that $a_0+a_1+...+a_n>0$.