MathForces: Math Olympiads
MathForces - Math Olympiadsβeta
Login Register


Author: mathforces
Problem has been solved: 15 times

Русский язык | English Language

Let $X_k$ be a number obtained from the numbers $2^{10}, 2^{20}, …, 2^{10k}$ written in decimal notation by concatenating them together in the specified order. Find the smallest value of $k \geq 3$ such that $X_k \equiv 2^{10k}\ (\text{mod} \ 2^{170})$.

Sorry, you need to login into your account