Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (mathmath333):

Some body check my work please find the remainder using fermat little theorm \(\large\tt \color{black}{\dfrac{8^{122}}{19}}\)

OpenStudy (mathmath333):

\(\large\tt \color{black}{8^{122}mod19}\) \(\large\tt \color{black}{8^{19\times 6+8}mod19}\) \(\large\tt \color{black}{8^{8}mod19}\) \(\large\tt \color{black}{64^{4}mod19}\) \(\large\tt \color{black}{7^{4}mod19}\) \(\large\tt \color{black}{(49\times49)mod19}\) \(\large\tt \color{black}{\large\tt \color{black}{(11\times11=121)}mod19}\) \(\large\tt \color{black}{=7}\)

OpenStudy (mathmath333):

i want to know if this is correct way of applying fermat

OpenStudy (mathmath333):

@zepdrix

OpenStudy (mathmath333):

@cj49

OpenStudy (anonymous):

yeah, a^k mod k = 1

OpenStudy (anonymous):

a>1

OpenStudy (anonymous):

a is an integer

OpenStudy (mathmath333):

do i have to find the multiple of 19 in the index of 8 ?

OpenStudy (mathmath333):

ok thanks

OpenStudy (anonymous):

you did fine

OpenStudy (mathmath333):

oops sry lol

OpenStudy (mathmath333):

i think its \(\large\tt \color{black}{a^{p-1}\bmod{p}\equiv 1\bmod{p}}\)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!