Show that the e = order of a modulo m is equal to psi(m)

  • Thread starter Thread starter teddyayalew
  • Start date Start date
Click For Summary
SUMMARY

The discussion focuses on proving that the order of an integer \( e \) modulo \( m \) is equal to \( \psi(m) \), where \( \psi(m) \) represents Euler's totient function. The key equations involved are \( ae \equiv 1 \mod m \) and \( a(\psi(m)) \equiv 1 \mod m \). The solution approach utilizes the relationship \( eu - \psi(m)v = \gcd(e, \psi(m)) = g \) and demonstrates that \( g \) must equal \( e \) through the division algorithm, confirming that \( \psi(m) \) divides \( e \) and thus \( g = \psi(m) \).

PREREQUISITES
  • Understanding of modular arithmetic and congruences
  • Familiarity with Euler's totient function \( \psi(m) \)
  • Knowledge of the division algorithm and greatest common divisors
  • Basic algebraic manipulation skills in number theory
NEXT STEPS
  • Study the properties of Euler's totient function \( \psi(m) \)
  • Learn about the relationship between orders of elements in modular arithmetic
  • Explore proofs involving the division algorithm in number theory
  • Investigate applications of modular inverses in cryptography
USEFUL FOR

Mathematics students, particularly those studying number theory, cryptographers, and anyone interested in modular arithmetic and its applications.

teddyayalew
Messages
35
Reaction score
0

Homework Statement


http://i44.tinypic.com/33z5js3.jpg

It is part b


Homework Equations


ae = 1 (mod m)

a(psi(m)) = 1 (mod m)

eu - psi(m)v = gcd(e, psi(m)) = g

The Attempt at a Solution



I know that eu = g + psi(m)v

So then a(eu) = ag + psi(m)= ag*apsi(m) = ag (mod m) from the above relation.

Also aeu = 1u = 1 mod(m)

So then we know ag = 1 mod(m) . Because g divides e , g≤e . and because e is the smallest possible number s.t ae = 1 (mod m) e≤g so g =e.

I am having trouble then showing that g =psi(m) can someone help me.

 
Physics news on Phys.org
Well, from where you are, you could try to prove that e divides g, but I wouldn't do it (and don't know if it can be done.)

Use the division algorithm to note that you can write phi(m) = eq + r where 0 \leq r < e and show that r must be zero.
 
Ahh I see! Thank you for your help.
 

Similar threads

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