Let U(n) be the group of units in Zn. If n > 2, prove that there is an element k EU (n) such chat k² = 1 and k # 1.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Please go though every step and do not use a texblook solution.

Why is the gcd(n-1,n)=1? 

why is n-1 an element if U(n)?

Example let K = n-1

Assume since n-1 is an element of Zn, K is an element of Zn

let the gcd (n, n-1)= q

Prove somethign like this dont just jump to the gcd(n-1,n)=1 therefore n-1 is an element of U(n) so (n-1)^2 is congruent to n^2 - n2+1modn, 

I know the answer, I'm looking for proof with an explination with each step. 

Let U(n) be the group of units in Zn. If n > 2, prove that there is an element k = U(n) such
that k2 = 1 and k 1.
Transcribed Image Text:Let U(n) be the group of units in Zn. If n > 2, prove that there is an element k = U(n) such that k2 = 1 and k 1.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,