Found problems: 114
1963 German National Olympiad, 1
a) Prove that when you divide any prime number by $30$, the remainder is either $1$ or is a prime number!
b) Does this also apply when dividing a prime number by $60$? Justify your answer!
2017 Regional Olympiad of Mexico Northeast, 1
Let $n$ be a positive integer less than $1000$. The remainders obtained when dividing $n$ by $2, 2^2, 2^3, ... , 2^8$, and $2^9$ , are calculated. If the sum of all these remainders is $137$, what are all the possible values ​​of $n$?
2022 IFYM, Sozopol, 5
Find the number of subsets of $\{1, 2,... , 2100\}$ such that each has sum of the elements giving a remainder of $3$ when divided by $7$.
2024 AMC 10, 7
What is the remainder when $7^{2024}+7^{2025}+7^{2026}$ is divided by $19$?
$
\textbf{(A) }0 \qquad
\textbf{(B) }1 \qquad
\textbf{(C) }7 \qquad
\textbf{(D) }11 \qquad
\textbf{(E) }18 \qquad
$
2024 Israel National Olympiad (Gillis), P2
A positive integer $x$ satisfies the following:
\[\{\frac{x}{3}\}+\{\frac{x}{5}\}+\{\frac{x}{7}\}+\{\frac{x}{11}\}=\frac{248}{165}\]
Find all possible values of
\[\{\frac{2x}{3}\}+\{\frac{2x}{5}\}+\{\frac{2x}{7}\}+\{\frac{2x}{11}\}\]
where $\{y\}$ denotes the fractional part of $y$.
2016 NIMO Problems, 1
Let $m$ be a positive integer less than $2015$. Suppose that the remainder when $2015$ is divided by $m$ is $n$. Compute the largest possible value of $n$.
[i] Proposed by Michael Ren [/i]
1976 Euclid, 4
Source: 1976 Euclid Part B Problem 4
-----
The remainder when $f(x)=x^5-2x^4+ax^3-x^2+bx-2$ is divided by $x+1$ is $-7$. When $f(x)$ is divided by $x-2$ the remainder is $32$. Determine the remainder when $f(x)$ is divided by $x-1$.
2025 Kosovo National Mathematical Olympiad`, P3
Let $m$ and $n$ be natural numbers such that $m^3-n^3$ is a prime number. What is the remainder of the number $m^3-n^3$ when divided by $6$?
2025 Kosovo National Mathematical Olympiad`, P4
When a number is divided by $2$ it has quotient $x$ and remainder $1$. Whereas, when the same number is divided by $3$ it has quotient $y$ and remainder $2$. What is the remainder when $x+y$ is divided by $5$?
2017 Dutch Mathematical Olympiad, 4
If we divide the number $13$ by the three numbers $5, 7$, and $9$, then these divisions leave remainders: when dividing by $5$ the remainder is $3$, when dividing by $7$ the remainder is $6$, and when dividing by $9$ the remainder is 4. If we add these remainders, we obtain $3 + 6 + 4 = 13$, the original number.
(a) Let $n$ be a positive integer and let $a$ and $b$ be two positive integers smaller than $n$. Prove: if you divide $n$ by $a$ and $b$, then the sum of the two remainders never equals $n$.
(b) Determine all integers $n > 229$ having the property that if you divide $n$ by $99, 132$, and $229$, the sum of the three remainders is $n$.
2022 IFYM, Sozopol, 2
Finding all quads of integers $(a, b, c, p)$ where $p \ge 5$ is prime number such that the remainders of the numbers $am^3 + bm^2 + cm$, $m = 0, 1, . . . , p - 1$, upon division of $p$ are two by two different..
2008 JBMO Shortlist, 3
Integers $1,2, ...,2n$ are arbitrarily assigned to boxes labeled with numbers $1, 2,..., 2n$. Now, we add the number assigned to the box to the number on the box label. Show that two such sums give the same remainder modulo $2n$.
2018 Hanoi Open Mathematics Competitions, 8
Let $k$ be a positive integer such that $1 +\frac12+\frac13+ ... +\frac{1}{13}=\frac{k}{13!}$. Find the remainder when $k$ is divided by $7$.
2023 AMC 12/AHSME, 24
Let $K$ be the number of sequences $A_1$, $A_2$, $\dots$, $A_n$ such that $n$ is a positive integer less than or equal to $10$, each $A_i$ is a subset of $\{1, 2, 3, \dots, 10\}$, and $A_{i-1}$ is a subset of $A_i$ for each $i$ between $2$ and $n$, inclusive. For example, $\{\}$, $\{5, 7\}$, $\{2, 5, 7\}$, $\{2, 5, 7\}$, $\{2, 5, 6, 7, 9\}$ is one such sequence, with $n = 5$. What is the remainder when $K$ is divided by $10$?
$\textbf{(A) } 1 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 5 \qquad \textbf{(D) } 7 \qquad \textbf{(E) } 9$
1977 IMO Longlists, 10
Let $a,b$ be two natural numbers. When we divide $a^2+b^2$ by $a+b$, we the the remainder $r$ and the quotient $q.$ Determine all pairs $(a, b)$ for which $q^2 + r = 1977.$
2018 India PRMO, 25
Let $T$ be the smallest positive integers which, when divided by $11,13,15$ leaves remainders in the sets {$7,8,9$}, {$1,2,3$}, {$4,5,6$} respectively. What is the sum of the squares of the digits of $T$ ?
2004 Thailand Mathematical Olympiad, 6
Let $f(x) = x^6 + x^5 + x^4 + x^3 + x^2 + x + 1$. Find the remainder when $f(x^7)$ is divided by $f(x)$.
2004 Thailand Mathematical Olympiad, 13
Compute the remainder when $29^{30 }+ 31^{28} + 28! \cdot 30!$ is divided by $29 \cdot 31$.
2016 Singapore MO Open, 3
Let $n$ be a prime number. Show that there is a permutation $a_1,a_2,...,a_n$ of $1,2,...,n$ so that $a_1,a_1a_2,...,a_1a_2...a_n$ leave distinct remainders when divided by $n$
2020 Estonia Team Selection Test, 3
The prime numbers $p$ and $q$ and the integer $a$ are chosen such that $p> 2$ and $a \not\equiv 1$ (mod $q$), but $a^p \equiv 1$ (mod $q$). Prove that $(1 + a^1)(1 + a^2)...(1 + a^{p - 1})\equiv 1$ (mod $q$) .
1999 Kazakhstan National Olympiad, 6
In a sequence of natural numbers $ a_1 $, $ a_2 $, $ \dots $, $ a_ {1999} $, $ a_n-a_ {n-1} -a_ {n-2} $ is divisible by $ 100 (3 \leq n \leq 1999) $. It is known that $ a_1 = 19$ and $ a_2 = 99$. Find the remainder of $ a_1 ^ 2 + a_2 ^ 2 + \dots + a_ {1999} ^ 2 $ by $8$.
2002 Kazakhstan National Olympiad, 4
Prove that there is a set $ A $ consisting of $2002$ different natural numbers satisfying the condition:
for each $ a \in A $, the product of all numbers from $ A $, except $ a $, when divided by $ a $ gives the remainder $1$.
1977 IMO Shortlist, 3
Let $a,b$ be two natural numbers. When we divide $a^2+b^2$ by $a+b$, we the the remainder $r$ and the quotient $q.$ Determine all pairs $(a, b)$ for which $q^2 + r = 1977.$
1949-56 Chisinau City MO, 8
Prove that the remainder of dividing the sum of two squares of integers by $4$ is different from $3$.
2019 May Olympiad, 1
A positive integer is called [i]piola [/i] if the $9$ is the remainder obtained by dividing it by $2, 3, 4, 5, 6, 7, 8, 9$ and $10$ and it's digits are all different and nonzero. How many [i]piolas[/i] are there between $ 1$ and $100000$?