Arithmetic Progressions Over Quadratic Fields
|
|
- Stanley Baldwin
- 6 years ago
- Views:
Transcription
1 Arithmetic Progressions Over Quadratic Fields Alexander Diaz, Zachary Flores, Markus Vasquez July 2010 Abstract In 1640 Pierre De Fermat proposed to Bernard Frenicle de Bessy the problem of showing that there is no arithmetic progression of four squares over Q. The solution to this problem was published posthumously in 1780 by Euler. However, this does not hold over Q( D) where D is a squarefree integer. Arithmetic progressions of four squares over Q( D) correspond to rational points on the elliptic curve E : y 2 = x 3 + 5x 2 + 4x and this is related to the quadratic twist E (D) : y 2 = x 3 + 5Dx 2 + 4D 2 x. We use methods of elliptic curves to discuss the existence of arithmetic progressions of squares over Q( D). 1 Introduction Since 1640 s people have been trying to find arithmetic progressions. That is, finding a sequence of numbers a 2, b 2 and c 2 such that b 2 a 2 = c 2 b 2. Fermat sent a letter to Frenicle in 1640 in which he stated that there are no non-constant four squares arithmetic progression over Q, but he did not share the proof. Later in 1780, Euler proved the same statement above, although it was published by his assistants. After that, some other mathematicians, like Weil and Itard, have worked on the same problem. In Section 2 of this paper, we show how to find three squares arithmetic progressions over Q by finding rational points on the circle x 2 + y 2 = 2 and how to find three squares arithmetic progressions with fixed common difference n by finding rational points on the elliptic curve y 2 = x 3 n 2 x. In Section 3, we introduce a method that is crucial in order to prove the main theorems of this paper. In Section 5, we prove that there are no non-constant four squares arithmetic progressions with fixed common difference n over Q. Finally, in Section 6, we present how to find such progressions in quadratic extensions Q( D) by finding rational points on the elliptic curve y 2 = x 3 + 5D + 4D 2. 2 Three Squares Arithmetic Progressions over Q By definition, a three squares arithmetic progression (a 2, b 2, c 2 ) satisfies b 2 a 2 = c 2 b 2. We can rewrite this equation to be 2b 2 = a 2 + c 2. If b = 0 then a = 0 and c = 0, which is the trivial three squares arithmetic progression (0, 0, 0). Assume then 1
2 that b 0 and divide the equation by b 2. We obtain the equivalent formula (a/b) 2 + (c/b) 2 = 2. Then finding a three squares arithmetic progression is equivalent to finding rational points on the circle x 2 +y 2 = 2. This leads us to our first proposition. Proposition 1. A three squares arithmetic progression (a 2, b 2, c 2 ) can be obtained by the following formulas: a 2 = (m 2 2m 1) 2, b 2 = (m 2 +1) 2 and c 2 = ( m 2 2m+1) 2. Moreover, if m is rational, then a 2, b 2 and c 2 are rationals. Proof. In order to find an arithmetic progression, we parametrize the points on the circle x 2 + y 2 = 2. Pick the point P = (1, 1) on the circle and draw a line through P and a point (x 1, y 1 ). The equation of the line is defined as y = mx + b where m is the slope and b the y-intercept. Since the line passes through P, we have b = 1 m. To find the coordinates of the second point (x 1, y 1 ), substitute y = mx + (1 m) into the equation of the circle. This give us the following equation: x 2 + (mx + (1 m)) 2 = 2. Factoring we obtain: ( ) 2m(1 m) x 2 + x + m2 2m 2 = 0. m m Since we know the roots of this polynomial are x = 1 and x = x 1 then the multiplication of the roots gives us the last term of the polynomial, that is: x 1 = m2 2m 2. m Using the equation of the line, we obtain: x 2 = m2 2m + 1. m We have parametrized the points on the circle x 2 + y 2 = 2 and now we can set a/b = x 1 and c/b = x 2, which will give us the desired formulas. It is clear that a 2, b 2 and c 2 are rationals if m is rational. The following proposition will be useful to prove that finding a three squares arithmetic progression with common difference n is equivalent to finding rational points on the elliptic curve y 2 = x 3 n 2 x. Proposition 2. For fixed n 0, finding a three squares arithmetic progression of rational squares with common difference n is equivalent to finding a rational point (m, s) in the equation ns 2 = m 3 m. Proof. To prove the statement we show that there exists a bijection between three squares arithmetic progressions (a 2, b 2, c 2 ) and the rational points on the equation. Pick a rational arithmetic progression (a 2, b 2, c 2 ) with common difference n. Then ((a/b) 2, 1, (c/b) 2 ) is an arithmetic progression with common difference n/b 2. So, n/b 2 = 1 (a/b) 2. Now by Proposition 1, (a/b) 2 = (m 2 2m 2) 2 /(m 2 + 1) 2 2
3 and m = (c b)/(a b) where m is the slope of the line through (1, 1) and (a/b, c/b). Then ( ) n m 2 2 b = 1 2m 2 2 m ( ) 2 n 2 b = (m 3 m). 2 m Let s = (m 2 + 1)/2b then ns 2 = m 3 m. Now, conversely, pick a rational point (m, s) on the equation ns 2 = m 3 m. Then, set a = (m 2 2m 1)/2s, b = (m 2 + 1)/2s and c = ( m 2 2m + 1)/2s. We obtain the arithmetic progression (a 2, b 2, c 2 ) with common difference n = (m 3 m)/s 2. Proposition 3. For fixed n 0, finding a three squares arithmetic progression of rational squares with common difference n is equivalent to finding a rational point (x, y) in the elliptic curve y 2 = x 3 n 2 x. Proof. Proposition 2 show that there is a bijection between an arithmetic progression (a 2, b 2, c 2 ) and the equation ns 2 = m 3 m. Now we show there is a bijection between this last equation and the elliptic curve y 2 = x 3 n 2 x. First, multiply ns 2 = m 3 m by n 3 and we get: (n 2 s) 2 = (nm) 3 n 2 (nm). Make the substitution x = nm, y = n 2 s and we get y 2 = x 3 n 2 x. On the other hand, divide y 2 = x 3 n 2 x by n 3 and we obtain ny 2 n 4 = x3 n 3 n2 x n 3. Make the substitution m = x/n, s = y/n 2 and we get ns 2 = m 3 m. Our next proposition is crucial in order to find infinitely many three squares arithmetic progressions with common difference n. Proposition 4. For fixed n 0, the only rational points with finite order on the elliptic curve y 2 = x 3 n 2 x are (n, 0), ( n, 0) and (0, 0). Proof. Let n = dt 2 where d is the squarefree part of n. Then there is a bijection between the curves y 2 = x 3 n 2 x and y 2 = x 3 d 2 x given by (x, y) (x/t 2, y/t 3 ) that sends the points (n, 0), ( n, 0) and (0, 0) to (d, 0), ( d, 0) and (0, 0). Then we can assume n is a squarefree integer. Pick a rational point P = (x 1, y 1 ) on the curve y 2 = x 3 n 2 x with finite order and assume y 1 0. Then since P has finite order by Nagell-Lutz theorem, the coordinates of P are integers. Let r be the x-coordinate of P P. Then ( ) x 2 r = 1 + n y 1 3
4 Using Nagell-Lutz theorem we know r is an integer. Note that ( ) x 2 r n = 1 2x 1 n n 2 2 2y 1 and ( ) x 2 r + n = 1 + 2x 1 n n 2 2 2y 1 which means we have created a three squares arithmetic progression namely (r n, r, r + n) with common difference n. Then we know an even difference between two squares is divisible by 4 because if you look at (r + n) (r n) = 2n mod 4, the only possible value of 2n is 0 mod 4. Since 2n is divisible by 4, then n is even. Using the same argument we conclude n 0 mod 4 which is a contradiction since n is squarefree. Then the only rational points with finite order are the points with y-coordinate zero, namely (n, 0), ( n, 0) and (0, 0). Now we can state our next proposition: Proposition 5. If there exists a three squares arithmetic progression with common difference n, then there exist infinitely many three squares arithmatic progressions with the same difference n. Proof. Let say we have a three squares arithmetic progression (a 2, b 2, c 2 ), then by Proposition 3 this sequence is map to a rational point on the elliptic curve y 2 = x 3 n 2 x. By Proposition 4, this point has to have infinite order. Then you can add the point infinitely many times to get an infinite amount of points which is equivalent to an infinite amount of three squares arithmetic progression with common difference n. 3 2-Descent Method In order to determine if an elliptic curve has rational points we define a method called 2-Descent that will help us answer that question. The main idea of the 2-Descent method is to calculate the rank of an elliptic curve and therefore determine how many rational points are on an elliptic curve. At the end of the section, we calculate the rank of the elliptic curve y 2 = x 3 + 5x 2 + 4x, which is crucial in Section 5. Before explaining the method, we recall three very important theorems in Elliptic Curve s theory. Theorem 1. (Fundamental Theorem of Finitely Generated Abelian Groups). Let G be a finitely generated abelian group under. Denote the set G tors = {a G [m]a = e for some nonzero integer m} as the torsion subgroup of G. 1. G tors = ZN1 Z N2 Z Ns is a finite subgroup of G. 2. G/G tors = Z r is a free abelian group of rank r. 3. G = G tors Z r. 4
5 Proof. See [1]. Define E(Q) to be the set of rational points on the elliptic curve E and the operation in which you take two points of E(Q) and do the chord-tangent method to get a third point. Theorem 2. (Mordell s Theorem). Let E be an elliptic defined over Q. Then E(Q) is a finitely generated abelian group. In particular, Proof. See [3]. E(Q) = E(Q) tors Z r. Theorem 3. (Mazur s Theorem). Let E be a rational elliptic curve, and let E(Q) tors denote its torsion subgroup. This finite group can only be one of the fifteen types: { E(Q) tors Z N for N=1,2,3,4,5,6,7,8,9,10,12; = Z 2 Z 2N for N=1,2,3,4. Moreover, each of these possibilities does occur i.e., given one of these fifteen finite groups T, there exists a rational elliptic curve E such that E(Q) tors = T. Proof. See [2]. Proposition 6. Consider the elliptic curve E : y 2 = (x e 1 )(x e 2 )(x e 3 ) with e i Q. Then, E(Q) tors = Z2 Z 2N, where N = 1, 2, 3, 4. Proof. It is easy to verify that the rational points (e 1 : 0 : 1), (e 2 : 0 : 1) and (e 3 : 0 : 1) have order two. By Theorem 3, the only possibilities for E(Q) tors with the above description are Z 2 Z 2N, N = 1, 2, 3, 4. Define the m-multiplication map as [m] : E(Q) E(Q) by sending (0 : 1 : 0) if m = 0 P [m]p = P P P if m > 0 [ 1]P [ 1]P [ 1]P if m < 0 Proposition 7. Let E be an elliptic curve in the form y 2 = (x e 1 )(x e 2 )(x e 3 ) with e i Q and 2E(Q) be the image of the [2] map. Then ( ) E(Q) # = 2 r+2. 2E(Q) Proof. Using Theorem 2 and Proposition 6, E(Q) = E(Q) tors Z r = Z2 Z 2N Z r. Then the image under the multiplication by [2] map is: 2E(Q) = Z N (2Z) r E(Q) 2E(Q) = (Z 2 ) r+2. 5
6 Therefore, ( ) E(Q) # = 2 r+2. 2E(Q) Consider E : y 2 = (x e 1 )(x e 2 )(x e 3 ) with e i k (for our purposes we will have e i Z). Define the Tate Paring: ɛ 2 : E(Q) Qx E[2] 2E(Q) (Q x ) 2 (P, T i ) (X e i ) mod (Q x ) 2. Where E[2] = {(e 1 : 0 : 1), (e 2 : 0 : 1), (e 3 : 0 : 1), (0 : 1 : 0)} and T i = (e i : 0 : 1). Proposition 8. The Tate Paring map ɛ 2, defined above, is a perfect pairing i.e., 1. (Non Degeneracy.) If ɛ 2 (P, T ) = 1 for all T E[2] then P 2E(Q). 2. (Bilinearity.) F or all P, Q E(Q) and T E[2] we have ɛ 2 (P Q, T ) = ɛ 2 (P, T ) ɛ 2 (Q, T ), ɛ 2 (P, T 1 T 2 ) = ɛ 2 (P, T 1 ) ɛ 2 (P, T 2 ). Proof. Pick P = (p 1 : p 2 : p 3 ) E(k), and say that ɛ 2 (P, T ) for all T E[2]. To show P 2E(k) it suffices to exhibit P E(k) such that P = [2]P. If P = O we may choose P = O as well, so assume p 0 0. Upon considering T = (e : 0 : 1), we see that f i = p1 p 0 e i k for i = 1, 2, 3; we choose the signs so that p 1 p 0 = f 1 f 2 f 3. It is easy to check that the desired k-rational point is ( P (e1 e 3 )(e 2 e 3 ) = (f 1 f 3 )(f 2 f 3 ) + e 3 : (e ) 1 e 3 )(e 1 e 2 )(e 2 e 3 ) (f 1 f 3 )(f 1 f 2 )(f 2 f 3 ) : 1. We show ɛ 2 (P Q, T ) = ɛ 2 (P, T ) ɛ 2 (Q, T ). If T = O there is nothing to show since ɛ 2 (P, T ) = ɛ 2 (Q, T ) = ɛ 2 (P Q, T ) = 1, so assume that T = (e : 0 : 1). Choose two points P = (p 1 : p 2 : p 0 ) and Q = (q 1 : q 2 : q 0 ) in E(k). Draw a line through them, say ax 1 + bx 2 + cx 0 = 0 and assume that it intersects E at a third point R = (r 1 : r 2 : r 0 ). The projective curve E is defined by the homogeneous polynomial F (x 1, x 2, x 0 ) = x 2 2x 0 (x 1 e 1 x 0 )(x 1 e 2 x 0 )(x 1 e 3 x 0 ) so the intersection with the line ax 1 + bx 2 + cx 0 = 0 admits the factorization p 0 q 0 r 0 F (x 1, x 2, x 0 ) = (p 1 x 0 p 0 x 1 )(q 1 x 0 q 0 x 1 )(r 1 x 0 r 0 x 1 ). When (x 1 : x 2 : x 0 ) = (be : ae c : b) is the point where the lines ax 0 +bx 1 +cx 0 = 0 and x 1 ex 0 = 0 intersect, we have the equality ( ) ( ) ( ) b 3 p1 q1 r1 e e e = F (be, ae c, b) = (ae + c) 2 b. p 0 q 0 r 0 6
7 This implies the congruence ɛ 2 (p, T ) ɛ 2 (Q, T ) ɛ 2 (R, T ) 1(mod (k x ) 2 ). We conclude that ɛ 2 (P Q, T ) = ɛ 2 (P, T ) ɛ 2 (Q, T ). We show ɛ 2 (P, T 1 T 2 ) = ɛ 2 (P, T 1 ) ɛ 2 (P, T 2 ). If T 1 = T 2 then ɛ 2 (P, T 1 T 2 ) = ɛ 2 (P, O) = 1 ɛ 2 (P, T 1 ) 2 = ɛ 2 (P, T 1 ) ɛ 2 (P, T 2 ). If T 1 T 2, we may assume T 1 = (e 1 : 0 : 1) and T 2 = (e 2 : 0 : 1). (If either T 1 or T 2 is O there is nothing to show). Then T 1 T 2 = (e 3 : 0 : 1). The identity ( ) ( ) ( ) ( ) 2 p1 p1 p1 p2 e 1 e 2 e 3 = p 0 p 0 p 0 implies the congruence ɛ 2 (P, T 1 ) ɛ 2 (P, T 2 ) ɛ 2 (P, T 1 T 2 ) 1(mod (k x ) 2 ). We conclude that ɛ 2 (P, T 1 T 2 ) = ɛ 2 (P, T 1 ) ɛ 2 (P, T 2 ). p 0 Define S i = {p p (e i e i+1 )(e i e i 1 )} and Q(S i, 2) = {d Q /(Q ) 2 d ( 1) m 0 p m 1... p mn n }, where m i = 0 or 1 and p j S i. Consider the map δ E : E(Q) 2E(Q) where ɛ 2 is the Tate Pairing. Qx (Q x ) Qx 2 (Q x ). 2 P (ɛ 2 (P, T 1 ), ɛ 2 (P, T 2 )), Proposition 9. Let δ i be the map defined above. Then δ i is an injective group homomorphism. Furthermore the image of δ i lying in the finitely generated abelian group generated by the set Q(S i, 2). Proof. First we prove δ i is an injective group homomorphism. For P and Q in E(Q)/2E(Q), then δ i (P Q) = (ɛ 2 (P Q, T 1 ), ɛ 2 (P Q, T 2 )) = (ɛ 2 (P, T 1 ) ɛ 2 (Q, T 1 ), ɛ 2 (P, T 2 ) ɛ 2 (Q, T 2 )) = (ɛ 2 (P, T 1 ), ɛ 2 (P, T 2 )) (ɛ 2 (Q, T 1 ), ɛ 2 (Q, T 2 )) = δ i (P ) δ i (Q). Then δ i is a group homomorphism. Say δ i (P ) = (1, 1). Then ɛ 2 (P, T 1 ) = ɛ 2 (P, T 2 ) = 1 = ɛ 2 (P, T 3 ) = ɛ 2 (P, T 1 ) ɛ 2 (P, T 2 ) = 1. Hence ɛ 2 (P, T 1 ) = 1 for all T E[2]. P 2E[k]. This shows δ i is injective. Since ɛ 2 is non-degenerate, we must have 7
8 Let x = a/b and y = c/d with (a, b) = 1 and (c, d) = 1 so that we may rewrite y 2 = (x e 1 )(x e 2 )(x e 3 ) as b 3 c 2 = (a be 1 )(a be 2 )(a be 3 )d 2. (1) Then δ i (P, T i ) p 1... p n for some distinct primes p j thus we have a/b e i = p 1... p n u 2, where u Q. Write u = e/f with (e, f) = 1 and rearranging we have f 2 (a be i ) = p 1... p n be 2. Then if we have p j f 2 we have p j f so write f = p j m so that we have a be i = bp p j... p n e 2 m 2 but p j 1 p j mod (Q ) 2, hence we may assume that none of the p j divde f 2. Thus we have p j a be i so write a be i = kp j a = be i + kp j so then Equation 1 becomes b 3 c 2 = kp j (kp j + b(e i e i 1 ))(kp j + b(e i e i+1 ))d 2 (2) and from p j a be i we cannot have p j b otherwise p j a contradicting (a, b) = 1. Hence p j c 2 and hence p j c, then let c = tp j then let (e i e i 1 ) = z 1 and (e i e i+1 ) = z 2 so we rewrite Equation 2 as Expanding we obtain b 3 c 2 = kp j (kp j + bz 1 )(kp j + bz 2 )d 2 b 3 t 2 p j = kd 2 (kp j + bz 1 )(kp j + bz 2 ) = k 3 d 2 p 2 j + k 2 d 2 p j b(z 1 + z 2 ) + kd 2 b 2 z 1 z 2, which implies p j kd 2 b 2 z 1 z 2 and we know that (p j, b) = (p j, d) = 1 hence we have p j kz 1 z 2. Thus if we have p j k then write k = p r js where p j does not divide s. Hence we have a be i = sp r j bp 1... p n mod (Q ) 2 h 2 sp r j = bp 1... p n g 2 where (h, g) = 1 then we have h 2 s = bp 1... p 1 2r j... p n g 2 s bp 1... p 1 2r j... p n bp 1... p j... p n mod (Q ) 2 then as in the previous argument, we may assume that if sh 2 0 = p 1... p n g 2 0 then (p j, h 0 ) = 1 so that but then p j sh 2 0 but p j does not divide s and h 2 0, contradicting the choice of p j as prime, hence we must have p j dividing z 1 z 2 which completes the proof. Since δ E is a group homomorphism and using Propositions 7 and 9 ( ) 2 r+2 = E(Q) E(Q) 2E(Q) = δ E Q(S, 2) 2 = 2 2 S. 2E(Q) This give us an upper bound on the rank, namely r 2 S 2. Also, the rank is exactly the order of the image of δ E. Proposition 10. Let E(k) : Y 2 = (X e 1 )(X e 2 )(X e 3 ). There exists a bijection between points (d 1, d 2 ) on the image of δ E and rational points (u, v, w) on the curves C d : d 1 u 2 d 2 v 2 = (e 2 e 1 ), d 1 u 2 d 1 d 2 w 2 = (e 3 e 2 ). 8
9 Proof. Pick a point P = (X : Y : 1) E(k) and consider the image (d 1, d 2 ) = δ E (P ). Then there exist u and v in k such that Looking at the curve E(k) we have Let w = d 1 u 2 = X e 1 d 2 v 2 = X e 2. Y 2 d 1 d 2 u 2 v 2 = X e 3. Y, then X e (X e 1 )(X e 2 ) 3 = d 1 d 2 w 2. Combining the three equations we get d 1 u 2 d 2 v 2 = (e 2 e 1 ) and d 1 u 2 d 1 d 2 w 2 = (e 3 e 1 ). Hence (u, v, w) C d (k). Now, pick (z 1 : z 2 : z 3 : z 0 ) C d (k). We have d 1 z 2 1 d 2 z 2 2 = (e 2 e 1 )z 2 0 d 1 z 2 1 d 1 d 2 z 2 3 = (e 3 e 1 )z 2 0. d 1 z 2 1 = (X e 1 )z 2 0 d 2 z 2 2 = (X e 2 )z 2 0 d 1 d 2 z 2 3 = (X e 3 )z 3 0. precisely when (X : 1) = (d 1 z e 1 z 2 0 : z 2 0). Upon taking the product of the first three equations, we find an involving Y, which we solve to give Finally, since we have (X : Y : 1) = (d 1 z 2 1z 0 + e 1 z 3 0 : d 1 d 2 z 1 z 2 z 3 : z 3 0). X e 1 = d 1 z 2 1 z 2 0 we see that δ E ((X : Y : 1)) = (d 1, d 2 ). and X e 2 = d 2 z 2 2 z Method to discard points on Q(S 1, 2) Q(S 2, 2) Recall that one of our goals is to find bounds on the ranks of the curves E D. We know that δ E is an injective homomorphism from E D (Q) to Q(S 1, 2) Q(S 2, 2). We also know that a point d = (d 1, d 2 ) is in the image of δ E if and only if there is a rational point on the curve C d : d 1 u 2 d 2 v 2 = (e 2 e 1 ), d 1 u 2 d 1 d 2 w 2 = (e 3 e 2 ). Our approach to finding bounds on the ranks will be to find the d Q(S 1, 2) Q(S 2, 2) that are not in the image of δ E by showing that there are no rational points on C d. Proposition 11. Let E (D) : y 2 = x 3 + 5Dx 2 + 4D 2 x, let m, N Z with m N, and let A (d1,d 2 ) be the set of solutions (a, b, c, d) ( Z mz )4 to the system d 1 a 2 d 2 b 2 Dd 2 (mod m) and d 1 a 2 d 1 d 2 c 2 4Dd 2 (mod m). Let a, b, c, and d be the smallest representatives of a, b, c, and d respectively. If gcd(a, b, c, d, m) 1 for all (a, b, c, d) A (d1,d 2 ), then (d 1, d 2 ) δ E (D 0 )( E(D 0 ) (Q) 2E (D 0 ) (Q) ) for any D 0 such that D 0 D(modN). 9
10 Proof. Let D 0 D(mod N) and let m N. Suppose that for all (a, b, c, d ) A (d1,d 1 ), gcd(a, b, c, d, m) = r 1, where a, b, c, d are the smallest representatives of a, b, c, and d respectively, and that (d 1, d 2 ) δ E (D 0 )( E(D 0 ) (Q) ). Then, by the previous theorem there is a rational point (u, v, w) on the curve C (d1,d 2 ). We write 2E (D 0 ) (Q) u = a, v = b, and w = c with a, b, c, d Z and gcd(a, b, c, d) = 1.Then, d d d d 1a 2 d 2 b 2 Dd 2 (mod m) and d 1 a 2 d 1 d 2 c 2 4Dd 2 (mod m). Now, a a (mod m), b b (mod m), c c (mod m), d d (mod m). Then, r a, r b, r c, and r d, a contradiction. In the present case, we are interested in showing that these curves C d fail to have rational solutions for all D in an equivalence class modulo 24. Thus, we will take N = 24 and m = 3 or m = 8. Example 1. Consider the elliptic curve E (D) : y 2 = x 3 + 5Dx 2 + 4D 2 x.we show that for D 2(mod 3), (2, 1) δ E (D)( E(D) (Q) 2E (D) (Q) ). Proof. Suppose that (2, 1) δ E (D)( E(D) (Q) ). Then, there is some rational point on the 2E (D) (Q) curve given by: 2u 2 v 2 = D and 2u 2 2w 2 = 4D. Write u = a, v = b, and w = c d d d with a, b, c, d Z and gcd(a, b, c, d) = 1. Then, 2a 2 b 2 = Dd 2 and 2a 2 2c 2 = 4Dd 2 Looking at these equations modulo 3, we have 2a 2 + 2b 2 d 2 (mod 3) and 2a 2 + c 2 d 2 (mod 3). Suppose a 2 0(mod 3). Then, b 2 c 2 d 2 0(mod 3). It follows that 3 divides each of a,b,c and d, contradiction our choice of a,b,c, and d. Suppose a 2 1(mod 3). Then, c 2 1(mod 3) and d 2 0(mod 3). But then 2b 2 1(mod 3), which is impossible. This method of showing that the curves C d cannot have a rational point is not the only method of showing that d is not in the image of the connecting homomorphism. We can also use the fact that Im(δ E ) is a group and thus closed under multiplication. We can then argue as follows. Suppose that a, b Q(S 1, 2) Q(S 2, 2) and that b Im(δ E ). If ab Im(δ E ), then it follows that a Im(δ E ). Because of the amount of computation involved with eliminating points this way, we decided that having a computer do most of the work was the prudent thing to do. For the sake of completeness, we provide the computer program in Section 7. 5 Four Squares Arithmetic Progressions over Q The four-tuple (a 2, b 2, c 2, d 2 ) is an arithmetic progression of four squares over a field k if b 2 a 2 = c 2 b 2 = d 2 c 2. In the main theorem of the section we prove that there are no non-constant four squares arithmetic progressions over Q using the fact that there are no rational points with infinite order on the elliptic curve y 2 = x 3 +5x 2 +4x. We use the 2-Descent method (Section 3) to prove the above statement. Proposition 12. There exists a bijection between four squares arithmetic progression and E(Q), the set of rational points on E : y 2 = x 3 + 5x 2 + 4x. 10
11 Proof. Given a four squares arithmetic progression (a : b : c : d) (1 : 1 : 1 : 1), the following point is an element of E(Q): ( ( ) ( ) ) a 3b 3c + d a + b c d 2 : 6 : 1 a + 3b + 3c + d a + 3b + 3c + d and if (a : b : c : d) = (1 : 1 : 1 : 1), then we get the point (0 : 0 : 1). On the other hand, given a point (x : y : z) (0 : 0 : 1) E(Q), then (a : b : c : d) is an arithmetic progression of four squares over Q, where a = 6x + 3x 2 2y + xy, b = 2x x 2 2y xy, c = 2x x 2 + 2y + xy, d = 6x + 3x 2 + 2y xy. The difference n between the terms of the progression is 16xy 4x 3 y. If (x : y : z) = (0 : 0 : 1), then we get the arithmetic progression (1 : 1 : 1 : 1). Proposition 13. If E : y 2 = x 3 + 5x 2 + 4x then E(Q) tors = Z2 Z 4 Proof. With the substitutions x = X 2 X+2 y = 8 Y X = 2 1+x Y = 1 x 6y 3 (X+2) 2 (1 x) 2 we find that E is isogeneous to the quartic curve y 2 = (1 x 2 )(1 k 2 x 2 ) where k = 1/3. We know from [5] that the torsion subgroup of y 2 = (1 x 2 )(1 k 2 x 2 ) is Z 2 Z 4. Proposition 14. Points in E(Q) tors correspond to constant arithmetic progressions (±1 : ±1 : ±1 : ±1 :). Proof. We first calculate the 8 points in E(Q) tors. Using the bijection on Proposition 12 we calculate the corresponding arithmetic progression for each point. P oint P rogression (2 : 6 : 1) (1 : 1 : 1 : 1) (2 : 6 : 1) (1 : 1 : 1 : 1) ( 1 : 0 : 1) ( 1 : 1 : 1 : 1) ( 2 : 2 : 1) ( 1 : 1 : 1 : 1) ( 4 : 0 : 1) (1 : 1 : 1 : 1) ( 2 : 2 : 1) (1 : 1 : 1 : 1) (0 : 1 : 0) ( 1 : 1 : 1 : 1) (0 : 0 : 1) (1 : 1 : 1 : 1). Lemma 1. The rank of E : y 2 = x 3 + 5x 2 + 4x is zero. 11
12 Proof. We can compute the rank via 2-Descent: We have y 2 = x 3 + 5x 2 + 4x = x(x + 4)(x + 1). Let e 1 = 0, e 2 = 1, e 3 = 4 so that (e 1 e 3 )(e 1 e 2 ) = 4 and (e 2 e 1 )(e 2 e 3 ) = 3. Therefore, S 1 = {2}, S 2 = {3} and We consider the curves Q(S 1, 2) = {±1, ±2} Q(S 2, 2) = {±1, ±3}. C d : d 1 z 2 1 d 2 z 2 2 = 1, d 1 z 2 1 d 1 d 2 z 2 3 = 4 and D d1 : W 2 = d 1 + 5Z d 1 Z 4. Since E(Q) tors is generated by ( 4 : 0 : 1) and (2 : 6 : 1) we have δ E (E(Q) tors ) = {( 1, 3), (2, 3), ( 2, 1), (1, 1)}. We see from the equation d 1 z1 2 d 2 z2 2 = 1 that the points (1, 1), (2, 1), (1, 3) and (2, 3) cannot be in the image of δ E since d 1 z1 2 d 2 z2 2 = 1 < 0. Then since δ E is a homomorphism of groups we may also conclude that ( 1, 3), ( 2, 3), ( 1, 2), ( 2, 1), ( 2, 3), (1, 3), (2, 1), and ( 1, 1) are not in the image. Then, we only have four points on the image of δ E, which implies 2 r+2 = 4, hence r = 0. Theorem 4. There are no non-constant arithmetic progressions of four squares over Q. Proof. From the previous Lemma we know that E has rank 0 over Q and hence that E(Q) = Z 2 Z 4 and from Proposition 14 we know that all of the points in E(Q) tors are mapped to constant arithmetic progressions, hence no non-constant arithmetic progression can exist over Q. 6 Four Squares Arithmetic Progressions over Q( D) Unlike Q, it is possible to find arithmetic progressions of four squares over Q( D) where D is a squarefree integer. We show how arithmetic progressions over Q( D) are related to the quadratic twist E (D) : y 2 = x 3 + 5Dx 2 + 4D 2 x of the curve E : y 2 = x 3 + 5x 2 + 4x, give a method for explicitly calculating such progressions and provide examples of such calculations. Proposition 15. Fix a nonzero integer D and let E (D) : y 2 = x 3 + 5Dx 2 + 4D 2 x. If P = (x : y : 1) is a rational point on E (D) then there is a corresponding arithmetic progression in Q( D). Proof. Note that the bijection given in Proposition 12 applies to any field k of characteristic 2, 3 hence it applies to the field Q( D). Given a rational point P = (x : y : 1) on E (D) then we have that (x/d : y/ D 3 : 1) is a point on the curve E : y 2 = x 3 + 5x 2 + 4x, hence using the bijection in Proposition 12 we obtain an arithmetic progression of four squares in Q( D). 12
13 For Table XX listed in [4] where there is a? or a yes, we use this method to compute an explicit example of an arithmetic progression of four squares over Q( D). In Table XX, we show the upper bound of the rank for each particular case and we give an example of a curve matching the bound. Table XX summarizes our results on narrowing the possible ranks of the elliptic curves E D. The first number is the upper bound that was found using the computer program. The numbers in parentheses are a D value and the rank of the corresponding E D. These provide a lower bound on the rank. 7 Computer Program 8 Acknowledgments This work was conducted during the 2010 Mathematical Sciences Research Institute Undergraduate Program (MSRI-UP), a program supported by the National Science Foundation (grant No. DMS ) and the National Security Agency (grant No. HB ). We also thank Dr. Cooper, Dr. Goins and Ebony Harvey for all their help during the preparation of this paper. References [1] David S. Dummit and Richard M. Foote Abstract Algebra. Prentice Hall Inc., Englewood Cliffs, NJ, [2] B. Mazur. Modular Curves and the Eisenstein ideal., 2nd Ed., Springer-Verlag, New York, [3] L. J. Mordell. Diophantine equations., Academic Press, London, [4] E. Gonzalez-Jimenez and Jorn Steuding. Arithmetic Progressions of Four Squares Over Quadratic Fields [5] E. Goins lecture notes 13
14 p mod 24 D = p D = 2p D = 3p D = 6p D = p D = 2p D = 3p D = 6p 1 2, (73, 2) 2, (146, 2) 2, (579, 2) 3, (1438, 1) 2, (-97, 2) 2, (-146, 2) 2, (-939, 2) 2, (-582, 2) 5 0, (5, 0) 1, (10, 1) 2, (15, 0) 2, (30, 1) 2, (-5, 1) 1, (-10, 1) 2, (-15, 1) 2, (-30, 0) 7 1, (7, 0) 0, (14, 0) 2, (21, 1) 2, (42, 1) 1, (-7, 0) 2, (-14, 2) 2, (-21, 1) 2, (-42, 0) 11 1, (11, 1) 2, (22, 1) 2, (33, 0) 2, (66,1) 1, (-11,0) 1, (-22, 1) 2, (-33, 1) 3, (-66, 2) 13 1, (13, 1) 0, (26, 0) 2, (39, 2) 2, (78, 1) 2, (-13, 0) 1, (-26, 0) 2, (-39, 1) 2, (-78, 0) 17 1, (17, 1) 2, (34, 1) 2, (51, 0) 3, (102, 1) 2, (-17, 1) 1, (-34, 1) 2, (-51, 0) 2, (-102, 0) 19 1, (19,0) 2, (134, 2) 2, (57, 0) 2, (114, 1) 1, (-19,1) 1, (-38, 0) 2, (-57, 1) 3, (-114, 2) 23 1, (23, 1) 1, (46, 1) 2, (69, 1) 2, (138, 1) 1, (-23, 1) 1, (-46, 1) 2, (-69, 1) 2, (-1002, 2) 14
15 579 ( 588 : 3024 : 1) (( (48 : 6480 : 1) (( ) 2 : ( ) 2 : ( )2 : ( )2 : ( (2304/25 : 45408/125 : 1) (( ) 2 : ( ) 2 : ( (98 : 1512 : 1) (( ) 2 : ( ) 2 : ( (507 : : 1) (( ) 2 : ( (150 : : 1) (( ) 2 : ( )2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( 23 ) 2 : ( ) 2 : ( ( 25 : 75 : 1) (( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 ) (150 : 4500 : 1) (( ) 2 : ( ) 2 : ( ) 2 : ( (4 : 8 : 1) (( ) 2 : ( )2 : ( )2 : ( (64 : 288 : 1) (( ) 2 : ( ) 2 : ( ) 2 : ( (6 : 54 : 1) (( ) 2 : ( ) 2 : ( ( 48 : 216 : 1) (( ( 150 : 540 : 1) (( (2 : 36 : 1) (( (9 : 90 : 1) (( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( )2 : ( ) 2 : ( ) 2 : ( ) 2 : ( (735 : 2295 : 1) (( ) 2 : ( (3025/16 : /64 : 1) (( (900 : : 1) (( ) 2 : ( ) 2 : ( ) 2 : ( )2 : ( ) ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( (22 : 484 : 1) (( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 ) (12 : 120 : 1) (( ) 2 : ( ) 2 : ( ( 48 : 216 : 1) (( ) 2 : ( ) 2 : ( (363 : : 1) (( ) 2 : ( (12 : 216 : 1) (( ) 2 : ( ((18 : 30 : 1) (( (65 : 1120 : 1) (( ( 968/9 : 11440/27 : 1) (( (256/25 : 7904/125 : 1) (( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( )2 : ( )2 : ( ) 2 : ( ) 2 : ( )2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( (256/9 : 320/27 : 1) (( (12544/25 : /125 : 1) (( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ( 162 : 1512 : 1) (( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( ) 2 : ( (256/49 : 24480/343 : 1) (( ) 2 : ( ) 2 : ( (715008/12679 : / : 1) (( ) 2 : ( (6 : 540 : 1) (( ) 2 : ( ) 2 : ( ) 2 : ( )2 : ( )2 : ( ) 2 : ( (12100/169 : /2197 : 1) (( ) 2 : ( ) 2 : ( (8 : 288 : 1) (( (15000 : : 1) (( ) 2 : ( ) 2 : ( )2 : ( )2 : ( ) 2 : ( ) 2 : ( (98 : 210 : 1) (( ) 2 : ( ) 2 : ( ) 2 : (
Arithmetic Progressions over Quadratic Fields
uadratic Fields ( D) Alexer Díaz University of Puerto Rico, Mayaguez Zachary Flores Michigan State University Markus Oklahoma State University Mathematical Sciences Research Institute Undergraduate Program
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 Mordell-Weil group of an elliptic curve is a difficult problem.
More informationLECTURE 2 FRANZ LEMMERMEYER
LECTURE 2 FRANZ LEMMERMEYER Last time we have seen that the proof of Fermat s Last Theorem for the exponent 4 provides us with two elliptic curves (y 2 = x 3 + x and y 2 = x 3 4x) in the guise of the quartic
More informationTHERE ARE NO ELLIPTIC CURVES DEFINED OVER Q WITH POINTS OF ORDER 11
THERE ARE NO ELLIPTIC CURVES DEFINED OVER Q WITH POINTS OF ORDER 11 ALLAN LACY 1. Introduction If E is an elliptic curve over Q, the set of rational points E(Q), form a group of finite type (Mordell-Weil
More information6.5 Elliptic Curves Over the Rational Numbers
6.5 Elliptic Curves Over the Rational Numbers 117 FIGURE 6.5. Louis J. Mordell 6.5 Elliptic Curves Over the Rational Numbers Let E be an elliptic curve defined over Q. The following is a deep theorem about
More informationAlgebraic Geometry: Elliptic Curves and 2 Theorems
Algebraic Geometry: Elliptic Curves and 2 Theorems Chris Zhu Mentor: Chun Hong Lo MIT PRIMES December 7, 2018 Chris Zhu Elliptic Curves and 2 Theorems December 7, 2018 1 / 16 Rational Parametrization Plane
More informationLECTURE 18, MONDAY
LECTURE 18, MONDAY 12.04.04 FRANZ LEMMERMEYER 1. Tate s Elliptic Curves Assume that E is an elliptic curve defined over Q with a rational point P of order N 4. By changing coordinates we may move P to
More informationOn the Torsion Subgroup of an Elliptic Curve
S.U.R.E. Presentation October 15, 2010 Linear Equations Consider line ax + by = c with a, b, c Z Integer points exist iff gcd(a, b) c If two points are rational, line connecting them has rational slope.
More informationElliptic Curves: An Introduction
Elliptic Curves: An Introduction Adam Block December 206 Introduction The goal of the following paper will be to explain some of the history of and motivation for elliptic curves, to provide examples and
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #24 12/03/2013
18.78 Introduction to Arithmetic Geometry Fall 013 Lecture #4 1/03/013 4.1 Isogenies of elliptic curves Definition 4.1. Let E 1 /k and E /k be elliptic curves with distinguished rational points O 1 and
More informationARITHMETIC PROGRESSIONS OF THREE SQUARES
ARITHMETIC PROGRESSIONS OF THREE SQUARES KEITH CONRAD 1 Introduction Here are the first 10 perfect squares (ignoring 0): 1, 4, 9, 16, 25, 36, 49, 64, 81, 100 In this list there is an arithmetic progression:
More informationARITHMETIC PROGRESSIONS OF THREE SQUARES
ARITHMETIC PROGRESSIONS OF THREE SQUARES KEITH CONRAD 1. Introduction Here are the first 10 perfect squares (ignoring 0): 1, 4, 9, 16, 25, 36, 49, 64, 81, 100. In this list there is an arithmetic progression:
More informationELLIPTIC CURVES BJORN POONEN
ELLIPTIC CURVES BJORN POONEN 1. Introduction The theme of this lecture is to show how geometry can be used to understand the rational number solutions to a polynomial equation. We will illustrate this
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
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 informationCONGRUENT NUMBERS AND ELLIPTIC CURVES
CONGRUENT NUMBERS AND ELLIPTIC CURVES JIM BROWN Abstract. In this short paper we consider congruent numbers and how they give rise to elliptic curves. We will begin with very basic notions before moving
More informationLECTURE 15, WEDNESDAY
LECTURE 15, WEDNESDAY 31.03.04 FRANZ LEMMERMEYER 1. The Filtration of E (1) Let us now see why the kernel of reduction E (1) is torsion free. Recall that E (1) is defined by the exact sequence 0 E (1)
More informationIntroduction to Arithmetic Geometry
Introduction to Arithmetic Geometry 18.782 Andrew V. Sutherland September 5, 2013 What is arithmetic geometry? Arithmetic geometry applies the techniques of algebraic geometry to problems in number theory
More informationOn a Problem of Steinhaus
MM Research Preprints, 186 193 MMRC, AMSS, Academia, Sinica, Beijing No. 22, December 2003 On a Problem of Steinhaus DeLi Lei and Hong Du Key Lab of Mathematics Mechanization Institute of Systems Science,
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 informationOutline of the Seminar Topics on elliptic curves Saarbrücken,
Outline of the Seminar Topics on elliptic curves Saarbrücken, 11.09.2017 Contents A Number theory and algebraic geometry 2 B Elliptic curves 2 1 Rational points on elliptic curves (Mordell s Theorem) 5
More informationHans Wenzl. 4f(x), 4x 3 + 4ax bx + 4c
MATH 104C NUMBER THEORY: NOTES Hans Wenzl 1. DUPLICATION FORMULA AND POINTS OF ORDER THREE We recall a number of useful formulas. If P i = (x i, y i ) are the points of intersection of a line with the
More informationElliptic Curves and Mordell s Theorem
Elliptic Curves and Mordell s Theorem Aurash Vatan, Andrew Yao MIT PRIMES December 16, 2017 Diophantine Equations Definition (Diophantine Equations) Diophantine Equations are polynomials of two or more
More informationOn the Rank of the Elliptic Curve y 2 = x 3 nx
International Journal of Algebra, Vol. 6, 2012, no. 18, 885-901 On the Rank of the Elliptic Curve y 2 = x 3 nx Yasutsugu Fujita College of Industrial Technology, Nihon University 2-11-1 Shin-ei, Narashino,
More informationON A FAMILY OF ELLIPTIC CURVES
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XLIII 005 ON A FAMILY OF ELLIPTIC CURVES by Anna Antoniewicz Abstract. The main aim of this paper is to put a lower bound on the rank of elliptic
More informationModern Number Theory: Rank of Elliptic Curves
Modern Number Theory: Rank of Elliptic Curves Department of Mathematics University of California, Irvine October 24, 2007 Rank of Outline 1 Introduction Basics Algebraic Structure 2 The Problem Relation
More informationHow many elliptic curves can have the same prime conductor? Alberta Number Theory Days, BIRS, 11 May Noam D. Elkies, Harvard University
How many elliptic curves can have the same prime conductor? Alberta Number Theory Days, BIRS, 11 May 2013 Noam D. Elkies, Harvard University Review: Discriminant and conductor of an elliptic curve Finiteness
More informationWhy Should I Care About Elliptic Curves?
Why Should I Care About? Edray Herber Goins Department of Mathematics Purdue University August 7, 2009 Abstract An elliptic curve E possessing a rational point is an arithmetic-algebraic object: It is
More informationTwists of elliptic curves of rank at least four
1 Twists of elliptic curves of rank at least four K. Rubin 1 Department of Mathematics, University of California at Irvine, Irvine, CA 92697, USA A. Silverberg 2 Department of Mathematics, University of
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationarxiv: v2 [math.nt] 23 Sep 2011
ELLIPTIC DIVISIBILITY SEQUENCES, SQUARES AND CUBES arxiv:1101.3839v2 [math.nt] 23 Sep 2011 Abstract. Elliptic divisibility sequences (EDSs) are generalizations of a class of integer divisibility sequences
More informationIntroduction to Elliptic Curves
IAS/Park City Mathematics Series Volume XX, XXXX Introduction to Elliptic Curves Alice Silverberg Introduction Why study elliptic curves? Solving equations is a classical problem with a long history. Starting
More informationInfinite rank of elliptic curves over Q ab and quadratic twists with positive rank
Infinite rank of elliptic curves over Q ab and quadratic twists with positive rank Bo-Hae Im Chung-Ang University The 3rd East Asian Number Theory Conference National Taiwan University, Taipei January
More informationCONSTRUCTION OF HIGH-RANK ELLIPTIC CURVES WITH A NONTRIVIAL TORSION POINT
MATHEMATICS OF COMPUTATION Volume 66, Number 217, January 1997, Pages 411 415 S 0025-5718(97)00779-5 CONSTRUCTION OF HIGH-RANK ELLIPTIC CURVES WITH A NONTRIVIAL TORSION POINT KOH-ICHI NAGAO Abstract. We
More informationarxiv: v1 [math.nt] 31 Dec 2011
arxiv:1201.0266v1 [math.nt] 31 Dec 2011 Elliptic curves with large torsion and positive rank over number fields of small degree and ECM factorization Andrej Dujella and Filip Najman Abstract In this paper,
More informationINTRODUCTION TO ELLIPTIC CURVES
INTRODUCTION TO ELLIPTIC CURVES MATILDE LALÍN Abstract. These notes correspond to a mini-course taught by the author during the program Two Weeks at Waterloo - A Summer School for Women in Math. Please
More informationSome new families of positive-rank elliptic curves arising from Pythagorean triples
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 24, 2018, No. 3, 27 36 DOI: 10.7546/nntdm.2018.24.3.27-36 Some new families of positive-rank elliptic curves
More informationABC Triples in Families
Edray Herber Goins Department of Mathematics Purdue University September 30, 2010 Abstract Given three positive, relative prime integers A, B, and C such that the first two sum to the third i.e. A+B =
More informationIntroduction. Axel Thue was a Mathematician. John Pell was a Mathematician. Most of the people in the audience are Mathematicians.
Introduction Axel Thue was a Mathematician. John Pell was a Mathematician. Most of the people in the audience are Mathematicians. Giving the Number Theory Group the title 1 On Rational Points of the Third
More informationElliptic Curves. Akhil Mathew (Department of Mathematics Drew UniversityElliptic MathCurves 155, Professor Alan Candiotti) 10 Dec.
Elliptic Curves Akhil Mathew Department of Mathematics Drew University Math 155, Professor Alan Candiotti 10 Dec. 2008 Akhil Mathew (Department of Mathematics Drew UniversityElliptic MathCurves 155, Professor
More informationIntegral points of a modular curve of level 11. by René Schoof and Nikos Tzanakis
June 23, 2011 Integral points of a modular curve of level 11 by René Schoof and Nikos Tzanakis Abstract. Using lower bounds for linear forms in elliptic logarithms we determine the integral points of the
More informationarxiv: v1 [math.nt] 26 Mar 2009
RIGHT TRIANGLES WITH ALGEBRAIC SIDES AND ELLIPTIC CURVES OVER NUMBER FIELDS arxiv:0903.46v [math.nt] 26 Mar 2009 E. GIRONDO, G. GONZÁLEZ-DIEZ, E. GONZÁLEZ-JIMÉNEZ, R. STEUDING, J. STEUDING Abstract. Given
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More informationCongruent number elliptic curves of high rank
Michaela Klopf, BSc Congruent number elliptic curves of high rank MASTER S THESIS to achieve the university degree of Diplom-Ingenieurin Master s degree programme: Mathematical Computer Science submitted
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationTHE NUMBER OF TWISTS WITH LARGE TORSION OF AN ELLITPIC CURVE
THE NUMBER OF TWISTS WITH LARGE TORSION OF AN ELLITPIC CURVE FILIP NAJMAN Abstract. For an elliptic curve E/Q, we determine the maximum number of twists E d /Q it can have such that E d (Q) tors E(Q)[2].
More informationComputing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q John Cremona 1 and Samir Siksek 2 1 School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7
More informationElliptic curves and Hilbert s Tenth Problem
Elliptic curves and Hilbert s Tenth Problem Karl Rubin, UC Irvine MAA @ UC Irvine October 16, 2010 Karl Rubin Elliptic curves and Hilbert s Tenth Problem MAA, October 2010 1 / 40 Elliptic curves An elliptic
More informationThree cubes in arithmetic progression over quadratic fields
Arch. Math. 95 (2010), 233 241 c 2010 Springer Basel AG 0003-889X/10/030233-9 published online August 31, 2010 DOI 10.1007/s00013-010-0166-5 Archiv der Mathematik Three cubes in arithmetic progression
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
More informationTAMAGAWA NUMBERS OF ELLIPTIC CURVES WITH C 13 TORSION OVER QUADRATIC FIELDS
TAMAGAWA NUMBERS OF ELLIPTIC CURVES WITH C 13 TORSION OVER QUADRATIC FIELDS FILIP NAJMAN Abstract. Let E be an elliptic curve over a number field K c v the Tamagawa number of E at v and let c E = v cv.
More informationTheorem 6.1 The addition defined above makes the points of E into an abelian group with O as the identity element. Proof. Let s assume that K is
6 Elliptic curves Elliptic curves are not ellipses. The name comes from the elliptic functions arising from the integrals used to calculate the arc length of ellipses. Elliptic curves can be parametrised
More informationax b mod m. has a solution if and only if d b. In this case, there is one solution, call it x 0, to the equation and there are d solutions x m d
10. Linear congruences In general we are going to be interested in the problem of solving polynomial equations modulo an integer m. Following Gauss, we can work in the ring Z m and find all solutions to
More informationDoes There Exist an Elliptic Curve E/Q with Mordell-Weil Group Z 2 Z 8 Z 4?
Does There Exist an Elliptic Curve E/Q with Mordell-Weil Group Z 2 Z 8 Z 4? Edray Herber Goins Department of Mathematics, Purdue University Atkin Memorial Lecture and Workshop: over Q( 5) April 29, 2012
More informationElliptic Curves: Theory and Application
s Phillips Exeter Academy Dec. 5th, 2018 Why Elliptic Curves Matter The study of elliptic curves has always been of deep interest, with focus on the points on an elliptic curve with coe cients in certain
More informationDiophantine m-tuples and elliptic curves
Diophantine m-tuples and elliptic curves Andrej Dujella (Zagreb) 1 Introduction Diophantus found four positive rational numbers 1 16, 33 16, 17 4, 105 16 with the property that the product of any two of
More informationElliptic Curves Spring 2013 Lecture #12 03/19/2013
18.783 Elliptic Curves Spring 2013 Lecture #12 03/19/2013 We now consider our first practical application of elliptic curves: factoring integers. Before presenting the elliptic curve method (ECM) for factoring
More informationElliptic curves and modularity
Elliptic curves and modularity For background and (most) proofs, we refer to [1]. 1 Weierstrass models Let K be any field. For any a 1, a 2, a 3, a 4, a 6 K consider the plane projective curve C given
More informationElliptic Curves, Factorization, and Cryptography
Elliptic Curves, Factorization, and Cryptography Brian Rhee MIT PRIMES May 19, 2017 RATIONAL POINTS ON CONICS The following procedure yields the set of rational points on a conic C given an initial rational
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationRational Distance Sets on Conic Sections
Rational Distance Sets on Conic Sections Megan D Ly Loyola Marymount Shawn E Tsosie UMASS Amherst July 010 Lyda P Urresta Union College Abstract Leonhard Euler noted that there exists an infinite set of
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationTHE CONGRUENT NUMBER PROBLEM
THE CONGRUENT NUMBER PROBLEM KEITH CONRAD 1. Introduction A right triangle is called rational when its legs and hypotenuse are all rational numbers. Examples of rational right triangles include Pythagorean
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
More informationNumber Fields Generated by Torsion Points on Elliptic Curves
Number Fields Generated by Torsion Points on Elliptic Curves Kevin Liu under the direction of Chun Hong Lo Department of Mathematics Massachusetts Institute of Technology Research Science Institute July
More informationYale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall Midterm Exam Review Solutions
Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall 2015 Midterm Exam Review Solutions Practice exam questions: 1. Let V 1 R 2 be the subset of all vectors whose slope
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 informationFormal groups. Peter Bruin 2 March 2006
Formal groups Peter Bruin 2 March 2006 0. Introduction The topic of formal groups becomes important when we want to deal with reduction of elliptic curves. Let R be a discrete valuation ring with field
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationEXAMPLES OF MORDELL S EQUATION
EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural
More informationBasic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.
Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationCONTENTS COLLEGE ALGEBRA: DR.YOU
1 CONTENTS CONTENTS Textbook UNIT 1 LECTURE 1-1 REVIEW A. p. LECTURE 1- RADICALS A.10 p.9 LECTURE 1- COMPLEX NUMBERS A.7 p.17 LECTURE 1-4 BASIC FACTORS A. p.4 LECTURE 1-5. SOLVING THE EQUATIONS A.6 p.
More information5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationDiophantine equations and beyond
Diophantine equations and beyond lecture King Faisal prize 2014 Gerd Faltings Max Planck Institute for Mathematics 31.3.2014 G. Faltings (MPIM) Diophantine equations and beyond 31.3.2014 1 / 23 Introduction
More informationCONGRUENT NUMBERS AND ELLIPTIC CURVES
CONGRUENT NUMBERS AND ELLIPTIC CURVES JIM BROWN Abstract. These are essentially the lecture notes from a section on congruent numbers and elliptic curves taught in my introductory number theory class at
More informationON THE FAMILY OF ELLIPTIC CURVES y 2 = x 3 m 2 x+p 2
Manuscript 0 0 0 ON THE FAMILY OF ELLIPTIC CURVES y = x m x+p ABHISHEK JUYAL, SHIV DATT KUMAR Abstract. In this paper we study the torsion subgroup and rank of elliptic curves for the subfamilies of E
More informationVojta s conjecture and level structures on abelian varieties
Vojta s conjecture and level structures on abelian varieties Dan Abramovich, Brown University Joint work with Anthony Várilly-Alvarado and Keerthi Padapusi Pera ICERM workshop on Birational Geometry and
More informationWinter Camp 2009 Number Theory Tips and Tricks
Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine
More informationTORSION AND TAMAGAWA NUMBERS
TORSION AND TAMAGAWA NUMBERS DINO LORENZINI Abstract. Let K be a number field, and let A/K be an abelian variety. Let c denote the product of the Tamagawa numbers of A/K, and let A(K) tors denote the finite
More informationCourse MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
More informationOn the polynomial x(x + 1)(x + 2)(x + 3)
On the polynomial x(x + 1)(x + 2)(x + 3) Warren Sinnott, Steven J Miller, Cosmin Roman February 27th, 2004 Abstract We show that x(x + 1)(x + 2)(x + 3) is never a perfect square or cube for x a positive
More informationMath Precalculus I University of Hawai i at Mānoa Spring
Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2013 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents
More informationAlgebra Review 2. 1 Fields. A field is an extension of the concept of a group.
Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-13 Recap Divisibility Prime Number Theorem Euclid s Lemma Fundamental Theorem of Arithmetic Euclidean Algorithm Basic Notions - Section
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 informationD-MATH Algebra I HS 2013 Prof. Brent Doran. Solution 3. Modular arithmetic, quotients, product groups
D-MATH Algebra I HS 2013 Prof. Brent Doran Solution 3 Modular arithmetic, quotients, product groups 1. Show that the functions f = 1/x, g = (x 1)/x generate a group of functions, the law of composition
More informationELLIPTIC CURVES OVER FINITE FIELDS
Further ELLIPTIC CURVES OVER FINITE FIELDS FRANCESCO PAPPALARDI #4 - THE GROUP STRUCTURE SEPTEMBER 7 TH 2015 SEAMS School 2015 Number Theory and Applications in Cryptography and Coding Theory University
More informationOn the Rank of the Elliptic Curve y 2 = x(x p)(x 2)
On the Rank of the Ellitic Curve y = x(x )(x ) Jeffrey Hatley Aril 9, 009 Abstract An ellitic curve E defined over Q is an algebraic variety which forms a finitely generated abelian grou, and the structure
More informationElliptic Curves. Dr. Carmen Bruni. November 4th, University of Waterloo
University of Waterloo November 4th, 2015 Revisit the Congruent Number Problem Congruent Number Problem Determine which positive integers N can be expressed as the area of a right angled triangle with
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More informationOn Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem Qi Cheng 1 and Ming-Deh Huang 2 1 School of Computer Science The University of Oklahoma Norman, OK 73019, USA. Email: qcheng@cs.ou.edu.
More informationPythagoras = $1 million problem. Ken Ono Emory University
Pythagoras = $1 million problem Ken Ono Emory University Pythagoras The Pythagorean Theorem Theorem (Pythagoras) If (a, b, c) is a right triangle, then a 2 + b 2 = c 2. Pythagoras The Pythagorean Theorem
More informationON MONIC BINARY QUADRATIC FORMS
ON MONIC BINARY QUADRATIC FORMS JEROME T. DIMABAYAO*, VADIM PONOMARENKO**, AND ORLAND JAMES Q. TIGAS*** Abstract. We consider the quadratic form x +mxy +ny, where m n is a prime number. Under the assumption
More informationToday. Polynomials. Secret Sharing.
Today. Polynomials. Secret Sharing. A secret! I have a secret! A number from 0 to 10. What is it? Any one of you knows nothing! Any two of you can figure it out! Example Applications: Nuclear launch: need
More informationRATIONAL POINTS ON CURVES. Contents
RATIONAL POINTS ON CURVES BLANCA VIÑA PATIÑO Contents 1. Introduction 1 2. Algebraic Curves 2 3. Genus 0 3 4. Genus 1 7 4.1. Group of E(Q) 7 4.2. Mordell-Weil Theorem 8 5. Genus 2 10 6. Uniformity of Rational
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationCORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS
CORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS DEPARTMENT OF MATHEMATICS AND STATISTICS UNIVERSITY OF OTTAWA SUPERVISOR: PROFESSOR MONICA NEVINS STUDENT: DANG NGUYEN
More information