# Die ganzen zahlen hat Gott gemacht

Size: px
Start display at page:

## Transcription

1 Die ganzen zahlen hat Gott gemacht Polynomials with integer values B.Sury A quote attributed to the famous mathematician L.Kronecker is Die Ganzen Zahlen hat Gott gemacht, alles andere ist Menschenwerk. A translation might be God gave us integers and all else is man s work. All of us are familiar already from middle school with the similarities between the set of integers and the set of all polynomials in one variable. A paradigm of this is the Euclidean (division) algorithm. However, it requires an astute observer to notice that one has to deal with polynomials with real or rational coefficients rather than just integer coefficients for a strict analogy. There are also some apparent dissimilarities - for instance, there is no notion among integers corresponding to the derivative of a polynomial. In this discussion, we shall consider polynomials with integer coefficients. Of course a complete study of this encompasses the whole subject of algebraic number theory, one might say. For the most of this article (in fact, with the exception of 2.3,2.4 and 4.3), we stick to fairly elementary methods and address a number of rather natural questions. To give a prelude, one such question might be if an integral polynomial takes only values which are perfect squares, then must it be the square ( ) of a polynomial? Note that for a natural number n, X the polynomial takes integer values at all integers n = X(X 1) (X n+1) n(n 1) 1 although it does not have integer coefficients. 1 Prime values and irreducibility The first observation about polynomials taking integral values is the Lemma 1.1 ( ) X A polynomial P takes Z to Z if, and only if, P (X) = a 0 + a ( ) 1 X a n for some a n i in Z. Proof: The sufficiency is evident. For the converse, we first note that any polynomial whatsoever can be written in this form for some n and 1

2 some (possibly nonintegral) a is. Writing P in this form and assuming that P (Z) Z, we have P (0) = a 0 Z P (1) = a 0 + a 1 Z ( ) 2 P (2) = a 0 + a 1 + a 1 2 Z and so on. Inductively, since P (m) Z m, we get a i Z i. Corollary 1.2 If a polynomial P takes Z to Z and has degree n, then n!p (X) Z[X]. Lemma 1.3 A nonconstant integral polynomial P (X) cannot take only prime values. Proof: If all values are composite, then there is nothing to prove. So, assume that P (a) = p for some integer a and prime p. Now, as P is nonconstant, lim P (a + np) =. So, for big enough n, P (a + np) > p. But n P (a + np) P (a) 0 mod p, which shows P (a + np) is composite. Remark 1.4 Infinitely many primes can occur as integral values of a polynomial. For example, if (a, b) = 1, then the well-known (but deep) Dirichlet s theorem on primes in progression shows that the polynomial ax + b takes infinitely many prime values. In general, it may be very difficult to decide whether a given polynomial takes infinitely many prime values. For instance, it is not known if X represents infinitely many primes. In fact, there is no polynomial of degree 2 which takes infinitely many prime values. Lemma 1.5 If P is a nonconstant, integral-valued polynomial, then the number of prime divisors of its values {P (m)} m Z, is infinite i.e. not all terms of the sequence P (0), P (1), can be built from finitely many primes. Proof: It is clear from the note above that it is enough to prove this for P (X) Z[X], which we will henceforth assume. Now, P (X) = n i=0 a i X i where n 1. If a 0 = 0, then clearly P (p) 0 mod p for any prime p. If a 0 0, let us consider for any integer t, the polynomial } n n P (a 0 tx) = a i (a 0 tx) i = a 0 {1 + a i a i 1 0 t i X i = a 0 Q(X). i=0 2 i=1

3 There exists some prime number p such that Q(m) 0 mod p for some m and some prime p, because Q can take the values 0,1,-1 only at finitely many points. Since Q(m) 1 mod t, we have (p, t) = 1. Then P (a 0 tm) 0 mod p. Since t was arbitrary the set of p arising in this manner is infinite. Remark 1.6 (a) Note that it may be possible to construct infinitely many terms of the sequence {P (m)} m Z using only a finite number of primes. For example take (a, d) = 1, a d 1. Since, by Euler s theorem, a ϕ(d) 1 mod d, the numbers a(aϕ(d)n 1) d Z n. For the polynomial P (X) = dx + a, the infinitely many values P ( a d (aϕ(d)n 1)) = a ϕ(d)n+1 have only prime factors coming from primes dividing a. (b) In order that the values of an integral polynomial P (X) be prime for infinitely many integers, P (X) must be irreducible over Z and of content 1. By content, we mean the greatest common divisor of the coefficients. In general, it is difficult to decide whether a given integral polynomial is irreducible or not. We note that the irreducibility of P (X) and the condition that it have content 1, are not sufficient to ensure that P (X) takes infinitely many prime values. For instance, the polynomial X n + 105X + 12 is irreducible, by Eisenstein s criterion (see box). But, it cannot take any prime value because it takes only even values and it does not take either of the values ±2 since both X n + 105X + 10 and X n + 105X + 14 are irreducible, again by Eisenstein s criterion. Lemma 1.7 Let a 1,, a n be distinct integers. Then P (X) = (X a 1 ) (X a n ) 1 is irreducible. Proof: Suppose, if possible, P (X) = f(x)g(x) with deg.f, deg.g < n. Evidently, f(a i ) = g(a i ) = ±1 1 i n. Now, f(x) + g(x) being a polynomial of degree < n which vanishes at the n distinct integers a 1,, a n must be identically zero. This gives P (X) = f(x) 2 but this is impossible as can be seen by comparing the coefficients of X n. Exercise 1.8 Let n be odd and a 1,, a n be distinct integers. Prove that (X a 1 ) (X a n ) + 1 is irreducible. Let us consider the following situation. Suppose p = a n a 0 is a prime number expressed in the usual decimal system i.e. p = a a a n a n, 0 a i 9. Then, is the polynomial a 0 + a 1 X + + a n X n 3

4 irreducible? This is, in fact, true and, more generally Lemma 1.9 Let P (X) Z[X] and assume that there exists an integer n such that (i) the zeros of P lie in the half plane Re(z) < n 1 2. (ii) P (n 1) 0 (iii) P (n) is a prime number. Then P (X) is irreducible. Proof: Suppose, if possible P (X) = f(x)g(x) over Z. All the zeros of f(x) also lie in Re(z) < n 1 2. Therefore, f(n 1 2 t) < f(n 1 2 +t) t > 0. Since f(n 1) 0 and f(n 1) is integral, we have f(n 1) 1. Thus f(n) > f(n 1) 1. A similar thing holding for g(x), we get that P (n) has proper divisors f(n), g(n) which contradicts our hypothesis. 2 Irreducibility and congruence modulo p For an integral polynomial to take the value zero at an integer or even to be reducible, it is clearly necessary that these properties hold modulo any integer m. Conversely, if P (X) has a root modulo any integer, it must itself have a root in Z. In fact, if P (X) Z[X] has a linear factor modulo all but finitely many prime numbers, the P (X) itself has a linear factor. This fact can be proved only by deep methods viz. using the so-called Ćebotarev density theorem. On the other hand, (see lemma..) it was first observed by Hilbert that the reducibility of a polynomial modulo every integer is not sufficient to guarantee its reducibility over Z. Regarding roots of a polynomial modulo a prime, there is following general result due to Lagrange : Lemma 2.1 Let p be a prime number and let P (X) Z[X] be of degree n. Assume that not all coefficients of P are multiples of p. Then the number of solutions mod p to P (X) 0 mod p is, at the most, n. The proof is obvious using the division algorithm over Z/p. In fact, the general result of this kind (provable by the division algorithm again) is that a nonzero polynomial over any field has at the most its degree number of roots. Remark 2.2 4

5 Since 1, 2,, p 1 are solutions to X p 1 1 mod p, we have X p 1 1 (X 1)(X 2) (X (p 1)) mod p For odd p, putting X = 0 gives Wilson s theorem that (p 1)! 1 mod p. Note that we have observed earlier that any integral polynomial has a root modulo infinitely many primes. However, as first observed by Hilbert, the reducibility of a polynomial modulo every integer does not imply its reducibility over Z. For example, we have the following result: Lemma 2.3 Let p, q be odd prime number such that ( p q ) = ( q p ) = 1 and p 1 mod 8. Here ( p q ) denotes the Legendre symbol defined to be 1 or 1 according as p is a square or not modulo q. Then, the polynomial P (X) = (X 2 p q) 2 4pq is irreducible whereas it is reducible modulo any integer. Proof: P (X) = X 4 2(p + q)x 2 + (p q) 2 = (X p q)(x + p + q)(x p + q)(x + p q). Since p, q, p± q, pq are all irrational, none of the linear or quadratic factors of P (X) are in Z[X] i.e. P (X) is irreducible. Note that it is enough to show that a factorisation of P exists modulo any prime power as we can use Chinese reminder theorem to get a factorisation modulo a general integer. Now, P (X) can be written in the following ways: P (X) = X 4 2(p + q)x 2 + (p q) 2 = (X 2 + p q) 2 4pX 2 = (X 2 p + q) 2 4qX 2 = (X 2 p q) 2 4pq. The second and third equalities above show that P (X) is reducible modulo any p n and any q n. Also since p 1 mod 8, p is a quadratic residue modulo any 2 n and the second equality above again shows that P (X) is the difference of two squares modulo 2 n, and hence reducible mod 2 n. If l is a prime 2, p, q, let us show now that P (X) is reducible modulo l n for any n. 5

6 At least one of ( p l ), ( q pq l ) and ( l ) is 1 because, by the product formula for Legendre symbols, ( p l ) ( q l ) ( pq l ) = 1. According as ( p l ), ( q pq l ) or ( l ) = 1, the second, third or fourth equality shows that P (X) is reducible mod l n for any n. We end this section with a result of Schur whose proof is surprising and elegant as well. This is: Schur s theorem 2.4 For any n, the truncated exponential polynomial E n (X) = n!(1 + X + X2 + Xn n! ) is irreducible over Z. 2! + Just for this proof, we need some nontrivial number theoretic facts. A reader unfamiliar with these notions but one who is prepared to accept at face value a couple of results can still appreciate the beauty of Schur s proof. Here is where we have to take recourse to some very basic facts about prime decomposition in algebraic number fields. Start with any (complex) root α of f and look at the field K = Q(α) of all those complex numbers which can be written as polynomials in α with coefficients from Q. The basic fact that we will be using (without proof) is that any nonzero ideal in the ring of integers of K (i.e., the subring O K of K made up of those elements which satisfy a monic integral polynomial) is uniquely a product of nonzero prime ideals and a prime ideal can occur only at the most the degree times. This is a good replacement for K of the usual unique factorisation of natural numbers into prime numbers. The proof also uses a fact about prime numbers observed by Sylvester but is not trivial to prove. Sylvester s theorem If m r, then (m + 1)(m + 2) (m + r) has a prime factor p > r. The special case m = r is known as Bertrand s postulate. Proof of Schur s theorem Suppose, if possible, that E n (X) = f(x)g(x) for some nonconsant, irreducible integral polynomial f. Let us write f(x) = a 0 + a 1 X + + X r (evidently, we may take the top coefficients of f to be 1). Now, the proof uses the following observation which is interesting in its own right: Observation: Any prime dividing the constant term a 0 of f is less than the degree r of f. To see this, note first that N(α), the norm of α (a name for the product of 6

7 all the roots of the minimal polynomial f of α) is a 0 upto sign. So, there is a prime ideal P of O K so that (α) = P k I, (p) = P l J where I, J are indivisible by P and k, l 1. Here, (α) and (p) denote, respectively, the ideal of O K generated by α and p. Since E n (α) = 0, we have 0 = n! + n!α + n!α 2 /2! + + α n We know that the exact power of p dividing n! is h n = [n/p] + [n/p 2 ] + Thus, in O K, the ideal (n!) is divisible by P lhn and no higher power of P. Similarly, for 1 i n, the ideal generated by n!α i /i! is divisible by P lhn lhi+ki. Because of the equality n! = n!α + n!α 2 /2! + + α n, it follows that we cannot have lh n lh i + ki cannot be strictly bigger than lh n which is the exact power of P dividing the left hand side. Therefore, there is some i so that lh i + ki 0. Thus, i ki lh i = l([i/p] + [i/p 2 ] + ) < li p 1 Thus, p 1 < l r i.e., p r. This confirms the observation. To cotinue with the proof, we may clearly assume that the degree r of f at most n/2. Now, we use Sylvester s theorem to choose a prime q > r dividing the product n(n 1) (n r+1). Note that we can use this theorem because the smallest term n r + 1 of this r-fold consecutive product is bigger than r as r n/2. Note also that the observation tells us that q cannot divide a 0. Now, we shall write E n (X) modulo the prime q. By choice, q divides the coefficients of X i for 0 i n r. So, f(x)g(x) X n + n! Xn 1 (n 1)! + + n! Xn r+1 (n r+1)! mod q. Write f(x) = a 0 + a 1 X + + X r and g(x) = b 0 + b 1 X + + X n r. The above congruence gives a 0 b 0 0, a 0 b 1 + a 1 b 0 0 etc. mod q until the coefficient of X n r of f(x)g(x). As a 0 0 mod q, we get recursively (this is just like the proof of Eisenstein s criterion - see box) that b 0 b 1 b n r 0 mod q This is impossible as b n r = 1. Thus, Schur s assertion follows. 3 Polynomials taking square values 7

8 If an integral polynomial takes only values which are squares, is it true that the polynomial itself is a square of a polynomial? In this section, we will show that this, and more, is indeed true. Lemma 3.1 Let P (X) be a Z-valued polynomial which is irreducible. If P is not a constant, then there exist arbitarily large integers n such that P (n) 0 and P (n) 0 mod p 2 for some prime p. Proof: First, suppose that P (X) Z[X]. Since P is irreducible, P and P have no common factors. Write f(x)p (X) + g(x)p (X) = 1 for some f, g Z[X]. By lemma 1.5, there is a prime p such that P (n) 0 mod p where n can be as large as we want. So, P (n) 0 mod p as f(n)p (n) = g(n)p (n) = 1. Since P (n + p) P (n) P (n) mod p 2, either P (n + p) or P (n) is 0 mod p 2. To prove the result for general P, one can replace P by m! P where m = deg P. Lemma 3.2 Let P (X) be a Z-valued polynomial such that the zeros of smallest multiplicity have multiplicity m. Then, there exist arbitrarily large integers n such that P (n) 0 mod p m, P (n) 0 mod p m+1 for some prime p. Proof: Let P 1 (X),, P r (X) be the distinct irreducible factors of P (X). Write P (X) = P 1 (X) m1 P r (X) mr with m = m 1 m r. By the above lemma, one can find arbirarily large n such that for some prime p, P 1 (n) 0 mod p, P 1 (n) 0 mod p 2 and, P i (n) 0 mod p for i > 1. Then, P (n) 0 mod p m and 0 mod p m+1. Corollary 3.3 If P (X) takes at every integer, a value which is the k-th power of an integer, then P (X) itself is the k-th power of a polynomial. Proof: If P (X) is not an exact k-th power, then one can write P (X) = f(x) k g(x) for polynomials f, g so that g(x) has a zero whose multiplicity is < k. Once again, we can choose n and a prime p such that g(n) 0 mod p, 0 mod p k. This contradicts the fact that P (n) is a k-th power. 4 Cyclotomic polynomials These were referred to already in an earlier article ([1]). It was also shown there that one could use these polynomials to prove the existence of infinitely many parimes congruent to 1 modulo n for any n. For a natural number d, recall that the cyclotomic polynomial Φ d (X) is the irreducible, monic 8

9 polynomial whose roots are the primitive d-th roots of unity i.e. Φ d (X) = a d:(a,d)=1 (X e2πa/d ). Note that Φ 1 (X) = X 1 and that for a prime p, Φ p (X) = X p X + 1. Observe that for any n 1, X n 1 = d/n Φ d(x). Exercise 4.1 (i) Prove that for any d, Φ d (X) has integral coefficients. (ii) Prove that for any d, Φ d (X) is irreducible over Q. Factorising an integral polynomial into irreducible factors is far from easy. Even if we know the irreducible factors, it might be difficult to decide whether a given polynomial divides another given one. a i a j i j Exercises 4.2 (a) Given positive integers a 1 < < a n, consider the polynomials P (X) = i>j (Xa i a j 1) and Q(X) = i>j (Xi j 1). By factorising into cyclotomic polynomials, prove that Q(X) divides P (X). Conclude that i>j is always an integer. (b) Consider [ the] n n matrix A whose (i, j)-th entry is the Gaussian poly- a i nomial. j 1 Compute deta to obtain the same conclusion as in part (a). [ Here, ] for m r > 0, the Gaussian polynomial is defined [ ] as m = (Xm 1)(X m 1 1) (X m r+1 1) m. Note that = r (X r 1)(X r 1 1) (X 1) r X r [ m 1 r ]. [ m 1 r 1 It seems from looking at Φ p (X) for prime p as though the coefficients of the cyclotomic polynomials Φ d (X) for any d are all 0, 1 or 1. However, the following rather amazing thing was discovered by Schur. His proof uses a consequence of a deep result about prime numbers known as the prime number theorem. The prime-number theorem tells us that π(x) x/log(x) as x. Here π(x) denotes the number of primes until x. The reader does not need to be familiar with the prime number theorem but is urged to take on faith the consequence of it that for any constant c, there is n such that π(2 n ) cn. ] + 9

10 Proposition 4.3 Every integer occurs as a coefficient of some cyclotomic polynomial. Proof: First, we claim that for any integer t > 2, there are primes p 1 < p 2 < < p t such that p 1 + p 2 > p t. Suppose this is not true. Then, for some t > 2, every set of t primes p 1 < < p t satisfies p 1 + p 2 p t. So, 2p 1 < p t. Therefore, the number of primes between 2 k and 2 k+1 for any k is less than t. So, π(2 k ) < kt. This contradicts the prime-number theorem as noted above. Hence, it is indeed true that for any integer t > 2, there are primes p 1 < p 2 < < p t such that p 1 + p 2 > p t. Now, let us fix any odd t > 2. We shall demonstrate that both t + 1 and t + 2 occur as coefficents. This will prove that all negative integers occur as coefficients. Then, using the fact that for an odd m > 1, Φ 2m (X) = Φ m ( X), we can conclude that all integers are coefficients. Consider now primes p 1 < p 2 < < p t such that p 1 +p 2 > p t. Write p t = p for simplicity. Let n = p 1 p t and let us write Φ n (X) modulo X p+1. Since X n 1 = d/n Φ d (X), and since p 1 + p 2 > p t, we have Φ n (X) t i=1 1 X p i 1 X (1 + + Xp )(1 X p 1 ) (1 X pt ) (1 + + X p )(1 X p 1 X pt ) mod X p+1 Therefore, the coefficients of X p and X p 2 are 1 t and 2 t respectively. This completes the proof. Note that in the proof, we have used the fact that if P (X) = (1 X r )Q(X) for a polynomial Q(X), then Q(X) = P (X)(1 + X r + X 2r + + ) modulo any X k. Exercise 4.4 (a) Let A = (a ij ) be a matrix in GL(n, Z) i.e., both A and A 1 have integer entries. Consider the polynomials p i (X) = n j=0 a ij X j for 0 i n. Prove that any integral polynomial of degree at most n is an integral linear combination of the p i (X). In particular, if a 0,..., a n Q are distinct, show that any rational polynomial of degree at most n is of the form n λ i (X+a i ) n for some λ i Q. (b) Prove that 1+X+...+X n [ n 2 ] ( ) n i = ( 1) i X i=0 i i (1+X) n 2i. Conclude that ( ) n i = 1+ρ+ +ρn i 0 i (1+ρ) where ρ is either root of X 2 + 3X + 1 = 0. n Further, compute ( ) n i ( 1) i. i i 0 10 i=0

11 Remark 4.5 It is easily seen by induction that ( ) n i is just the (n+1)-th Fibonacci i 0 i number F n+1. Thus, exercise (b) provides an expression for F n+1. This expression makes it easy to prove the following identities: (a) F n + F n+1 = F n+2. (b) F n+1 F n 1 = Fn 2 + ( 1) n. z 1 z z 2. (c) F n z n = (d) Fn 2 + Fn+1 2 = F 2n+1. Notice that only (a) seems obvious from the expression F n+1 = i 0 ( ) n i. i As we remarked earlier, even for a polynomial of degree 2 (like X 2 + 1) it is unknown whether it takes infinitely many prime values. A general conjecture in this context is: Conjecture 4.6 (Bouniakowsky, Schinzel and Sierpinski) A nonconstant irreducible integral polynomial whose coefficients have no nontrivial common factor always takes on a prime value. It is appropriate to recall here that the polynomial X 2 + X + 41 takes prime values at X = 40, 39,..., 0, 1,..., 39 ([2]). We end with an open question which is typical of number-theoretic questions - a statement which can be understood by the proverbial layman but an answer which proves elusive to this day to professional mathematicians. For any irreducible, monic, integral polynomial P (X), define its Mahler measure to be M(P ) = i Max( α i, 1) where the product is over the roots of P. The following is an easy exercise. Exercise 4.7 M(P ) = 1 if, and only if, P is cyclotomic. D.H.Lehmer posed the following question: Does there exist a constant C > 0 such that M(P ) > 1 + C for all noncyclotomic (irreducible) polynomials P? This is expected to have an affirmative answer and, indeed, Lehmer s calculations indicate that the smallest possible value of M(P ) 1 is , which occurs for the polynomial P (X) = X 10 + X 9 X 7 X 6 X 5 X 4 X 3 + X + 1. Lehmer s question can be formulated in terms of discrete subgroups of Lie 11

12 groups. One may not be able to predict when it can be answered but it is more or less certain that one will need tools involving deep mathematics. Box item: Eisenstein s criterion and more Perhaps the only general criterion known to check whether an integral polynomial of a special kind is irreducible is due to G.Eisenstein, a student of Gauss and an outstanding mathematician whom Gauss rated above himself. Eisenstein died when he was 27. Let f(x) = a 0 + a 1 X + + a n X n be an integral polynomial satisfying the following property with respect to some prime p. The prime p divides a 0, a 1,, a n 1 but does not divide a n. Also, assume that p 2 does not divide a 0. Then, f is irreducible. The proof is indeed very simple high school algebra. Suppose, if possible, that f(x) = g(x)h(x) = (b 0 + b 1 X + + b r X r )(c 0 + c 1 X + + c s X s ) with r, s 1. Comparing coefficients, one has a 0 = b 0 c 0, a 1 = a 0 b 1 + b 0 a 1,, a n = b r c s, r + s = n. Since a 0 = b 0 c 0 0 mod p, either b 0 0 mod p or c 0 0 mod p. To fix notations, we may assume that b 0 0 mod p. Since a 0 0 mod p 2, we must have c 0 0 mod p. Now a 1 = b 0 c 1 + b 1 c 0 b 1 c 0 mod p; so b 1 0 mod p. Proceeding inductively in this maner, it is clear that all the b i s are multiples of p. This is a manifest contradiction of the fact that a n = b r c s is not a multiple of p. This finishes the proof. It may be noted that one may reverse the roles of a 0 and a n and obtain another version of the criterion: Let f(x) = a 0 + a 1 X + + a n X n be an integral polynomial satisfying the following property with respect to some prime p. The prime p divides a 1, a 2,, a n but does not divide a 0. Also, assume that p 2 does not divide a n. Then, f is irreducible. The following generalisation is similar to prove and is left as an exercise. Let f(x) = a 0 + a 1 X + + a n X n be an integral polynomial satisfying the following property with respect to some prime p. Let t be such that the prime p divides a 0, a 1,, a n t but does not divide a n. Also, assume that p 2 does not divide a 0. Then, f is either irreducible or it has a nonconstant factor of degree less than t. References quoted and other reading suggested 12

13 [1] B.Sury, Cyclotomy, Resonance, Vol.4, No.12, P [2] Tejaswi, Resonance, Vol.4, No.6, P Polya & Szego - Problems in analysis, I & II. 13

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu

Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

### Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

### 7. Some irreducible polynomials

7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of

### The cyclotomic polynomials

The cyclotomic polynomials Notes by G.J.O. Jameson 1. The definition and general results We use the notation e(t) = e 2πit. Note that e(n) = 1 for integers n, e(s + t) = e(s)e(t) for all s, t. e( 1 ) =

### Unique Factorization

Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon

### 3 1. Note that all cubes solve it; therefore, there are no more

Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if

### Introduction to Finite Fields (cont.)

Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

### PROBLEM SET 6: POLYNOMIALS

PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other

### Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2) Kevin Broughan University of Waikato, Hamilton, New Zealand May 13, 2010 Remainder and Factor Theorem 15 Definition of factor If f (x)

### H/wk 13, Solutions to selected problems

H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

### Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com

Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).

