This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 15460

1972 IMO Longlists, 34
Tags: number theory
If $p$ is a prime number greater than $2$ and $a, b, c$ integers not divisible by $p$, prove that the equation \[ax^2 + by^2 = pz + c\] has an integer solution.

2001 Estonia National Olympiad, 2
Tags: number theory , digit , remainder , sum of digits
Dividing a three-digit number by the number obtained from it by swapping its first and last digit we get $3$ as the quotient and the sum of digits of the original number as the remainder. Find all three-digit numbers with this property.

1988 IMO, 3
Tags: number theory , divisibility , diophantine equation , perfect square , vieta jumping
Let $ a$ and $ b$ be two positive integers such that $ a \cdot b \plus{} 1$ divides $ a^{2} \plus{} b^{2}$. Show that $ \frac {a^{2} \plus{} b^{2}}{a \cdot b \plus{} 1}$ is a perfect square.

2010 Saint Petersburg Mathematical Olympiad, 7
Tags: combinatorics , number theory
$600$ integer numbers from $[1,1000]$ colored in red. Natural segment $[n,k]$ is called yummy if for every natural $t$ from $[1,k-n]$ there are two red numbers $a,b$ from $[n,k]$ and $b-a=t$ . Prove that there is yummy segment with $[a,b]$ with $b-a \geq 199$

2012 Tuymaada Olympiad, 1
Tags: number theory
Solve in positive integers the following equation: \[{1\over n^2}-{3\over 2n^3}={1\over m^2}\] [i]Proposed by A. Golovanov[/i]

2024 All-Russian Olympiad, 1
Tags: number theory
Petya and Vasya only know positive integers not exceeding $10^9-4000$. Petya considers numbers as good which are representable in the form $abc+ab+ac+bc$, where $a,b$ and $c$ are natural numbers not less than $100$. Vasya considers numbers as good which are representable in the form $xyz-x-y-z$, where $x,y$ and $z$ are natural numbers strictly bigger than $100$. For which of them are there more good numbers? [i]Proposed by I. Bogdanov[/i]

2009 Canada National Olympiad, 4
Tags: modular arithmetic , greatest common divisor , number theory
Find all ordered pairs of integers $(a,b)$ such that $3^a + 7^b$ is a perfect square.

2017 ELMO Shortlist, 3
Tags: number theory
For each integer $C>1$ decide whether there exist pairwise distinct positive integers $a_1,a_2,a_3,...$ such that for every $k\ge 1$, $a_{k+1}^k$ divides $C^ka_1a_2...a_k$. [i]Proposed by Daniel Liu

1989 Turkey Team Selection Test, 2
Tags: number theory
A positive integer is called a "double number" if its decimal representation consists of a block of digits, not commencing with $0$, followed immediately by an identical block. So, for instance, $360360$ is a double number, but $36036$ is not. Show that there are infinitely many double numbers which are perfect squares.

2018 Middle European Mathematical Olympiad, 4
Tags: number theory , algebra
Let $n$ be a positive integer and $u_1,u_2,\cdots ,u_n$ be positive integers not larger than $2^k, $ for some integer $k\geq 3.$ A representation of a non-negative integer $t$ is a sequence of non-negative integers $a_1,a_2,\cdots ,a_n$ such that $t=a_1u_1+a_2u_2+\cdots +a_nu_n.$ Prove that if a non-negative integer $t$ has a representation,then it also has a representation where less than $2k$ of numbers $a_1,a_2,\cdots ,a_n$ are non-zero.

2021 2nd Memorial "Aleksandar Blazhevski-Cane", 2
Tags: number theory , prime number
Let $p$ be a prime number and $F=\left \{0,1,2,...,p-1 \right \}$. Let $A$ be a proper subset of $F$ that satisfies the following property: if $a,b \in A$, then $ab+1$ (mod $p$) $ \in A$. How many elements can $A$ have? (Justify your answer.)

