×

# Help needed in NT!

My doubt has been resolved by Satyajit Mohanty and Pi Han Goh.How would you go about solving this problem?:$10^n \equiv 2\pmod{19};n \in \mathbb{Z}^{+}\\ Smallest\ such\ n=?$Please help!

2 years, 1 month ago

Sort by:

- 2 years, 1 month ago

The smallest $$n$$ is $$17$$. Study residue systems modulo $$n$$.

- 2 years, 1 month ago

You need to check that 17 is the smallest, though.

- 2 years, 1 month ago

Kindly tell the method!

- 2 years, 1 month ago

Oh,wait I got it:did you do it this way:$10^{18}\equiv1\pmod{19}\\ from\ Euler's\ totient\ function\\ 10^{17}\equiv\dfrac{1}{10}\equiv\dfrac{2}{20}\equiv2\pmod{19}$?

- 2 years, 1 month ago

You have only shown that n = 17 is a solution but you didn't show that it's the smallest solution.

- 2 years, 1 month ago

- 2 years, 1 month ago

Show that the residues of a prime is (prime - 1). So if you found anything less than a prime, then it's minimum.

- 2 years, 1 month ago

Yup.

- 2 years, 1 month ago

Ok,thanx!Are you in mood for a trigo problem?

- 2 years, 1 month ago