Question

Let p be an odd prime and let a be an odd integer with p not...

Let p be an odd prime and let a be an odd integer with p not divisible by a. Suppose that p = 4a + n2 for some integer n. Prove that the Legendre symbol (a/p) equals 1.

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
3.a) Let n be an integer. Prove that if n is odd, then (n^2) is also...
3.a) Let n be an integer. Prove that if n is odd, then (n^2) is also odd. 3.b) Let x and y be integers. Prove that if x is even and y is divisible by 3, then the product xy is divisible by 6. 3.c) Let a and b be real numbers. Prove that if 0 < b < a, then (a^2) − ab > 0.
Formal Proof: Let p be a prime and let a be an integer. Assume p ∤...
Formal Proof: Let p be a prime and let a be an integer. Assume p ∤ a. Prove gcd(a, p) = 1.
Problem 2: (i) Let a be an integer. Prove that 2|a if and only if 2|a3....
Problem 2: (i) Let a be an integer. Prove that 2|a if and only if 2|a3. (ii) Prove that 3√2 (cube root) is irrational. Problem 3: Let p and q be prime numbers. (i) Prove by contradiction that if p+q is prime, then p = 2 or q = 2 (ii) Prove using the method of subsection 2.2.3 in our book that if p+q is prime, then p = 2 or q = 2 Proposition 2.2.3. For all n ∈...
Supose p is an odd prime and G is a group and |G| = p 2...
Supose p is an odd prime and G is a group and |G| = p 2 ^n , where n is a positive integer. Prove that G must have an element of order 2
Prove that if p does not equal 5 is an odd prime number, then either p^2-1...
Prove that if p does not equal 5 is an odd prime number, then either p^2-1 or p^2+1 is divisible by 5.
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).
Let b be a primitive root for the odd prime p. Prove that b^k is a...
Let b be a primitive root for the odd prime p. Prove that b^k is a primitive root for p if and only if gcd(k, p − 1) = 1.
If p is an odd prime and if 1+ 1/2 +1/3 +...+1/p-1=a/b , where a,b are...
If p is an odd prime and if 1+ 1/2 +1/3 +...+1/p-1=a/b , where a,b are positive integers , prove that a is divisible by p.
Let n be an integer, with n ≥ 2. Prove by contradiction that if n is...
Let n be an integer, with n ≥ 2. Prove by contradiction that if n is not a prime number, then n is divisible by an integer x with 1 < x ≤√n. [Note: An integer m is divisible by another integer n if there exists a third integer k such that m = nk. This is just a formal way of saying that m is divisible by n if m n is an integer.]
If p = 2k − 1 is prime, show that k is an odd integer or...
If p = 2k − 1 is prime, show that k is an odd integer or k = 2. Hint: Use the difference of squares 22m − 1 = (2m − 1)(2m + 1).
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT