Let p be an odd prime, let a be an integer that is not divisible by p, and let b be a square root of a modulo p. This exercise investigates the square root of a modulo powers of p. (a) Prove that for some choice of k, the number b + kp is a square root of a modulo p^2, i.e., (b + kp)^2 ≡ a (mod p2). (b) The number b = 537 is a square root of a = 476 modulo the prime p = 1291. Use the idea in (a) to compute a square root of 476 modulo p^2.

Let p be an odd prime, let a be an integer that is not divisible by p, and let b be a square root of a modulo p. This exercise investigates the square root of a modulo powers of p. (a) Prove that for some choice of k, the number b + kp is a square root of a modulo p^2, i.e., (b + kp)^2 ≡ a (mod p2). (b) The number b = 537 is a square root of a = 476 modulo the prime p = 1291. Use the idea in (a) to compute a square root of 476 modulo p^2.

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

Similar questions

Suppose p is an odd prime. Show that (1² +2 +3P +...+ (p − 1)²) = 0 (mod p).
(9) Find all primes p ≤ 29 such that 2 is a primitive root modulo p.
If a is any integer and p is prime, then prove that a\power{p}≡a (mod p).
Let p >2 be a prime. Prove that [(p-2) = (-1)0+1/2 (mod p).
Does x° = a (mod p) always have a solution for every value of a, whenever p is prime?
B
This Intro to Elementary Number Theory Homework problem is very difficult.
Ty
4. (i) Using the fact that 187 = 11 · 17, show that 2186 = 174 mod 187. This shows that 187 fails the base 2 primality test. (ii) Compute 21911 mod 1911. Use Fermat's little theorem and hand calculations. Does 1911 pass or fail the base 2 primality test? You may use the prime factorization of 1911.
Both part (a.) and (b.) please.