PERFECT POLYNOMIALS OVER F p WITH p + 1 IRREDUCIBLE DIVISORS. 1. Introduction. Let p be a prime number. For a monic polynomial A F p [x] let d
|
|
- Austin Jefferson
- 6 years ago
- Views:
Transcription
1 PERFECT POLYNOMIALS OVER F p WITH p + 1 IRREDUCIBLE DIVISORS L. H. GALLARDO and O. RAHAVANDRAINY Abstract. We consider, for a fixed prime number p, monic polynomials in one variable over the finite field F p which are equal to the sum of their monic divisors. We give necessary conditions for the existence of such polynomials, called perfect polynomials, having p + 1 irreducible factors. These conditions allow us to describe the set of all perfect polynomials with p + 1 irreducible divisors in the first unknown case, namely, the case p = Introduction Let p be a prime number. For a monic polynomial A F p [x] let σ(a) = d d A, d monic be the sum of all monic divisors of A (1 and A included). The restriction to monic polynomials is necessary since the sum of all divisors of A that have a given degree is zero. Observe that A and σ(a) have the same degree. Let us call ω(a) the number of distinct monic irreducible polynomials that divide A. The function σ is multiplicative on co-prime polynomials while the function ω is additive (on co-prime polynomials). This fact is used many times without more reference in the rest of the paper. Received March 2, Mathematics Subject Classification. Primary 11T55, 11T06. Key words and phrases. Sum of divisors; polynomials; finite fields; characteristic p.
2 A perfect polynomial is a monic polynomial A such that σ(a) = A. This notion is a good function field analogue of the notion of a multiperfect natural number n that satisfies that n divides σ(n). For example, 120 is a multiperfect number since 120 divides 360 = σ(120). Indeed, since deg(a) = deg(σ(a)), if a monic polynomial A F p [x] divides σ(a), then both are forced to be equal. We say that a polynomial A is odd (resp. even) if it has no root in F p (that is: gcd(a, x p x) = 1) (resp. it is not odd). This definition is natural in the understanding that a polynomial P F p [x], with absolute value P := p deg(p ) is even if and only if it has a divisor d with absolute value d = p. Throughout the paper, we assume that a polynomial means a monic polynomial and that the notion of polynomial irreducibility is defined over F p. Important results about perfect polynomials appear in the work of Canaday [1] and Beard et al. ([2], [3]). Indeed Canaday introduced the subject, working in the case p = 2 in his thesis under Carlitz while Beard et al. extended these results to F p with odd p in the special case where the polynomials considered split completely over F p. Trivially, there is no odd perfect polynomial over F 2 with ω(a) = 1. Canaday [1, Theorem 17] proved the inexistence of odd perfect polynomials over F 2 with two irreducible factors, i.e., with ω(a) = 2. We obtained recently some results about even or splitting perfect polynomials that generalize the work of Canaday and Beard et al., (see [9] and the references therein). Nevertheless, providing complete lists of perfect polynomials satisfying some properties (even polynomials, odd polynomials, splitting polynomials) remains difficult because it is difficult to know precisely the manner in which a given polynomial factorizes over F p, (like the difficulty of factorization of special type of integers prevents to know more about the multiperfect numbers).
3 Observe that for any given positive integer w, there is an infinity of polynomials A F p [x] with ω(a) = w, so potentially an infinity of perfect polynomials with ω(a) = w may exist. The following restriction is important. A perfect polynomial over F p must have a multiple of p number of minimal irreducible divisors (see Lemma 2.2), so trivially there is no perfect polynomial over F p with less than p irreducible factors. We proved in [6], [8] (resp. [7]) the inexistence of odd perfect polynomials over F 2 with ω(a) {3, 4} (resp. over F 3 with ω(a) = 3). In particular, this settles the case p = 2 of the present paper. We should take then p as an odd prime in all the paper. We proved also [10] some general results about odd perfect polynomials over F p with p irreducible factors, leaving unknown the list of such polynomials. However, we got the following explicit result (see [10, Theorem 1.2]): The unique odd perfect polynomial over F p, with p irreducible factors of degree 2 for which all exponents do not exceed two is A(x) := ( (x + a) 2 3/8 ) 2, a F p where either (p 11 mod 24) or (p 17 mod 24). It is natural to consider the following case. What can we say about perfect polynomials with p + 1 irreducible factors? Is it possible to provide the complete list L(p) of such polynomials? In particular, is this list finite? We know only L(2) (see [1, Theorem 9 ] and [6, Theorem 3.1]) that consists of the four even polynomials in F 2 [x] S 1 (x) = x(x + 1) 2 (x 2 + x + 1), S 2 (x) = S 1 (x + 1), S 3 (x) = x 3 (x + 1) 4 (x 4 + x 3 + 1), S 4 (x) = S 3 (x + 1). From some computations reported in [2], the list L(3) contains the following three perfect polynomials of degree 8 in F 3 [x] which are also even: A 1 (x) := x 3 (x + 1) 2 (x + 2)(x 2 + 1), A 2 (x) := A 1 (x + 1), A 3 (x) := A 1 (x + 2).
4 In this paper in Theorem 1.1, we first establish some necessary conditions for the non-vacuity of the list L(p), for a fixed odd prime number. Secondly, we prove Theorem 1.2 by means of Theorem 1.1 that L(3) does not contain anything else. Theorem 1.1. Let p be an odd prime number. Let A = P a P p ap Q b be a perfect polynomial over F p with p + 1 irreducible factors. Then d := deg(p 1 ) = = deg(p p ) and i) (A is even) or (a j is even for at least one j {1,..., p}), ii) for at least one j {1,..., p}, a j is of the form N j p nj 1 with N j, n j N, N j 1, p N j and N j (p 1), iii) either (p b + 1) or (b {p 1, 2p 1} and d deg(q)). Theorem 1.2. The only perfect polynomials over F 3 with four irreducible factors are: x 3 (x + 1) 2 (x + 2)(x 2 + 1), x(x + 1) 3 (x + 2) 2 (x 2 + 2x + 2), and x 2 (x + 1)(x + 2) 3 (x 2 + x + 2). By contrast with the integer perfect numbers, observe that Sylvester [12] already proved in 1888 that every odd perfect number has at least five prime factors. Later, Dickson [4] proved that there is a finite number of odd perfect numbers with given number ω of prime divisors. For polynomials over finite fields, we have not yet an analogue of these important results. 2. Some useful facts We denote, the set of nonnegative integers (resp. of positive integers) as usual by N (resp. by N ). For a set Λ, we denote the cardinal of Λ by #Λ. For polynomials A, B F p [x], we write: A n B if A n B but A n+1 B.
5 Definition 2.1. We say that a polynomial P is a minimal irreducible divisor of A if P is an irreducible divisor of A such that deg(p ) deg(r) for any irreducible divisor R of A. A basic but important result is the following. Lemma 2.2. (see [5, Lemma 2.5]) Let p be a prime number. Let A F p [x] be a perfect polynomial. Then the number of minimal irreducible divisors of A is a multiple of p. We immediately get the corollary. Corollary 2.3. Any perfect polynomial A over F p, with exactly p + 1 irreducible factors may be written as A = P a1 1 P p ap Q b, where a j, b N and deg(p 1 ) = = deg(p p ) < deg(q). Notation 2.4. In the rest of the paper, we fix an odd prime number p. According to Corollary 2.3 for a perfect polynomial A F p [x] with ω(a) = p + 1, we put A = P a1 1 P ap p Q b, where,..., a p, b N and deg(p 1 ) = = deg(p p ) < deg(q), a i = N i p ni 1, b = Mp m 1, N i, n i, M, m N, N i, M 1, p N i, p M. Note that P 1,..., P p may be even whereas Q is always odd. For S {Q, P 1,..., P p } and for s {b,,..., a p }, we would like to understand how σ(s s ) = 1 + S + + S s may be factorized into irreducible divisors of A σ(s s ) = P c P cp p Q c, where c, c l 0 for any l {1,..., p}. We may write s := Np n 1 for some N, n N such that N 1 and p N. In that case, we put d := gcd(n, p 1) and we denote by L N the splitting field of x N 1 over F p which is a strict subset of the algebraic closure F p of F p.
6 Moreover, since p N, the polynomial x N 1 has no multiple root (in L N ). The set U N := {λ L N : λ N = 1} of N-th roots of unity in L N is a cyclic group of order N (see [11, Theorem 2.42]). Consider the Frobenius map φ p (t) = t p for t L N, acting over L N. The action is extended trivially to L N [x] by sending x to x. The Galois group G of the extension L N over F p is generated by φ p. The Galois group G e of the extension ring L N [x] over F p [x] is isomorphic to G and acts as G on the coefficients of any element A L N [x]. We recall that a polynomial P L N [x] lies in F p [x] if and only if φ p (P ) = P. In Sections 3 and 4 we will use the following facts very often. Lemma 2.5. (see [10, Lemma 2.4]) Let S F p [x] be an irreducible polynomial such that S µ is irreducible for any µ F p. Then deg(s) = 1, so that S is even. Lemma 2.6. Let S F p [x] be an irreducible polynomial and N N with p N. If σ(s N 1 ) = Q c1 1 Qct t, where Q l is irreducible, gcd(s, Q l ) = 1 and deg(s) deg(q l ) for any l, then c l {0, 1} for any l. Proof. If c l 2 for some l, then put 1 + S + + S N 1 = R m C, where m = c l and R = Q l. We get (1) S N 1 = (S 1)R m C. Since p N by taking derivatives on both sides of (1) one has 0 NS N 1 S = R m 1 (S RC + (S 1)(mR C + RC )),
7 so with the observation gcd(s, R) = 1, R m 1 S. Thus, we get the contradiction deg(s) (m 1) deg(s) = (m 1) deg(r) deg(s ) < deg(s). 3. The proof of Theorem 1.1 We recall (see Notation 2.4) that we are interested in perfect polynomials of the form A = P a1 1 P ap p Q b, where,..., a p, b N and deg(p 1 ) = = deg(p p ) < deg(q), a i = N i p ni 1, b = Mp m 1, N i, n i, M, m N, N i, M 1, p N i, p M. We give more precisions about Q and its exponent b below Necessary conditions on Q and on b In this section we consider the following subsets of {1,..., p} Λ := {i : n i = 0}, Σ 1 := {i : Q σ(p ai i )}, Σ 2 := {i : Q σ(p ai i )}. We see that Σ 1, Σ 1 Σ 2 = and Σ 1 Σ 2 = {1,..., p}. Lemma 3.1. If i Λ Σ 1, then a i p 2. Proof. One has where α ji {0, 1} by Lemma 2.6. a i = N i 1, p N i, σ(p i a i ) = j i P j α ji,.
8 Thus a i = j i α ji p 1 and a i = N i 1 p 1 since p N i. (2) Lemma 3.2. i) If i Σ 1, then Q pn i σ(p i a i ). ii) One has b = Mp m 1 = Proof. i) One has i Σ 1 p ni = #(Λ Σ 1 ) + i Σ 1 Λ a σ(p i i ) = (P i 1) pn i 1 N (σ(p i 1 i )) pn i, N where σ(p i 1 N i ) is square free by Lemma 2.6. Hence, Q σ(p i 1 i ). ii) The exponent of Q in A is b. The exponent of Q in σ(a) is that of Q in a i Σ 1 σ(p i i ). We get (2) from i). p ni. Corollary 3.3. Let A = P a1 1 P ap p Q b F p [x] be perfect with b = Mp m 1, p M. If m 1, then #(Λ Σ 1 ) = p 1 and deg(p ) deg(q). More precisely, we must have: i) M = m = 1 if (#Λ = p, #Σ 1 = p 1) or (#Λ = #Σ 1 = p 1). ii) M = p n k 1 + 1, m = 1, Q(α) { 1, 1} for any α F p if #Λ = p 1 and #Σ 1 = p, where k is the unique integer not lying on Λ (n k 1). Proof. We see that We apply Relations (2) in Lemma 3.2. #(Λ Σ 1 ) #Λ p.
9 If m 1, then #(Λ Σ 1 ) 1 mod p. So, #(Λ Σ 1 ) = p 1. We get four cases: If #Λ = p = #Σ 1, then #Λ = #Σ 1 = {1,..., p} and p 1 = #(Λ Σ 1 ) = p, which is impossible. If #Λ = p and #Σ 1 = p 1, then b = Mp m 1 = p 1. So, M = m = 1. If #Λ = #Σ 1 = p 1, then b = Mp m 1 = p 1. So, M = m = 1. If #Λ = p 1 and #Σ 1 = p, let k be the unique integer such that k Λ. We get b = Mp m 1 = p 1 + p n k = p(p n k 1 + 1) 1, where p (p n k 1 + 1). It follows that σ(q b ) = Qb+1 1 = (Q 1) p 1 (1 + Q + + Q pn k 1 ) p. Q 1 We see that Q 1 divides σ(a) = A which is odd, so for any α F p, Q(α) 1. Remark also that for any v 1 and for any α F p, one has ( Q p v +1 ) 1 +1 (1 + + Q pv )(α) = (α) = (Q(α))pv 1 Q 1 Q(α) 1 Thus = (Q(α))2 1 Q(α) 1 = Q(α) + 1. (σ(q b ))(α) = 0 whenever Q(α) = 1. It is impossible since σ(q b ) divides σ(a) = A and A is odd. Corollary 3.4. Let A = P a1 1 P ap p Q b F p [x] be perfect with b = Mp m 1, p M. If m = 0, then
10 i) b = M 1 = p ni = #(Λ Σ 1 ) + p ni, i Σ 1 i Σ 1 Λ ii) we have either (Λ = Σ 1 = {1,..., p}) or #(Λ Σ 1 ) p 2. Proof. Relations (2) in Lemma 3.2 give i) and imply that p divides M if #(Λ Σ 1 ) = p 1. It is impossible. Lemma 3.5. One has σ(x p ) = (1 + x) 2 (x 2 u i x + 1), p 1 i=1 where u i = ξ i + 1 ξ with ξ a primitive (p + 1)-root of unity, u i i { 2, 2}, and x 2 u i x + 1 is irreducible over F p. Proof. Since the group of roots (in an algebraic closure of F p ) of x p+1 1 is a cyclic group of order p + 1 (see [11, Theorem 2.42]) with a generator ξ, such roots are So 1, 1, ξ, 1 ξ = ξp, ξ 2, σ(x p ) = (1 + x) 1 ξ 2 = ξp 1,..., ξ p 1 1 2, ξ p p 1 i=1 (x ξ i ) (x 1ξ ) i. = ξ p+3 2. For any i { 1,..., p 1 } 2, x 2 u i x + 1 = (x ξ i ) ( ) x 1 ξ lies in i Fp [x] since u i = ξ i + 1 ξ is invariant i by the Frobenius morphism φ p : x x p. Note that (ξ i ) 2 1 for any i { 1,..., p 1 } ( ) 2 and ui { 2, 2}. Remark also that φ p ξ i 1 ξ = i ξ i + 1 ξ ξ i 1 i ξ so that ξ i 1 i ξ F i p.
11 Each polynomial x 2 u i x+1 is then irreducible over F p, because its discriminant δ i := ( ξ i + 1 ξ i ) 2 4 = ( ξ i 1 ξ i ) 2 is not a square in Fp. Lemma 3.6. Let v 2 and let ξ be a primitive p v + 1-root of unity. Then, for any i, j {1,..., p 1} and for any k, r {0,..., 2v 1} whenever (i, k) (j, r). ξ ipk ξ jpr Proof. If ξ ipk = ξ jpr for some (i, k) (j, r), then ip k jp r 0 mod (p v + 1). We may suppose that k r, so that ip k r j 0 mod (p v + 1). If k = r, then i j 0 mod (p v + 1) and we must have i j = 0 since v 2. So, k > r. Put ip k r j = c (p v + 1). We easily see that p c and we may write c in base p expansion c = e 0 p z + e 1 p z e z 1 p + e z, where e l {0,..., p 1} and z 0. Therefore, z (3) ip k r = p v e l p z l + e 0 p z + e 1 p z e z 1 p + e z + j. Hence l=0 z + v = k r, e 0 = i 0. If z = 0, then v = k r and ip v = i (p v + 1) + j, which is impossible. If z 1, then ip z occurs in the right hand side of Relation (3), but not in the left. It is also impossible.
12 Lemma 3.7. For any v 2, σ(x pv ) is divisible at least by p 1 polynomials (irreducible or not) R 1,..., R p 1 of degree 2v such that gcd(r i (S), R j (S)) = 1 if i j for any S F p [x]. Proof. As above, let ξ be a primitive p v + 1-root of unity. Put N := p v + 1 and R 1 = (x ξ)(x ξ p ) (x ξ p2v 1 ), R 2 = (x ξ 2 )(x ξ 2p ) (x ξ 2p2v 1 ),. R l = (x ξ l )(x ξ lp ) (x ξ lp2v 1 ), For S F p [x] and for l {1,..., p 1}, we get. R l (S) = (S ξ l )(S ξ lp )... (S ξ lp2v 1 ). For any l, let S 1,l,..., S 2v,l be the elementary symmetric polynomials in (ξ l, ξ lp,... ξ lp2v 1 ). For any l and for any 1 k 2v, we get so that φ p (S k,l ) = (S k,l ) p = S k,l, φ p (R l ) = R l and R l F p [x]. We see that deg(r l ) = 2v and if gcd(r i (S), R j (S)) = 1 in L N [x], then gcd(r i (S), R j (S)) = 1 in F p [x]. Let us prove that gcd(r i (S), R j (S)) = 1 in L N [x]. If not, let W L N [x] be an irreducible (over L N ) common divisor of R i (S) and R j (S). We must have modulo W ξ ipk S ξ jpr
13 for some k {0,..., 2i 1} and for some r {0,..., 2j 1}. Thus ξ ipk = ξ jpr, which contradicts Lemma 3.6. Lemma 3.8. If A = P 1 a1 P p ap Q p is perfect (with deg(q) > deg(p j )) and if Q 2 uq + 1 divides σ(q p ) for some u F p { 2, 2}, then (4) Proof. If ω(q 2 uq + 1) = 1, then ω(q 2 uq + 1) 2. Q 2 uq + 1 = P w for some P {P 1,..., P p }, because Q (Q 2 uq + 1) and (Q 2 uq + 1) σ(q p ) σ(a) = A. Since deg(q) > deg(p ), we see that w = 2 deg(q) deg(p ) 3. By taking derivatives in both sides of (4), one has Q (2Q u) = wp w 1 P. If P divides 2Q u, then 2Q u mod P and u = u2 4 u Q2 uq mod P. Thus u 2 = 4 mod P and u { 2, 2}, which is impossible. So, P (2Q u), P w 1 Q, Q = P w 1 R for some R F p [x] and R (2Q u) = wp, which is impossible by considering degrees.
14 Remark 3.9. The conclusion in Lemma 3.8 does not hold in a more general context. For example, take p = 3, Q = x which is odd and irreducible over F 3, ξ a primitive 4-root of 1. One has ξ { 2, 2}, u := ξ + 1 ξ = 0 and Q 2 uq + 1 = Q = x 4 + 2x which is irreducible over F 3 with ω(q 2 uq + 1) = 1. Corollary Let A = P 1... P p ap Q p F p [x] be perfect (with deg(q) > deg(p j )). Then i) The polynomial σ(q p ) has at least p + 1 irreducible factors. ii) More generally, σ(q pv ) has at least p + 1 irreducible factors for any v 1. Proof. i) We get σ(q p ) = (Q + 1) 2 (Q 2 u i Q + 1). Remark that for any i, u i { 2, 2}, gcd(q + 1, Q 2 u i Q + 1) = 1, for any i, j, u i u j and gcd(q 2 u i Q + 1, Q 2 u j Q + 1) = 1, for any i, ω(q 2 u i Q + 1) 2 by Lemma 3.8 and ω(q + 1) 2. It follows that ω(σ(q p )) 2 p = p ii) Each polynomial R l (Q) divides σ(q pv ) and gcd(r i (Q), R j (Q)) = 1 in F p [x] if i j. Moreover, ω(r l (Q)) 2 for any l. So p 1 i=1 ω(σ(q pv )) 2(p 1) p + 1. From Corollaries 3.3, 3.4 and 3.10, we get the following corollary
15 Corollary Let A = P 1... P p ap Q p F p [x] be perfect (with deg(q) > deg(p j )) and b = Mp m 1, p M. i) If m = 0, then p b + 1 and #(Λ Σ 1 ) p 2. ii) If m 1, then m = 1, M {1, 2}, so b {p 1, 2p 1}. Proof. i) If m = 0 and if Λ = Σ 1 = {1,..., p}, then b = p. We get p ω(σ(q b )) p + 1, which is impossible. ii) If m 1, then m = 1. If M = p nk with n k 2, then σ(q M 1 ) = σ(q pn k 1 ) has at least p + 1 irreducible factors. It is impossible as in the proof of Corollary The proof By using Notation 2.4, Propositions 3.12 and 3.13 give the first and second part of our theorem. Corollary 3.11 gives the third part. Proposition There are no odd perfect polynomials over F p of the form P a P p ap Q b with p + 1 irreducible divisors where a i is odd for any i {1,..., p}. Proof. Since is odd, P divides σ(p a1 1 ). P cannot be composite since any of its irreducible factors should have degree < d. So, P is an irreducible divisor of A. By applying the same argument to P 1 + 1, we see that P is also an irreducible divisor of A, and so on. Thus, {P 1,..., P p } = {P 1, P 1 +1, P 1 +2,..., P 1 +(p 1)} and hence P µ is irreducible for any µ F p. This contradicts Lemma 2.5. Proposition There exist no perfect polynomials over F p of the form P a1 1 P p ap Q b with p + 1 irreducible divisors where for any i {1,..., p}, a i = N i p ni 1, p N i, N i p 1.
16 Proof. Since N i p 1, we may write If A is perfect, then Therefore, we may put A = σ(a) = i A = i σ(p ai i ) = µ Ω Ni (P i µ) cµ. σ(p ai i ) σ(q b ) = i A i σ(q b ) = i µ Ω Ni (P i µ) cµ σ(q b ). ξ F p (P i ξ) bξ σ(q b ), where b ξ N (may be equal to 0) and P i P j F p if i j. Since Q σ(q b ), we see that Q does not divide A, which is impossible. 4. The proof of Theorem 1.2 In this section, we take p = 3, so (see Notation 2.4) A = P a1 1 P a2 2 P a3 3 Q b, where, a 2, a 3, b N, deg(p 1 ) = deg(p 2 ) = deg(p 3 ) < deg(q), a i = N i 3 ni 1, b = M 3 m 1, N i, n i, M, m N, N i, M 1, 3 N i, 3 M. As in Section 3.1, we put Λ = {i {1, 2, 3} : n i = 0} and Σ 1 = {i {1, 2, 3} : Q σ(p ai i )}.
17 The following results are useful. Lemma 4.1. Let A = P a1 1 P a2 2 P a3 3 Q b F 3 [x] be perfect. If j Λ, then a j = N j 1 2. If j Λ \ Σ 1, then a j = N j 1 = 1. Proof. We suppose that j = 2 without loss of generality. From Lemma 2.6, we get σ(p a2 2 ) = P β1 1 P β3 3, a 2 = β 1 + β 3 2. Since 3 N 2, we must have a 2 = 1. Lemma 4.2. Let p be an odd prime number such that p 3 mod 4 and let v be a positive integer. Then the polynomial 1 + (x 2 ) (x 2 ) v is irreducible over F p if and only if v = 1. Proof. The sufficiency is obvious since 1 + x 2 is irreducible over F p whenever p 3 mod 4. Now, we prove the necessity. One has If v 2 and if v is odd, then S(x) := 1 + (x 2 ) (x 2 ) v = (x2 ) v+1 1 x 2 1 S(x) = xv + + x + 1 x + 1 = (xv + + x + 1) (x v+1 + 1). x + 1 (x v+1 + 1) = (1 + (x 2 ) (x 2 ) v 1 2 ) (x v+1 + 1),
18 which is reducible. If v 2 and if v is even, then which is also reducible. S(x) = xv (x v + + x + 1) x + 1 = (x v x v 1 + x + 1) (x v + + x + 1), Now, we are ready to prove Theorem 1.2. According to Corollaries 3.3 and 3.4, since Q(α) { 1, 1} for any α F 3, it remains to consider the following cases: ( ) m = 0, #Λ Σ 1 {0, 1}, ( ) M = m = 1, b = 2, Λ = {1, 2, 3}, Σ 1 = {1, 2}, ( ) M = m = 1, b = 2, Λ = {1, 2} = Σ 1. We shall see that only Case ( ) may happen and A must be even. We retrieve (Section 4.2.1, Case n 2 1, n 3 = 0), then the three polynomials described in Theorem Case A odd In this section, we may write A = P a1 1 P a2 2 P a3 3 Q b with a i = N i 3 ni 1, b = M 3 m 1, deg(q) > deg(p i ) 2. Lemma 4.3. If A = P a1 1 P a2 2 P a3 3 Q b F 3 [x] is odd and perfect, then there exists at most one i {1, 2, 3} such that n i = 1 (i.e. #Λ {2, 3}). Proof. Suppose to the contrary that there exist two distinct integers j 1, j 2 {1, 2, 3} such that n j1, n j2 1. Put (without loss of generality) j 1 = 1 and j 2 = 2. We see that P 1 1 and P 2 1 divide σ(a) = A. Thus P 1 1, P 2 1 {P 1, P 2, P 3 }.
19 If P 1 1 = P 2, then P 2 1 = P 3, so P 1, P 1 1 and P 1 2 = P 3 are both irreducible, which contradicts Lemma 2.5. If P 1 1 = P 3, then P 2 1 = P 1, so P 1, P 1 1 and P 1 2 = P 2 are both irreducible, which is also impossible Case ( ) m = 0, #Λ Σ 1 1. If Λ Σ 1 = since Σ 1, from Lemma 4.3, we get #Λ = 2. We may put #Λ = {1, 2}. So 1, 2 Σ 1 and thus Q σ(p a1 a2 1 ) and Q σ(p2 ). Therefore, by Lemma 4.1, = a 2 = 1. Hence, σ(p 1 ) = 1 + P 1 {P 2, P 3 } and σ(p 2 ) = 1 + P 2 {P 1, P 3 }, which contradicts Lemma 2.5. Now, we suppose that #Λ Σ 1 = 1. We may put Λ Σ 1 = {1} so that n 1 = 0 and Q σ(p a1 1 ), (n 2 1 or Q σ(p a2 2 )) and (n 3 1 or Q σ(p a3 3 )). Lemma 4.4. We must have either (n 2 1) or (n 3 1). Proof. First, if n 2 1 and n 3 1, then Λ = {1}, which contradicts Lemma 4.3. If n 2 = 0 = n 3, then Q σ(p a2 2 ) and Q σ(p a3 3 ). So, by Lemma 4.1, we must have a 2 = a 3 = 1. Thus, σ(p 2 ) = 1 + P 2 {P 1, P 3 } and σ(p 3 ) = 1 + P 3 {P 1, P 2 }, which contradicts Lemma 2.5 as above. According to Lemma 4.4, we may suppose that n 3 1, n 2 = 0 and Q σ(p a2 2 ). Thus, a 2 = 1 by Lemma 4.1. Therefore, P 3 1 and σ(p 2 ) divides σ(a) = A, σ(p 2 ) = 1 + P 2 {P 1, P 3 } and P 3 1 {P 1, P 2 }. If 1 + P 2 = P 3, then P 3 1 = P 2 and 1 = a 2 3 n3 1. It is impossible. If 1 + P 2 = P 1, then P 3 1 = P 1. Again, this contradicts Lemma Case ( ) M = m = 1, b = 2, Λ = {1, 2, 3}, Σ 1 = {1, 2}.
20 By Lemma 4.1, a 3 = 1. So, σ(p 3 ) = 1 + P 3 {P 1, P 2 }. We may suppose that 1 + P 3 = P 1 so P 3 (ξ) = 1 = P 1 (ξ) for any ξ F 3. Since Q σ(p ai i ) for i {1, 2} and since σ(a) = A, we get where σ(p 1 ) = P α2 2 P α3 3 Q, σ(p 2 a2 ) = P β1 1 P β3 3 Q, σ(p 3 a 3 ) = σ(p 3 ) = P 1, σ(q b ) = σ(q 2 ) = (Q 1) 2 = (P w1 1 P w2 2 P w3 3 )2, β w 1 =, α 2 + 2w 2 = a 2, α 3 + β 3 + 2w 3 = a 3 = 1, α 2, α 3, β 1, β 3 {0, 1}, (α 2 + α 3 ) = deg(q) deg(p ) = a 2 (β 1 + β 3 ) = w 1 + w 2 + w 3. It follows that w 3 = 0 and (α 3, β 3 ) {(1, 0), (0, 1)}. Moreover, since (σ(p a1 1 ))(ξ) 0 and P 1(ξ) = 1, must be even and (σ(p a1 1 ))(ξ) = 1, since Q 1 = P w1 1 P w2 2, we must have Q(ξ) = 1 for any ξ F 3. Since β w 1 = is even, we get β 1 = 1 and = 2 + 2w 1. If α 3 = 1, β 3 = 0, then a 2 = 1 + deg(q) deg(p ) = 1 + w 1 + w 2. Since 1 = (σ(p a1 1 ))(ξ) = (P 2(ξ)) α2 1 ( 1) = (P 2 (ξ)) α2, we must have α 2 = 1, P 2 (ξ) = 1 and a a 2 = 1 + 2w 2 is odd. In this case, (σ(p 2 2 ))(ξ) = 0 for any ξ. It is impossible, because A is odd. If α 3 = 0, β 3 = 1, then a 2 = deg(q) deg(p ) = 2 + w 1 + w 2. As above, since 1 = (σ(p a1 1 ))(ξ) = (P 2(ξ)) α2 ( 1) = (P 2 (ξ)) α2, we must have α 2 = 1, P 2 (ξ) = 1 a and a 2 = 1 + 2w 2 is odd. In this case, (σ(p 2 2 ))(ξ) = 0 for any ξ. It is impossible, because A is odd.
21 Case ( ) M = m = 1, b = 2, Λ = {1, 2} = Σ 1. In this case, P 3 1 divides σ(a) = A, so P 3 1 {P 1, P 2 }. We may suppose that P 3 1 = P 1. We get where σ(p 1 ) = P 2 α 2 P 3 α 3 Q, σ(p 2 a 2 ) = P 1 β 1 P 3 β 3 Q, a σ(p ) = P n 3 1 γ 1 P 2 3 n 3 2, σ(q b ) = σ(q 2 ) = (Q 1) 2 w = (P 1 w 1 P 2 w 2 P 3 3 ) 2 β n w 1 =, α 2 + γ 2 3 n3 + 2w 2 = a 2, α 3 + β 3 + 2w 3 = a 3, α 2, α 3, β 1, β 3, γ 2 {0, 1}, (α 2 + α 3 ) = deg(q) deg(p ) = a 2 (β 1 + β 3 ) = w 1 + w 2 + w 3, N 3 3 n3 1 = a 3 = 3 n3 1 + γ 2 3 n3, so N 3 = γ {1, 2}. Remark that for any ξ F 3, P 3 (ξ) = 1 = P 1 (ξ) since P 3 1 = P 1. a Since (σ(p 3 3 ))(ξ) 0 and P 3 (ξ) = 1, a 3 must be even and (σ(p a3 3 ))(ξ) = 1. w Since Q 1 = P 1 w 1 P 2 w 2 P 3 3, we must have Q(ξ) = 1 for any ξ F 3. It follows that N 3 = 1, γ 2 = 0 and α 3 + β 3 = a 3 2w 3 = 3 n3 1 2w 3 {0, 2}. Hence, either (α 3 = β 3 = 0) or (α 3 = β 3 = 1). Case α 3 = β 3 = 0 One has the following. Lemma 4.5. For any ξ F 3, P 2 (ξ) = 1. Proof. If P 2 (ξ) = 1 for some ξ F 3, then (σ(p a2 2 ))(ξ) = 1, which contradicts the fact (σ(p a2 2 ))(ξ) = (P 1 β1 Q)(ξ) = 1 β1 ( 1) = 1.
22 Lemma 4.6. Let P F 3 [x] be irreducible and a N, then P + 1 divides σ(p a ) if and only if a is odd. Proof. If a is odd, then we may write a = 2s + 1 and σ(p a ) = 1 + P + + P 2s + P 2s+1 = (1 + P )(1 + (P 2 ) (P 2 ) s ). If a is even, then a 1 is odd and P + 1 divides σ(p a 1 ). Hence σ(p a ) = σ(p a 1 ) + P a is not divisible by P + 1. Corollary 4.7. The integers and a 2 must be even, so that β 1 = α 2 = 0 and = a 2. Proof. a If is odd, then by Lemma 4.6, P divides σ(p 1 1 ), so α 2 = 1 and P 2 = P = P 3, which is impossible. Thus, = β 1 + 2w 3 + 2w 1 is even and β 1 = 0. a If a 2 is odd, then as above, P divides σ(p 2 2 ), so β 1 = 1 and P 1 = P Hence P 1, P 1 1 = P 2, P 1 2 = P 3 are both irreducible. It contradicts Lemma 2.5. So, a 2 = α 2 + 2w 2 is even and α 2 = 0. a From Corollary 4.7, β 1 = α 2, so σ(p 1 a 1 ) = Q = σ(p 2 2 ). Hence w P 1 w 1 P 2 w 2 P 3 a 3 =Q 1 = P 1 (1+P P 1 1 a 1 )=P 2 (1+P P ). Thus, w 1 = w 2 = 1 and 2 = 2w 2 = a 2 = = 3 n w 1 = 3 n3 + 1, which is impossible, because n 3 1.
23 Case α 3 = β 3 = 1 We get where σ(p 1 ) = P 2 α 2 P 3 Q, σ(p 2 a 2 ) = P 1 β 1 P 3 Q, σ(p 3 a 3 ) = P 1 3 n 3 1, σ(q b ) = σ(q 2 ) = (Q 1) 2 = (P 1 w 1 P 2 w 2 P 3 w 3 ) 2 β n w 1 =, α 2 + 2w 2 = a 2, 2 + 2w 3 = a 3 = 3 n3 1, α 2, β 1 {0, 1}, (α 2 + 1) = deg(q) deg(p ) = a 2 (β 1 + 1) = w 1 + w 2 + w 3. Lemma 4.8. The integer is odd and a 2 is even, so that β 1 = 1, α 2 = 0 and a 2 = + 1. a Proof. The integer is odd by Lemma 4.6 since P 3 = P divides σ(p 1 1 ). Again, if a 2 is a odd, then P divides σ(p 2 2 ). So, P = P 1. Thus, P 1, P 1 1 = P 2 and P 1 2 = P 3 are both irreducible. This contradicts Lemma 2.5. Corollary 4.9. i) For any ξ F 3, P 2 (ξ) = 1. ii) w 2 + w 3, w 1 and w 1 + w 2 + w 3 = deg(q) deg(p ) are both even. iii) = 6l + 3, a 2 = 2w 2 = + 1 = 6l + 4 for some l N. Proof. i) If P 2 (ξ) = 1, then modulo 3 we get a = (σ(p 2 a 2 ))(ξ) = (P 1 P 3 Q)(ξ) = (P 1 σ(p 1 ))(ξ) = 1 ( + 1).
24 Hence by Lemma 4.8, we get modulo 3 = a 2 = + 1. It is impossible. ii) We get modulo 3 1 = (Q 1)(ξ) = (P 1 w 1 P 2 w 2 P 3 w 3 )(ξ) = 1 ( 1) w2+w3. We are done. iii) Since P 2 (ξ) = 1 and a 2 is even, we get (σ(p 2 a 2 ))(ξ) = 1. But modulo 3 (σ(p 2 a 2 ))(ξ) = (P 1 σ(p 1 ))(ξ) = 1 ( + 1). We see that 0 mod 3 and 3 mod 6 since is odd. So, Now, in order to end the proof for the odd case, we see that (1 + P 1 )(1 + (P 1 2 ) (P 1 2 ) 3l+1 ) = σ(p 1 ) = P 3 Q = (P 1 + 1) Q. and l must be equal to 0 by Lemma 4.2. Hence Q = 1 + (P 1 2 ) (P 1 2 ) 3l+1 P 1 w 1 P 2 w 2 P 3 w 3 = Q 1 = P 1 2. Thus, w 1 = 2 and = n w 1 = 3 n It is impossible, because 0 mod Case A even In this section, we put A = P a1 1 P a2 2 P a3 3 Q b with P 1 := x + 1, P 2 := x + 2, P 3 := x + 3 = x, a i = N i 3 ni 1, b = M 3 m 1, 3 N i, 3 M. For S F 3 [x], we denote by S (resp. S) the polynomial obtained from S by substituting x by x + 1 (resp., by x + 2).
25 We need the following facts that are more precise than Lemma 4.6. Lemma Let a N and P {P 1, P 2, P 3 }. Then i) P divides σ(p a ) if and only if a is odd, ii) P divides σ(p a ) if and only if 3 divides a + 1. Proof. We may suppose that P = P 1. i) follows from the facts ii) follows from the facts P 2 (1) = 0, P 1 (1) = 2 = 1, (σ(p 1 ))(1) = ( 1)a = ( 1) a P 3 (0) = 0, P 1 (0) = 1, (σ(p 1 ))(0) = + 1. Lemma i) If is odd, n 1 = 0 and σ(p 1 ) = P α2 2 P α3 3 Q, then = 3, α 2 = 1, α 3 = 0 and Q = 1 + P 1 2 = 1 + (x + 1) 2. ii) If is odd, n 1 1 and σ(p 1 ) = P α2 2 P α3 3 Qα, then either (N 1 = 2, α 2 = 3 n1 = α 3 + 1, α = 0) or (N 1 = 4, α 2 = 3 n1 = α 3 + 1, α = 3 n1, Q = 1 + P 1 2 = 1 + (x + 1) 2. Proof. i) if is odd then P 2 = 1 + P 1 divides σ(p 1 ) and α 2 = 1 since α 2 {0, 1}.
26 If α 3 0, then α 3 = 1 and P 3 divides σ(p 1 ). Thus, we get in F 3 N 1 = + 1 = (σ(p 1 ))(0) = (P 2 P 3 Q)(0) = 0, which is impossible since 3 N 1. Therefore, α 3 = 0 and (1 + P 1 )(1 + (P 2 1 ) (P a 1 ) ) = σ(p 1 1 ) = P 2 Q. Hence 1 + (P 2 1 ) (P ) = Q is irreducible. So, we must have = 3 by Lemma 4.2. ii) Since is odd, we may put = (2c 1 ) 3 n1 1 where c 1 N. Hence a σ(p ) = P n 1 1 c 3 (1 + P P ) 3n 1 c (P ) 3n 1. If c 1 = 1, then N 1 = 2 and α = 0. If c 1 = 2, then N 1 = 4, Q = 1 + P 1 2, α 2 = 1 and α = 3 n1. If c 1 3, then P 1 c is reducible over F 3 and thus 3 ω(σ(p 1 )) 4. It is impossible. Lemma i) If is even, n 1 = 0 and σ(p 1 ) = P α2 2 P α3 3 Q, then + 1 is a prime number, α 2 = α 3 = 0 and Q = σ(p 1 ). ii) If is even, n 1 1 and σ(p 1 ) = P α2 2 P α3 3 Qα, then either (N 1 = 1, α 2 = 0, α 3 = 3 n1 1, α = 0) or (N 1 is an odd prime number, α 2 = 0, α 3 = 3 n1 1, α = 3 n1, Q = σ(p 1 N 1 1 )).
27 Proof. i) even implies α 2 = 0. As above, α 3 0 implies = N 1, which is impossible. So, Q = σ(p 1 ) is irreducible and + 1 must be an odd prime number. ii) even implies N 1 odd and α 2 = 0, and n 1 1 implies α 3 = 3 n1 1. If N 1 = 1, then α = 0. If N 1 3, then P 3 3 n 1 1 (1 + P P 1 N 1 1 ) 3n 1 a = σ(p ) = P n Q 3n 1. Thus Q = σ(p 1 N 1 1 ) is irreducible and N 1 must be an odd prime number. Lemma Let p be an odd prime number. If σ(x a ) is irreducible over F p and if σ(x a ) = σ((x + µ) a ) for some µ F p, then µ = 0. Proof. Let ξ be a primitive (a + 1)-root of unity. By hypothesis, a S(x) := σ(x a ) = (x ξ i ) is the minimal polynomial of ξ. If S(x) = S(x+µ) with µ 0, then x ξ = x+µ ξ k for some 2 k a. Thus, the polynomial R(x) := x k x µ F p [x] satisfies R(ξ) = 0. Hence, S divides R and S = R, which is impossible since p 2. Corollary If A = P a1 1 P a2 2 P a3 3 Qb F 3 [x] is even and perfect, then there exists a unique j {1, 2, 3} such that Q σ(p j a j ), so #Σ 1 = 1. i=1
28 Proof. We know that Σ 1. If #Σ 1 2, then we may suppose that 1, 2 Σ 1. According to Lemmata 4.11 and 4.12, we get by Lemma Q {1 + P 1 2, σ(p 1 ), σ(p 1 N 1 1 )} {1 + P 2 2, σ(p 2 a 2 ), σ(p 2 N 2 1 )} = According to Corollary 4.14, it remains to consider only the case ( ) Case m = 0, #Λ Σ 1 = 1. m = 0, #Λ Σ 1 {0, 1}. We may put Λ Σ 1 = {1}, so n 1 = 0, Q σ(p a1 1 Case n 2 = 0 = n 3 One has a 2 = 1 = a 3 by Lemma 4.1. Thus, we get where ), Q σ(p a2 2 σ(p 1 ) = P α2 2 Q, σ(p 2 a2 ) = 1 + P 2 = P 3, σ(p 3 a 3 ) = 1 + P 3 = P 1, σ(q b ) = 1 + Q = P w1 1 P w w 1 = = α 2 + deg(q), α 2 + w 2 = a 2 = 1, α 2 {0, 1}. a3 ), Q σ(p3 ) and thus b = 1. If is odd, then α 2 = 1 and w 2 = 0. So, Q = P 1 w 1 1 is odd and irreducible. It is impossible. If is even, then α 2 = 0 and 1 + P P 1 = σ(p 1 ) = Q. Thus, P 1 does not divide 2 + P P 1 = 1 + Q = σ(q). Hence w 1 = 0 and = 1, which is impossible. Case n 2 1, n 3 1 We get σ(p 1 ) = P α2 2 P α3 3 Q, σ(p 2 a2 ) = P 1 3 n 2 1 P 3 β 3 3 n 2, σ(p 3 a 3 ) = P 2 3 n 3 1 P 1 γ 1 3 n 3, σ(q b ) = 1 + Q = P w1 1 P w2 2 P w3 3
29 where 3 n2 1 + γ 1 3 n3 + w 1 = = α 2 + α 3 + deg(q), α 2, α 3, β 3, γ 1 {0, 1}. If is odd, then by Lemma 4.11, = 3, α 2 = 1, α 3 = 0 and Q = 1 + (x + 1) 2. Hence σ(q b ) = 1 +Q = x 2 + 2x = P 2 P 3, w 1 = 0, w 2 = w 3 = 1 and = 3 n2 1+γ 1 3 n3. It is impossible since 3 ( + 1). If is even, then σ(p a1 1 ) = Q and + 1 is an odd prime number. Therefore, P 1 does not a divide 2 + P P 1 1 = σ(q), w 1 = 0 and = 3 n2 1 + γ 1 3 n3, which is impossible. Case n 2 = 0, n 3 1 In this case, a 2 = 1 by Lemma 4.1. We get and the contradiction 1 = a 2 3 n σ(p 3 a 3 ) = P 2 3 n 3 1 P 1 γ 1 3 n 3 Case n 2 1, n 3 = 0 In this case, a 3 = 1 by Lemma 4.1. If is odd, then by Lemma 4.11, = 3 and σ(p a1 1 ) = P 2 (1 + P 2 1 ) = P 2 Q. Since Q does not divide σ(p a2 2 ), one has σ(q) = 1 + Q = P 2 P 3 and a 2 = 2 = We get the three even perfect polynomials of Theorem 1.2 A = x(x + 1) 3 (x + 2) 2 (1 + (x + 1) 2 ), A and A. If is even, then σ(p a1 1 ) = Q and + 1 is an odd prime number. We get a σ(p 1 a 1 ) = Q, σ(p ) = P n 2 1 β 1 P 3 3 n 2 3, σ(p 3 a 3 ) = 1 + P 3 = P 1, σ(q b ) = 1 + Q = P w1 1 P w2 2 P w3 3,
30 β 3 = 0 since n 2 1 and 1 = a 3 β 3 3 n2. So, a 2 is even. Hence, w 3 = a 3 = 1, a 2 = w 2 = 3 n2 1 and w 1 = 0. Thus, 2 + P P 1 = σ(q) = P 2 a 2 P 3. So, = a It is impossible, because and a 2 are both even Case m = 0, Λ Σ 1 =. We need the following general result. Lemma For any T F 3 [x], one has gcd(1 + T, 1 + (T 2 ) (T 2 ) 3n ) = 1. Proof. If S is a common irreducible divisor of 1 + T and of 1 + (T 2 ) (T 2 ) 3n 1 1 2, then T 1 mod S and T 2 1 mod S. Thus 3 n (T 2 ) (T 2 ) 3n mod S. 2 It is impossible since 3 does not divide 3 n Since Σ 1, one has #Λ 2. By Corollary 4.14, we may consider only two cases: (I) Σ 1 = {1} and Λ = {2, 3}, (II) Σ 1 = {1} and Λ =. Case (I) Since Q σ(p a2 a3 2 ) and Q σ(p3 ), from Lemma 4.1, we get a 2 = a 3 = 1. Moreover, n 1 1, so 3 P n 1 1 a 3 divides σ(p 1 1 ). Hence 1 = a 3 3 n1 1 2, which is impossible.
31 Case (II) n 1 1, n 2 1 and n 3 1. From Corollary 4.14, We get σ(p 1 ) = P 3 3 n 1 1 (P α2 2 Q)3n 1 σ(p 3 a 3 ) = P 2 3 n 3 1 P 1 γ 1 3 n 3 σ(p 2 a 2 ) = P 1 3 n 2 1 P 3 β 3 3 n 2 σ(q b ) = P w1 1 P w2 2 P w3 3. so b = 3 n1. If is odd, then by Lemma 4.11, α 2 = 1, = 4 3 n1 1 and a σ(p ) = P n (P 2 Q) 3n 1, where Q = 1 + P 2 1. So, 1 + Q = P 2 P 3 and P 2 P 3 (1 + (Q 2 ) (Q 2 ) 3n ) = σ(q b ) = P w1 1 P w2 Lemma 4.15, w 2 = w 3 = 1 and 1 + (Q 2 ) (Q 2 ) 3n = P 1 w 1. 2 P w3 3. Thus, by Thus We get Q 1 mod P 1 and w 1 = deg(p 1 w 1 ) = (3 n1 1) deg(q) 4. 3 n It is impossible since 3 does not divide 3 n (Q 2 ) 1 + (Q 2 ) 3n mod P 1. If is even, then by Lemma 4.12, α 2 = 0 and Q = 1 + P P 1 N 1 1, where N 1 is an odd prime number. Hence, (1 + Q) (1 + (Q 2 ) (Q 2 ) 3n ) = σ(q b ) = P w1 1 P w2 2 P w3 3.
32 Since P 1 does not divide 2 + P P 1 N 1 1 = 1 + Q, we have But Q 1 mod P 1, so we get It is impossible as above. 3 n (Q 2 ) (Q 2 ) 3n mod P (Q 2 ) (Q 2 ) 3n mod P Canaday E. F., The sum of the divisors of a polynomial, Duke Math. Journal 8 (1941), Beard Jr. J. T. B., O Connell Jr. J. R. and West K. I., Perfect polynomials over GF (q) Rend. Accad. Lincei, 62 (1977), Beard Jr. J. T. B., Perfect polynomials revisited, Publ. Math. 38 (1 2 (1991), L. E. Dickson, Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors American J. 35 (1913), Gallardo L. H. and Rahavandrainy O., Perfect polynomials over F 4 with less than five prime factors Portugaliae Mathematica 64(1) (2007), , Odd perfect polynomials over F 2 J. Théor. Nombres Bordeaux 19 (2007), , Perfect polynomials over F 3 Int. J. of Algebra 2(10) (2008), , There is no odd perfect polynomial over F 2 with four prime factors Portugaliae Mathematica 66(2) (2009), Gallardo L. H. and Rahavandrainy O., On even (unitary) perfect polynomials over F 2 Finite Fields Appl. 18(5) (2012), , On perfect polynomials over F p with p irreducible factors Portugaliae Mathematica 69(4) (2012), Lidl R. and Niederreiter H., Finite Fields, Encyclopedia of Mathematics and its applications, Cambridge University Press, 1983 (Reprinted 1987).
33 12. Sylvester J. J., Sur l impossibilité de l existence d un nombre parfait impair qui ne contient pas au moins 5 diviseurs premiers distincts Comptes Rendus Paris 106 (1888), L. H. Gallardo, Mathematics, University of Brest, 6, Avenue Le Gorgeu, C.S , Brest Cedex 3, France, luisgall@univ-brest.fr O. Rahavandrainy, Mathematics, University of Brest, 6, Avenue Le Gorgeu, C.S , Brest Cedex 3, France, rahavand@univ-brest.fr
Odd perfect polynomials over F 2
Journal de Théorie des Nombres de Bordeaux 19 (2007), 165 174 Odd perfect polynomials over F 2 par Luis H. GALLARDO et Olivier RAHAVANDRAINY Résumé. Un polynôme A F 2 [x] est dit parfait s il est égal
More informationPerfect Polynomials. modulo 2. Ugur Caner Cengiz. Lake Forest College. April 7, 2015
Perfect Polynomials modulo 2 Ugur Caner Cengiz Lake Forest College April 7, 2015 Ugur Caner Cengiz Perfect Polynomials Student Symposium 2015 1 / 18 Outline 1 Definitions modulo 2 What is "Perfect"? Perfect
More informationDONG QUAN NGOC NGUYEN
REPRESENTATION OF UNITS IN CYCLOTOMIC FUNCTION FIELDS DONG QUAN NGOC NGUYEN Contents 1 Introduction 1 2 Some basic notions 3 21 The Galois group Gal(K /k) 3 22 Representation of integers in O, and the
More informationON EXPLICIT FORMULAE AND LINEAR RECURRENT SEQUENCES. 1. Introduction
ON EXPLICIT FORMULAE AND LINEAR RECURRENT SEQUENCES R. EULER and L. H. GALLARDO Abstract. We notice that some recent explicit results about linear recurrent sequences over a ring R with 1 were already
More informationCounting Perfect Polynomials
Enrique Treviño joint work with U. Caner Cengiz and Paul Pollack 49th West Coast Number Theory December 18, 2017 49th West Coast Number Theory 2017 1 Caner (a) Caner Cengiz (b) Paul Pollack 49th West Coast
More informationFinite Fields. [Parts from Chapter 16. Also applications of FTGT]
Finite Fields [Parts from Chapter 16. Also applications of FTGT] Lemma [Ch 16, 4.6] Assume F is a finite field. Then the multiplicative group F := F \ {0} is cyclic. Proof Recall from basic group theory
More informationTC10 / 3. Finite fields S. Xambó
TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the
More informationClassification of Finite Fields
Classification of Finite Fields In these notes we use the properties of the polynomial x pd x to classify finite fields. The importance of this polynomial is explained by the following basic proposition.
More informationSolutions of exercise sheet 6
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 6 1. (Irreducibility of the cyclotomic polynomial) Let n be a positive integer, and P Z[X] a monic irreducible factor of X n 1
More information1/30: Polynomials over Z/n.
1/30: Polynomials over Z/n. Last time to establish the existence of primitive roots we rely on the following key lemma: Lemma 6.1. Let s > 0 be an integer with s p 1, then we have #{α Z/pZ α s = 1} = s.
More informationarxiv: v3 [math.nt] 4 Nov 2015
FUNCTION FIELD ANALOGUES OF BANG ZSIGMONDY S THEOREM AND FEIT S THEOREM arxiv:1502.06725v3 [math.nt] 4 Nov 2015 NGUYEN NGOC DONG QUAN Contents 1. Introduction 1 1.1. A Carlitz module analogue of Bang Zsigmondy
More informationFinite Fields: An introduction through exercises Jonathan Buss Spring 2014
Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence
More information55 Separable Extensions
55 Separable Extensions In 54, we established the foundations of Galois theory, but we have no handy criterion for determining whether a given field extension is Galois or not. Even in the quite simple
More informationPermutation Polynomials over Finite Fields
Permutation Polynomials over Finite Fields Omar Kihel Brock University 1 Finite Fields 2 How to Construct a Finite Field 3 Permutation Polynomials 4 Characterization of PP Finite Fields Let p be a prime.
More informationGalois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.
Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More
More informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationTwo Diophantine Approaches to the Irreducibility of Certain Trinomials
Two Diophantine Approaches to the Irreducibility of Certain Trinomials M. Filaseta 1, F. Luca 2, P. Stănică 3, R.G. Underwood 3 1 Department of Mathematics, University of South Carolina Columbia, SC 29208;
More informationFIELD THEORY. Contents
FIELD THEORY MATH 552 Contents 1. Algebraic Extensions 1 1.1. Finite and Algebraic Extensions 1 1.2. Algebraic Closure 5 1.3. Splitting Fields 7 1.4. Separable Extensions 8 1.5. Inseparable Extensions
More informationA GRAPHICAL REPRESENTATION OF RINGS VIA AUTOMORPHISM GROUPS
A GRAPHICAL REPRESENTATION OF RINGS VIA AUTOMORPHISM GROUPS N. MOHAN KUMAR AND PRAMOD K. SHARMA Abstract. Let R be a commutative ring with identity. We define a graph Γ Aut R (R) on R, with vertices elements
More informationA BRIEF INTRODUCTION TO LOCAL FIELDS
A BRIEF INTRODUCTION TO LOCAL FIELDS TOM WESTON The purpose of these notes is to give a survey of the basic Galois theory of local fields and number fields. We cover much of the same material as [2, Chapters
More informationSection 33 Finite fields
Section 33 Finite fields Instructor: Yifan Yang Spring 2007 Review Corollary (23.6) Let G be a finite subgroup of the multiplicative group of nonzero elements in a field F, then G is cyclic. Theorem (27.19)
More informationSection VI.33. Finite Fields
VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,
More informationOn a Theorem of Dedekind
On a Theorem of Dedekind Sudesh K. Khanduja, Munish Kumar Department of Mathematics, Panjab University, Chandigarh-160014, India. E-mail: skhand@pu.ac.in, msingla79@yahoo.com Abstract Let K = Q(θ) be an
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationIntroduction to finite fields
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
More informationFast Polynomial Multiplication
Fast Polynomial Multiplication Marc Moreno Maza CS 9652, October 4, 2017 Plan Primitive roots of unity The discrete Fourier transform Convolution of polynomials The fast Fourier transform Fast convolution
More informationPermuting the partitions of a prime
Journal de Théorie des Nombres de Bordeaux 00 (XXXX), 000 000 Permuting the partitions of a prime par Stéphane VINATIER Résumé. Étant donné un nombre premier p impair, on caractérise les partitions l de
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More informationBasic Algebra. Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series
Basic Algebra Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series Cornerstones Selected Pages from Chapter I: pp. 1 15 Anthony
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationNOTES ON SIMPLE NUMBER THEORY
NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More informationHomework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn
Homework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn Problem 1: 4.4 # 2:x 3 + 8x 2 x 1 0 (mod 1331). a) x 3 + 8x 2 x 1 0 (mod 11). This does not break down, so trial and error gives: x = 0 : f(0)
More informationPoints of Finite Order
Points of Finite Order Alex Tao 23 June 2008 1 Points of Order Two and Three If G is a group with respect to multiplication and g is an element of G then the order of g is the minimum positive integer
More informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More informationSubsets of Euclidean domains possessing a unique division algorithm
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.
More informationMoreover this binary operation satisfies the following properties
Contents 1 Algebraic structures 1 1.1 Group........................................... 1 1.1.1 Definitions and examples............................. 1 1.1.2 Subgroup.....................................
More informationOlympiad Number Theory Through Challenging Problems
Olympiad Number Theory Justin Stevens Page 1 Olympiad Number Theory Through Challenging Problems Authors Justin Stevens Editor and L A TEX Manager David Altizio Dedicated to my sister. Justin Contents
More informationContradiction. Theorem 1.9. (Artin) Let G be a finite group of automorphisms of E and F = E G the fixed field of G. Then [E : F ] G.
1. Galois Theory 1.1. A homomorphism of fields F F is simply a homomorphism of rings. Such a homomorphism is always injective, because its kernel is a proper ideal (it doesnt contain 1), which must therefore
More informationGalois theory (Part II)( ) Example Sheet 1
Galois theory (Part II)(2015 2016) Example Sheet 1 c.birkar@dpmms.cam.ac.uk (1) Find the minimal polynomial of 2 + 3 over Q. (2) Let K L be a finite field extension such that [L : K] is prime. Show that
More informationFurther linear algebra. Chapter II. Polynomials.
Further linear algebra. Chapter II. Polynomials. Andrei Yafaev 1 Definitions. In this chapter we consider a field k. Recall that examples of felds include Q, R, C, F p where p is prime. A polynomial is
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationNAP Module 4. Homework 2 Friday, July 14, 2017.
NAP 2017. Module 4. Homework 2 Friday, July 14, 2017. These excercises are due July 21, 2017, at 10 pm. Nepal time. Please, send them to nap@rnta.eu, to laurageatti@gmail.com and schoo.rene@gmail.com.
More informationNORM OR EXCEPTION? KANNAPPAN SAMPATH & B.SURY
NORM OR EXCEPTION? KANNAPPAN SAMPATH & B.SURY Introduction In a first course on algebraic number theory, a typical homework problem may possibly ask the student to determine the class group of a quadratic
More informationThe Weil bounds. 1 The Statement
The Weil bounds Topics in Finite Fields Fall 013) Rutgers University Swastik Kopparty Last modified: Thursday 16 th February, 017 1 The Statement As we suggested earlier, the original form of the Weil
More informationFields. Victoria Noquez. March 19, 2009
Fields Victoria Noquez March 19, 2009 5.1 Basics Definition 1. A field K is a commutative non-zero ring (0 1) such that any x K, x 0, has a unique inverse x 1 such that xx 1 = x 1 x = 1. Definition 2.
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More informationϕ : Z F : ϕ(t) = t 1 =
1. Finite Fields The first examples of finite fields are quotient fields of the ring of integers Z: let t > 1 and define Z /t = Z/(tZ) to be the ring of congruence classes of integers modulo t: in practical
More informationarxiv: v1 [math.gr] 3 Feb 2019
Galois groups of symmetric sextic trinomials arxiv:1902.00965v1 [math.gr] Feb 2019 Alberto Cavallo Max Planck Institute for Mathematics, Bonn 5111, Germany cavallo@mpim-bonn.mpg.de Abstract We compute
More informationGALOIS THEORY. Contents
GALOIS THEORY MARIUS VAN DER PUT & JAAP TOP Contents 1. Basic definitions 1 1.1. Exercises 2 2. Solving polynomial equations 2 2.1. Exercises 4 3. Galois extensions and examples 4 3.1. Exercises. 6 4.
More informationTHE NUMBER OF POLYNOMIAL SOLUTIONS OF POLYNOMIAL RICCATI EQUATIONS
This is a preprint of: The number of polynomial solutions of polynomial Riccati equations, Armengol Gasull, Joan Torregrosa, Xiang Zhang, J. Differential Equations, vol. 261, 5071 5093, 2016. DOI: [10.1016/j.jde.2016.07.019]
More informationFinite Fields and Error-Correcting Codes
Lecture Notes in Mathematics Finite Fields and Error-Correcting Codes Karl-Gustav Andersson (Lund University) (version 1.013-16 September 2015) Translated from Swedish by Sigmundur Gudmundsson Contents
More informationPartial Sums of Powers of Prime Factors
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.1.6 Partial Sums of Powers of Prime Factors Jean-Marie De Koninck Département de Mathématiques et de Statistique Université Laval Québec
More informationAlgebraic number theory
Algebraic number theory F.Beukers February 2011 1 Algebraic Number Theory, a crash course 1.1 Number fields Let K be a field which contains Q. Then K is a Q-vector space. We call K a number field if dim
More informationAn Approach to Hensel s Lemma
Irish Math. Soc. Bulletin 47 (2001), 15 21 15 An Approach to Hensel s Lemma gary mcguire Abstract. Hensel s Lemma is an important tool in many ways. One application is in factoring polynomials over Z.
More informationA talk given at University of Wisconsin at Madison (April 6, 2006). Zhi-Wei Sun
A tal given at University of Wisconsin at Madison April 6, 2006. RECENT PROGRESS ON CONGRUENCES INVOLVING BINOMIAL COEFFICIENTS Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 210093,
More informationPrime and irreducible elements of the ring of integers modulo n
Prime and irreducible elements of the ring of integers modulo n M. H. Jafari and A. R. Madadi Department of Pure Mathematics, Faculty of Mathematical Sciences University of Tabriz, Tabriz, Iran Abstract
More informationOn transitive polynomials modulo integers
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 22, 2016, No. 2, 23 35 On transitive polynomials modulo integers Mohammad Javaheri 1 and Gili Rusak 2 1
More informationExplicit global function fields over the binary field with many rational places
ACTA ARITHMETICA LXXV.4 (1996) Explicit global function fields over the binary field with many rational places by Harald Niederreiter (Wien) and Chaoping Xing (Hefei) 1. Introduction. In a series of papers
More information(Inv) Computing Invariant Factors Math 683L (Summer 2003)
(Inv) Computing Invariant Factors Math 683L (Summer 23) We have two big results (stated in (Can2) and (Can3)) concerning the behaviour of a single linear transformation T of a vector space V In particular,
More informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
More informationTHE HALF-FACTORIAL PROPERTY IN INTEGRAL EXTENSIONS. Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND.
THE HALF-FACTORIAL PROPERTY IN INTEGRAL EXTENSIONS Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND. 58105-5075 ABSTRACT. In this paper, the integral closure of a half-factorial
More informationp-adic fields Chapter 7
Chapter 7 p-adic fields In this chapter, we study completions of number fields, and their ramification (in particular in the Galois case). We then look at extensions of the p-adic numbers Q p and classify
More informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
More informationResults and open problems related to Schmidt s Subspace Theorem. Jan-Hendrik Evertse
Results and open problems related to Schmidt s Subspace Theorem Jan-Hendrik Evertse Universiteit Leiden 29 ièmes Journées Arithmétiques July 6, 2015, Debrecen Slides can be downloaded from http://pub.math.leidenuniv.nl/
More informationMathematical Journal of Okayama University
Mathematical Journal of Okayama University Volume 48, Issue 1 2006 Article 1 JANUARY 2006 On Euclidean Algorithm Kaoru Motose Hirosaki University Copyright c 2006 by the authors. Mathematical Journal of
More informationSEVERAL PROOFS OF THE IRREDUCIBILITY OF THE CYCLOTOMIC POLYNOMIALS
SEVERAL PROOFS OF THE IRREDUCIBILITY OF THE CYCLOTOMIC POLYNOMIALS STEVEN H. WEINTRAUB ABSTRACT. We present a number of classical proofs of the irreducibility of the n-th cyclotomic polynomial Φ n (x).
More informationQ N id β. 2. Let I and J be ideals in a commutative ring A. Give a simple description of
Additional Problems 1. Let A be a commutative ring and let 0 M α N β P 0 be a short exact sequence of A-modules. Let Q be an A-module. i) Show that the naturally induced sequence is exact, but that 0 Hom(P,
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationOn Permutation Polynomials over Local Finite Commutative Rings
International Journal of Algebra, Vol. 12, 2018, no. 7, 285-295 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2018.8935 On Permutation Polynomials over Local Finite Commutative Rings Javier
More informationp-cycles, S 2 -sets and Curves with Many Points
Facultad de Ciencias Naturales y Exactas Universidad del Valle p-cycles, S 2 -sets and Curves with Many Points Álvaro Garzón R. Universidad del Valle Received: December 16, 2016 Accepted: June 13, 2017
More informationBulletin of the Iranian Mathematical Society
ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online) Special Issue of the Bulletin of the Iranian Mathematical Society in Honor of Professor Heydar Radjavi s 80th Birthday Vol 41 (2015), No 7, pp 155 173 Title:
More informationRepeated-Root Self-Dual Negacyclic Codes over Finite Fields
Journal of Mathematical Research with Applications May, 2016, Vol. 36, No. 3, pp. 275 284 DOI:10.3770/j.issn:2095-2651.2016.03.004 Http://jmre.dlut.edu.cn Repeated-Root Self-Dual Negacyclic Codes over
More informationGreatest Common Divisor MATH Greatest Common Divisor. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Greatest Common Divisor Benjamin V.C. Collins James A. Swenson The world s least necessary definition Definition Let a, b Z, not both zero. The largest integer d such that d a and d b is called
More informationREDUCTION OF ELLIPTIC CURVES OVER CERTAIN REAL QUADRATIC NUMBER FIELDS
MATHEMATICS OF COMPUTATION Volume 68, Number 228, Pages 1679 1685 S 0025-5718(99)01129-1 Article electronically published on May 21, 1999 REDUCTION OF ELLIPTIC CURVES OVER CERTAIN REAL QUADRATIC NUMBER
More informationContents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains
Ring Theory (part 4): Arithmetic and Unique Factorization in Integral Domains (by Evan Dummit, 018, v. 1.00) Contents 4 Arithmetic and Unique Factorization in Integral Domains 1 4.1 Euclidean Domains and
More informationON TYPES OF MATRICES AND CENTRALIZERS OF MATRICES AND PERMUTATIONS
ON TYPES OF MATRICES AND CENTRALIZERS OF MATRICES AND PERMUTATIONS JOHN R. BRITNELL AND MARK WILDON Abstract. It is known that that the centralizer of a matrix over a finite field depends, up to conjugacy,
More informationON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE
ON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE AMIR AKBARY, DRAGOS GHIOCA, AND QIANG WANG Abstract. We count permutation polynomials of F q which are sums of m + 2 monomials of prescribed degrees. This
More informationTo Professor W. M. Schmidt on his 60th birthday
ACTA ARITHMETICA LXVII.3 (1994) On the irreducibility of neighbouring polynomials by K. Győry (Debrecen) To Professor W. M. Schmidt on his 60th birthday 1. Introduction. Denote by P the length of a polynomial
More informationSOLVING SOLVABLE QUINTICS. D. S. Dummit
D. S. Dummit Abstract. Let f(x) = x 5 + px 3 + qx + rx + s be an irreducible polynomial of degree 5 with rational coefficients. An explicit resolvent sextic is constructed which has a rational root if
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationODD REPDIGITS TO SMALL BASES ARE NOT PERFECT
#A34 INTEGERS 1 (01) ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT Kevin A. Broughan Department of Mathematics, University of Waikato, Hamilton 316, New Zealand kab@waikato.ac.nz Qizhi Zhou Department of
More informationINFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS
INFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS YONGWEI YAO Abstract. For any commutative ring R that is not a domain, there is a zerodivisor graph, denoted Γ(R), in which the vertices are the nonzero zero-divisors
More informationA Gel fond type criterion in degree two
ACTA ARITHMETICA 111.1 2004 A Gel fond type criterion in degree two by Benoit Arbour Montréal and Damien Roy Ottawa 1. Introduction. Let ξ be any real number and let n be a positive integer. Defining the
More informationCDM. Finite Fields. Klaus Sutner Carnegie Mellon University. Fall 2018
CDM Finite Fields Klaus Sutner Carnegie Mellon University Fall 2018 1 Ideals The Structure theorem Where Are We? 3 We know that every finite field carries two apparently separate structures: additive and
More informationFinite fields: some applications Michel Waldschmidt 1
Ho Chi Minh University of Science HCMUS Update: 16/09/2013 Finite fields: some applications Michel Waldschmidt 1 Exercises We fix an algebraic closure F p of the prime field F p of characteristic p. When
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationDetermining elements of minimal index in an infinite family of totally real bicyclic biquadratic number fields
Determining elements of minimal index in an infinite family of totally real bicyclic biquadratic number fields István Gaál, University of Debrecen, Mathematical Institute H 4010 Debrecen Pf.12., Hungary
More information9. Finite fields. 1. Uniqueness
9. Finite fields 9.1 Uniqueness 9.2 Frobenius automorphisms 9.3 Counting irreducibles 1. Uniqueness Among other things, the following result justifies speaking of the field with p n elements (for prime
More information1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism
1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials
More informationThe Riemann Hypothesis for Function Fields
The Riemann Hypothesis for Function Fields Trevor Vilardi MthSc 952 1 Function Fields Let F = F q be the finite field with q elements (q is a prime power). Definiton 1. Let K/F (x) be an extension of F.
More informationDICKSON POLYNOMIALS OVER FINITE FIELDS. n n i. i ( a) i x n 2i. y, a = yn+1 a n+1 /y n+1
DICKSON POLYNOMIALS OVER FINITE FIELDS QIANG WANG AND JOSEPH L. YUCAS Abstract. In this paper we introduce the notion of Dickson polynomials of the k + 1)-th kind over finite fields F p m and study basic
More informationAlgebraic Cryptography Exam 2 Review
Algebraic Cryptography Exam 2 Review You should be able to do the problems assigned as homework, as well as problems from Chapter 3 2 and 3. You should also be able to complete the following exercises:
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More information