Chapter 9: Problem 2
Use Gauss's lemma to compute each of the Legendre symbols below (that is, in each case obtain the integer \(n\) for which \((a / p)=(-1)^{n}\) ): (a) \((8 / 11)\). (b) \((7 / 13)\). (c) \((5 / 19)\). (d) \((11 / 23)\). (e) \((6 / 31)\).
Short Answer
Expert verified
(8/11)=-1, (7/13)=-1, (5/19)=1, (11/23)=-1, (6/31)=-1.
Step by step solution
01
Understanding Gauss's Lemma
Gauss's lemma states that if \( p \) is an odd prime and \( a \) is an integer not divisible by \( p \), then the Legendre symbol \( \left( \frac{a}{p} \right) = (-1)^n \), where \( n \) is the number of integers \( k \) such that \( 1 \leq k \leq \frac{p-1}{2} \) and \( a \cdot k \equiv -m \pmod{p} \) for some \( m \) satisfying \( 0 < m \leq \frac{p}{2} \). Our task is to compute \( n \) for each Legendre symbol.
02
Solve (a): \((8/11)\)
List the multiples of 8: \( 8 \), \( 16 \), \( 24 \), \( 32 \), \( 40 \). Reduce modulo 11: \( 8 \), \( 5 \), \( 2 \), \( 10 \), \( 7 \). Count numbers greater than 5: these are \( 8, 10, 7 \), giving us 3 numbers. As \( n = 3 \), \( \left( \frac{8}{11} \right) = (-1)^3 = -1 \).
03
Solve (b): \((7/13)\)
List the multiples of 7: \( 7, 14, 21, 28, 35, 42 \). Reduce modulo 13: \( 7, 1, 8, 2, 9, 3 \). Count numbers greater than 6: \( 7, 8, 9 \), providing 3 numbers. Since \( n = 3 \), \( \left( \frac{7}{13} \right) = (-1)^3 = -1 \).
04
Solve (c): \((5/19)\)
List the multiples of 5: \( 5, 10, 15, 20, 25, 30, 35, 40, 45 \). Reduce modulo 19: \( 5, 10, 15, 1, 6, 11, 16, 2, 7 \). Count numbers greater than 9: \( 10, 15, 11, 16 \), which is 4 numbers. Therefore, \( n = 4 \) and \( \left( \frac{5}{19} \right) = (-1)^4 = 1 \).
05
Solve (d): \((11/23)\)
List the multiples of 11: \( 11, 22, 33, 44, 55, 66, 77, 88, 99, 110, 121 \). Reduce modulo 23: \( 11, 22, 10, 21, 9, 20, 8, 19, 7, 18, 6 \). Count numbers greater than 11: \( 22, 21, 20, 19, 18 \), which is 5 numbers. Thus, \( n = 5 \) and \( \left( \frac{11}{23} \right) = (-1)^5 = -1 \).
06
Solve (e): \((6/31)\)
List the multiples of 6: \( 6, 12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 72, 78, 84, 90 \). Reduce modulo 31: \( 6, 12, 18, 24, 30, 5, 11, 17, 23, 29, 4, 10, 16, 22, 28 \). Count numbers greater than 15: \( 18, 24, 30, 17, 23, 29, 16, 22, 28 \), which is 9 numbers. Therefore, \( n = 9 \) and \( \left( \frac{6}{31} \right) = (-1)^9 = -1 \).
Unlock Step-by-Step Solutions & Ace Your Exams!
-
Full Textbook Solutions
Get detailed explanations and key concepts
-
Unlimited Al creation
Al flashcards, explanations, exams and more...
-
Ads-free access
To over 500 millions flashcards
-
Money-back guarantee
We refund you if you fail your exam.
Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
Legendre Symbol
The Legendre Symbol is a mathematical notation used in number theory, particularly when dealing with quadratic residues. Essentially, it helps indicate if a quadratic equation has solutions in integers modulo an odd prime number. The symbol is presented as \( \left( \frac{a}{p} \right) \), where \( a \) is any integer, and \( p \) is an odd prime. It's defined as follows:
- \( \left( \frac{a}{p} \right) = 0 \) if \( a \equiv 0 \pmod{p} \).
- \( \left( \frac{a}{p} \right) = 1 \) if \( a \) is a quadratic residue modulo \( p \) and \( a ot\equiv 0 \pmod{p} \).
- \( \left( \frac{a}{p} \right) = -1 \) if \( a \) is a non-quadratic residue modulo \( p \).
Number Theory
Number theory is a branch of mathematics devoted to the study of integers and integer-valued functions. This area explores various properties of numbers, such as divisibility, prime numbers, and solving equations with integer solutions. It's a fascinating field that bridges pure mathematics with real-life applications like cryptography. Here are some aspects that make number theory interesting:
- **Prime Numbers:** The basic building blocks of number theory, primes can only be divided by 1 and themselves.
- **Divisibility Rules:** Understanding how and when a number can be exactly divided by another.
- **Modular Arithmetic:** A system of arithmetic for integers, where numbers "wrap around" after reaching a certain value, called the modulus.
- **Diophantine Equations:** Polynomial equations that require integer solutions, often leading to complex and rich problem-solving.
Modulo Operation
The modulo operation, often shortened to "mod," helps find a remainder after division of one number by another. Widely used throughout mathematics and computer science, "mod" plays a vital role in simplifying problems involving cycles and repeating patterns. Here's how it works:
- When you divide one number by another, the remainder is what’s left over after you subtract the largest possible multiple of the divisor without going over the dividend.
- The expression \( a \equiv b \pmod{n} \) means that when \( a \) is divided by \( n \), it leaves a remainder of \( b \).
- Practical applications of mod include clock arithmetic, where hours wrap around after reaching 12, or 24 in the case of a 24-hour clock.
Odd Prime
In mathematics, a prime number is a natural number greater than 1 that is not divisible by any other numbers except for 1 and itself. An odd prime is simply a prime that is not divisible by 2, which leaves us only with primes like 3, 5, 7, etc., excluding 2, which is the only even prime. These odd primes play a significant role in various mathematical theories and real-world applications.
- **Foundational Role:** Odd primes are key in the factorization of numbers, as every number can be uniquely expressed as a product of primes.
- **Modular Arithmetic:** Odd primes appear frequently in modular systems, simplifying the understanding and solving of equations.
- **Gauss's Lemma:** This lemma allows us to use odd primes in predicting the solvability of quadratic congruences.
- **Cryptography:** Odd primes are fundamental to encryption algorithms, including RSA, which protect our digital data.