Show that if p is an odd prime, then the congruence x2 ≡ 1 (mod pα) has exactly two solutions, namely, x ≡ ±1 (mod pα)
Added by Lori G.
Step 1
Let's think step by step. Show more…
Show all steps
Close
Your feedback will help us improve your experience
James Chok and 54 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Show that if $p$ is an odd prime and $a$ is an integer not divisible by $p$ , then the congruence $x^{2} \equiv a(\bmod p)$ has either no solutions or exactly two incongruent solutions modulo $p .$
Number Theory and Cryptography
Solving Congruences
Show that if $p$ is prime, the only solutions of $x^{2} \equiv$ 1$(\bmod p)$ are integers $x$ such that $x \equiv 1(\bmod p)$ or $x \equiv-1$ $(\bmod p) .$
Prove that if p is an odd prime, then x 2 ≡ 2 (mod p) has solutions if and only if p ≡ 1 or 7 (mod 8).
Adi S.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD