Residues Modulo - Number Theory - Exam, Exams of Number Theory

This is the Exam of Number Theory which includes Residues Modulo, Nonnegative Integers, Positive Integers, Elements, Prime Divisor, Exist Infinitely, Integer Solution, Congruence etc. Key important points are: Residues Modulo, Nonnegative Integers, Positive Integers, Elements, Prime Divisor, Exist Infinitely, Integer Solution, Congruence, Satisfying, Positive Integral Pair

Typology: Exams

2012/2013

Uploaded on 02/18/2013

samudrai
samudrai 🇮🇳

4.6

(9)

76 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Comprehensive Exam, Summer 2003
for
MATH 780 & MATH 784
1. Let p1 (mod 4) be a prime number. Define Rto be the set of integers in {1,2, . . . , p 1}which are quadratic
residues modulo p, and Nto be the set of integers in {1,2, . . . , p 1}which are quadratic nonresidues modulo p.
(For example, if p= 5, then R={1,4}, and N={2,3}.) Prove that
X
n∈R
n=X
n∈N
n.
(In other words, show that the sum of the elements of the set Requals the sum of the elements of the set N.)
2. Let a2and b2be relatively prime integers. Let Sbe the set of positive integers which can be represented
in the form ak +bl with kand lnonnegative integers. (For example, it is not difficult to show that if a= 2 and
b= 3, then S={2,3,4,5, . . .}.) Prove that the largest positive integer which is not in Sis ab ab. (Hint: If
nis an integer, then at least one of the numbers n, n a, . . . , n (b1)ais divisible by b.)
3. Let nbe a positive integer.
(a) Find the order of 2modulo 22n+ 1.
(b) Let pbe a prime divisor of 22n+ 1. Prove that p1 (mod 2n+1).
(c) Let kbe a positive integer. Using (b), prove that there exist infinitely many primes which are congruent to 1
modulo 2k+1.
4. Let pbe a prime number.
(a) Suppose that pis odd and is not of the form 8k+ 5 with kan integer. Prove that the congruence a44
(mod p)has an integer solution.
(b) Suppose that pis of the form 8k+ 5 with kan integer. Prove that the congruence a4 4 (mod p)has an
integer solution.
(c) Prove that for any prime pthe congruence a816 (mod p)has an integer solution.
5. Let (xn, yn)denote the nth positive integral pair (x, y)satisfying x22y2= 1 (ordered so that x1< x2<·· ·).
Thus, for example, (x1, y1) = (3,2) and (x2, y2) = (17,12). Let pbe a prime. Prove that
xpx1(mod p)and ypy1(mod p) p ±1 (mod 8).
(Comment: This is meant to test your knowledge of both Math 780 and Math 784.)
6. Prove the following theorem from class, giving as many details as you can.
Theorem Let αbe an algebraic number with minimal polynomial f(x) = xn+Pn1
j=0 ajxjQ[x]. Every
element of Q(α)can be expressed uniquely in the form g(α)where g(x)Q[x]with g(x)0or
deg g(x)n1.
pf2

Partial preview of the text

Download Residues Modulo - Number Theory - Exam and more Exams Number Theory in PDF only on Docsity!

Comprehensive Exam, Summer 2003

for

MATH 780 & MATH 784

  1. Let p ≡ 1 (mod 4) be a prime number. Define R to be the set of integers in { 1 , 2 ,... , p − 1 } which are quadratic

residues modulo p, and N to be the set of integers in { 1 , 2 ,... , p − 1 } which are quadratic nonresidues modulo p. (For example, if p = 5, then R = { 1 , 4 }, and N = { 2 , 3 }.) Prove that ∑

n∈R

n =

n∈N

n.

(In other words, show that the sum of the elements of the set R equals the sum of the elements of the set N .)

  1. Let a ≥ 2 and b ≥ 2 be relatively prime integers. Let S be the set of positive integers which can be represented

in the form ak + bl with k and l nonnegative integers. (For example, it is not difficult to show that if a = 2 and b = 3, then S = { 2 , 3 , 4 , 5 ,.. .}.) Prove that the largest positive integer which is not in S is ab − a − b. (Hint: If n is an integer, then at least one of the numbers n, n − a,... , n − (b − 1)a is divisible by b.)

  1. Let n be a positive integer.

(a) Find the order of 2 modulo 22

n

(b) Let p be a prime divisor of 22

n

    1. Prove that p ≡ 1 (mod 2n+1).

(c) Let k be a positive integer. Using (b), prove that there exist infinitely many primes which are congruent to 1 modulo 2 k+ .

  1. Let p be a prime number.

(a) Suppose that p is odd and is not of the form 8 k + 5 with k an integer. Prove that the congruence a^4 ≡ 4 (mod p) has an integer solution.

(b) Suppose that p is of the form 8 k + 5 with k an integer. Prove that the congruence a^4 ≡ −4 (mod p) has an integer solution.

(c) Prove that for any prime p the congruence a 8 ≡ 16 (mod p) has an integer solution.

  1. Let (xn, yn) denote the n th positive integral pair (x, y) satisfying x 2 − 2 y 2 = 1 (ordered so that x 1 < x 2 < · · · ). Thus, for example, (x 1 , y 1 ) = (3, 2) and (x 2 , y 2 ) = (17, 12). Let p be a prime. Prove that

xp ≡ x 1 (mod p) and yp ≡ y 1 (mod p) ⇐⇒ p ≡ ± 1 (mod 8).

(Comment: This is meant to test your knowledge of both Math 780 and Math 784.)

  1. Prove the following theorem from class, giving as many details as you can.

Theorem Let α be an algebraic number with minimal polynomial f (x) = x n

∑n− 1 j=0 aj^ x

j ∈ Q[x]. Every element of Q(α) can be expressed uniquely in the form g(α) where g(x) ∈ Q[x] with g(x) ≡ 0 or deg g(x) ≤ n − 1_._

  1. Let R be the ring of algebraic integers in Q(

−47). Let I be the ideal in R generated by (3 +

−47)/ 2 and 2. Thus,

I =

(a) Is I principal? (In other words, does there exist an α ∈ R such that I = (α)?)

(b) Let

J =

The product of the ideals I and J is a principal ideal (β) for some β ∈ R. Find such a β.

(c) Compute the norm of the ideal I (in the ring R).

  1. The following concerns the Diophantine equation x 2 + 13 = y 3 . The class number (the size of the class group) associated with the field Q(

−13) is 2. In particular, the ring of integers R in Q(

−13) is not a PID.

(a) Suppose A is an ideal in R and A^3 is principal. Justify that A is necessarily a principal ideal in R. (Use that the class number is 2. You do not have to prove that the class number is 2 .)

(b) Suppose x 0 and y 0 are rational integers for which x^20 + 13 = y 03. Justify that gcd(y 0 , 26) = 1.

(c) With the notation in part (b), justify that the ideals

x 0 +

and

x 0 −

are relatively prime.

(d) Explain why there is a principal ideal

a + b

in R such that

x 0 +

a + b

(e) Solve the Diophantine equation x^2 + 13 = y^3 (i.e., find with proof all integer pairs (x 0 , y 0 ) such that x 2 0 + 13 =^ y

3 0 .)