Mathematics Homework Solutions
#37808
Quadratic Reciprocity Law
Prove, using the quadratic reciprocity law that
(3/p) = 1 if p== 1 or 11 (mod 12)
(3/p) = -1 if p==5 or 7 (mod12)
for each odd prime p.
The Quadratic Reciprocity Law is invesigated. The solution is detailed and well presented. The response received a rating of "5" from the student who originally posted the question.
What is this?
By OTA - Overall OTA Rating
Yupei Xiong, PhD - 4.8/5
Purchase Cost Now
$2.19 CAD (was ~$7.98)
Included in Download
- Plain text response
- Attached file(s):
- 37808.doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Quadratic Reciprocity - Please see the attached file for the fully formatted problems. The Quadratic Reciprocity Theorem - If p and q are odd primes and , then (p/q) = -(q/p). Otherwise , (p/q) = (q/p). Show that the ...
- Number Theory. 400 level. Introductory Course in Undergraduate. - Topics usually include the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitiv ...
- Number Theory. 400 level. Introductory Course in Undergraduate. - Topics usually include the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitiv ...
- Quadratic Reciprocity - I need help with the following problem: Show that 3 is a quadratic nonresidue of all Mersenne primes greater than 3. Please show all work so that I understand the logic of each step of the proof ...
- Number Theory. 400 level. Introductory Course in Undergraduate. - Topics usually include the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitiv ...
