Olympiad problems

2012 Stanford Mathematics Tournament, 2

Tags: modular arithmetic

Find the sum of all integers $x$, $x \ge 3$, such that $201020112012_x$ (that is, $201020112012$ interpreted as a base $x$ number) is divisible by $x-1$

2007 Germany Team Selection Test, 3

Tags: modular arithmetic , number theory , divisibility , exponential

For all positive integers $n$, show that there exists a positive integer $m$ such that $n$ divides $2^{m} + m$. [i]Proposed by Juhan Aru, Estonia[/i]

1999 Irish Math Olympiad, 2

Tags: modular arithmetic , number theory

Show that there is a positive number in the Fibonacci sequence which is divisible by $ 1000$.

2001 Junior Balkan MO, 1

Tags: geometry , modular arithmetic

Solve the equation $a^3+b^3+c^3=2001$ in positive integers. [i]Mircea Becheanu, Romania[/i]

2010 Brazil National Olympiad, 3

Tags: modular arithmetic , greatest common divisor , search , number theory

Find all pairs $(a, b)$ of positive integers such that \[ 3^a = 2b^2 + 1. \]

2021-IMOC, N7

Tags: modular arithmetic , number theory

Let $p$ be a given odd prime. Find the largest integer $k'$ such that it is possible to partition $\{1,2,\cdots,p-1\}$ into two sets $X,Y$ such that for any $k$ with $0 \le k \le k'$, $$\sum_{a \in X}a^k \equiv \sum_{b \in Y}b^k \pmod p$$ [i]houkai[/i]

1970 IMO Shortlist, 4

Tags: modular arithmetic , number theory , product , partition

Find all positive integers $n$ such that the set $\{n,n+1,n+2,n+3,n+4,n+5\}$ can be partitioned into two subsets so that the product of the numbers in each subset is equal.

2012 AIME Problems, 1

Tags: modular arithmetic

Find the number of positive integers with three not necessarily distinct digits, $abc$, with $a \neq 0$, $c \neq 0$ such that both $abc$ and $cba$ are divisible by 4.

2012 Kazakhstan National Olympiad, 1

Tags: modular arithmetic , number theory

The number $\overline{13\ldots 3}$, with $k>1$ digits $3$, is a prime. Prove that $6\mid k^{2}-2k+3$.

1958 AMC 12/AHSME, 32

Tags: modular arithmetic , least common multiple , number theory , diophantine equation

With $ \$1000$ a rancher is to buy steers at $ \$25$ each and cows at $ \$26$ each. If the number of steers $ s$ and the number of cows $ c$ are both positive integers, then: $ \textbf{(A)}\ \text{this problem has no solution}\qquad\\ \textbf{(B)}\ \text{there are two solutions with }{s}\text{ exceeding }{c}\qquad \\ \textbf{(C)}\ \text{there are two solutions with }{c}\text{ exceeding }{s}\qquad \\ \textbf{(D)}\ \text{there is one solution with }{s}\text{ exceeding }{c}\qquad \\ \textbf{(E)}\ \text{there is one solution with }{c}\text{ exceeding }{s}$

2009 Belarus Team Selection Test, 2

Tags: number theory , modular arithmetic , sequence , divisibility

Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$. [i]Proposed by Mohsen Jamaali, Iran[/i]

1951 Miklós Schweitzer, 10

Tags: algebra , polynomial , modular arithmetic , ring theory

Let $ f(x)$ be a polynomial with integer coefficients and let $ p$ be a prime. Denote by $ z_1,...,z_{p\minus{}1}$ the $ (p\minus{}1)$th complex roots of unity. Prove that $ f(z_1)\cdots f(z_{p\minus{}1})\equiv f(1)\cdots f(p\minus{}1) \pmod{p}$.

2013 Korea National Olympiad, 3

Tags: algebra , polynomial , quadratic , induction , calculus , integration , modular arithmetic

Prove that there exist monic polynomial $f(x) $ with degree of 6 and having integer coefficients such that (1) For all integer $m$, $f(m) \ne 0$. (2) For all positive odd integer $n$, there exist positive integer $k$ such that $f(k)$ is divided by $n$.

1994 Iran MO (2nd round), 1

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

Let $\overline{a_1a_2a_3\ldots a_n}$ be the representation of a $n-$digits number in base $10.$ Prove that there exists a one-to-one function like $f : \{0, 1, 2, 3, \ldots, 9\} \to \{0, 1, 2, 3, \ldots, 9\}$ such that $f(a_1) \neq 0$ and the number $\overline{ f(a_1)f(a_2)f(a_3) \ldots f(a_n) }$ is divisible by $3.$

1977 Germany Team Selection Test, 4

