On squares in Lucas sequences


 Lynette Bryan
 1 years ago
 Views:
Transcription
1 On squares in Lucas sequences A. Bremner N. Tzanakis July, 2006 Abstract Let P and Q be nonzero integers. The Lucas sequence {U n (P, Q)} is defined by U 0 = 0, U 1 = 1, U n = P U n 1 QU n 2 (n 2). The question of when U n (P, Q) can be a perfect square has generated interest in the literature. We show that for n = 2,..., 7, U n is a square for infinitely many pairs (P, Q) with gcd(p, Q) = 1; further, for n = 8,..., 12, the only nondegenerate sequences where gcd(p, Q) = 1 and U n (P, Q) =, are given by U 8 (1, 4) = 21 2, U 8 (4, 17) = 620 2, and U 12 (1, 1) = Keywords: Lucas sequence, squares, genus two curves 1 Introduction Let P and Q be nonzero integers. The Lucas sequence {U n (P, Q)} is defined by U 0 = 0, U 1 = 1, U n = P U n 1 QU n 2 (n 2). (1) The sequence {U n (1, 1)} is the familiar Fibonacci sequence, and it was proved by Cohn [6] in 1964 that the only perfect square greater than 1 in this sequence is U 12 = 144. The question arises, for which parameters P, Q, can U n (P, Q) be a perfect square? In what follows, we shall assume that we are not dealing with the degenerate sequences corresponding to (P, Q) = (±1, 1), where U n is periodic with period 3, and we also assume (P, Q) ( 2, 1) (in which case U n = precisely when n is an odd square) and (P, Q) (2, 1) (when U n = precisely when n is square). Ribenboim and McDaniel [10] with only elementary methods show that when P and Q are odd, and P 2 4Q > 0, then U n can be square only for n = 0, 1, 2, 3, 6 or 12; and that there are at most two indices greater than 1 Department of Mathematics, Arizona State University, Tempe AZ, USA, andrew/bremner.html Department of Mathematics, University of Crete, Iraklion, Greece, tzanakis 1
2 for which U n can be square. They characterize fully the instances when U n =, for n = 2, 3, 6. Bremner & Tzanakis [1] extend these results by determining all Lucas sequences {U n (P, Q)} with U 12 =, subject only to the restriction that gcd(p, Q) = 1 (it turns out that the Fibonacci sequence provides the only example). Under the same hypothesis, all Lucas sequences with {U n (P, Q)} with U 9 = are determined. There seems little mention in the literature of when under general hypotheses U n (P, Q) can be a perfect square. It is straightforward to see from Theorem 1 of Darmon and Granville [7] that for n sufficiently large (n 11 certainly suffices), the equation U n (P, Q) = can have only finitely many solutions for coprime P, Q. Note that for n 1, U n (kp, k 2 Q) = k n 1 U n (P, Q), and so for fixed P, Q, and even n, appropriate choice of k gives a sequence with U n (kp, k 2 Q) a perfect square. The restriction to gcd(p, Q) = 1 is therefore a sensible one, and we shall assume this from now on. Rather curiously, a small computer search reveals sequences with U n (P, Q) a perfect square only for n = 0,..., 8, and n = 12. In this paper, we shall dispose of this range of n. Bremner & Tzanakis [1] have addressed the cases n = 9, 12. Section 2 of this paper addresses the case U n (P, Q) =, n 7, which can be treated entirely elementarily. Section 3 addresses the cases U n (P, Q) =, 8 n 11. In these instances, we deduce a finite collection of curves, whose rational points cover all required solutions. In turn, this reduces to a number of problems of similar type, namely, finding all points on an elliptic curve defined over a number field K subject to a Qrationality condition on the Xcoordinate. Nils Bruin has powerful techniques for addressing this type of problem, and [2], [3], [4], [] provide details and examples. See in particular 4 of [] for development of the underlying mathematics. The latest release of Magma [9] now contains Bruin s routines and so we only set up the appropriate computation here, with details of the Magma programs available on request. The results of Sections 2, 3, when combined with the results of Bremner & Tzanakis [1] give the following theorem: Theorem 1. Let P, Q be nonzero coprime integers such that if Q = 1 then P ±1, ±2 (that is, P, Q determine a nondegenerate Lucas sequence). Then (i) for n = 2,..., 7, U n (P, Q) is a square for infinitely many such pairs (P, Q), and (ii) for n = 8,..., 12, the only solutions of U n (P, Q) = are given by U 8 (1, 4) = 21 2, U 8 (4, 17) = 620 2, and U 12 (1, 1) = Solution of U n (P, Q) =, n 7 Certainly U 2 (P, Q) = if and only if P = a 2, and U 3 (P, Q) = if and only if P 2 Q = a 2. Now U 4 (P, Q) = if and only if P (P 2 2Q) =, so if and only if either P = δa 2, Q = 1 2 (a4 δb 2 ), or P = 2δa 2, Q = 2a 4 δb 2, with δ = ±1 (where, in 2
3 the first instance, ab is odd and in the second instance b is odd). The demand that U (P, Q) be square is that P 4 3P 2 Q + Q 2 =, equivalently, that 1 3x + x 2 =, where x = Q/P 2. Parametrizing the quadric, Q/P 2 = (λ 2 + 6λµ + µ 2 )/(4λµ), where, without loss of generality, (λ, µ) = 1, λ > 0, and µ 0 (mod ). Necessarily (λ, µ) = (a 2, ±b 2 ), giving (P, Q) = (2ab, a 4 + 6a 2 b 2 + b 4 ) or (2ab, a 4 + 6a 2 b 2 b 4 ) if a and b are of opposite parity, and (P, Q) = (ab, 1 4 (a4 + 6a 2 b 2 + b 4 )) or (ab, 1 4 ( a4 + 6a 2 b 2 b 4 )), if a and b are both odd. The demand that U 6 (P, Q) be square is that P (P 2 Q)(P 2 3Q) =, which leads to one of seven cases: P = a 2, P 2 Q = b 2, with 2a 4 + 3b 2 = ; P = a 2, P 2 Q = 2b 2, with a 4 + 3b 2 = ; P = a 2, P 2 Q = 2b 2, with a 4 3b 2 = ; and P = 3a 2, P 2 Q = δb 2, (δ = ±1, ±2), with 6 δ a4 + b 2 =. So finitely many parametrizations result (which can easily be obtained if we wish to do so). The demand that U 7 (P, Q) be square is that P 6 P 4 Q + 6P 2 Q 2 Q 3 =, equivalently, that 1 + x + 6x 2 + x 3 = y 2, where x = Q/P 2. This latter elliptic curve has rank 1, with generator P 0 = ( 1, 1), and trivial torsion. Accordingly, sequences with U 7 (P, Q) = are parametrized by the multiples of P 0 on the above elliptic curve, corresponding to (±P, Q) = (1, 1), (1, ), (2, 1), (, 21), (1, 104), (21, 4), (2, 41),... 3 Solution of U n (P, Q) =, n = 8, 10, 11 Here we shall show the following result: Theorem. The only nondegenerate sequences where gcd(p, Q) = 1 and U n (P, Q) =, 8 n 11, are given by U 8 (1, 4) = 21 2 and U 8 (4, 17) = For each n {8, 10, 11} we reduce the solution of our problem to a number of questions, all having the following general shape: Problem 1. Let E : Y 2 + a 1 XY + a 3 Y = X 3 + a 2 X 2 + a 4 X + a 6 (2) be an elliptic curve defined over Q(α), where α is a root of a polynomial f(x) Z[X], irreducible over Q, of degree d 2, and let β, γ Q(α) be algebraic integers. Find all points (X, Y ) E(Q(α)) for which βx+γ is a rational number. As mentioned in the Introduction, problems of this type may be attacked with the Magma routines of Nils Bruin, in particular the routine Chabauty using output from PseudoMordellWeilGroup. It is not a priori guaranteed that these routines will be successful, particularly over number fields of high degree, but for our purposes and the computations encountered in this paper, no difficulties arose. 3
4 3.1 n = 8 The demand that U 8 (P, Q) be square is that P (P 2 2Q)(P 4 4P 2 Q + 2Q 2 ) =. In the case P is odd, it follows that (P, P 2 2Q, P 4 4P 2 Q + 2Q 2 ) = (a 2, b 2, c 2 ), (a 2, b 2, c 2 ), ( a 2, b 2, c 2 ), or ( a 2, b 2, c 2 ), where a, b, c are positive integers with ab odd. The latter two possibilities are impossible modulo 4, and the first two possibilities lead respectively to: a 8 + 2a 4 b 2 + b 4 = 2c 2 (3) a 8 2a 4 b 2 + b 4 = 2c 2. (4) We shall see that the only positive solutions to the above equations are (a, b) = (1, 1), (1, 3) and (1, 1) respectively, leading to (P, Q) = (1, 0), (1, 4) and (1, 1), from which we reject the first one. The last gives a degenerate sequence. In the case that P is even, then Q is odd, and 2 exactly divides both P 4 4P 2 Q + 2Q 2 and P 2 2Q, forcing P 0 (mod 4). Put P = 4p, so that U 8 = if and only if p(8p 2 Q)(128p 4 32p 2 Q + Q 2 ) =, with gcd(p, Q) = 1. It follows that (p, 8p 2 Q, 128p 4 32p 2 Q + Q 2 ) = (a 2, b 2, c 2 ), (a 2, b 2, c 2 ), ( a 2, b 2, c 2 ), or ( a 2, b 2, c 2 ), where a, b, c are positive integers, (a, b) = 1 and bc is odd. The middle two possibilities are impossible modulo 4, and the remaining two possibilities lead respectively to: 64a a 4 b 2 + b 4 = c 2 () 64a 8 16a 4 b 2 + b 4 = c 2. (6) We shall see that the only positive solution which leads to a desired pair (P, Q) is from the first equation when (a, b) = (1, ), leading to (P, Q) = (4, 17). We shall work in the number field K = Q(φ) where φ is a root of f φ (x) = x 4 + 2x 2 1. The class number of K is 1, the maximal order O of K is Z[φ], and fundamental units of O are η 1 = φ, η 2 = 2 3φ + φ 2 φ 3. The factorization of 2 is 2 = η1 4 η2(1 2 + φ) Equation (3) The factorization of (3) over K is (b φa 2 )(b + φa 2 )(b 2 + (2 + φ 2 )a 4 ) = 2, and it is easy to see that each of the first two factors is exactly divisible by 1 + φ and the third factor is exactly divisible by (1 + φ) 2. Thus the gcd of any two (ideal) terms on the left hand side is equal to (1 + φ), and b + φa 2 = ±η i 1 1 η i 2 2 (1 + φ), b 2 + (2 + φ 2 )a 4 = ±η j 1 1 η j 2 2 (1 + φ) 2, (7) 4
5 where the exponents of the units are 0,1. Specializing φ at the real root of f φ (x), and using b > 0, then necessarily the sign on the right hand side must be positive. Taking norms in the first equation gives 2c 2 = ( 1) i 1 2, so that i 1 = 0. Applying the automorphism of K defined by φ φ, it follows that b φa 2 = η i 2 2 (1 φ) = η i 2+1 displayed equations at (7) gives η j 1 1 η j 2+1 now have 2 (1 + φ). Multiplying this equation by the two 2 = 2c 2 =, so that j 1 = 0, j 2 = 1. We (b + φa 2 )(b 2 + (2 + φ 2 )a 4 ) = η j 2(1 + φ), with j = 0, 1. Putting b/a 2 = δ 1 x/(1 + φ), where δ {1, η 2 }, our problem reduces to finding all Kpoints (x, y) on the curves (x + φ(1 + φ)δ)(x 2 + (2 + φ 2 )(1 + φ) 2 δ 2 ) = y 2, subject to δ 1 x/(1+φ) Q. For both curves, the Magma routines of Bruin show that solutions to (3) occur only for (±a, ±b) = (1, 1), (1, 3) Equation (4) As above, (4) leads to equations b + φ 1 a 2 = η i 1 1 η i 2 2 (1 + φ), b 2 + ( 2 + φ 2 )a 4 = η j 1 1 η j 2 2 (1 + φ) 2, with exponents 0, 1. Taking norms in the first equation gives 2c 2 = ( 1) i 1 2, so that i 1 = 1; and specializing φ at the real root of f φ (x) in the second equation gives j 1 = 0. We thus obtain (b + φ 1 a 2 )(b 2 + ( 2 + φ 2 )a 4 ) = η 1 η j 2(1 + φ), with j = 0, 1. Putting b/a 2 = δ 1 x/(1 + φ), where δ = η 1 η j 2, we thus have to find all Kpoints (x, y) on the curves (x φ φ δ)(x2 + ( φ 2 )(1 + φ)2 δ 2 ) = y 2, such that δ 1 x Q, for δ = η 1+φ 1, η 1 η 2. The Magma routines show that solutions to (4) occur only for (±a, ±b) = (1, 1) Equation () As above, () leads to equations b + 2(φ 3 + φ)a 2 = η i 1 1 η i 2 2, b 2 + 8(2 + φ 2 )a 4 = η j 1 1 η j 2 2, with exponents 0, 1. Arguing just as for equation (3), we deduce i 1 = 0, and j 1 = 0, j 2 = 0. Thus (b + 2(φ 3 + φ)a 2 )(b 2 + 8(2 + φ 2 )a 4 ) = η j 2,
6 with j = 0, 1. For a 0, put b/a 2 = δ 1 x, where δ = η j 2, which leads to seeking all Kpoints (x, y) on the curves (x + 2(φ 3 + φ)δ)(x 2 + 8(φ 2 + 2)δ 2 ) = y 2, subject to δ 1 x Q, with δ = 1, η 2. Magma routines show the only solutions of () are given by (±a, ±b) = (0, 1), (1, 2), (1, ), of which only the third provides a desired pair (P, Q) Equation (6) Arguing as in previous cases, we deduce an equation (b + 2(φ 3 + 3φ)a 2 )(b 2 + 8φ 2 a 4 ) = η j 2, with j = 0, 1. For a 0, put b/a 2 = δ 1 x, where δ = η j 2. This leads to finding all Kpoints (x, y) on the curves (x + 2(φ 3 + 3φ)δ)(x 2 + 8φ 2 δ 2 ) =, with δ 1 x Q, and δ = 1, η 2. Magma routines show the only solution of (6) occurs for a = 0, with no solution for (P, Q). 3.2 n = 10 The equation U 10 = is given by P (P 4 3P 2 Q + Q 2 )(P 4 P 2 Q + Q 2 ) =. (8) Our aim is to show that the only integer solutions are given by (P, Q) = (1, 0), (0, 1), ( 1, 1). The assumption gcd(p, Q) = 1 implies that P is coprime to the second factor on the left at (8), and may only have the divisor in common with the third factor. Further, the second and third factors can only have common divisor 2, impossible for gcd(p, Q) = 1. Putting (x, y) = (P 2, Q), then factorization over Z implies x 2 3xy + y 2 = d 1 z 2, x 2 xy + y 2 = d 2 w 2, with d 1 = ±1, d 2 = ±1, ±, giving 8 curves of genus 1. Most of the possibilities for (d 1, d 2 ) are readily eliminated, either by local consideration, or by leading to rank 0 elliptic curves; the case (d 1, d 2 ) = ( 1, ) however resists elementary treatment, apparently leading to a curve of genus 3 with Jacobian of rank 4. We have found it preferable to invoke factorization of (8) over K = Q( ), when (8) becomes P (P 2 ɛ 2 Q)(P 2 ɛ 2 Q)(P 2 ɛq)(p 2 ɛ 1 Q) =, (9) 6
7 where ɛ = (1 + )/2 is a fundamental unit of the ring of integers O K of K, of class number 1. Denote with a bar conjugation under, so that ɛ = ɛ 1. We have two cases to consider: (1) (P, ) = 1, and (2) (P, ) =. Case (1): (P, ) = 1. It follows that P = ±p 2, and p 4 ɛ 2 Q = λ 1 α 2 1, p 4 ɛ Q = λ 2 α 2 2, p 4 ɛ 2 Q = λ 1 ᾱ 1 2, p 4 ɛ 1 Q = λ 2 ᾱ 2 2 where λ i, α i O K, with λ i units. Equivalently, since p 0, 1 ɛ 2 q = λ 1 β 2 1, 1 ɛ q = λ 2 β 2 2, 1 ɛ 2 q = λ 1 β1 2, 1 ɛ 1 q = λ 2 β2 2, (10) where q = Q/p 4 Q, β i K, and without loss of generality, λ i {±1, ±ɛ}. From the first three of these equations, (q ɛ 2 )(q ɛ 2 )(q ɛ 1 ) = λ 1 λ1 λ 2 ɛ 1 = v ɛ 1, where v = λ 1 λ1 λ 2 = ±λ 2. Putting x = δq, δ = vɛ, where δ 1 x Q, then (x vɛ 1 )(x vɛ 3 )(x v) =. If v = ±λ 2 = ±1, then one of the following equations holds: y 2 = (x (3 ɛ))(x (3 + 4ɛ))(x 1) (11) y 2 = (x + (3 ɛ))(x + (3 + 4ɛ))(x + 1) (12) under the condition ɛ 1 x Q. Equation (11) defines an elliptic curve of Krank 0, with no corresponding value of Q; equation (12) defines an elliptic curve of positive Krank, and the Magma routines show that the only points satisfying the rationality condition are (x, ±y) = (0, ɛ ), ( 2 ɛ, 1 + 3ɛ), corresponding to Q = 0 and Q = 1. If λ 2 = ±ɛ, then one of the following equations holds: y 2 = (x )(x ɛ 4 ))(x ɛ) y 2 = (x + )(x + ɛ 4 ))(x + ɛ) under the condition ɛ 2 x Q. Both these curves have Krank 0, and no solution to our problem arises. 7
8 Case (2): (P, ) =. We have P = ±p 2, and (2p 4 ɛ 2 Q)(2p 4 ɛ 2 Q)( p 4 ɛq)( p 4 ɛ 1 Q) = ±, so that either p = 0 (returning the solution (P, Q) = (0, 1) to (8)), or ɛ 2 r = µ 1 γ 2 1, ɛ 2 r = µ 1 γ 1 2, ɛr = µ2 γ 2, 2 ɛ 1 r = µ 2 γ 2 2, (13) where r = Q/(p 4 ) Q, γ i K, and µ i units of O K, without loss of generality in the set {±1, ±ɛ}. From the first three of these equations, (r ɛ 2 )(r ɛ 2 )(r ɛ 1 ) = µ 1 µ 1 µ 2 ɛ 1 = wɛ 1, where w = µ 1 µ 1 µ 2 = ±µ 2. Putting then x = ηr, η = wɛ, where η 1 x Q, (x wɛ 1 )(x wɛ 3 )(x w ) =. If w = ±µ 2 = ±1, then one of the following equations holds: y 2 = (x ɛ 1 )(x ɛ 3 )(x ) (14) y 2 = (x + ɛ 1 )(x + ɛ 3 )(x + ) (1) under the condition ɛ 1 x Q. If w = ±ɛ, then one of the following equations holds: y 2 = (x )(x ɛ 4 )(x ɛ ) (16) y 2 = (x + )(x + ɛ 4 )(x + ɛ ) (17) under the condition ɛ 2 x Q. These last four equations define elliptic curves, the first three of which have positive Krank, the fourth having Krank 0 (giving no solution to our problem). Magma computations show that no solutions arise from the first three curves. (Computations do disclose the point (x, y) = ( 2ɛ, ɛ) on (1) satisfying the rationality condition, but this point leads to (P, Q) = (, 10), disallowed for our original problem). 3.3 n = 11 The equation U 11 = is given by U 11 (P, Q) = P 10 9P 8 Q + 28P 6 Q 2 3P 4 Q 3 + 1P 2 Q 4 Q = M 2. (18) 8
9 There is the trivial solution given by (P, Q) = (0, 1), and henceforth we assume P 0. Our aim is to show that when gcd(p, Q) = 1, the only integer solution of (18) is given by (P 2, Q) = (1, 0). On putting x = Q/P 2, y = M/P, equation (18) becomes that of a genus 2 curve C : y 2 = x + 1x 4 3x x 2 9x + 1, and Magma computations show that the Jacobian J of C has rank 1, so that a Chabauty argument can be applied to determine all rational points of C. A generator is found to be { ( (3 + )/2, (11 + )/2 ) } (where is the unique point at infinity on C), and Magma tells us that there is at most one pair of rational points on C, which is accordingly (0, ±1) as required. Full details of such an argument may be found in Flynn, Poonen, Schaefer [8]. For greater transparency, we outline the method that reduces as in previous cases to finding points on elliptic curves over a number field under a certain rationality condition. We shall be working over a Galois field, and this approach requires only application of the formal group of an elliptic curve, conceptually more straightforward than invoking the formal group of a curve of genus 2. It is easy to see that j= M 2 = u 11 (P, Q) = ((ζ j/2 + ζ j/2 ) 2 P 2 Q), (19) j=1 and thus U 11 (P, Q) splits completely over the real subfield of the cyclotomic field Q(ζ) = Q(ζ 11 ). Let θ = ζ + ζ 1, so that f θ (θ) = θ + θ 4 4θ 3 3θ 2 + 3θ + 1 = 0, and work in the number field K = Q(θ), with ring of integers O K = Z[θ], discriminant 11 4, and classnumber 1. The unit group is of rank 4, and generators may be taken as: ɛ 1 = θ, ɛ 2 = θ 2 + 2, ɛ 3 = θ 4 + 4θ 2 2, ɛ 4 = θ 3 + 3θ, with norms all equal +1. Rewrite (19) in the form j= M 2 = L j (P, Q), (20) j=1 where L j (P, Q) = θ j P 2 Q, with θ j = (ζ j/2 + ζ j/2 ) 2. The Galois group of Q(θ)/Q is cyclic, generated by the automorphism σ : θ θ 2 2, which acts cyclically on the θ i, and satisfies ɛ σ i = ɛ i+1 for i = 1, 2, 3, ɛ σ 4 = ɛ 1 1 ɛ 1 2 ɛ 1 3 ɛ 1 4. Since U 11 (x, 1) 0 mod 11 2 has no solution, M 0 mod 11; so each factor L j (P, Q) is prime to 11 in O K. Further, for j k, the K/Q norm of θ j θ k is 9
10 ±11, and it follows that the factors L j (P, Q) for j = 1,..., are coprime in O K. Accordingly, L 1 (P, Q) = (θ 4 θ 3 2θ 2 + θ + 1)P 2 Q = ( 1) i 0 ɛ i 1 1 ɛ i 2 2 ɛ i 3 3 ɛ i 4 4, (21) where i 0, i 1,..., i 4 {0, 1}. Since the norm of L 1 (P, Q) equals M 2, we must have i 0 = 0. Now let : Q(θ) R be the embedding that sends θ to the smallest real root of f θ (x). It is straightforward to check that θ1 > θ4 > θ > θ3 > θ2, whence L 1 > L 4 > L > L 3 > L 2. (22) Since (20) implies that the exact number of the L j that are negative must be even, then (22) gives L 1 > 0. But ɛ 1 > 0, ɛ 2 < 0, ɛ 3 < 0, ɛ 4 > 0, and so necessarily i 2 + i 3 is even. By applying σ repeatedly to (21) we obtain: sgn(l 2) = ( 1) i 1+i 2, sgn(l 3) = ( 1) i 1, sgn(l 4) = ( 1) i 4, sgn(l ) = ( 1) i 3+i 4. Listing the 8 possibilities for (i 1, i 2, i 3, i 4 ), together with the corresponding signs of the L i, the only ones that respect the linear ordering (22) are (0, 0, 0, 0), (1, 0, 0, 0), and (1, 0, 0, 1). The conclusion is that Certainly L 1 (P, Q) = θ 1 P 2 Q = η, η {1, ɛ 1, ɛ 1 ɛ 4 }. L 1 = η, L 2 = η σ, L 3 = η σ2, L 4 = η σ3, L = η σ4, and we have various possibilities for producing an elliptic curve cover of our original equation. When η = 1, then (θ 1 P 2 Q)(θ 2 P 2 Q)(θ 3 P 2 Q) =, so that x = Q/P 2 is the xcoordinate of a Krational point on the elliptic curve (x + θ 1 )(x + θ 2 )(x + θ 3 ) = y 2, with x Q. Magma computations show that the only such points on this curve are at infinity (corresponding to P = 0), and (x, y) = (0, ɛ 3 ɛ 4 ), corresponding to (P 2, Q) = (1, 0). When η = ɛ 1 or ɛ 1 ɛ 4, then (θ 1 P 2 Q)(θ 2 P 2 Q)(θ 3 P 2 Q) = δ, with δ = ɛ 1 ɛ 2 ɛ 3 or ɛ 1, respectively; and x = δq/p 2 is the xcoordinate of a Krational point on the elliptic curve (x + δθ 1 )(x + δθ 2 )(x + δθ 3 ) = y 2, 10
11 satisfying δ 1 x Q. These two curves both have positive Krank, and by the Magma routines lead to no nontrivial solutions for P, Q. Acknowledgement: We thank the anonymous referee for several useful comments. References [1] A. Bremner and N. Tzanakis, Lucas sequences whose 12th or 9th term is a square, J. Number Theory, 107 (2004), [2] N. Bruin, The primitive solutions to x 3 + y 9 = z 2, J. Number Theory, 111 (200), [3] N. Bruin and N.D. Elkies, Trinomials ax 7 +bx+c and ax 8 +bx+c with Galois Groups of Order 168 and 8 168, Algorithmic Number Theory, th International Symposium, ANTSV, (Claus Fieker, David R. Kohel Eds.), Lecture Notes in Computer Science 2369 Springer (2002), [4] N. Bruin, Chabauty methods and covering techniques applied to generalized Fermat equations, CWI Tract, vol. 133, Stichtung Mathematisch Centrum Centrum voor Wiskunde en Informatica, Amsterdam (2002), Dissertation, University of Leiden, Leiden (1999). [] N. Bruin, Chabauty methods using elliptic curves, J. reine angew. Math., 62 (2003), [6] J.H.E. Cohn, On square Fibonacci numbers, J. London Math. Soc. 39 (1964), [7] On the equations z m = F (x, y) and Ax p + By q = Cz r, Bull. London Math. Soc. 27 (199), [8] E.V. Flynn, B. Poonen, and E. Schaefer, Cycles of quadratic polynomials and rational points on a genus2 curve, Duke Math. J., 90 (1997), no. 3, [9] Magma, < [10] P. Ribenboim and W.L. McDaniel, The square terms in Lucas sequences, J. Number Theory, 8, 1996,
Arithmetic properties of periodic points of quadratic maps, II
ACTA ARITHMETICA LXXXVII.2 (1998) Arithmetic properties of periodic points of quadratic maps, II by Patrick Morton (Wellesley, Mass.) 1. Introduction. In this paper we prove that the quadratic map x f(x)
More informationarxiv: v1 [math.nt] 8 Sep 2014
arxiv:1409.2463v1 [math.nt] 8 Sep 2014 On the Diophantine equation X 2N +2 2α 5 2β p 2γ = Z 5 Eva G. Goedhart and Helen G. Grundman Abstract We prove that for each odd prime p, positive integer α, and
More informationExplicit solution of a class of quartic Thue equations
ACTA ARITHMETICA LXIV.3 (1993) Explicit solution of a class of quartic Thue equations by Nikos Tzanakis (Iraklion) 1. Introduction. In this paper we deal with the efficient solution of a certain interesting
More informationMath 201C Homework. Edward Burkard. g 1 (u) v + f 2(u) g 2 (u) v2 + + f n(u) a 2,k u k v a 1,k u k v + k=0. k=0 d
Math 201C Homework Edward Burkard 5.1. Field Extensions. 5. Fields and Galois Theory Exercise 5.1.7. If v is algebraic over K(u) for some u F and v is transcendental over K, then u is algebraic over K(v).
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics MOD p REPRESENTATIONS ON ELLIPTIC CURVES FRANK CALEGARI Volume 225 No. 1 May 2006 PACIFIC JOURNAL OF MATHEMATICS Vol. 225, No. 1, 2006 MOD p REPRESENTATIONS ON ELLIPTIC
More informationGraduate Preliminary Examination
Graduate Preliminary Examination Algebra II 18.2.2005: 3 hours Problem 1. Prove or give a counterexample to the following statement: If M/L and L/K are algebraic extensions of fields, then M/K is algebraic.
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 informationTHE padic VALUATION OF LUCAS SEQUENCES
THE padic VALUATION OF LUCAS SEQUENCES CARLO SANNA Abstract. Let (u n) n 0 be a nondegenerate Lucas sequence with characteristic polynomial X 2 ax b, for some relatively prime integers a and b. For each
More informationOn elliptic curves in characteristic 2 with wild additive reduction
ACTA ARITHMETICA XCI.2 (1999) On elliptic curves in characteristic 2 with wild additive reduction by Andreas Schweizer (Montreal) Introduction. In [Ge1] Gekeler classified all elliptic curves over F 2
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 informationDivisibility Sequences for Elliptic Curves with Complex Multiplication
Divisibility Sequences for Elliptic Curves with Complex Multiplication Master s thesis, Universiteit Utrecht supervisor: Gunther Cornelissen Universiteit Leiden Journées Arithmétiques, Edinburgh, July
More informationHermitian modular forms congruent to 1 modulo p.
Hermitian modular forms congruent to 1 modulo p. arxiv:0810.5310v1 [math.nt] 29 Oct 2008 Michael Hentschel Lehrstuhl A für Mathematik, RWTH Aachen University, 52056 Aachen, Germany, hentschel@matha.rwthaachen.de
More informationHeronian Tetrahedra Are Lattice Tetrahedra
Heronian Tetrahedra Are Lattice Tetrahedra Susan H. Marshall and Alexander R. Perlis Abstract. Extending a similar result about triangles, we show that each Heronian tetrahedron may be positioned with
More informationAppending Digits to Generate an Infinite Sequence of Composite Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 2011, Article 11.5.7 Appending Digits to Generate an Infinite Sequence of Composite Numbers Lenny Jones and Daniel White Department of Mathematics
More informationTHE ARTINSCHREIER THEOREM KEITH CONRAD
THE ARTINSCHREIER THEOREM KEITH CONRAD 1. Introduction The algebraic closure of R is C, which is a finite extension. Are there other fields which are not algebraically closed but have an algebraic closure
More informationAlgorithm for Concordant Forms
Algorithm for Concordant Forms Hagen Knaf, Erich Selder, Karlheinz Spindler 1 Introduction It is well known that the determination of the MordellWeil group of an elliptic curve is a difficult problem.
More informationThe Kummer Pairing. Alexander J. Barrios Purdue University. 12 September 2013
The Kummer Pairing Alexander J. Barrios Purdue University 12 September 2013 Preliminaries Theorem 1 (Artin. Let ψ 1, ψ 2,..., ψ n be distinct group homomorphisms from a group G into K, where K is a field.
More information3.4. ZEROS OF POLYNOMIAL FUNCTIONS
3.4. ZEROS OF POLYNOMIAL FUNCTIONS What You Should Learn Use the Fundamental Theorem of Algebra to determine the number of zeros of polynomial functions. Find rational zeros of polynomial functions. Find
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 informationPOSITIVE DEFINITE nregular QUADRATIC FORMS
POSITIVE DEFINITE nregular QUADRATIC FORMS BYEONGKWEON OH Abstract. A positive definite integral quadratic form f is called n regular if f represents every quadratic form of rank n that is represented
More informationDip. Matem. & Fisica. Notations. Università Roma Tre. Fields of characteristics 0. 1 Z is the ring of integers. 2 Q is the field of rational numbers
On Never rimitive points for Elliptic curves Notations The 8 th International Conference on Science and Mathematical Education in Developing Countries Fields of characteristics 0 Z is the ring of integers
More information1 First Theme: Sums of Squares
I will try to organize the work of this semester around several classical questions. The first is, When is a prime p the sum of two squares? The question was raised by Fermat who gave the correct answer
More informationRAMIFICATION IN THE DIVISION FIELDS OF ELLIPTIC CURVES WITH POTENTIAL SUPERSINGULAR REDUCTION
RAMIFICATION IN THE DIVISION FIELDS OF ELLIPTIC CURVES WITH POTENTIAL SUPERSINGULAR REDUCTION ÁLVARO LOZANOROBLEDO Abstract. Let d 1 be fixed. Let F be a number field of degree d, and let E/F be an elliptic
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics ON THE DIOPHANTINE EQUATION xn 1 x 1 = y Yann Bugeaud, Maurice Mignotte, and Yves Roy Volume 193 No. 2 April 2000 PACIFIC JOURNAL OF MATHEMATICS Vol. 193, No. 2, 2000 ON
More informationarxiv: v1 [math.nt] 24 Jan 2008
René Schoof Amsterdam, February 4, 2008 Four primality testing algorithms arxiv:0801.3840v1 [math.nt] 24 Jan 2008 Introduction. In this expository paper we describe four primality tests. The first test
More informationHigher genus curves and the inverse Galois problem
Higher genus curves and the inverse Galois problem Samuele Anni joint work with Pedro Lemos and Samir Siksek University of Warwick Congreso de Jóvenes Investigadores de la Real Sociedad Matemática Española
More informationA SURVEY OF PRIMALITY TESTS
A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic
More informationOn the Representations of xy + yz + zx
On the Representations of xy + yz + zx Jonathan Borwein and KwokKwong Stephen Choi March 13, 2012 1 Introduction Recently, Crandall in [3] used Andrews identity for the cube of the Jacobian theta function
More informationKUMMER S LEMMA KEITH CONRAD
KUMMER S LEMMA KEITH CONRAD Let p be an odd prime and ζ ζ p be a primitive pth root of unity In the ring Z[ζ], the pth power of every element is congruent to a rational integer mod p, since (c 0 + c 1
More informationGaussian integers. 1 = a 2 + b 2 = c 2 + d 2.
Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d
More informationThe 8 th International Conference on Science and Mathematical Education in Developing Countries
On Never Primitive points for Elliptic curves The 8 th International Conference on Science and Mathematical Education in Developing Countries University of Yangon Myanmar 4 th 6 th December 2015, Francesco
More informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationChebyshev covers and exceptional number fields David P. Roberts University of Minnesota, Morris
Chebyshev covers and exceptional number fields David P. Roberts University of Minnesota, Morris 1. Context. A heuristic says that A N or S N number fields with discriminant ±2 a 5 b and degree N 49 need
More informationMath 192r, Problem Set #3: Solutions
Math 192r Problem Set #3: Solutions 1. Let F n be the nth Fibonacci number as Wilf indexes them (with F 0 F 1 1 F 2 2 etc.). Give a simple homogeneous linear recurrence relation satisfied by the sequence
More informationFINITELY GENERATED SIMPLE ALGEBRAS: A QUESTION OF B. I. PLOTKIN
FINITELY GENERATED SIMPLE ALGEBRAS: A QUESTION OF B. I. PLOTKIN A. I. LICHTMAN AND D. S. PASSMAN Abstract. In his recent series of lectures, Prof. B. I. Plotkin discussed geometrical properties of the
More informationChapter 7 Rational Expressions, Equations, and Functions
Chapter 7 Rational Expressions, Equations, and Functions Section 7.1: Simplifying, Multiplying, and Dividing Rational Expressions and Functions Section 7.2: Adding and Subtracting Rational Expressions
More informationFinite Fields and ErrorCorrecting Codes
Lecture Notes in Mathematics Finite Fields and ErrorCorrecting Codes KarlGustav Andersson (Lund University) (version 1.01316 September 2015) Translated from Swedish by Sigmundur Gudmundsson Contents
More informationGAUSS S LEMMA FOR NUMBER FIELDS
GAUSS S LEMMA FOR NUMBER FIELDS ARTURO MAGIDIN AND DAVID MCKINNON 1. Introduction. This note arose when the following question was asked on the newsgroup sci.math: Question 1.1. Can every polynomial with
More informationMod p Galois representations attached to modular forms
Mod p Galois representations attached to modular forms Ken Ribet UC Berkeley April 7, 2006 After Serre s article on elliptic curves was written in the early 1970s, his techniques were generalized and extended
More informationThe set of points at which a polynomial map is not proper
ANNALES POLONICI MATHEMATICI LVIII3 (1993) The set of points at which a polynomial map is not proper by Zbigniew Jelonek (Kraków) Abstract We describe the set of points over which a dominant polynomial
More informationCMFields with Cyclic Ideal Class Groups of 2Power Orders
journal of number theory 67, 110 (1997) article no. T972179 CMFields with Cyclic Ideal Class Groups of 2Power Orders Ste phane Louboutin* Universite de Caen, UFR Sciences, De partement de Mathe matiques,
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 informationUndecidability of C(T 0,T 1 )
Undecidability of C(T 0,T 1 ) David A. Pierce 1997; recompiled, April 4, 2017 Mathematics Dept Mimar Sinan Fine Arts University, Istanbul david.pierce@msgsu.edu.tr http://mat.msgsu.edu.tr/~dpierce/ We
More informationDiophantine equations
Diophantine equations So far, we have considered solutions to equations over the real and complex numbers. This chapter instead focuses on solutions over the integers, natural and rational numbers. There
More informationarxiv: v1 [math.nt] 3 Jun 2016
Absolute real root separation arxiv:1606.01131v1 [math.nt] 3 Jun 2016 Yann Bugeaud, Andrej Dujella, Tomislav Pejković, and Bruno Salvy Abstract While the separation(the minimal nonzero distance) between
More informationCover Page. The handle holds various files of this Leiden University dissertation.
Cover Page The handle http://hdl.handle.net/887/2587 holds various files of this Leiden University dissertation. Author: Kosters, Michiel F. Title: Groups and fields in arithmetic Issue Date: 2040604
More informationON THE ELEMENTS OF THE CONTINUED FRACTIONS OF QUADRATIC IRRATIONALS
ON THE ELEMENTS OF THE CONTINUED FRACTIONS OF QUADRATIC IRRATIONALS YAN LI AND LIANRONG MA Abstract In this paper, we study the elements of the continued fractions of Q and ( 1 + 4Q + 1)/2 (Q N) We prove
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 informationProduct of integers in an interval, modulo squares
Product of integers in an interval, modulo squares Andrew Granville Department of Mathematics, University of Georgia Athens, GA 306027403 and J.L. Selfridge Department of Mathematics,
More informationMath Review. for the Quantitative Reasoning measure of the GRE General Test
Math Review for the Quantitative Reasoning measure of the GRE General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important for solving
More informationNormal integral bases for Emma Lehmer s parametric family of cyclic quintics
Journal de Théorie des Nombres de Bordeaux 16 (004), 15 0 Normal integral bases for Emma Lehmer s parametric family of cyclic quintics par Blair K. SPEARMAN et Kenneth S. WILLIAMS Résumé. Nous donnons
More information12 Ramification, Haar measure, the product formula
18.785 Number theory I Lecture #12 Fall 2015 10/22/2015 12 Ramification, Haar measure, the product formula 12.1 Ramification in terms of the different and discriminant We conclude our discussion of the
More informationarxiv: v2 [math.nt] 4 Jul 2015
THREE CONSECUTIVE ALMOST SQUARES JEREMY ROUSE AND YILIN YANG arxiv:1502.00605v2 [math.nt] 4 Jul 2015 Abstract. Given a positive integer n, we let sfp(n) denote the squarefree part of n. We determine all
More informationTHE UNIT GROUP OF A REAL QUADRATIC FIELD
THE UNIT GROUP OF A REAL QUADRATIC FIELD While the unit group of an imaginary quadratic field is very simple the unit group of a real quadratic field has nontrivial structure Its study involves some geometry
More informationladic MODULAR DEFORMATIONS AND WILES S MAIN CONJECTURE
ladic MODULAR DEFORMATIONS AND WILES S MAIN CONJECTURE FRED DIAMOND AND KENNETH A. RIBET 1. Introduction Let E be an elliptic curve over Q. The ShimuraTaniyama conjecture asserts that E is modular, i.e.,
More informationA Generalized BrezingWeng Algorithm for Constructing PairingFriendly Ordinary Abelian Varieties
A Generalized BrezingWeng Algorithm for Constructing PairingFriendly Ordinary Abelian Varieties David Freeman Department of Mathematics University of California, Berkeley Berkeley, CA 947203840, USA
More informationHeron Triangle and Rhombus Pairs With a Common Area and a Common Perimeter
Forum Geometricorum Volume 17 (2017) 419 42. FORUM GEOM ISSN 1541178 Heron Triangle and Rhombus Pairs With a Common Area and a Common Perimeter Yong Zhang and Junyao Peng Abstract. By Fermat s method,
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 informationElGamal type signature schemes for ndimensional vector spaces
ElGamal type signature schemes for ndimensional vector spaces Iwan M. Duursma and Seung Kook Park Abstract We generalize the ElGamal signature scheme for cyclic groups to a signature scheme for ndimensional
More informationSolutions for November. f(x + f(y)) = f(x) + y
Solutions for November 647. Find all continuous functions f : R R such that for every x, y R. f(x + f(y)) = f(x) + y Solution 1. Setting (x, y) = (t, 0) yields f(t + f(0)) = f(t) for all real t. Setting
More informationComputing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring
Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring Alexander May Faculty of Computer Science, Electrical Engineering and Mathematics University of Paderborn 33102 Paderborn,
More informationModular Arithmetic. Examples: 17 mod 5 = 2. 5 mod 17 = 5. 8 mod 3 = 1. Some interesting properties of modular arithmetic:
Modular Arithmetic If a mod n = b, then a = c n + b. When you reduce a number a modulo n you usually want 0 b < n. Division Principle [Bar02, pg. 61]: Let n be a positive integer and let a be any integer.
More informationHomework 4 Solutions
Homework 4 Solutions November 11, 2016 You were asked to do problems 3,4,7,9,10 in Chapter 7 of Lang. Problem 3. Let A be an integral domain, integrally closed in its field of fractions K. Let L be a finite
More informationSolving the general quadratic congruence. y 2 Δ (mod p),
Quadratic Congruences Solving the general quadratic congruence ax 2 +bx + c 0 (mod p) for an odd prime p (with (a, p) = 1) is equivalent to solving the simpler congruence y 2 Δ (mod p), where Δ = b 2 4ac
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationPolynomials. Exponents. End Behavior. Writing. Solving Factoring. Graphing. End Behavior. Polynomial Notes. Synthetic Division.
Polynomials Polynomials 1. P 1: Exponents 2. P 2: Factoring Polynomials 3. P 3: End Behavior 4. P 4: Fundamental Theorem of Algebra Writing real root x= 10 or (x+10) local maximum Exponents real root x=10
More informationThe group law on elliptic curves
Mathematisch Instituut Universiteit Leiden Elliptic curves The theory of elliptic curves is a showpiece of modern mathematics. Elliptic curves play a key role both in the proof of Fermat s Last Theorem
More informationKUMMER S CRITERION ON CLASS NUMBERS OF CYCLOTOMIC FIELDS
KUMMER S CRITERION ON CLASS NUMBERS OF CYCLOTOMIC FIELDS SEAN KELLY Abstract. Kummer s criterion is that p divides the class number of Q(µ p) if and only if it divides the numerator of some Bernoulli number
More informationMath 711: Lecture of September 7, Symbolic powers
Math 711: Lecture of September 7, 2007 Symbolic powers We want to make a number of comments about the behavior of symbolic powers of prime ideals in Noetherian rings, and to give at least one example of
More informationA Beginner s Guide To The General Number Field Sieve
1 A Beginner s Guide To The General Number Field Sieve Michael Case Oregon State University, ECE 575 case@engr.orst.edu Abstract RSA is a very popular public key cryptosystem. This algorithm is known to
More informationn P say, then (X A Y ) P
COMMUTATIVE ALGEBRA 35 7.2. The Picard group of a ring. Definition. A line bundle over a ring A is a finitely generated projective Amodule such that the rank function Spec A N is constant with value 1.
More informationCHUNG PANG MOK. The correct form of Proposition 2.2 of [M1] should be stated as follows:
CORRIGENDUM AND ADDENDUM TO SPECIAL VALUES OF LFUNCTIONS OF ELLIPTIC CURVES OVER Q AND THEIR BASE CHANGE TO REAL QUADRATIC FIELDS [J. NUMBER THEORY 130 (2010), NO. 2, 431 438] CHUNG PANG MOK Abstract.
More informationDixon s Factorization method
Dixon s Factorization method Nikithkumarreddy yellu December 2015 1 Contents 1 Introduction 3 2 History 3 3 Method 4 3.1 Factorbase.............................. 4 3.2 Bsmooth...............................
More informationWorkshop on Serre s Modularity Conjecture: the level one case
Workshop on Serre s Modularity Conjecture: the level one case UC Berkeley Monte Verità 13 May 2009 Notation We consider Serretype representations of G = Gal(Q/Q). They will always be 2dimensional, continuous
More informationImportant Math 125 Definitions/Formulas/Properties
Exponent Rules (Chapter 3) Important Math 125 Definitions/Formulas/Properties Let m & n be integers and a & b real numbers. Product Property Quotient Property Power to a Power Product to a Power Quotient
More informationOld and new algorithms for computing Bernoulli numbers
Old and new algorithms for computing Bernoulli numbers University of New South Wales 25th September 2012, University of Ballarat Bernoulli numbers Rational numbers B 0, B 1,... defined by: x e x 1 = n
More information2 so Q[ 2] is closed under both additive and multiplicative inverses. a 2 2b 2 + b
. FINITEDIMENSIONAL VECTOR SPACES.. Fields By now you ll have acquired a fair knowledge of matrices. These are a concrete embodiment of something rather more abstract. Sometimes it is easier to use matrices,
More information1 Total Gadha s Complete Book of NUMBER SYSTEM TYPES OF NUMBERS Natural Numbers The group of numbers starting from 1 and including 1,,, 4, 5, and so on, are known as natural numbers. Zero, negative numbers,
More informationOn a Generalization of the Coin Exchange Problem for Three Variables
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 9 (006), Article 06.4.6 On a Generalization of the Coin Exchange Problem for Three Variables Amitabha Tripathi Department of Mathematics Indian Institute
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 information3.0 INTRODUCTION 3.1 OBJECTIVES 3.2 SOLUTION OF QUADRATIC EQUATIONS. Structure
UNIT 3 EQUATIONS Equations Structure 3.0 Introduction 3.1 Objectives 3.2 Solution of Quadratic Equations 3.3 Quadratic Formula 3.4 Cubic and Bioquadratic Equations 3.5 Answers to Check Your Progress 3.6
More informationUNIIAMIFIED EXTENSIONS OF QUADRATIC NUMBER, FIELDS,
Tohoku Math. Journ. 22(1970)9 220224. UNIIAMIFIED EXTENSIONS OF QUADRATIC NUMBER, FIELDS, II KoJI UCHIDA (Received December 25,1909). We have studied equations of type XnaX + b =0, and have obtained
More informationTHE REGULAR ELEMENT PROPERTY
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 126, Number 7, July 1998, Pages 2123 2129 S 00029939(98)042579 THE REGULAR ELEMENT PROPERTY FRED RICHMAN (Communicated by Wolmer V. Vasconcelos)
More informationEQUATIONS OF THE GENUS 6 CURVE WITH AUTOMORPHISM GROUP G = 72, 15
EQUATIONS OF THE GENUS 6 CURVE WITH AUTOMORPHISM GROUP G = 72, 15 DAVID SWINARSKI The group G = 72, 15 is the automorphism group of a genus 6 curve X. One notable feature of this curve is that the representation
More informationOn the AbhyankarMoh inequality
On the AbhyankarMoh inequality Evelia García Barroso La Laguna University, Tenerife September, 2014 In this talk we present some results of R.D. Barrolleta, E. García Barroso and A. Płoski, On the AbhyankarMoh
More informationLax Embeddings of Generalized Quadrangles in Finite Projective Spaces
Lax Embeddings of Generalized Quadrangles in Finite Projective Spaces J. A. Thas H. Van Maldeghem 1 Introduction Definition 1.1 A (finite) generalized quadrangle (GQ) S = (P, B, I) is a pointline incidence
More information7.1 Definitions and Generator Polynomials
Chapter 7 Cyclic Codes Lecture 21, March 29, 2011 7.1 Definitions and Generator Polynomials Cyclic codes are an important class of linear codes for which the encoding and decoding can be efficiently implemented
More informationComputation in finite fields. John Kerl Arizona State University and Lockheed Martin Corporation
Computation in finite fields John Kerl Arizona State University and Lockheed Martin Corporation April, 2004 Abstract Elementary techniques for computation in finite fields are presented, at a level appropriate
More informationA NOTE ON THE DIOPHANTINE EQUATION a x b y =c
MATH. SCAND. 107 010, 161 173 A NOTE ON THE DIOPHANTINE EQUATION a x b y =c BO HE, ALAIN TOGBÉ and SHICHUN YANG Abstract Let a,b, and c be positive integers. We show that if a, b = N k 1,N, where N,k,
More informationA reduction of the BatyrevManin Conjecture for Kummer Surfaces
1 1 A reduction of the BatyrevManin Conjecture for Kummer Surfaces David McKinnon Department of Pure Mathematics, University of Waterloo Waterloo, ON, N2T 2M2 CANADA December 12, 2002 Abstract Let V be
More informationGarrett Z p. Few explicit parametrizations of algebraic closures of fields are known: not Q, for sure. But we do also know
Garrett 0220 Examples (cont d): Function fields in one variable... as algebraic parallels to Z and Q. Theorem: All finite field extensions of C((X z)) are by adjoining solutions to Y e = X z for e =
More informationOn a certain vector crank modulo 7
On a certain vector crank modulo 7 Michael D Hirschhorn School of Mathematics and Statistics University of New South Wales Sydney, NSW, 2052, Australia mhirschhorn@unsweduau Pee Choon Toh Mathematics &
More informationUncertainties & Error Analysis Tutorial
Uncertainties & Error Analysis Tutorial Physics 118/198/1 Reporting Measurements Uncertainties & Error Analysis Tutorial When we report a measured value of some parameter, X, we write it as X X best ±
More informationKevin James. MTHSC 412 Section 3.4 Cyclic Groups
MTHSC 412 Section 3.4 Cyclic Groups Definition If G is a cyclic group and G =< a > then a is a generator of G. Definition If G is a cyclic group and G =< a > then a is a generator of G. Example 1 Z is
More informationON THE EXTENSIBILITY OF DIOPHANTINE TRIPLES {k 1, k + 1, 4k} FOR GAUSSIAN INTEGERS. Zrinka Franušić University of Zagreb, Croatia
GLASNIK MATEMATIČKI Vol. 43(63)(2008), 265 291 ON THE EXTENSIBILITY OF DIOPHANTINE TRIPLES {k 1, k + 1, 4k} FOR GAUSSIAN INTEGERS Zrinka Franušić University of Zagreb, Croatia Abstract. In this paper,
More informationStatistical Investigations as a Tool in Undergraduate Mathematics Research
TEACHING OF STATISTICS HONOLULU, JUNE 5, 2003 Statistical Investigations as a Tool in Undergraduate Mathematics Research Steven J. Miller, Leo Goldmakher, Atul Pokharel Department of Mathematics, Princeton
More informationElliptic Curves over Q
Elliptic Curves over Q Peter Birkner Technische Universiteit Eindhoven DIAMANT Summer School on Elliptic and Hyperelliptic Curve Cryptography 16 September 2008 What is an elliptic curve? (1) An elliptic
More informationarxiv: v1 [math.nt] 7 Sep 2015
THE ARITHMETIC OF CONSECUTIVE POLYNOMIAL SEQUENCES OVER FINITE FIELDS arxiv:1509.01936v1 [math.nt] 7 Sep 2015 DOMINGO GÓMEZPÉREZ, ALINA OSTAFE, AND MIN SHA Abstract. Motivated by a question of van der
More informationThe Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12
Math 3040: Spring 2011 The Integers Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers 11 4. Multiplying integers 12 Before we begin the mathematics of this section, it is worth
More information