Show that $Q_p / \mathbb Z$ is divisible as $\mathbb Z$-module. [closed]

Let $p \in \mathbb N$ be a prime. Let

$$Q_p : = \left \{ x \in \mathbb Q : (\exists k \in \mathbb Z)\ \mathrm {and}\ (\exists n \in \mathbb N)\ \mathrm {such}\ \mathrm {that}\ x= \frac {k} {p^n} \right \}.$$

Show that $Q_p / \mathbb Z$ is divisible as $\mathbb Z$-module.

closed as off-topic by Saad, José Carlos Santos, Hanul Jeon, Shailesh, HenrikApr 8 '18 at 10:17

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Saad, José Carlos Santos, Hanul Jeon, Shailesh, Henrik
If this question can be reworded to fit the rules in the help center, please edit the question.

• What are your thoughts about that? What have you tried so far? Where have you got stuck? – Taroccoesbrocco Apr 8 '18 at 9:22
• @Taro see my comment below the answer of Lord Shark the Unknown. – A.Chattopadhyay Apr 8 '18 at 10:01

You need to prove that for $x=a/p^r$ and $n\in\Bbb N$ then there is a $y\in\Bbb Q_p$ with $ny\equiv x\pmod{\Bbb Z}$. You can reduce to the case where $n$ is prime. If $n=p$ that's easy: take $y=x/p$.
So, let $n\ne p$ also be a prime. Try $y=b/p^r$ with $b$ an integer. Then one needs $nb\equiv a\pmod{p^r}$. This congruence is soluble.
• WLOG we may assume that $p \mid n$ and $p^r \nmid n$ for otherwise we have a solution to the given congruence. Let $m$ be the highest power of $p$ dividing $n$ where $0 <m <r$. Then $(n,p^r) = p^m$. But then $p^m \mid n$ and $p^m | nb - a \implies p^m\mid a$. Which proves that the given congruence equation has a solution modulo $p^m$. Isn't it @Lord Shark the Unknown? – A.Chattopadhyay Apr 8 '18 at 8:27