Perrons Theorem - 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: Perrons Theorem, Polynomials, Number of Zeroes, Region Bounded, Irreducible Monic Polynomial, Cyclotomic Polynomial, Positive Integer, Arbitrary Polynomial, Distinct Irreducible Polynomials, Irreducible Factor

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 788F & MATH 788G
1. Prove Perron’s theorem that if a0,a1, . . . , anare integers with an= 1,a06= 0, and
|an1|>|an|+|an2|+|an3|+· · · +|a1|+|a0|,
then anxn+an1xn1+· · · +a1x+a0is irreducible. You may use Rouch´
e’s theorem as stated below, but
otherwise your argument should be self-contained.
Rouch´
e’s Theorem Let f(x)and g(x)be polynomials in C[x], and let
C={zC:|z|= 1}.
If the strict inequality |f(z) + g(z)|<|f(z)|+|g(z)|holds for each z C, then f(x)and g(x)have
the same total number of zeroes (counted to their multiplicities) inside the circle C(i.e., in the interior
of the region bounded by C).
2. Determine whether each of the following is Eisenstein. Justify your answers.
(a) x23x2(b) x3+ 4x2+x1
3. Prove Kroncecker’s theorem that if f(x)is an irreducible monic polynomial with all of its roots on the unit circle
(i.e., all of its roots have absolute value 1), then f(x)is a cyclotomic polynomial.
4. Let nbe a positive integer, and set
Sn=f(x) =
n
X
j=0
εjxj:εj {0,1}for each jand ε0= 1.
Let g(x)be an arbitrary polynomial in Z[x]. Prove there are 2n/(n+ 1) polynomials in Sndivisible by g(x)2.
5. (a) Prove that x255 1factors modulo 2as a product of distinct irreducible polynomials each of degree 8.
(b) It follows from part (a) that each irreducible factor of x255 1modulo 2has degree in S={1,2,3, . . . , 8}.
Which numbers in Sactually occur as the degree of some irreducible factor of x255 1modulo 2? Justify your
answer.
6. (a) Prove that the non-reciprocal part of 1 + x+x2+x4+x8+x16 +x32 is irreducible.
(b) Prove that the non-reciprocal part of 1 + x+x2+x4+x8+· · · +x2nis irreducible for every integer n2.
7. We showed that if nis a positive integer and a1, a2, . . . , anare distinct integers, then
(xa1)(xa2)· · · (xan)1
is irreducible. Determine with justification whether or not there exists an Nsuch that if nis an integer Nand
a1, a2, . . . , anare rational numbers, then (xa1)(xa2)· · · (xan)1is irreducible over the rationals.
pf2

Partial preview of the text

Download Perrons Theorem - Number Theory - Exam and more Exams Number Theory in PDF only on Docsity!

Comprehensive Exam, Summer 2003

for

MATH 788F & MATH 788G

  1. Prove Perron’s theorem that if a 0 , a 1 ,... , an are integers with an = 1, a 0 6 = 0, and

|an− 1 | > |an| + |an− 2 | + |an− 3 | + · · · + |a 1 | + |a 0 |,

then anxn^ + an− 1 xn−^1 + · · · + a 1 x + a 0 is irreducible. You may use Rouch´e’s theorem as stated below, but otherwise your argument should be self-contained.

Rouch´e’s Theorem Let f (x) and g(x) be polynomials in C[x] , and let

C = {z ∈ C : |z| = 1}.

If the strict inequality |f (z) + g(z)| < |f (z)| + |g(z)| holds for each z ∈ C , then f (x) and g(x) have the same total number of zeroes (counted to their multiplicities) inside the circle C (i.e., in the interior of the region bounded by C ).

  1. Determine whether each of the following is Eisenstein. Justify your answers.

(a) x^2 − 3 x − 2 (b) x^3 + 4x^2 + x − 1

  1. Prove Kroncecker’s theorem that if f (x) is an irreducible monic polynomial with all of its roots on the unit circle (i.e., all of its roots have absolute value 1 ), then f (x) is a cyclotomic polynomial.
  2. Let n be a positive integer, and set

Sn =

f (x) =

∑^ n

j=

εj xj^ : εj ∈ { 0 , 1 } for each j and ε 0 = 1

Let g(x) be an arbitrary polynomial in Z[x]. Prove there are ≤ 2 n/(n + 1) polynomials in Sn divisible by g(x)^2.

  1. (a) Prove that x^255 − 1 factors modulo 2 as a product of distinct irreducible polynomials each of degree ≤ 8.

(b) It follows from part (a) that each irreducible factor of x^255 − 1 modulo 2 has degree in S = { 1 , 2 , 3 ,... , 8 }. Which numbers in S actually occur as the degree of some irreducible factor of x^255 − 1 modulo 2? Justify your answer.

  1. (a) Prove that the non-reciprocal part of 1 + x + x^2 + x^4 + x^8 + x^16 + x^32 is irreducible.

(b) Prove that the non-reciprocal part of 1 + x + x^2 + x^4 + x^8 + · · · + x^2 n is irreducible for every integer n ≥ 2.

  1. We showed that if n is a positive integer and a 1 , a 2 ,... , an are distinct integers, then

(x − a 1 )(x − a 2 ) · · · (x − an) − 1

is irreducible. Determine with justification whether or not there exists an N such that if n is an integer ≥ N and a 1 , a 2 ,... , an are rational numbers, then (x − a 1 )(x − a 2 ) · · · (x − an) − 1 is irreducible over the rationals.

  1. For m a positive integer, define

fm(x) = (54x^2 + 189)xm^ + (146x^6 − 54).

It is not the case that fm(x) is irreducible for every positive integer m. (a) Using Newton polygons, determine information about the factorization of fm(x). (This is vague. For the purposes of part (c) below and partial credit, in the event you do not complete this problem, you will want to be rather precise here.) (b) Prove that there is an absolute constant C (independent of m) such that if fm(α) = 0, then |α| ≤ C. (c) Explain how parts (a) and (b) imply that there are at most finitely many positive integers m for which fm(x) is reducible.