Found problems: 114
Given an integer ${n>1}$, denote by $P_{n}$ the product of all positive integers $x$ less than $n$ and such that $n$ divides ${x^2-1}$. For each ${n>1}$, find the remainder of $P_{n}$ on division by $n$.
[i]Proposed by John Murray, Ireland[/i]
Let $k$ be a positive integer and $r_n$ be the remainder when ${2 n} \choose {n}$ is divided by $k$.
Find all $k$ for which the sequence $(r_n)_{n=1}^{\infty}$ is eventually periodic.
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$
Let $p$ a prime number and $r$ the remainder of the division of $p$ by $210$. It is known that $r$ is a composite number and can be written as the sum of two non-zero perfect squares. Find all primes less than $2018$ that satisfy these conditions.
Is there a nine-digit number without zero digits, the remainder of dividing which on each of its digits is different?
Determine whether it is possible to place the integers $1, 2,...,2012$ in a circle in such a way that the $2012$ products of adjacent pairs of numbers leave pairwise distinct remainders when divided by $2013$.
We say that a permutation $(a_1, \dots, a_n)$ of $(1, 2, \dots, n)$ is good if the sums $a_1 + a_2 + \dots + a_i$ are all distinct modulo $n$. Prove that there exists a positive integer $n$ such that there are at least $2020$ good permutations of $(1, 2, \dots, n)$.
[i]Proposed by Ariel García[/i]
Let $a, b$ be two co-prime positive integers. A number is called [i]good [/i] if it can be written in the form $ax + by$ for non-negative integers $x, y$. Defi ne the function $f : Z\to Z $as $f(n) = n - n_a - n_b$, where $s_t$ represents the remainder of $s$ upon division by $t$. Show that an integer $n$ is [i]good [/i]if and only if the in finite sequence $n, f(n), f(f(n)), ...$ contains only non-negative integers.
Determine the smallest $n$ such that $n \equiv (a - 1)$ mod $a$ for all $a \in \{2,3,..., 10\}$.
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$
Find the four smallest four-digit numbers that meet the following condition: by dividing by $2$, $3$, $4$, $5$ or $6$ the remainder is $ 1$.
Let $d$ be a positive divisor of the number $A = 1024^{1024}+5$ and suppose that $d$ can be expressed as $d = 2x^2+2xy+3y^2$ for some integers $x,y$. Which remainder we can have when divide $d$ by $20$ ?
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$ ?
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.$
How many different remainders can result when the $100$th power of an integer is divided by $125$?
$
\textbf{(A) }1 \qquad
\textbf{(B) }2 \qquad
\textbf{(C) }5 \qquad
\textbf{(D) }25 \qquad
\textbf{(E) }125 \qquad
$
Let $n$ be an integer, $n \ge 2$. Find the remainder of the division of the number $n(n + 1)(n + 2)$ by $n - 1$.
If we divide number $1^{1990}+2^{1990}+3^{1990}+...+1990^{1990}$ with $10$, what remainder will we find?
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$.
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$.
Consider the set $E$ of all positive integers $n$ such that when divided by $9,10,11$ respectively, the remainders(in that order) are all $>1$ and form a non constant geometric progression. If $N$ is the largest element of $E$, find the sum of digits of $E$
Let all positive integers $n$ satisfy the following condition:
for each non-negative integers $k, m$ with $k + m \le n$,
the numbers $\binom{n-k}{m}$ and $\binom{n-m}{k}$ leave the same remainder when divided by $2$.
(Poland)
PS. The translation was done using Google translate and in case it is not right, there is the original text in Slovak
Let $ a_1, a_2, ..., a_ {1994} $ be integers such that $ a_1 + a_2 + ... + a_{1994} = 1994 ^{1994} $ .
Determine the remainder of the division of $ a ^ 3_1 + a ^ 3_2 + ... + a ^ 3_{1994} $ with $6$.
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$) .
Compute the remainder when $\underbrace{\hbox{11...1}}_{\hbox{1862}}$ is divided by $2006$
Prove that the remainder of dividing the sum of two squares of integers by $4$ is different from $3$.