### Factoring Polynomials

Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent

### Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

### A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number

Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### FACTORING SPARSE POLYNOMIALS

FACTORING SPARSE POLYNOMIALS Theorem 1 (Schinzel): Let r be a positive integer, and fix non-zero integers a 0,..., a r. Let F (x 1,..., x r ) = a r x r + + a 1 x 1 + a 0. Then there exist finite sets S

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### The Division Algorithm for Polynomials Handout Monday March 5, 2012

The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,

### Primality - Factorization

Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.

### POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

### 11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### The van Hoeij Algorithm for Factoring Polynomials

The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial

### 3 Factorisation into irreducibles

3 Factorisation into irreducibles Consider the factorisation of a non-zero, non-invertible integer n as a product of primes: n = p 1 p t. If you insist that primes should be positive then, since n could

### QUADRATIC RECIPROCITY IN CHARACTERISTIC 2

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets

### RESULTANT AND DISCRIMINANT OF POLYNOMIALS

RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results

### FACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set

FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is called a quadratic field and it has degree 2 over Q. Similarly,

### Cyclotomic Extensions

Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### calculating the result modulo 3, as follows: p(0) = 0 3 + 0 + 1 = 1 0,

Homework #02, due 1/27/10 = 9.4.1, 9.4.2, 9.4.5, 9.4.6, 9.4.7. Additional problems recommended for study: (9.4.3), 9.4.4, 9.4.9, 9.4.11, 9.4.13, (9.4.14), 9.4.17 9.4.1 Determine whether the following polynomials

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

