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

Lewis Harvey 2021-01-28 Answered
Find the smallest positive integer k satisfying the stated condition or explain no such k exists:
${2}^{k}\equiv 1\text{mod}11$.
You can still ask an expert for help

## Want to know more about Congruence?

• Live experts 24/7
• Questions are typically answered in as fast as 30 minutes
• Personalized clear answers

Solve your problem for the price of one coffee

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

Maciej Morrow
Step 1
To find the smallest positive integer k satisfying the given condition of congruence.
Step 2
Use Eulers