0
$\begingroup$

Let $n \in \mathbb{N}^{+} \smallsetminus \{{1}\}$ and $p = min\{p \in \mathbb{P} : p \mid n\}$.

Also, let $a \in \mathbb{Z}$ and $a^n \equiv 1 \pmod{n}$

I need to proof, that $a \equiv 1 \pmod{p}$.

It is a study task. Therefore, I wish to get some algorithm of solution of my problem.

$\endgroup$
4
  • 2
    $\begingroup$ Have you tried, like, anything? $\endgroup$
    – Sarah
    Nov 17 '14 at 22:31
  • $\begingroup$ @Sarah, I have no idea, how to start of proof. $\endgroup$
    – Max
    Nov 17 '14 at 22:33
  • 1
    $\begingroup$ Do you know fermats little theorem? <-- Read that $\endgroup$
    – Sarah
    Nov 17 '14 at 22:33
  • $\begingroup$ @Sarah, thank you, I will read. $\endgroup$
    – Max
    Nov 17 '14 at 22:36
1
$\begingroup$

Fermat's Little Theorem can be stated as, for any prime $p$ and coprime $a$ we have that $$a^{p-1}=1\pmod p$$ These questions are scattered around. Feel free to read on-line literature on the subject, it is not too hard to find.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.