### Alex, I will take congruent numbers for one million dollars please

Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

### Factorization Algorithms for Polynomials over Finite Fields

Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is

### Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients

DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca

### minimal polyonomial Example

Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### Math 345-60 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field

Math 345-60 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field 1. Throughout this section, F is a field and F [x] is the ring of polynomials with coefficients in F. We will

### MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

### Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### Putnam Notes Polynomials and palindromes

Putnam Notes Polynomials and palindromes Polynomials show up one way or another in just about every area of math. You will hardly ever see any math competition without at least one problem explicitly concerning

### Factorization in Polynomial Rings

Factorization in Polynomial Rings These notes are a summary of some of the important points on divisibility in polynomial rings from 17 and 18 of Gallian s Contemporary Abstract Algebra. Most of the important

### 9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role

### Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a

### Number Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures

Number Theory Hungarian Style Cameron Byerley s interpretation of Csaba Szabó s lectures August 20, 2005 2 0.1 introduction Number theory is a beautiful subject and even cooler when you learn about it

### r + s = i + j (q + t)n; 2 rs = ij (qj + ti)n + qtn.

Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in

### The finite field with 2 elements The simplest finite field is

The finite field with 2 elements The simplest finite field is GF (2) = F 2 = {0, 1} = Z/2 It has addition and multiplication + and defined to be 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 0 0 0 = 0 0 1 = 0

### ALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY

ALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY HENRY COHN, JOSHUA GREENE, JONATHAN HANKE 1. Introduction These notes are from a series of lectures given by Henry Cohn during MIT s Independent Activities

### ON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]]

#A47 INTEGERS 4 (204) ON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]] Daniel Birmaer Department of Mathematics, Nazareth College, Rochester, New Yor abirma6@naz.edu Juan B. Gil Penn State Altoona,

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Factoring Algorithms

Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### Factoring of Prime Ideals in Extensions

Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree

### An Introductory Course in Elementary Number Theory. Wissam Raji

An Introductory Course in Elementary Number Theory Wissam Raji 2 Preface These notes serve as course notes for an undergraduate course in number theory. Most if not all universities worldwide offer introductory

### THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

### 8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

### Non-unique factorization of polynomials over residue class rings of the integers

Comm. Algebra 39(4) 2011, pp 1482 1490 Non-unique factorization of polynomials over residue class rings of the integers Christopher Frei and Sophie Frisch Abstract. We investigate non-unique factorization

### Doug Ravenel. October 15, 2008

Doug Ravenel University of Rochester October 15, 2008 s about Euclid s Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we

### A Course on Number Theory. Peter J. Cameron

A Course on Number Theory Peter J. Cameron ii Preface These are the notes of the course MTH6128, Number Theory, which I taught at Queen Mary, University of London, in the spring semester of 2009. There

### Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

### FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it

### SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### Chapter 1. Search for Good Linear Codes in the Class of Quasi-Cyclic and Related Codes

Chapter 1 Search for Good Linear Codes in the Class of Quasi-Cyclic and Related Codes Nuh Aydin and Tsvetan Asamov Department of Mathematics, Kenyon College Gambier, OH, USA 43022 {aydinn,asamovt}@kenyon.edu

### Congruence properties of binary partition functions

Congruence properties of binary partition functions Katherine Anders, Melissa Dennison, Jennifer Weber Lansing and Bruce Reznick Abstract. Let A be a finite subset of N containing 0, and let f(n) denote

### Factoring Cubic Polynomials

Factoring Cubic Polynomials Robert G. Underwood 1. Introduction There are at least two ways in which using the famous Cardano formulas (1545) to factor cubic polynomials present more difficulties than

### On the largest prime factor of x 2 1

On the largest prime factor of x 2 1 Florian Luca and Filip Najman Abstract In this paper, we find all integers x such that x 2 1 has only prime factors smaller than 100. This gives some interesting numerical

### JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials

### 15. Symmetric polynomials

15. Symmetric polynomials 15.1 The theorem 15.2 First examples 15.3 A variant: discriminants 1. The theorem Let S n be the group of permutations of {1,, n}, also called the symmetric group on n things.

### SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

### SOLVING POLYNOMIAL EQUATIONS

C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra

### Factoring & Primality

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

### (a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9

Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned

### ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

### Continued Fractions. Darren C. Collins

Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history

### Lectures on Number Theory. Lars-Åke Lindahl

Lectures on Number Theory Lars-Åke Lindahl 2002 Contents 1 Divisibility 1 2 Prime Numbers 7 3 The Linear Diophantine Equation ax+by=c 12 4 Congruences 15 5 Linear Congruences 19 6 The Chinese Remainder

### 1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

### Algebra 3: algorithms in algebra

Algebra 3: algorithms in algebra Hans Sterk 2003-2004 ii Contents 1 Polynomials, Gröbner bases and Buchberger s algorithm 1 1.1 Introduction............................ 1 1.2 Polynomial rings and systems

### March 29, 2011. 171S4.4 Theorems about Zeros of Polynomial Functions

MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial

### Prime numbers and prime polynomials. Paul Pollack Dartmouth College

Prime numbers and prime polynomials Paul Pollack Dartmouth College May 1, 2008 Analogies everywhere! Analogies in elementary number theory (continued fractions, quadratic reciprocity, Fermat s last theorem)

### Monogenic Fields and Power Bases Michael Decker 12/07/07

Monogenic Fields and Power Bases Michael Decker 12/07/07 1 Introduction Let K be a number field of degree k and O K its ring of integers Then considering O K as a Z-module, the nicest possible case is

### Settling a Question about Pythagorean Triples

Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### The last three chapters introduced three major proof techniques: direct,

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements