

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
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
1 / 2
This page cannot be seen from the preview
Don't miss anything!


for
|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 ).
(a) x^2 − 3 x − 2 (b) x^3 + 4x^2 + x − 1
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.
(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.
(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.
(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.
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.