Tags: modular arithmetic , divisibility , digit , decimal representation , digit sum

When $4444^{4444}$ is written in decimal notation, the sum of its digits is $ A.$ Let $B$ be the sum of the digits of $A.$ Find the sum of the digits of $ B.$ ($A$ and $B$ are written in decimal notation.)

1992 IMO Longlists, 14

Tags: equation , divisibility , modular arithmetic , number theory

Integers $a_1, a_2, . . . , a_n$ satisfy $|a_k| = 1$ and \[ \sum_{k=1}^{n} a_ka_{k+1}a_{k+2}a_{k+3} = 2,\] where $a_{n+j} = a_j$. Prove that $n \neq 1992.$

2011 Indonesia TST, 4

Tags: modular arithmetic , induction , number theory

A prime number $p$ is a [b]moderate[/b] number if for every $2$ positive integers $k > 1$ and $m$, there exists k positive integers $n_1, n_2, ..., n_k $ such that \[ n_1^2+n_2^2+ ... +n_k^2=p^{k+m} \] If $q$ is the smallest [b]moderate[/b] number, then determine the smallest prime $r$ which is not moderate and $q < r$.

1989 AIME Problems, 9

Tags: euler , modular arithmetic , number theory

One of Euler's conjectures was disproved in then 1960s by three American mathematicians when they showed there was a positive integer $ n$ such that \[133^5 \plus{} 110^5 \plus{} 84^5 \plus{} 27^5 \equal{} n^5.\] Find the value of $ n$.

2009 China Team Selection Test, 3

Tags: modular arithmetic , inequalities , number theory

Prove that for any odd prime number $ p,$ the number of positive integer $ n$ satisfying $ p|n! \plus{} 1$ is less than or equal to $ cp^\frac{2}{3}.$ where $ c$ is a constant independent of $ p.$

2014 Online Math Open Problems, 15

Tags: probability , ceiling function , linear algebra , matrix , modular arithmetic

In Prime Land, there are seven major cities, labelled $C_0$, $C_1$, \dots, $C_6$. For convenience, we let $C_{n+7} = C_n$ for each $n=0,1,\dots,6$; i.e. we take the indices modulo $7$. Al initially starts at city $C_0$. Each minute for ten minutes, Al flips a fair coin. If the coin land heads, and he is at city $C_k$, he moves to city $C_{2k}$; otherwise he moves to city $C_{2k+1}$. If the probability that Al is back at city $C_0$ after $10$ moves is $\tfrac{m}{1024}$, find $m$. [i]Proposed by Ray Li[/i]

2004 Baltic Way, 10

Tags: number theory , modular arithmetic , induction , prime number

Is there an infinite sequence of prime numbers $p_1$, $p_2$, $\ldots$, $p_n$, $p_{n+1}$, $\ldots$ such that $|p_{n+1}-2p_n|=1$ for each $n \in \mathbb{N}$?

2010 Contests, 2

Tags: modular arithmetic , number theory

Given a fixed integer $k>0,r=k+0.5$,define $f^1(r)=f(r)=r[r],f^l(r)=f(f^{l-1}(r))(l>1)$ where $[x]$ denotes the smallest integer not less than $x$. prove that there exists integer $m$ such that $f^m(r)$ is an integer.

2014 Online Math Open Problems, 23

Tags: modular arithmetic , number theory , greatest common divisor , quadratic , law of cosines

For a prime $q$, let $\Phi_q(x)=x^{q-1}+x^{q-2}+\cdots+x+1$. Find the sum of all primes $p$ such that $3 \le p \le 100$ and there exists an odd prime $q$ and a positive integer $N$ satisfying \[\dbinom{N}{\Phi_q(p)}\equiv \dbinom{2\Phi_q(p)}{N} \not \equiv 0 \pmod p. \][i]Proposed by Sammy Luo[/i]

2012 Peru IMO TST, 6

Tags: modular arithmetic , number theory

Let $p$ be an odd prime number. For every integer $a,$ define the number $S_a = \sum^{p-1}_{j=1} \frac{a^j}{j}.$ Let $m,n \in \mathbb{Z},$ such that $S_3 + S_4 - 3S_2 = \frac{m}{n}.$ Prove that $p$ divides $m.$ [i]Proposed by Romeo Meštrović, Montenegro[/i]

2007 National Olympiad First Round, 34

Tags: modular arithmetic , quadratic

For how many primes $p$ less than $15$, there exists integer triples $(m,n,k)$ such that \[ \begin{array}{rcl} m+n+k &\equiv& 0 \pmod p \\ mn+mk+nk &\equiv& 1 \pmod p \\ mnk &\equiv& 2 \pmod p. \end{array} \] $ \textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 6 $