# Find the smallest positive integer k satisfying the stated condition or explain no such k exists: 3^k -= 1 mod 11.

Find the smallest positive integer k satisfying the stated condition or explain no such k exists:
${3}^{k}\equiv 1\text{mod}11$.
You can still ask an expert for help

## Want to know more about Congruence?

• Questions are typically answered in as fast as 30 minutes

Solve your problem for the price of one coffee

• Math expert for every subject
• Pay only if we can solve it

unett
Step 1
Since gcd(3,11)=1 and again by using Eulers