Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
a² Prove that if ged(a, m); 1 and gcd (a-1, m)=1, then 1+a+a² + ... + a(m) = 0 (mod m). (Hint: What do you get when you multiply the congruence by a-1?)

a² Prove that if ged(a, m); 1 and gcd (a-1, m)=1, then 1+a+a² + ... + a(m) = 0 (mod m). (Hint: What do you get when you multiply the congruence by a-1?)

Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section: Chapter Questions
Problem 60RE
See similar textbooks
icon
Related questions
Question
a² Prove that if ged(a, m); 1 and gcd (a-1, m)=1, then 1+a+a² + ... + a(m) = 0 (mod m). (Hint: What do you get when you multiply the congruence by a-1?)
Transcribed Image Text:a² Prove that if ged(a, m); 1 and gcd (a-1, m)=1, then 1+a+a² + ... + a(m) = 0 (mod m). (Hint: What do you get when you multiply the congruence by a-1?)
Expert Solution
steps

Step by step

Solved in 1 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer