Question

suppose that p is a prime with p= 3 ( mod 4). Show that for all...

suppose that p is a prime with p= 3 ( mod 4). Show that for all x in Z_p, it is not possible for both x and -x to be squares (x and -x cannot have a square root)

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let p be a prime that is congruent to 3 mod 4. Prove that there is...
Let p be a prime that is congruent to 3 mod 4. Prove that there is no solution to the congruence x2≡−1 modp. (Hint: what would be the order of x?)
Let p be prime. Show that the equation x^2 is congruent to 1(mod p) has just...
Let p be prime. Show that the equation x^2 is congruent to 1(mod p) has just two solutions in Zp (the set of integers). We cannot use groups.
Let p be be prime and p ≡ 1 (mod 4|a|). Prove that a is a...
Let p be be prime and p ≡ 1 (mod 4|a|). Prove that a is a quadratic residue mod p.
Let p be a prime and let a be a primitive root modulo p. Show that...
Let p be a prime and let a be a primitive root modulo p. Show that if gcd (k, p-1) = 1, then b≡ak (mod p) is also a primitive root modulo p.
Let p be an odd prime of the form p = 3k+2. Show that if a^3...
Let p be an odd prime of the form p = 3k+2. Show that if a^3 ≡ b^3 (mod p), then a ≡ b (mod p). Conclude that 1^3,2^3,…,p^3 form a complete system of residues mod p.
et P be an odd prime number. Suppose there are two natural numbers A, B such...
et P be an odd prime number. Suppose there are two natural numbers A, B such that 2P = A2 + B2. Show that A, B are odd and coprime. Show that P ≡ 1 (mod 4). Write P as a sum of two squares of natural numbers. Find a Primitive Pythagorean Triple (U, V, P).
Let p be a prime and m an integer. Suppose that the polynomial f(x) = x^4+mx+p...
Let p be a prime and m an integer. Suppose that the polynomial f(x) = x^4+mx+p is reducible over Q. Show that if f(x) has no zeros in Q, then p = 3.
Show that there exists a prime number p such that p+4 and p+6 are also prime....
Show that there exists a prime number p such that p+4 and p+6 are also prime. [Hint: Primes are 2, 3, 5, 7, 11, 13, 17, 19, 23, ...]
1. Let p be any prime number. Let r be any integer such that 0 <...
1. Let p be any prime number. Let r be any integer such that 0 < r < p−1. Show that there exists a number q such that rq = 1(mod p) 2. Let p1 and p2 be two distinct prime numbers. Let r1 and r2 be such that 0 < r1 < p1 and 0 < r2 < p2. Show that there exists a number x such that x = r1(mod p1)andx = r2(mod p2). 8. Suppose we roll...
Let p be an odd prime. Prove that −1 is a quadratic residue modulo p if...
Let p be an odd prime. Prove that −1 is a quadratic residue modulo p if p ≡ 1 (mod 4), and −1 is a quadratic nonresidue modulo p if p ≡ 3 (mod 4).
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT