Found problems: 37
2015 Romania Team Selection Tests, 3
Define a sequence of integers by $a_0=1$ , and $a_n=\sum_{k=0}^{n-1} \binom{n}{k}a_k$ , $n \geq 1$ . Let $m$ be a positive integer , let $p$ be a prime , and let $q$ and $r$ be non-negative integers . Prove that :
$$a_{p^mq+r} \equiv a_{p^{m-1}q+r} \pmod{p^m}$$
PEN D Problems, 14
Determine the number of integers $n \ge 2$ for which the congruence \[x^{25}\equiv x \; \pmod{n}\] is true for all integers $x$.
1998 Belarus Team Selection Test, 2
Let $ p$ be a prime number and $ f$ an integer polynomial of degree $ d$ such that $ f(0) = 0,f(1) = 1$ and $ f(n)$ is congruent to $ 0$ or $ 1$ modulo $ p$ for every integer $ n$. Prove that $ d\geq p - 1$.
PEN D Problems, 6
Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[2, \; 2^{2}, \; 2^{2^{2}}, \; 2^{2^{2^{2}}}, \cdots \pmod{n}\] is eventually constant.
PEN D Problems, 20
Show that $1994$ divides $10^{900}-2^{1000}$.
PEN D Problems, 2
Suppose that $p$ is an odd prime. Prove that \[\sum_{j=0}^{p}\binom{p}{j}\binom{p+j}{j}\equiv 2^{p}+1\pmod{p^{2}}.\]
PEN D Problems, 18
Let $p$ be a prime number. Determine the maximal degree of a polynomial $T(x)$ whose coefficients belong to $\{ 0,1,\cdots,p-1 \}$, whose degree is less than $p$, and which satisfies \[T(n)=T(m) \; \pmod{p}\Longrightarrow n=m \; \pmod{p}\] for all integers $n, m$.
Novosibirsk Oral Geo Oly VII, 2023.4
Inside the convex pentagon $ABCDE$, a point $O$ was chosen, and it turned out that all five triangles $AOB$, $BOC$, $COD$, $DOE$ and $EOA$ are congrunet to each other. Prove that these triangles are isosceles or right-angled.
PEN D Problems, 23
Let $p$ be an odd prime of the form $p=4n+1$. [list=a][*] Show that $n$ is a quadratic residue $\pmod{p}$. [*] Calculate the value $n^{n}$ $\pmod{p}$. [/list]
PEN D Problems, 9
Show that there exists a composite number $n$ such that $a^n \equiv a \; \pmod{n}$ for all $a \in \mathbb{Z}$.
PEN D Problems, 3
Show that \[(-1)^{\frac{p-1}{2}}{p-1 \choose{\frac{p-1}{2}}}\equiv 4^{p-1}\pmod{p^{3}}\] for all prime numbers $p$ with $p \ge 5$.
PEN D Problems, 17
Determine all positive integers $n$ such that $ xy+1 \equiv 0 \; \pmod{n} $ implies that $ x+y \equiv 0 \; \pmod{n}$.
PEN D Problems, 8
Characterize the set of positive integers $n$ such that, for all integers $a$, the sequence $a$, $a^2$, $a^3$, $\cdots$ is periodic modulo $n$.
Russian TST 2019, P2
Prove that for every odd prime number $p{}$, the following congruence holds \[\sum_{n=1}^{p-1}n^{p-1}\equiv (p-1)!+p\pmod{p^2}.\]
2015 Serbia National Math Olympiad, 6
In nonnegative set of integers solve the equation:
$$(2^{2015}+1)^x + 2^{2015}=2^y+1$$
PEN D Problems, 19
Let $a_{1}$, $\cdots$, $a_{k}$ and $m_{1}$, $\cdots$, $m_{k}$ be integers with $2 \le m_{1}$ and $2m_{i}\le m_{i+1}$ for $1 \le i \le k-1$. Show that there are infinitely many integers $x$ which do not satisfy any of congruences \[x \equiv a_{1}\; \pmod{m_{1}}, x \equiv a_{2}\; \pmod{m_{2}}, \cdots, x \equiv a_{k}\; \pmod{m_{k}}.\]
2021 Balkan MO Shortlist, N3
Let $n$ be a positive integer. Determine, in terms of $n$, the greatest integer which divides
every number of the form $p + 1$, where $p \equiv 2$ mod $3$ is a prime number which does not divide $n$.
PEN D Problems, 21
Determine the last three digits of \[2003^{2002^{2001}}.\]
2022 Romania Team Selection Test, 3
Consider a prime number $p\geqslant 11$. We call a triple $a,b,c$ of natural numbers [i]suitable[/i] if they give non-zero, pairwise distinct residues modulo $p{}$. Further, for any natural numbers $a,b,c,k$ we define \[f_k(a,b,c)=a(b-c)^{p-k}+b(c-a)^{p-k}+c(a-b)^{p-k}.\]Prove that there exist suitable $a,b,c$ for which $p\mid f_2(a,b,c)$. Furthermore, for each such triple, prove that there exists $k\geqslant 3$ for which $p\nmid f_k(a,b,c)$ and determine the minimal $k{}$ with this property.
[i]Călin Popescu and Marian Andronache[/i]
Kyiv City MO 1984-93 - geometry, 1992.9.2
Two lines divide a square into $4$ figures of the same area. Prove that all these figures are congruent.
PEN D Problems, 10
Let $p$ be a prime number of the form $4k+1$. Suppose that $2p+1$ is prime. Show that there is no $k \in \mathbb{N}$ with $k<2p$ and $2^k \equiv 1 \; \pmod{2p+1}$.
PEN D Problems, 7
Somebody incorrectly remembered Fermat's little theorem as saying that the congruence $a^{n+1} \equiv a \; \pmod{n}$ holds for all $a$ if $n$ is prime. Describe the set of integers $n$ for which this property is in fact true.
2023 Novosibirsk Oral Olympiad in Geometry, 4
Inside the convex pentagon $ABCDE$, a point $O$ was chosen, and it turned out that all five triangles $AOB$, $BOC$, $COD$, $DOE$ and $EOA$ are congrunet to each other. Prove that these triangles are isosceles or right-angled.
PEN D Problems, 13
Let $\Gamma$ consist of all polynomials in $x$ with integer coefficients. For $f$ and $g$ in $\Gamma$ and $m$ a positive integer, let $f \equiv g \pmod{m}$ mean that every coefficient of $f-g$ is an integral multiple of $m$. Let $n$ and $p$ be positive integers with $p$ prime. Given that $f,g,h,r$ and $s$ are in $\Gamma$ with $rf+sg\equiv 1 \pmod{p}$ and $fg \equiv h \pmod{p}$, prove that there exist $F$ and $G$ in $\Gamma$ with $F \equiv f \pmod{p}$, $G \equiv g \pmod{p}$, and $FG \equiv h \pmod{p^n}$.
PEN D Problems, 11
During a break, $n$ children at school sit in a circle around their teacher to play a game. The teacher walks clockwise close to the children and hands out candies to some of them according to the following rule. He selects one child and gives him a candy, then he skips the next child and gives a candy to the next one, then he skips 2 and gives a candy to the next one, then he skips 3, and so on. Determine the values of $n$ for which eventually, perhaps after many rounds, all children will have at least one candy each.