What is the smallest natural number n for a^(3n)=a (mod 85)?

  • Thread starter Thread starter papacy
  • Start date Start date
  • Tags Tags
    Theory
Click For Summary

Homework Help Overview

The problem involves finding the smallest natural number n such that a^(3n) = a (mod 85) for any integer a. The context includes modular arithmetic and properties derived from Fermat's Little Theorem.

Discussion Character

  • Exploratory, Assumption checking

Approaches and Questions Raised

  • Participants discuss the need to solve the congruences a^(3n) = a (mod 5) and a^(3n) = a (mod 17) separately, using properties from Fermat's theorem. There is an exploration of specific values for n and the implications of those values.

Discussion Status

Some participants have made attempts to derive specific values for n based on their findings, while others have provided hints to guide the exploration of the problem. There is ongoing discussion about the validity of the derived values and whether they meet the conditions set by the problem.

Contextual Notes

Participants are working under the assumption that the values of a are integers and are considering the implications of modular arithmetic with respect to the prime factors of 85.

papacy
Messages
5
Reaction score
0

Homework Statement



Find the smallest natural number n such that: a^(3n)=a (mod 85) for each integer a.
Justify your answer.

Homework Equations




The Attempt at a Solution



because 85=17 . 5 and gcd (5,17)=1 we have to find the n such:

a^(3n)=a (mod 5) and a^(3n)=a (mod 17).

From Fermat theorem we know that a^(17)=a (mod 17) and a^(5)=a (mod 5)

so we have: a^(5)=a^(3n) (mod 5) and a^(17)=a^(3n)(mod 17).

I don't now how to continue and find the smallest natural n.
 
Physics news on Phys.org
You've already observed that it suffices to find a minimal n such that a^{3n} \equiv a \pmod{5} and a^{3n} \equiv a \pmod{17}. Here's a hint about how to do so:

You already know that a^{5} \equiv a \pmod{5}. Show that a^9 \equiv a \pmod{5}, a^{13} \equiv a \pmod{5} and so on.

Similarly, you know that a^{17} \equiv a \pmod{17}. Show that a^{33} \equiv a \pmod{17}, and so on.

Use the above to find the least exponent 3n such that a^{3n} \equiv a \pmod{5} and a^{3n} \equiv a \pmod{17}.

Please post again if you have any questions.
 
i just do it. i find a^(33)=a(mod5) and a^(33)=a(mod17)
now can i say that 3n=33 and n=11. is that right ?
 
papacy said:
i just do it. i find a^(33)=a(mod5) and a^(33)=a(mod17)
now can i say that 3n=33 and n=11. is that right ?

I got the same answer.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 28 ·
Replies
28
Views
6K
  • · Replies 1 ·
Replies
1
Views
6K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
1
Views
4K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
5
Views
13K