- Thread starter
- #1

#### mathworker

##### Well-known member

- May 31, 2013

- 119

Prove or disprove for every prime P there is a K such that \(\displaystyle 10^k=1\text{mod}P\).

I arrived at this statement while proving something and can't find progress

here is the problem which may doesn't matter but if you wan't to find the origin [here]

I arrived at this statement while proving something and can't find progress

here is the problem which may doesn't matter but if you wan't to find the origin [here]

Last edited: