Prove if $k$ is any positive integer, the decimal expansion of $\frac{1}{k}$ eventually gets into a repeating cycle.
I'm stuck here , i've thought about applying the pigeonhole principle and induction here but to no avail...
My answer is asking for a proof through pigeonhole principle or induction.. the one linked does not show those..
Please don't close this.
If you divide $1$ by $k$ in the way everyone learnt it in school, you calculate $10$ times a number divided by $k$ with remainder multiple times.
The possible remainders are $0,1,\cdots ,k-1$, so there are $k$ possible remainders.
If we have determined $k+1$ remainders, the pigeonhole-principle guarantees some duplication.
So, there must be two positions with equal remainders.
The earliest point for which this occurs is the point where the decimal expansion gets periodic.