The best way to learn math and computer science.

Log in with Facebook Log in with Google Log in with email

Join using Facebook Join using Google Join using email

Forgot password? New user? Sign up

Existing user? Log in

143 is special ...

Number Theory

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

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

View solutions

Your answer seems reasonable. Find out if you're right!

Sign up to access problem solutions.

That seems reasonable. Find out if you're right!

Sign up to save your progress!

Log in with Facebook Log in with Google Log in with email

Join using Facebook Join using Google Join using email

Forgot password? New user? Sign up

Existing user? Log in

by Aditya Raut

×

Problem Loading...

Note Loading...

Set Loading...