You are here:

Advanced Math/Math Foundations Proofs

Advertisement


Question
Prove that the non-zero element [a] of Z(integers)sub n, has a multiplicative inverse in Z(integers)sub n if and only if n and a are relatively prime; that is, the greatest common divisor of n and a is 1.

Answer
Hi Pete~
    Ok, let's make a stab at it:

(-->) Suppose a,b != 0 in Z_n such that ab = 1 mod n then n|(ab-1) -->there exists a k in Z such that ab-1 = nk -> ab - nk = 1 -->(a,n)= 1.

(<--) Now suppose (a,n) = 1 then there exists an x,y in Z such that
ax + ny = 1 --> ny = 1-ax -> n|(1-ax) 1-ax = 0 mod n -> 1 = ax mod n --> x = a^-1

Of course you now want to draw your conclusion.

Note: I used "=" signs for congruence. Also about notation: (a,n) is the same as gcd(a,n) which is the same as the greatest common divisor of a and n

I hope this is clear for you.

Math Prof

Advanced Math

All Answers


Answers by Expert:


Ask Experts

Volunteer


Sherry Wallin

Expertise

I can answer most questions up through Calculus and some in Number Theory and Abstract Algebra.

Experience

I have had my Bachelor's Degree since 1987 and have been a teacher since 1988. I earned my Masters Degree in Mathematics May 2010. I have been teaching at the same community college since 2002.

Education/Credentials
I have taught 12 years at the community college level, medical college, and technical college as well as a high school instructor and alternative education instructor and charter school instructor.

Awards and Honors
Master's GPA 3.56 Bachelor's GPA 3.34 Post grad work not degree related GPA 4.0

©2012 About.com, a part of The New York Times Company. All rights reserved.