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

Find the smallest positive integer k satisfying the stated condition or explain no such k exists:
${2}^{k}\equiv 1\text{mod}14$.
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

Mitchel Aguirre

Find ${2}^{k}\left(\text{mod}14\right)$ for some values of k.
${2}^{1}\equiv 2\left(\text{mod}14\right)$
${2}^{2}\equiv 4\left(\text{mod}14\right)$
${2}^{3}\equiv 8\left(\text{mod}14\right)$
${2}^{4}\equiv 2\left(\text{mod}14\right)$
${2}^{5}\equiv 4\left(\text{mod}14\right)$
......
So, ${2}^{k}\left(\text{mod}14\right)$ gives the value 2,4 or 8 for any positive integer k.
Hence, there exists no positive integer k such that ${2}^{k}\equiv 1\left(\text{mod}14\right)$.