Fermat's little theorem

  • Thread starter acarchau
  • Start date
  • #1
21
0
From fermat's little theorem we have for a prime to a prime p : [tex]a^{p-1}\equiv 1[/tex](mod p). Assuming p-1 to be even we must have either [tex]a^{\frac{p-1}{2}}\equiv 1[/tex] (mod p) or [tex]a^{\frac{p+1}{2}}\equiv -1[/tex] (mod p). Are there any special cases in which it is easy to determine which of the previous two conditions holds without a lot of compution?
 
Last edited:

Answers and Replies

  • #3
21
0
thank you!
 

Related Threads on Fermat's little theorem

  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
1
Views
518
Replies
5
Views
635
Constructive Proofs Little Fermat Proof
Replies
2
Views
131
  • Last Post
Replies
5
Views
4K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
6
Views
2K
  • Last Post
3
Replies
53
Views
14K
Top