The title says it all. I'm aware of the proof of the converse of my statement, but how do I go on about proving this. Any help would be appreciated.
Asked
Active
Viewed 302 times
1 Answers
0
When dividing through n, you can only have n possible remainders, from $0$ to $n-1$, so either the division stops, when one of these remainders is $0$, or loops, when one of these non-zero remainders is equal to a previous non-zero remainder.
Lucian
- 49,312