How Does Fermat's Little Theorem Apply to n^{39} \equiv n^3 (mod 13)?

  • Thread starter Thread starter AryaSravaka
  • Start date Start date
  • Tags Tags
    Exam Theorem
Click For Summary

Homework Help Overview

The discussion revolves around the application of Fermat's Little Theorem to the congruence relation \( n^{39} \equiv n^3 \mod 13 \). Participants are exploring how this theorem relates to the problem and what implications it has for the congruence.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants inquire about the original poster's attempts and where they are experiencing difficulties. There is a request for insight into connecting the problem to Fermat's Little Theorem. Some participants discuss the implications of the theorem and explore alternative expressions of the congruence.

Discussion Status

The discussion is ongoing, with participants seeking clarification and exploring different interpretations of the problem. Some guidance has been offered regarding the application of the theorem, but there is no explicit consensus on the next steps or a resolution.

Contextual Notes

There is mention of a time constraint, as the original poster has a limited time to address the problem. Additionally, it is noted that Fermat's Little Theorem was not part of the exam content, which may influence the urgency and focus of the discussion.

AryaSravaka
Messages
5
Reaction score
0
Dear sir/madam
I have tried to do this question but can not figure it out. I gave up, but google gave me physicsforums site. I am very greatful and thanks for being genorous.

Thanks.
question is attached
 

Attachments

  • flt.png
    flt.png
    13.2 KB · Views: 524
Last edited:
Physics news on Phys.org
What did you try already?? If you tell us where you're stuck, then we'll know how to help...
 
micromass said:
What did you try already?? If you tell us where you're stuck, then we'll know how to help...

Sir, I really can not see any connection between this problem and FLT ..Pls give me some insight how to start out .. got 1day left :)
thanks
 
We know [itex]n^{13} \equiv n \ ( mod \ 13)[/itex], right? That's the theorem.

But we also know that if [itex]a' \equiv a \ ( mod \ m )[/itex] and [itex]b' \equiv b \ ( mod \ m )[/itex], then [itex]a'b' \equiv ab \ ( mod \ m )[/itex]. This implies

[tex]n^{39} \equiv n^3 \ (mod \ 13).[/tex]

But then what's another way to express this congruence? To say that [itex]n^{39}[/itex] is congruent to [itex]n^3[/itex] means 13 divides what?
 
stringy said:
We know [itex]n^{13} \equiv n \ ( mod \ 13)[/itex], right? That's the theorem.

But we also know that if [itex]a' \equiv a \ ( mod \ m )[/itex] and [itex]b' \equiv b \ ( mod \ m )[/itex], then [itex]a'b' \equiv ab \ ( mod \ m )[/itex]. This implies

[tex]n^{39} \equiv n^3 \ (mod \ 13).[/tex]

But then what's another way to express this congruence? To say that [itex]n^{39}[/itex] is congruent to [itex]n^3[/itex] means 13 divides what?


Dear Sir, Thanks very much for your time. Anyway FLT was not in the exam.. I had to do 4 questions but i did 6 questions... Well I passed it..Yehiiiiiiiiiiiiiiiiiiiiii


I am truly greatful
with metta
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
17
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
4
Views
3K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
2
Views
2K