The question concerns que same subject as my previous post in this section, but I still didn't figure it out:
Let p be a prime number and a be an integer such that p does not divide a. Show that if then or .
Any tips or approach suggestions will be useful.
Thanks in advance,