Ask your own question, for FREE!
Mathematics 17 Online
OpenStudy (loser66):

Let \(n=p_1p_2p_3\cdots p_k\) where \(p_i\) are distinct primes. Let a be any integer. Show that \(a^{\phi(n)+1}\equiv a~(mod~n)\) Please, help

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!