Let n = 29, determine the total number of solutions modulo n to and enter it below. (Note that 29 is prime.) Type your answer... z² 7 (mod n) = Let n = 33, determine the total number of solutions modulo n to = 1 (mod n) and enter it below. (Note that 33 is not prime.) Type your answer...

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section10.3: Geometric Sequences
Problem 56E
icon
Related questions
Question

Need help with these two Intro to Elementary Number Theory Homework Problems.

 

Let n
=
29, determine the total number of solutions modulo n to
and enter it below. (Note that 29 is prime.)
Type your answer...
z² 7 (mod n)
=
Transcribed Image Text:Let n = 29, determine the total number of solutions modulo n to and enter it below. (Note that 29 is prime.) Type your answer... z² 7 (mod n) =
Let n
=
33, determine the total number of solutions modulo n to
= 1 (mod n)
and enter it below. (Note that 33 is not prime.)
Type your answer...
Transcribed Image Text:Let n = 33, determine the total number of solutions modulo n to = 1 (mod n) and enter it below. (Note that 33 is not prime.) Type your answer...
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell