Olympiad problems

2010 Cuba MO, 9

Let $A$ be the subset of the natural numbers such that the sum of Its digits are multiples of$ 2009$. Find $x, y \in A$ such that $y - x > 0$ is minimum and $x$ is also minimum.

2004 Canada National Olympiad, 4

Tags: number theory , modular arithmetic

Let $p$ be an odd prime. Prove that: \[\displaystyle\sum_{k\equal{}1}^{p\minus{}1}k^{2p\minus{}1} \equiv \frac{p(p\plus{}1)}{2} \pmod{p^2}\]

2019 Saudi Arabia Pre-TST + Training Tests, 3.2

Tags: combinatorics , number theory , graph , graph theory

It is given a graph whose vertices are positive integers and an edge between numbers $a$ and $b$ exists if and only if $a + b + 1 | a^2 + b^2 + 1$. Is this graph connected?

2022/2023 Tournament of Towns, P2

Tags: number theory

The numbers $1, 19, 199, 1999,\ldots$ are written on several cards, one card for each number. [list=a] [*]Is it possible to choose at least three cards so that the sum of the numbers on the chosen cards equals a number in which all digits, except for a single digit, are twos? [*]Suppose you have chosen several cards so that the sum of the numbers on the chosen cards equals a number, all of whose digits are twos, except for a single digit. What can this single different digit be? [/list]

2017 Korea Junior Math Olympiad, 1

Tags: number theory

Find all positive integer $n$ and nonnegative integer $a_1,a_2,\dots,a_n$ satisfying: $i$ divides exactly $a_i$ numbers among $a_1,a_2,\dots,a_n$, for each $i=1,2,\dots,n$. ($0$ is divisible by all integers.)

1967 IMO Longlists, 14

Tags: number theory , approximation , decimal representation , rational number , irrational number

Which fractions $ \dfrac{p}{q},$ where $p,q$ are positive integers $< 100$, is closest to $\sqrt{2} ?$ Find all digits after the point in decimal representation of that fraction which coincide with digits in decimal representation of $\sqrt{2}$ (without using any table).

2022 JHMT HS, 10

Tags: greatest common divisor , number theory

Compute the exact value of \[ \sum_{a=1}^{\infty}\sum_{b=1}^{\infty} \frac{\gcd(a, b)}{(a + b)^3}. \] If necessary, you may express your answer in terms of the Riemann zeta function, $Z(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}$, for integers $s \geq 2$.

1947 Moscow Mathematical Olympiad, 134

Tags: digit , number theory

How many digits are there in the decimal expression of $2^{100}$ ?

1969 IMO Shortlist, 28

Tags: number theory , polynomial , recurrence relation , sequence , divisibility

$(GBR 5)$ Let us define $u_0 = 0, u_1 = 1$ and for $n\ge 0, u_{n+2} = au_{n+1}+bu_n, a$ and $b$ being positive integers. Express $u_n$ as a polynomial in $a$ and $b.$ Prove the result. Given that $b$ is prime, prove that $b$ divides $a(u_b -1).$

2019 India PRMO, 13

Tags: number theory , oeis

Consider the sequence $$1,7,8,49,50,56,57,343\ldots$$ which consists of sums of distinct powers of$7$, that is, $7^0$, $7^1$, $7^0+7^1$, $7^2$,$\ldots$ in increasing order. At what position will $16856$ occur in this sequence?

2013 Flanders Math Olympiad, 1

Tags: divisible , digit , sum , number theory

A six-digit number is [i]balanced [/i] when all digits are different from zero and the sum of the first three digits is equal to the sum of the last three digits. Prove that the sum of all six-digit balanced numbers is divisible by $13$.

2007 Iran Team Selection Test, 1

Tags: number theory , algebra , polynomial

Does there exist a a sequence $a_{0},a_{1},a_{2},\dots$ in $\mathbb N$, such that for each $i\neq j, (a_{i},a_{j})=1$, and for each $n$, the polynomial $\sum_{i=0}^{n}a_{i}x^{i}$ is irreducible in $\mathbb Z[x]$? [i]By Omid Hatami[/i]

2008 Postal Coaching, 2

Tags: floor function , power of 2 , number theory

Show that if $n \ge 4, n \in N$ and $\big [ \frac{2^n}{n} ]$ is a power of $2$, then $n$ is a power of $2$.

2017 Hanoi Open Mathematics Competitions, 2

Tags: diophantine equation , diophantine , number theory

