= Solution
The <Chinese remainder theorem> says that for pairwise <coprime> positive moduli $m_1,\ldots,m_r$ and arbitrary <integers> $a_1,\ldots,a_r$, the simultaneous <modular congruences>
$$
n\equiv a_i\pmod{m_i}\qquad(1\leq i\leq r)
$$
have a solution, unique modulo $M=\prod_i m_i$.
Choose $2017$ distinct <prime numbers> $q_1,\ldots,q_{2017}$. Their <prime powers> $q_i^{2017}$ are pairwise <coprime>. Apply the <Chinese remainder theorem> to
$$
\boxed{n\equiv-i\pmod{q_i^{2017}}\qquad(1\leq i\leq2017).}
$$
For the resulting <integer> $n$, each $n+i$ is divisible by $q_i^{2017}$, the required power of an <integer> greater than one. Adding a sufficiently large multiple of $\prod_iq_i^{2017}$ makes $n$ positive without changing any <modular congruence>. Thus \b[such a positive $n$ exists], indeed infinitely many do. This is the general construction of <consecutive integers divisible by prescribed prime powers>.
Back to article page
