Olympiad problems

2024 Saint Petersburg Mathematical Olympiad, 4

Tags: number theory

Given a $101$-digit number $a$ and an arbitrary positive integer $b$. Prove that there is at most a $102$-digit positive integer $c$ such that any number of the form $\overline{caaa \dots ab}$ is composite.

2005 China Team Selection Test, 2

Tags: number theory

Given prime number $p$. $a_1,a_2 \cdots a_k$ ($k \geq 3$) are integers not divible by $p$ and have different residuals when divided by $p$. Let \[ S_n= \{ n \mid 1 \leq n \leq p-1, (na_1)_p < \cdots < (na_k)_p \} \] Here $(b)_p$ denotes the residual when integer $b$ is divided by $p$. Prove that $|S|< \frac{2p}{k+1}$.

2012 Canadian Mathematical Olympiad Qualification Repechage, 5

Tags: number theory

Given a positive integer $n$, let $d(n)$ be the largest positive divisor of $n$ less than $n$. For example, $d(8) = 4$ and $d(13) = 1$. A sequence of positive integers $a_1, a_2,\dots$ satisfies \[a_{i+1} = a_i +d(a_i),\] for all positive integers $i$. Prove that regardless of the choice of $a_1$, there are inﬁnitely many terms in the sequence divisible by $3^{2011}$.

2024 Saint Petersburg Mathematical Olympiad, 1

Tags: combinatorics , number theory

In the cells of the $2024\times 2024$ board, integers are arranged so that in any $2 \times 2023$ rectangle (vertical or horizontal) with one cut corner cell that does not go beyond the board, the sum of the numbers is divided by $13$. Prove that the sum of all the numbers on the board is divisible by $13$.

2019 Federal Competition For Advanced Students, P1, 3

Tags: number theory , game , winning strategy , combinatorics , game strategy

Let $n\ge 2$ be an integer. Ariane and Bérénice play a game on the number of the residue classes modulo $n$. At the beginning there is the residue class $1$ on each piece of paper. It is the turn of the player whose turn it is to replace the current residue class $x$ with either $x + 1$ or by $2x$. The two players take turns, with Ariane starting. Ariane wins if the residue class $0$ is reached during the game. Bérénice wins if she can prevent that permanently. Depending on $n$, determine which of the two has a winning strategy.

2019 Saudi Arabia JBMO TST, 2

Tags: number theory

Solve in non-negative integers the equation $125.2^n-3^m=271$

2004 AIME Problems, 1

Tags: geometry , ratio , number theory , relatively prime

A chord of a circle is perpendicular to a radius at the midpoint of the radius. The ratio of the area of the larger of the two regions into which the chord divides the circle to the smaller can be expressed in the form $\frac{a\pi+b\sqrt{c}}{d\pi-e\sqrt{f}}$, where $a$, $b$, $c$, $d$, $e$, and $f$ are positive integers, $a$ and $e$ are relatively prime, and neither $c$ nor $f$ is divisible by the square of any prime. Find the remainder when the product $abcdef$ is divided by 1000.

2019 Saudi Arabia IMO TST, 1

Tags: number theory , divide , divisible

Let $a_0$ be an arbitrary positive integer. Let $(a_n)$ be infinite sequence of positive integers such that for every positive integer $n$, the term $a_n$ is the smallest positive integer such that $a_0 + a_1 +... + a_n$ is divisible by $n$. Prove that there exist $N$ such that $a_{n+1} = a_n$ for all $n \ge N$

2019 Romanian Master of Mathematics, 1

Tags: number theory

Amy and Bob play the game. At the beginning, Amy writes down a positive integer on the board. Then the players take moves in turn, Bob moves first. On any move of his, Bob replaces the number $n$ on the blackboard with a number of the form $n-a^2$, where $a$ is a positive integer. On any move of hers, Amy replaces the number $n$ on the blackboard with a number of the form $n^k$, where $k$ is a positive integer. Bob wins if the number on the board becomes zero. Can Amy prevent Bob’s win? [i]Maxim Didin, Russia[/i]

2016 Tuymaada Olympiad, 6

Tags: number theory

Is there a positive integer $N>10^{20}$ such that all its decimal digits are odd, the numbers of digits 1, 3, 5, 7, 9 in its decimal representation are equal, and it is divisible by each 20-digit number obtained from it by deleting digits? (Neither deleted nor remaining digits must be consecutive.)

2022 Bosnia and Herzegovina BMO TST, 2

Tags: number theory

