Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
6), then the congruence has a unique solution modulo p. 11. Show that the congruence x³ = 3 (mod 19) has no solutions, whereas x3 = 11 (mod 19) has three incongruent solutions.

6), then the congruence has a unique solution modulo p. 11. Show that the congruence x³ = 3 (mod 19) has no solutions, whereas x3 = 11 (mod 19) has three incongruent solutions.

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

Question 11, please solve it briefly with every reason, its from subject Number theory. 

Fo X *Stephen H. Friedberg, Arnald CBCS BSc(Hons)Maths (3).pdf Elementary_Number Theory 7th x PDE 台 /Users/Dell/Downloads/SEM-6%20%20BOOKS/Elementary_Number Theory_7th_edition%20(1).pdf News Translate (D A TI 日一寸 has a solution for b = 2, 5, and 6. (b) Determine the integers a(1<a<p - 1) such that the congruence x = a (mod p) has a solution for p = 7, 11, and 13. 9. Employ the corollary to Theorem 8.12 to establish that if p is an odd prime, then (a) x² (b) x = -1 (mod p) is solvable if and only if p = 1 (mod 8). 10. Given the congruence x' = a (mod p), where p 5 is a prime and gcd(a, p) = 1, prove the following: (a) If p = 1 (mod 6), then the congruence has either no solutions or three incongruent solutions modulo p. (b) If p = 5 (mod 6), then the congruence has a unique solution modulo p. 11. Show that the congruence x= 3 (mod 19) has no solutions, whereas x = 11 (mod 19) has three incongruent solutions. 2. -1(mod p) is solvable if and only if p = 1 (mod 4). 168 ELEMENTARY NUMBLR THEORY
Transcribed Image Text:Fo X *Stephen H. Friedberg, Arnald CBCS BSc(Hons)Maths (3).pdf Elementary_Number Theory 7th x PDE 台 /Users/Dell/Downloads/SEM-6%20%20BOOKS/Elementary_Number Theory_7th_edition%20(1).pdf News Translate (D A TI 日一寸 has a solution for b = 2, 5, and 6. (b) Determine the integers a(1<a<p - 1) such that the congruence x = a (mod p) has a solution for p = 7, 11, and 13. 9. Employ the corollary to Theorem 8.12 to establish that if p is an odd prime, then (a) x² (b) x = -1 (mod p) is solvable if and only if p = 1 (mod 8). 10. Given the congruence x' = a (mod p), where p 5 is a prime and gcd(a, p) = 1, prove the following: (a) If p = 1 (mod 6), then the congruence has either no solutions or three incongruent solutions modulo p. (b) If p = 5 (mod 6), then the congruence has a unique solution modulo p. 11. Show that the congruence x= 3 (mod 19) has no solutions, whereas x = 11 (mod 19) has three incongruent solutions. 2. -1(mod p) is solvable if and only if p = 1 (mod 4). 168 ELEMENTARY NUMBLR THEORY
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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,
SEE MORE TEXTBOOKS