143 is special ...

For how many positive integers k<10000k<10000 does the following statement hold ?

67×k1(mod143)67\times k \equiv 1 \pmod{143}

×

Problem Loading...

Note Loading...

Set Loading...