Determine all positive integers $A= \overline{a_n a_{n-1} \ldots a_1 a_0}$ such that not all of its digits are equal and no digit is $0$, and $A$ divides all numbers of the following form: $A_1 = \overline{a_0 a_n a_{n-1} \ldots a_2 a_1}, A_2 = \overline{a_1 a_0 a_{n} \ldots a_3 a_2}, \ldots ,$ $ A_{n-1} = \overline{a_{n-2} a_{n-3} \ldots a_0 a_n a_{n-1}}, A_n = \overline{a_{n-1} a_{n-2} \ldots a_1 a_0 a_n}$.

2017 HMNT, 8

Tags: number theory

Find the number of quadruples $(a, b, c, d)$ of integers with absolute value at most $5$ such that $$(a^2 + b^2 + c^2 + d^2)^2 = (a + b + c + d)(a - b + c -d)((a - c)^2 + (b - d)^2).$$

1986 IMO Longlists, 62

Tags: number theory

Determine all pairs of positive integers $(x, y)$ satisfying the equation $p^x - y^3 = 1$, where $p$ is a given prime number.

1990 IMO Longlists, 3

Tags: number theory , additive combinatorics , additive number theory , counting

The integer $ 9$ can be written as a sum of two consecutive integers: $ 9 \equal{} 4\plus{}5.$ Moreover, it can be written as a sum of (more than one) consecutive positive integers in exactly two ways: $ 9 \equal{} 4\plus{}5 \equal{} 2\plus{}3\plus{}4.$ Is there an integer that can be written as a sum of $ 1990$ consecutive integers and that can be written as a sum of (more than one) consecutive positive integers in exactly $ 1990$ ways?

2019 Saudi Arabia Pre-TST + Training Tests, 5.1

Tags: number theory , prime , divide , divisible

Let $n$ be a positive integer and $p > n+1$ a prime. Prove that $p$ divides the following sum $S = 1^n + 2^n +...+ (p - 1)^n$

2016 JBMO Shortlist, 4

Tags: number theory

Find all triplets of integers $(a,b,c)$ such that the number $$N = \frac{(a-b)(b-c)(c-a)}{2} + 2$$ is a power of $2016$. (A power of $2016$ is an integer of form $2016^n$,where n is a non-negative integer.)

2000 Romania Team Selection Test, 3

Tags: ratio , number theory , representation

Prove that every positive rational number can be represented in the form $\dfrac{a^{3}+b^{3}}{c^{3}+d^{3}}$ where a,b,c,d are positive integers.

2007 Baltic Way, 18

Tags: number theory

Let $a,b,c,d$ be non-zero integers, such that the only quadruple of integers $(x, y, z, t)$ satisfying the equation \[ax^2+by^2+cz^2+dt^2=0\] is $x=y=z=t=0$. Does it follow that the numbers $a,b,c,d$ have the same sign?

2024 Iberoamerican, 6

Tags: number theory , floor function

Determine all infinite sets $A$ of positive integers with the following propety: If $a,b \in A$ and $a \ge b$ then $\left\lfloor \frac{a}{b} \right\rfloor \in A$

1996 All-Russian Olympiad Regional Round, 9.3

Tags: number theory , integer

Let $a, b$ and $c$ be pairwise relatively prime natural numbers. Find all possible values of $\frac{(a + b)(b + c)(c + a)}{abc}$ if known what it is integer.

2013 Switzerland - Final Round, 2

Tags: inequalities , number theory , prime

Let $n$ be a natural number and $p_1, ..., p_n$ distinct prime numbers. Show that $$p_1^2 + p_2^2 + ... + p_n^2 > n^3$$

2023 CMIMC Algebra/NT, 7

Tags: number theory , algebra

Let $\phi(n)$ denote the number of positive integers less than or equal to $n$ which are relatively prime to $n$. Compute $\displaystyle \sum_{i=1}^{\phi(2023)} \dfrac{\gcd(i,\phi(2023))}{\phi(2023)}$. [i]Proposed by Giacomo Rizzo[/i]

2000 AIME Problems, 1

Tags: number theory , relatively prime , logarithm

The number \[ \frac 2{\log_4{2000^6}}+\frac 3{\log_5{2000^6}} \] can be written as $\frac mn$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

2011 Saudi Arabia Pre-TST, 2.1

Tags: number theory , integer

Let $n$ be a positive integer. Prove that the interval $I_n= \left( \frac{1+\sqrt{8n+1}}{2}, \frac{1+\sqrt{8n+9}}{2}\right)$ does not contain any integer.

2004 Purple Comet Problems, 7

Tags: floor function , relatively prime , number theory

How many positive integers less that $200$ are relatively prime to either $15$ or $24$?