2018 Serbia National Math Olympiad, 6
Tags: combinatorics , number theory
For each positive integer $k$, let $n_k$ be the smallest positive integer such that there exists a finite set $A$ of integers satisfy the following properties: [list] [*]For every $a\in A$, there exists $x,y\in A$ (not necessary distinct) that $$n_k\mid a-x-y$$[/*] [*]There's no subset $B$ of $A$ that $|B|\leq k$ and $$n_k\mid \sum_{b\in B}{b}.$$ [/list] Show that for all positive integers $k\geq 3$, we've $$n_k<\Big( \frac{13}{8}\Big)^{k+2}.$$

2000 Belarusian National Olympiad, 2
Tags: number theory , factorial
Find the number of pairs $(n, q)$, where $n$ is a positive integer and $q$ a non-integer rational number with $0 < q < 2000$, that satisfy $\{q^2\}=\left\{\frac{n!}{2000}\right\}$

2010 Spain Mathematical Olympiad, 3
Tags: number theory
Let $p$ be a prime number and $A$ an infinite subset of the natural numbers. Let $f_A(n)$ be the number of different solutions of $x_1+x_2+\ldots +x_p=n$, with $x_1,x_2,\ldots x_p\in A$. Does there exist a number $N$ for which $f_A(n)$ is constant for all $n<N$?

2017 CMIMC Individual Finals, 2
Tags: number theory
Find the smallest three-digit divisor of the number \[1\underbrace{00\ldots 0}_{100\text{ zeros}}1\underbrace{00\ldots 0}_{100\text{ zeros}}1.\]

2010 Dutch IMO TST, 3
Tags: number theory , perfect square
Let $n\ge  2$ be a positive integer and $p $ a prime such that $n|p-1$ and $p | n^3-1$. Show $ 4p-3$ is a square.

2025 Abelkonkurransen Finale, 2a
Tags: number theory
A teacher asks each of eleven pupils to write a positive integer with at most four digits, each on a separate yellow sticky note. Show that if all the numbers are different, the teacher can always submit two or more of the eleven stickers so that the average of the numbers on the selected notes are not an integer.

2007 Pre-Preparation Course Examination, 16
Tags: induction , number theory
Prove that $2^{2^{n}}+2^{2^{{n-1}}}+1$ has at least $n$ distinct prime divisors.

2023 Israel National Olympiad, P7
Tags: number theory , digit , guessing game
Ana and Banana are playing a game. Initially, Ana secretly picks a number $1\leq A\leq 10^6$. In each subsequent turn of the game, Banana may pick a positive integer $B$, and Ana will reveal to him the most common digit in the product $A\cdot B$ (written in decimal notation). In the case when at least two digits are tied for being the most common, Ana will reveal all of them to Banana. For example, if $A\cdot B=2022$, Ana will tell Banana that the digit $2$ is the most common, while if $A\cdot B=5783783$, Ana will reveal that $3, 7$ and $8$ are the most common. Banana's goal is to determine with certainty the number $A$ after some number of turns. Does he have a winning strategy?

2016 Bulgaria EGMO TST, 1
Tags: partition , number theory , combinatorics
Is it possible to partition the set of integers into three disjoint sets so that for every positive integer $n$ the numbers $n$, $n-50$ and $n+1987$ belong to different sets?

2023 HMNT, 8
Tags: number theory
Call a number [i]feared [/i] if it contains the digits $13$ as a contiguous substring and [i]fearless [/i] otherwise. (For example, $132$ is feared, while $123$ is fearless.) Compute the smallest positive integer $n$ such that there exists a positive integer $a < 100$ such that $n$ and $n + 10a$ are fearless while $n +a$, $n + 2a$, $. . . $, $n + 9a$ are all feared.

2013 239 Open Mathematical Olympiad, 2
Tags: number theory
For some $99$-digit number $k$, there exist two different $100$-digit numbers $n$ such that the sum of all natural numbers from $1$ to $n$ ends in the same $100$ digits as the number $kn$, but is not equal to it. Prove that $k-3$ is divisible by $5$.

2008 Junior Balkan Team Selection Tests - Romania, 3
Tags: number theory
Find all pairs $ (m,n)$ of integer numbers $ m,n > 1$ with property that $ mn \minus{} 1\mid n^3 \minus{} 1$.

2006 Germany Team Selection Test, 1
Tags: algebra , polynomial , number theory , composite number , prime number
Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$. Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.

2005 Germany Team Selection Test, 1
Tags: inequalities , number theory
Find the smallest positive integer $n$ with the following property: For any integer $m$ with $0 < m < 2004$, there exists an integer $k$ such that \[\frac{m}{2004}<\frac{k}{n}<\frac{m+1}{2005}.\]