How many pairs of positive integers $(x, y)$ are there, those satisfy the identity $2^x - y^2 = 4$? (A): $1$ (B): $2$ (C): $3$ (D): $4$ (E): None of the above.

2013 Ukraine Team Selection Test, 11

Tags: prime , divisibility , number theory

Specified natural number $a$. Prove that there are an infinite number of prime numbers $p$ such that for some natural $n$ the number $2^{2^n} + a$ is divisible by $p$.

2002 Tournament Of Towns, 1

Tags: number theory

John and Mary select a natural number each and tell that to Bill. Bill wrote their sum and product in two papers hid one paper and showed the other to John and Mary. John looked at the number (which was $2002$ ) and declared he couldn't determine Mary's number. Knowing this Mary also said she couldn't determine John's number as well. What was Mary's Number?

2022 Taiwan TST Round 1, 2

Tags: divisibility , cubefree , number theory

Find all positive integers $n\geq1$ such that there exists a pair $(a,b)$ of positive integers, such that $a^2+b+3$ is not divisible by the cube of any prime, and $$n=\frac{ab+3b+8}{a^2+b+3}.$$

2005 iTest, 3

Tags: number theory , probability , perfect square , pascal triangle

Find the probability that any given row in Pascal’s Triangle contains a perfect square. [i] (.1 point)[/i]

ICMC 7, 5

Tags: number theory , polynomial

[list=a] [*]Is there a non-linear integer-coefficient polynomial $P(x)$ and an integer $N{}$ such that all integers greater than $N{}$ may be written as the greatest common divisor of $P(a){}$ and $P(b){}$ for positive integers $a>b$? [*]Is there a non-linear integer-coefficient polynomial $Q(x)$ and an integer $M{}$ such that all integers greater than $M{}$ may be written as $Q(a) - Q(b)$ for positive integers $a>b$? [/list][i]Proposed by Dylan Toh[/i]

2023 Euler Olympiad, Round 2, 1

Tags: number theory , algebra , euler , 100 , power of 2 , residue

Consider a sequence of 100 positive integers. Each member of the sequence, starting from the second one, is derived by either multiplying the previous number by 2 or dividing it by 16. Is it possible for the sum of these 100 numbers to be equal to $2^{2023}$? [i]Proposed by Nika Glunchadze, Georgia[/i]

2006 USAMO, 1

Tags: number theory , floor function , inequalities , modular arithmetic , pigeonhole principle

Let $p$ be a prime number and let $s$ be an integer with $0 < s < p.$ Prove that there exist integers $m$ and $n$ with $0 < m < n < p$ and \[ \left \{\frac{sm}{p} \right\} < \left \{\frac{sn}{p} \right \} < \frac{s}{p} \] if and only if $s$ is not a divisor of $p-1$. Note: For $x$ a real number, let $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$, and let $\{x\} = x - \lfloor x \rfloor$ denote the fractional part of x.

2016 Singapore Senior Math Olympiad, 5

Tags: number theory , remainder

For each integer $n > 1$, find a set of $n$ integers $\{a_1, a_2,..., a_n\}$ such that the set of numbers $\{a_1+a_j | 1 \le i \le j \le n\}$ leave distinct remainders when divided by $n(n + 1)/2$. If such a set of integers does not exist, give a proof.

2009 Puerto Rico Team Selection Test, 5

Tags: number theory , algebra

The [i]weird [/i] mean of two numbers $ a$ and $ b$ is defined as $ \sqrt {\frac {2a^2 + 3b^2}{5}}$. $ 2009$ positive integers are placed around a circle such that each number is equal to the the weird mean of the two numbers beside it. Show that these $ 2009$ numbers must be equal.

2024 Bangladesh Mathematical Olympiad, P8

Tags: prime divisor , nt construction , number theory

Let $k$ be a positive integer. Show that there exist infinitely many positive integers $n$ such that $\frac{n^n-1}{n-1}$ has at least $k$ distinct prime divisors. [i]Proposed by Adnan Sadik[/i]

2021 India National Olympiad, 1

Tags: number theory , parity , contradiction

Suppose $r \ge 2$ is an integer, and let $m_1, n_1, m_2, n_2, \dots, m_r, n_r$ be $2r$ integers such that $$\left|m_in_j-m_jn_i\right|=1$$ for any two integers $i$ and $j$ satisfying $1 \le i<j \le r$. Determine the maximum possible value of $r$. [i]Proposed by B Sury[/i]