Basics of binary quadratic forms and Gauss composition
|
|
- Jonas Williams
- 6 years ago
- Views:
Transcription
1 Basics of binary quadratic forms and Gauss composition Andrew Granville Université de Montréal SMS summer school: Counting arithmetic objects Monday June 3rd, 014, 3:30-5:00 pm 0
2 Sums of two squares 1 Any prime p 1 (mod 4) can be written as the sum of two squares Geometry of numbers type proof Since p 1 (mod 4) = i Z : i 1 (mod p). Idea: Find smallest non-zero integer lattice point (x, y) Z : x iy (mod p)
3 Sums of two squares Since p 1 (mod 4) = i Z : i 1 (mod p). Consider now the set of integers {m + ni : 0 m, n [ p]} # pairs m, n is ([ p] + 1) > p, so by the pigeonhole principle, two are congruent mod p; say that m + ni M + Ni (mod p) where 0 m, n, M, N [ p] and (m, n) (M, n).
4 Sums of two squares 3 Since p 1 (mod 4) = i Z : i 1 (mod p). Consider now the set of integers {m + ni : 0 m, n [ p]} # pairs m, n is ([ p] + 1) > p, so by the pigeonhole principle, two are congruent mod p; say that m + ni M + Ni (mod p) where 0 m, n, M, N [ p] and (m, n) (M, n). Let r = m M and s = N n so that r is (mod p) where r, s [ p] < p, and r and s are not both 0. Now r + s (is) + s = s (i + 1) 0 (mod p) and 0 < r + s < p + p = p. The only multiple of p between 0 and p is p, and therefore r + s = p.
5 Sums of two squares 4 What integers can be written as the sum of two squares? (a + b )(c + e ) = (ac + be) + (ae bc).
6 Sums of two squares 5 What integers can be written as the sum of two squares? (a + b )(c + e ) = (ac + be) + (ae bc). Generalization: (a + db )(c + de ) = (ac + dbe) + d(ae bc).
7 Sums of two squares 6 What integers can be written as the sum of two squares? (a + b )(c + e ) = (ac + be) + (ae bc). Generalization: (a + db )(c + de ) = (ac + dbe) + d(ae bc). Gauss s view: A binary quadratic form is of the shape f(x, y) := ax + bxy + cy. Here we take f(x, y) = x + dy and f(a, b)f(c, e) = f(ac + dbe, ae bc) The latter values in f, namely ac + dbe and ae bc, are bilinear forms in a, b, c, e. Does this generalize to other such multiplications?
8 Pell s equation Are there integer solutions x, y to x dy = 1? Pell s equation 7
9 Pell s equation 8 Pell s equation Are there integer solutions x, y to x dy = 1? Can always be found using continued fraction for d. (Brahmagupta, 68 A.D.; probably Archimedes, to solve his Cattle Problem one needs to find a solution to u v = 1. The smallest solution has about 10 6 digits!)
10 Pell s equation 9 Pell s equation Are there integer solutions x, y to x dy = 1? Can always be found using continued fraction for d. (Brahmagupta, 68 A.D.; probably Archimedes, to solve his Cattle Problem one needs to find a solution to u v = 1. The smallest solution has about 10 6 digits!) Solution to Pell s Equation Let d be a non-square integer. x, y Z for which x dy = 1, with y 0. If x 1, y 1 smallest positive solution, then all others given by x n + dy n = (x + dy) n
11 Pell s equation 10 x dy = 1? Solution to Pell s Equation Let d be a non-square integer. x, y Z for which x dy = 1, with y 0. If x 1, y 1 smallest positive solution, then all others given by. x n + dy n = (x + dy) n Better to look for solutions to x dy = ±4, Understanding when there is solution with is a difficult question (great recent progress by Fouvry and Kluners).
12 Pell s equation 11 Theorem Any quadratic irrational real number has a continued fraction that is eventually periodic. Here are some examples of the continued fraction for d: = [1, ], 3 = [1, 1, ], 5 = [, 4], 6 = [,, 4], 7 = [, 1, 1, 1, 4], 8 = [, 1, 4], 10 = [3, 6], 11 = [3, 3, 6], 1 = [3,, 6], 13 = [3, 1, 1, 1, 1, 6],... If p k /q k are the convergents for d then p n 1 dq n 1 = ( 1)n.
13 Pell s equation 1 Longest continued fractions and the largest fundamental solutions = [1, ], 1 1 = 1 3 = [1, 1, ], 3 1 = 1 6 = [,, 4], 5 6 = 1 7 = [, 1, 1, 1, 4], = 1 13 = [3, 1, 1, 1, 1, 6], = 1 19 = [4,, 1, 3, 1,, 8], = 1 = [4, 1,, 4,, 1, 8], = 1 31 = [5, 1, 1, 3, 5, 3, 1, 1, 10], = 1 43 = [6, 1, 1, 3, 1, 5, 1, 3, 1, 1, 1], = 1 46 = [6, 1, 3, 1, 1,, 6,, 1, 1, 3, 1, 1], = 1 76 = [8, 1,, 1, 1, 5, 4, 5, 1, 1,, 1, 16], = 1
14 Pell s equation 13 Length of longest cont fracts and fundl solutions 16 : = 1 16 : = 1 16 : = 1 18 : = 1 0 : = 1 : = 1 6 : = 1 6 : = 1 6 : = 1 34 : = 1 37 : = 1 40 : = 1 4 : = 1
15 Pell s equation 14 Length of fundamental solutions The length of the continued fractions here are around d, and the size of the fundamental solutions 10 d. How big is the smallest solution? We believe that the smallest solution is typically of size C d but not much proved. Understanding the distribution of sizes of the smallest solutions to Pell s equation is an outstanding open question in number theory.
16 Pell s equation 15 Descent on solutions of x dy = n, d > 0 Let ɛ d = x 1 + y 1 d, the smallest solution x1, y 1 in positive integers to x 1 dy 1 = 1. Given a solution of with x, y 0, let x dy = n α := x + y d > n. If nɛ k d α < nɛ k+1 d let β := αɛ k d = u + dv so that n β < nɛd with u, v 1 and u dv = n.
17 Binary quadratic forms 16 Representation of integers by binary quadratic forms What integers are represented by binary quadratic form f(x, y) := ax + bxy + cy? That is, for what N are there coprime m, n such that N = am + bmn + cn? WLOG gcd(a, b, c) = 1. Complete the square to obtain 4aN = (am + bn) dn where discriminant d := b 4ac, so d 0 or 1 (mod 4). When d < 0 the right side can only take positive values... easier than when d > 0. If a > 0 then positive definite binary quadratic form.
18 Binary quadratic forms 17 x + y represents the same integers as X + XY + Y If N = m + n then N = (m n) + (m n)n + n, If N = u + uv + v then N = (u + v) + v.
19 Binary quadratic forms 18 x + y represents the same integers as X + XY + Y If N = m + n then N = (m n) + (m n)n + n, If N = u + uv + v then N = (u + v) + v. ( ) x y = M ( ) X Y where M = ( ) transforms x +y into X +XY +Y, and the transformation is invertible, since det M = 1.
20 Binary quadratic forms 19 x + y represents the same integers as X + XY + Y If N = m + n then N = (m n) + (m n)n + n, If N = u + uv + v then N = (u + v) + v. ( ) x y = M ( ) X Y where M = ( ) transforms x +y into X +XY +Y, and the transformation is invertible, since det M = 1. Much more generally define {( ) } α β SL(, Z) = : α, β, γ, δ Z and αδ βγ = 1 γ δ Then ax + bxy + cy represents ( the ) same ( integers ) as AX + BXY + CY x X whenever = M with y Y M SL(, Z). These quadratic forms are equivalent..
21 Binary quadratic forms 0 Equivalence ax + bxy + cy is( equivalent ) ( to) AX + BXY + CY x X if equal whenever = M with M SL(, Z). y Y This yields an equivalence relation and splits the binary quadratic forms into equivalence classes. Write ax + bxy + cy = ( x y ) ( ) ( ) a b/ x b/ c y ( ) a b/ Discriminant(f) = det. We deduce that b/ c AX +BXY +CY = ( X Y ) M T ( a b/ b/ c ) M ( ) X, Y so A = aα + bαγ + cγ and C = aβ + bβδ + cδ as ( ) ( ) A B/ = M T a b/ M. B/ C b/ c Hence two equivalent bqfs have same discriminant.
22 Binary quadratic forms 1 Equivalence classes of binary quadratic forms 9X + 8XY + 58Y is equivalent to x + y
23 Binary quadratic forms Equivalence classes of binary quadratic forms 9X + 8XY + 58Y is equivalent to x + y Gauss: Every equivalence class of bqfs (with d < 0) contains a unique reduced representative, defined as a < b a c, and b 0 whenever a = c.
24 Binary quadratic forms 3 Equivalence classes of binary quadratic forms 9X + 8XY + 58Y is equivalent to x + y Gauss: Every equivalence class of bqfs (with d < 0) contains a unique reduced representative, defined as a < b a c, and b 0 whenever a = c. If so, d = 4ac ( b ) 4a a a = 3a and hence a d /3. Therefore, for given d < 0, finitely many a, and so b (as b a), and then c = (b d)/4a is determined; so only finitely many (h(d), the class number, the number of equivalence classes) reduced bqfs of discrim d.
25 Binary quadratic forms 4 Equivalence classes of binary quadratic forms 9X + 8XY + 58Y is equivalent to x + y Gauss: Every equivalence class of bqfs (with d < 0) contains a unique reduced representative, defined as a < b a c, and b 0 whenever a = c. If so, d = 4ac ( b ) 4a a a = 3a and hence a d /3. Therefore, for given d < 0, finitely many a, and so b (as b a), and then c = (b d)/4a is determined; so only finitely many (h(d), the class number, the number of equivalence classes) reduced bqfs of discrim d. In fact h(d) 1 since we always have the principal form: { x (d/4)y when d 0 (mod 4), x + xy + (1 d) 4 y when d 1 (mod 4).
26 Binary quadratic forms 5 Gauss s reduction Theorem Every positive definite binary quadratic form is properly equivalent to a reduced form. Proof. A sequence of equivalent forms; algorithm terminates when we reach one that is reduced. Given (a, b, c): ( ) ( ) ( ) x 0 1 x i) If c < a the transformation = y 1 0 y, yields (c, b, a) which is properly equivalent to (a, b, c).
27 Binary quadratic forms 6 Gauss s reduction Theorem Every positive definite binary quadratic form is properly equivalent to a reduced form. ( ) ( ) ( ) x 0 1 x i) If c < a the transformation = y 1 0 y, yields (c, b, a) which is properly equivalent to (a, b, c). ii) If b > a or b a let b be the least residue, in absolute value, of b (mod( a), ) so( a < ) b ( ) a, say b x 1 k x = b ka. Then let = y 0 1 y. The resulting form (a, b, c ) is properly equivalent to (a, b, c). iii) If( c = ) a and ( a < ) ( b < ) 0 then we use the transformation = x 0 1 x y 1 0 y yielding the form (a, b, a). If resulting form not reduced, repeat
28 Binary quadratic forms 7 Gauss s reduction Theorem Every positive definite binary quadratic form is properly equivalent ( to ) a reduced ( form. ) ( ) x 0 1 x i) If c < a then = y 1 0 y. ( ) ( ) ( ) x 1 k x ii) If b > a or b a then = y 0 1 y. ( ) ( ) ( ) x 0 1 x iii) If c = a and a < b < 0 then = y 1 0 y If resulting form not reduced, repeat The algorithm terminates after (iii), and since (ii) is followed by (i) or (iii), and since (i) reduces the size of a.
29 Binary quadratic forms 8 Gauss s reduction Theorem; examples (76, 17, 155) of discriminant 31, The sequence of forms is (76, 65, 14), (14, 65, 76), (14, 9, ), (, 9, 14), (, 1, 4), the sought after reduced form.
30 Binary quadratic forms 9 Gauss s reduction Theorem; examples (76, 17, 155) of discriminant 31, The sequence of forms is (76, 65, 14), (14, 65, 76), (14, 9, ), (, 9, 14), (, 1, 4), the sought after reduced form. (11, 49, 55) of discriminant 19, gives the sequence of forms (11, 5, 1), (1, 5, 11), (1, 1, 5).
31 Binary quadratic forms 30 Restriction on values taken by a bqf Suppose d = b 4ac with (a, b, c) = 1, and p is a prime. (i) If p = am + bmn + cn for some integers m, n then d is a square mod 4p. (ii) If d is a square mod 4p then there exists a binary quadratic form of discriminant d that represents p.
32 Binary quadratic forms 31 Restriction on values taken by a bqf Suppose d = b 4ac with (a, b, c) = 1, and p is a prime. (i) If p = am + bmn + cn for some integers m, n then d is a square mod 4p. (ii) If d is a square mod 4p then there exists a binary quadratic form of discriminant d that represents p. Proof. (i) If p ad and p = am +bmn+cn. Therefore 4ap = (am + bn) dn and so dn is a square mod 4p. Now p n else p 4ap + dn = (am + bn) so that p am which is impossible as p a and (m, n) = 1. We deduce that d is a square mod p. (ii) If d b (mod 4p) then d = b 4pc for some integer c, and so px + bxy + cy is a quadratic form of discriminant d which represents p = p 1 + b c 0.
33 Binary quadratic forms 3 Class number one Theorem Suppose h(d) = 1. Then p is represented by the form of discrim d if and only if d is a square mod 4p.
34 Binary quadratic forms 33 Class number one Theorem Suppose h(d) = 1. Then p is represented by the form of discrim d if and only if d is a square mod 4p. ( Fundamental discriminants: If q d then q = and d 8 or 1 (mod 16).) The only fundamental d < 0 with h(d) = 1 are d = 3, 4, 7, 8, 11, 19, 43, 67, 163. (Heegner/ Baker/ Stark)
35 Binary quadratic forms 34 Class number one Theorem Suppose h(d) = 1. Then p is represented by the form of discrim d if and only if d is a square mod 4p. ( Fundamental discriminants: If q d then q = and d 8 or 1 (mod 16).) The only fundamental d < 0 with h(d) = 1 are d = 3, 4, 7, 8, 11, 19, 43, 67, 163. (Heegner/ Baker/ Stark) Euler noticed that the polynomial x + x + 41 is prime for x = 0, 1,,..., 39, and some other polynomials. Rabinowiscz s criterion We have h(1 4A) = 1 for A if and only if x + x + A is prime for x = 0, 1,,..., A.
36 Binary quadratic forms 35 Class number one Rabinowiscz s criterion We have h(1 4A) = 1 for A if and only if x + x + A is prime for x = 0, 1,,..., A. If p d then p is rep d by x + y if and only if ( 1/p) = 1, p is rep d by x + y if and only if ( /p) = 1, p is rep d by x + xy + y if and only if ( 3/p) = 1, p is rep d by x + xy + y if and only if ( 7/p) = 1, p is rep d by x + xy + 3y if and only if ( 11/p) = 1, p is rep d by x + xy + 5y if and only if ( 19/p) = 1, p is rep d by x + xy + 11y if and only if ( 43/p) = 1, p is rep d by x + xy + 17y if and only if ( 67/p) = 1, p is rep d by x + xy + 41y if and only if ( 163/p) = 1.
37 Binary quadratic forms 36 Class number not one What about when the class number is not one? First example, h( 0) =, the two reduced forms are x + 5y and x + xy + 3y. p is represented by x +5y if and only if p = 5, or p 1 or 9 (mod 0); p is represented by x + xy + 3y if and only if p =, or p 3 or 7 (mod 0).
38 Binary quadratic forms 37 Class number not one What about when the class number is not one? First example, h( 0) =, the two reduced forms are x + 5y and x + xy + 3y. p is represented by x +5y if and only if p = 5, or p 1 or 9 (mod 0); p is represented by x + xy + 3y if and only if p =, or p 3 or 7 (mod 0). Cannot always distinguish which primes are represented by which bqf of discriminant d by congruence conditions. Euler found 65 such idoneal numbers. No more are known at most one further idoneal number.
39 Structure of Ideals 38 Ideals in quadratic fields Any ideal I in a quadratic ring of integers: R := {a + b d : a, b Z} is generated by elements.
40 Structure of Ideals 39 Ideals in quadratic fields Any ideal I in a quadratic ring of integers: R := {a + b d : a, b Z} is generated by elements. If I Z then principal. Else r + s d I with s 0, wlog s > 0. Select s minimal.
41 Structure of Ideals 40 Ideals in quadratic fields Any ideal I in a quadratic ring of integers: R := {a + b d : a, b Z} is generated by elements. If I Z then principal. Else r + s d I with s 0, wlog s > 0. Select s minimal. Claim: If u + v d I then s divides v (else if ks + lv = g := gcd(s, v) then (kr + lu) + g d = k(r + s d) + l(u + v d) I #)
42 Structure of Ideals 41 Ideals in quadratic fields Any ideal I in a quadratic ring of integers: R := {a + b d : a, b Z} is generated by elements. If I Z then principal. Else r + s d I with s 0, wlog s > 0. Select s minimal. Claim: If u + v d I then s divides v (else if ks + lv = g := gcd(s, v) then (kr + lu) + g d = k(r + s d) + l(u + v d) I #) Let v = ms, so that (u+v d) m(r +s d) = u mr. Therefore I = {m(r + s d) + n : m Z, n I Z}. Now I Z is an ideal in Z so principal, = g say hence I = r + s d, g Z.
43 Structure of Ideals 4 Any ideal I R := {a + b d : a, b Z} has the form I = r + s d, g Z.
44 Structure of Ideals 43 Any ideal I R := {a + b d : a, b Z} has the form I = r + s d, g Z. More: d R, so g d I and sd + r d I, and so s divides both g and r.
45 Structure of Ideals 44 Any ideal I R := {a + b d : a, b Z} has the form I = r + s d, g Z. More: d R, so g d I and sd + r d I, and so s divides both g and r. Therefore r = sb and g = sa. Also s(b d) = (r + s d)(b d) I Z and so s(b d) is a multiple of g = sa; hence a divides b d. Therefore I = s b + d, a Z for some integers s, a, b where a divides b d.
46 Structure of Ideals 45 Binary quadratic forms and Ideals I = s a, b + d Z If f(x, y) = ax + bxy + cy then ( af(x, y) = ax + b + ) ( d y ax + b d so we see that af(x, y) is the Norm of y ) ( ax + b+ d y ).
47 Structure of Ideals 46 Binary quadratic forms and Ideals I = s a, b + d Z If f(x, y) = ax + bxy + cy then ( af(x, y) = ax + b + ) ( d y ax + b ) d y ( so we see that af(x, y) is the Norm of ax + b+ d y So the set of possible values of f(x, y) with x, y Z is in 1-to-1 correspondence with the elements of a, b+ d Z. ).
48 Structure of Ideals 47 Equivalence of ideals Any two equivalent bqfs can be obtained from each other by a succession of two basic transformations: x x+y, y y gives a, b + d Now a, b+ d Z = a, a+b+ d Z Z a, a + b + d Z
49 Structure of Ideals 48 Equivalence of ideals Any two equivalent bqfs can be obtained from each other by a succession of two basic transformations: x x+y, y y gives a, b + d Now a, b+ d Z = a, a+b+ d Z x y, y x gives a, b + d Z a, a + b + d Z Z c, b + d Z. Since b+ d b+ d = d b 4 = ac, and therefore b + d a, b + d Z = a b + d, c Z.
50 Structure of Ideals 49 Equivalence of ideals Any two equivalent bqfs can be obtained from each other by a succession of two basic transformations: x x+y, y y gives a, b + d Now a, b+ d Z = a, a+b+ d Z x y, y x gives a, b + d Z a, a + b + d Z Z c, b + d Z. Since b+ d b+ d = d b 4 = ac, and therefore b + d a, b + d Z = a b + d, c Z. So, equivalence of forms, in setting of ideals, gives: For ideals I, J of Q( d), we have that I J if and only there exists α Q( d), such that J = αi.
51 Structure of Ideals 50 For ideals I, J of Q( d), we have that I J if and only there exists α Q( d), such that J = αi.
52 Structure of Ideals 51 For ideals I, J of Q( d), we have that I J if and only there exists α Q( d), such that J = αi. This works in any number field; moreover then one has finitely many equivalence classes, and i bounds for the smallest element of each class.
53 Structure of Ideals 5 For ideals I, J of Q( d), we have that I J if and only there exists α Q( d), such that J = αi. This works in any number field; moreover then one has finitely many equivalence classes, and i bounds for the smallest element of each class. Any ideal I = a, b+ d with d < 0 then we plot Z- linear combinations on the complex plane and they form a lattice, Λ = a, b+ d geometry of lattices. Equivalence: Two lattices Λ, Λ are homothetic if there exists α C such that Λ = αλ, and we write Λ Λ. Divide through by a, every such lattice is homothetic to 1, τ where τ = b+ d a, in the upper half plane.
54 Structure of Ideals 53 Fundamental discriminants and orders A square class of integers, like 3, 1, 7, 48,... gives same field Q( 3n ) = Q( 3) minimal one? Candidate: The only one that is squarefree? However, from theory of bqfs need discriminant 0 or 1 (mod 4). Divisibility by 4 correct price to pay. The fundamental discriminant of a quadratic field to be the smallest element of the square class of the discriminant which is 0 or 1 (mod 4). For d squarefree integer, the fundamental discriminant D is { d if d 1 (mod 4) D = 4d if d or 3 (mod 4). The ring of integers is Z [ D+ D ] or Z[ω] = 1, ω Z, ω := { 1+ d if d 1 (mod 4) d = D/ if d or 3 (mod 4).
55 Composition 54 Gauss s Composition Law The product of any two values of a principal form gives a third value of that quadratic form: (a + db )(c + de ) = (ac + dbe) + d(ae bc).
56 Composition 55 Gauss s Composition Law The product of any two values of a principal form gives a third value of that quadratic form: (a + db )(c + de ) = (ac + dbe) + d(ae bc). Gauss: if f and g are bqfs discrim d, then bqf h of discrim d, such that any f(a, b)g(c, e) = h(m, n), m = m(a, b, c, e), n = n(a, b, c, e) are bilinear forms.
57 Composition 56 Gauss s Composition Law The product of any two values of a principal form gives a third value of that quadratic form: (a + db )(c + de ) = (ac + dbe) + d(ae bc). Gauss: if f and g are bqfs discrim d, then bqf h of discrim d, such that any f(a, b)g(c, e) = h(m, n), m = m(a, b, c, e), n = n(a, b, c, e) are bilinear forms. Gauss showed this explicitly via formulae; e.g., for three bqfs of discrim 71, m + mn + 9n = (4a + 3ab + 5b )(3c + ce + 6e ). with m = ac 3ae bc 3be and n = ac+ae+bc be. Gauss called this composition.
58 Composition 57 m + mn + 9n = (4a + 3ab + 5b )(3c + ce + 6e ). Gauss showed composition stays consistent under the equivalence relation. Allows us to find a group structure on the classes of quadratic forms of given discriminant, the class group. Gauss s proof is monstrously difficult, even in the hands of the master the algebra involved is so overwhelming that he does not include many details.
59 Composition 58 m + mn + 9n = (4a + 3ab + 5b )(3c + ce + 6e ). Gauss showed composition stays consistent under the equivalence relation. Allows us to find a group structure on the classes of quadratic forms of given discriminant, the class group. Gauss s proof is monstrously difficult, even in the hands of the master the algebra involved is so overwhelming that he does not include many details. Gauss s student Dirichlet found several ways to simplify composition. The first involved finding forms that are equivalent to f and g that are easier to compose:
60 Composition 59 Dirichlet s composition of forms For any given integer w there exist integers m, n with (am + bmn + cn, w) = 1. Given quadratic forms f and g, find f f such that (f (1, 0), g(1, 0)) = 1. There exists F f and G g such that F (x, y) = ax +bxy +cy and G(x, y) = Ax +bxy +Cy with (a, A) = 1. If f and g have the same discriminant then there exist h such that F (x, y) = ax + bxy + Ahy and G(x, y) = Ax + bxy + ahy with (a, A) = 1. d = b 4aAh. If H(x, y) = aax + bxy + hy then H(ux hvy, auy + Avx + bvy) = F (u, v)g(x, y)
61 Composition 60 Dirichlet s composition of ideals Dirichlet simplified by defining ideals: To multiply two ideals, IJ = {ij : i I, j J}. m + mn + 9n = (4a + 3ab + 5b )(3c + ce + 6e ).
62 Composition 61 Dirichlet s composition of ideals Dirichlet simplified by defining ideals: To multiply two ideals, IJ = {ij : i I, j J}. m + mn + 9n = (4a + 3ab + 5b )(3c + ce + 6e ). (4, ) corresponds to 4a + 3ab + 5b, and (3, ) corresponds to 3c + ce + 6e.
63 Composition 6 Dirichlet s composition of ideals Dirichlet simplified by defining ideals: To multiply two ideals, IJ = {ij : i I, j J}. m + mn + 9n = (4a + 3ab + 5b )(3c + ce + 6e ). (4, ) corresponds to 4a + 3ab + 5b, and (3, ) corresponds to 3c + ce + 6e. Then ) ( 3, 1 + ) 71 = ( 4, ( 1, which corresponds to 1x 5xy +y, also of disc 71, ),
64 Composition 63 Dirichlet s composition of ideals Dirichlet simplified by defining ideals: To multiply two ideals, IJ = {ij : i I, j J}. m + mn + 9n = (4a + 3ab + 5b )(3c + ce + 6e ). (4, ) corresponds to 4a + 3ab + 5b, and (3, ) corresponds to 3c + ce + 6e. Then ) ( 3, 1 + ) 71 = ( 4, ( 1, which corresponds to 1x 5xy +y, also of disc 71, but not reduced. Reduction then yields: (1, 5, ) (, 5, 1) (, 1, 9) ),
65 Composition 64 Comparing Dirichlet s compositions If F = ax + bxy + Ahy, G = Ax + bxy + ahy then H(ux hvy, auy + Avx + bvy) = F (u, v)g(x, y) for H(x, y) = aax + bxy + hy.
66 Composition 65 Comparing Dirichlet s compositions If F = ax + bxy + Ahy, G = Ax + bxy + ahy then H(ux hvy, auy + Avx + bvy) = F (u, v)g(x, y) for H(x, y) = aax + bxy + hy. ( The two quadratic forms F and G correspond to ( ) ( and. The product is A, b+ d aa, b+ d a, b+ d ), so the composition of F and G must be aax + bxy + hy. )
67 Composition 66 Comparing Dirichlet s compositions If F = ax + bxy + Ahy, G = Ax + bxy + ahy then H(ux hvy, auy + Avx + bvy) = F (u, v)g(x, y) for H(x, y) = aax + bxy + hy. ( The two quadratic forms F and G correspond to ( ) ( and. The product is A, b+ d aa, b+ d a, b+ d ), so the composition of F and G must be aax + bxy + hy. Identity of ideal class group: principal ideas. Inverses: ( a, b + d ) ( a, b d ) = ( a, a b + d a (a, b, c) = (a), ), a b d, b d 4 So an ideal and its conjugate are inverses in class group. )
68 Pre-homogenous vector spaces 67 A more general set up Let G(Z) be SL(, Z), an algebraic group ; V (Z) the space of bqfs over Z, a representation. Seen that: The G(Z)-orbits parametrize the ideal classes in the associated quadratic rings. Do other such pairs exist? That is an algebraic group G and associated representation V such that G(Z) V (Z) parametrizes something interesting? Eg rings, modules etc of arithmetic interest.
69 Pre-homogenous vector spaces 68 A more general set up Let G(Z) be SL(, Z), an algebraic group ; V (Z) the space of bqfs over Z, a representation. Seen that: The G(Z)-orbits parametrize the ideal classes in the associated quadratic rings. Do other such pairs exist? That is an algebraic group G and associated representation V such that G(Z) V (Z) parametrizes something interesting? Eg rings, modules etc of arithmetic interest. - In our example there is just one orbit over C: A pre-homogenous vector space is a pair (G, V ) where G is an algebraic group and V is a rational vector space representation of G such that the action of G(C) on V (C) has just one Zariski open orbit.
70 Pre-homogenous vector spaces 69 A pre-homogenous vector space is a pair (G, V ) where G is an algebraic group and V is a rational vector space representation of G such that the action of G(C) on V (C) has just one Zariski open orbit. Bhargava s program centres around study of G(Z) V (Z) for pre-homogenous vector spaces (G, V ).
71 Pre-homogenous vector spaces 70 A pre-homogenous vector space is a pair (G, V ) where G is an algebraic group and V is a rational vector space representation of G such that the action of G(C) on V (C) has just one Zariski open orbit. Bhargava s program centres around study of G(Z) V (Z) for pre-homogenous vector spaces (G, V ). There are just 36 of them (Sato-Kimura, 1977), but they have proved yo be incredibly rich in structure of interest to number theorists.
72 Pre-homogenous vector spaces 71 Bhargava composition Recently Bhargava gave a new insight into the composition law. Note: If IJ = K then IJK is principal.
73 Pre-homogenous vector spaces 7 Bhargava composition We begin with a -by--by- cube. a, b, c, d, e, f, g, h. Six faces, can be split into three parallel pairs. To each consider pair of -by- matrices by taking the entries in each face, with corresponding entries corresponding to opposite corners of the cube, always starting with a. Hence we get the pairs ( ) ( ) a b e f M 1 (x, y) := x + y, c d g h ( ) ( ) a c b d M (x, y) := M 3 (x, y) := x + e g ( ) a b x + e f y, f h ( ) c d y, g h where we have, in each added the dummy variables, x, y. The determinant, Q j (x, y), of each M j (x, y) gives rise to a quadratic form in x and y.
74 Pre-homogenous vector spaces 73 ( ) ( ) a b e f M 1 (x, y) := x + y, c d g h ( ) ( ) a c b d M (x, y) := x + y, e g f h ( ) ( ) a b c d M 3 (x, y) := x + y, e f g h Q j (x, y) = det M j (x, y), a bqf Now apply( an SL(, ) Z) transformation in one direction. α β That is, if SL(, Z) then we replace the face γ δ ( ) ( ) ( ) a b a b e f by α + β c d c d g h and ( ) e f g h by ( ) a b γ + c d ( ) e f δ. g h
75 If and ( ) α β γ δ M 1 (x, y) := Pre-homogenous vector spaces 74 ( ) a b x + c d ( ) e f y, g h SL(, Z) then we replace the face ( ) a b c d ( ) e f g h by by ( ) a b α + c d ( ) a b γ + c d ( ) e f β g h ( ) e f δ. g h Then M 1 (x, y) gets mapped to {( ) ( ) } {( ) a b e f a b α + β x+ γ + c d g h c d that is M 1 (αx + γy, βx + δy). Therefore ( ) } e f δ y, g h Q 1 (x, y) = det M 1 (x, y) gets mapped to Q 1 (αx + γy, βx + δy). which is equivalent to Q 1 (x, y).
76 Pre-homogenous vector spaces 75 Now M (x, y) gets mapped to ( ) aα + eβ cα + gβ x + aγ + eδ cγ + gδ ( ) α β = M γ δ (x, y); ( bα + fβ dα + hβ bγ + fδ dγ + hδ ) y hence the determinant, Q (x, y), is unchanged. An analogous ( ) calculation reveals that M 3 (x, y) gets mapped to α β M γ δ 3 (x, y) and its det, Q 3 (x, y) also unchanged. Therefore we can act on our cube by such SL(, Z)- transformations, in each direction, and each of the three quadratic forms remains in the same equivalence class.
77 Pre-homogenous vector spaces 76 Another prehomogenous vector space We can act on our cube by such SL(, Z)-transformations, in each direction, and each of the three quadratic forms remains in the same equivalence class.
78 Pre-homogenous vector spaces 77 Another prehomogenous vector space We can act on our cube by such SL(, Z)-transformations, in each direction, and each of the three quadratic forms remains in the same equivalence class. Bhargava s cubes can be identified as a e 1 e 1 e 1 + b e 1 e e 1 + c e e 1 e 1 +d e e e 1 + e e 1 e 1 e + f e 1 e e +g e e 1 e + h e e e with the representation Z Z Z of the group SL(, Z) SL(, Z) SL(, Z).
79 Pre-homogenous vector spaces 78 Another prehomogenous vector space We can act on our cube by such SL(, Z)-transformations, in each direction, and each of the three quadratic forms remains in the same equivalence class. Bhargava s cubes can be identified as a e 1 e 1 e 1 + b e 1 e e 1 + c e e 1 e 1 +d e e e 1 + e e 1 e 1 e + f e 1 e e +g e e 1 e + h e e e with the representation Z Z Z of the group SL(, Z) SL(, Z) SL(, Z). This pair is also a prehomogenous vector space
80 Pre-homogenous vector spaces 79 Reducing a Bhargava cube Simplify entries using the following reduction algorithm: We select the corner that is to be a so that a 0. Transform cube to ensure a divides b, c and e. If not, say a does not divide e, n select integers α, β so that aα + eβ = (a, e). Let γ = e/(a, e), δ = a/(a, e). In transformed matrix a = (a, e), e = 0 and 1 a a 1. If a does not divide b or c, repeat the process. Each time we reduce a, so a finite process. Transform cube to ensure b = c = e = 0. Select α = 1, β = 0, γ = e/a, δ = 1, so that e = 0, b = b, c = c. We repeat this in each of the three directions to ensure that b = c = e = 0.
81 Pre-homogenous vector spaces 80 Reducing a Bhargava cube, II Replacing a by a, we have that the three matrices are: ( ) ( ) a 0 0 f M 1 = x + y, so Q 0 d g h 1 = adx + ahxy + fgy ; ( ) ( ) a 0 0 d M = x + y, so Q 0 g f h = agx + ahxy + dfy ; ( ) ( ) a 0 0 d M 3 = x + y, so Q 0 f g h 3 = afx + ahxy + dgy. All discrim (Q j ) = (ah) 4adfg,
82 Pre-homogenous vector spaces 81 Reducing a Bhargava cube, II Replacing a by a, we have that the three matrices are: ( ) ( ) a 0 0 f M 1 = x + y, so Q 0 d g h 1 = adx + ahxy + fgy ; ( ) ( ) a 0 0 d M = x + y, so Q 0 g f h = agx + ahxy + dfy ; ( ) ( ) a 0 0 d M 3 = x + y, so Q 0 f g h 3 = afx + ahxy + dgy. All discrim (Q j ) = (ah) 4adfg, and Q 1 (fy x 3 +gx y 3 +hy y 3, ax x 3 dy y 3 ) = Q (x, y )Q 3 (x 3, y 3 ) x 1 = fy x 3 + gx y 3 + hy y 3 and y 1 = ax x 3 dy y 3.
83 Pre-homogenous vector spaces 8 Reducing a Bhargava cube, II Replacing a by a, we have that the three matrices are: ( ) ( ) a 0 0 f M 1 = x + y, so Q 0 d g h 1 = adx + ahxy + fgy ; ( ) ( ) a 0 0 d M = x + y, so Q 0 g f h = agx + ahxy + dfy ; ( ) ( ) a 0 0 d M 3 = x + y, so Q 0 f g h 3 = afx + ahxy + dgy. All discrim (Q j ) = (ah) 4adfg, and Q 1 (fy x 3 +gx y 3 +hy y 3, ax x 3 dy y 3 ) = Q (x, y )Q 3 (x 3, y 3 ) x 1 = fy x 3 + gx y 3 + hy y 3 and y 1 = ax x 3 dy y 3. Dirichlet: a = 1. So Includes every pair of bqfs of same discriminant.
84 Pre-homogenous vector spaces 83 SL(, Z)-transformations. Forms-Ideals-Transformations ( ) ( ) Generators of SL(, Z), Let z f := b+ d a in the upper half plane. z, z equivalent ( ) if( M) SL(, Z) such that z = u/v u z where = M. Hence z z +1 and z 1/z. v 1 Now a, b + d = a(1, z f ) so equivalent.
85 Pre-homogenous vector spaces 84 ( ) ( ) Generators of SL(, Z),. correspond to two basic ops in Gauss s reduction algorithm The first is x x + y, y y, so that f(x, y) g(x, y) := f(x+y, y) = ax +(b+a)xy+(a+b+c)y. Note that I g = (a, (b + a) + d) = I f, and z g = b a+ d a = z f 1.
86 Pre-homogenous vector spaces 85 ( ) ( ) Generators of SL(, Z),. correspond to two basic ops in Gauss s reduction algorithm The first is x x + y, y y, so that f(x, y) g(x, y) := f(x+y, y) = ax +(b+a)xy+(a+b+c)y. Note that I g = (a, (b + a) + d) = I f, and z g = b a+ d a = z f 1. The second is x y, y x so that f(x, y) h(x, y) := f(y, x) = cx bxy + ay. Note that I h = (c, b + d), and z h = b+ d c. z f z h = b + d b + d a c that is z h = 1/z f. Then = d b 4ac = 1 I h (1, z h ) = (1, 1/z f ) (1, z f ) = (1, z f ) I f.
87 Pre-homogenous vector spaces 86 Since any SL(, Z)-transformation can be constructed out of the basic two transformation we deduce Theorem f f if and only if I f I f if and only if z f z f.
88 Invariants of number fields 87 The ring of integers of a quadratic field, revisited Integer solutions x, y to x + 19 = y 3? If so, y is odd else x 5 (mod 8) #. Also 19 y else 19 x = 19 x + 19 = y 3 0 (mod 19 ). Hence (y, 38) = 1.
89 Invariants of number fields 88 The ring of integers of a quadratic field, revisited Integer solutions x, y to x + 19 = y 3? If so, y is odd else x 5 (mod 8) #. Also 19 y else 19 x = 19 x + 19 = y 3 0 (mod 19 ). Hence (y, 38) = 1. Now (x + 19)(x 19) = y 3 and (x + 19, x 19) contains 19 and y 3, and so also (y 3, 38) = 1.
90 Invariants of number fields 89 The ring of integers of a quadratic field, revisited Integer solutions x, y to x + 19 = y 3? If so, y is odd else x 5 (mod 8) #. Also 19 y else 19 x = 19 x + 19 = y 3 0 (mod 19 ). Hence (y, 38) = 1. Now (x + 19)(x 19) = y 3 and (x + 19, x 19) contains 19 and y 3, and so also (y 3, 38) = 1. Hence the ideals (x + 19) and (x 19) are coprime Their product is a cube and so they are both cubes.
91 Invariants of number fields 90 Integer solutions x, y to x + 19 = y 3? The ring of integers of Q[ 19] has class number one. So every ideal is principal. Hence x + 19 = u(a + b 19) 3 where u is a unit.
92 Invariants of number fields 91 Integer solutions x, y to x + 19 = y 3? The ring of integers of Q[ 19] has class number one. So every ideal is principal. Hence x + 19 = u(a + b 19) 3 where u is a unit. Only units: 1 and 1. Change a, b, to ua, ub. Hence x + 19 = (a + b 19) 3 so that b(3a 19b ) = 1. = a(a 57b ) + b(3a 19b ) 19,
93 Invariants of number fields 9 Integer solutions x, y to x + 19 = y 3? The ring of integers of Q[ 19] has class number one. So every ideal is principal. Hence x + 19 = u(a + b 19) 3 where u is a unit. Only units: 1 and 1. Change a, b, to ua, ub. Hence x + 19 = (a + b 19) 3 = a(a 57b ) + b(3a 19b ) 19, so that b(3a 19b ) = 1. Therefore b = ±1 and so 3a = 19b ± 1 = 19 ± 1 which is impossible. We deduce: There are no integer solutions x, y to x + 19 = y 3.
94 Invariants of number fields 93 Integer solutions x, y to x + 19 = y 3? The ring of integers of Q[ 19] has class number one. So every ideal is principal. Hence x + 19 = u(a + b 19) 3 where u is a unit. Only units: 1 and 1. Change a, b, to ua, ub. Hence x + 19 = (a + b 19) 3 = a(a 57b ) + b(3a 19b ) 19, so that b(3a 19b ) = 1. Therefore b = ±1 and so 3a = 19b ± 1 = 19 ± 1 which is impossible. We deduce: There are no integer solutions x, y to x + 19 = y 3. However what about = 7 3
95 Invariants of number fields 94 Integer solutions x, y to x + 19 = y 3? The ring of integers of Q[ 19] has class number one. So every ideal is principal. Hence x + 19 = u(a + b 19) 3 where u is a unit. Only units: 1 and 1. Change a, b, to ua, ub. Hence x + 19 = (a + b 19) 3 = a(a 57b ) + b(3a 19b ) 19, so that b(3a 19b ) = 1. Therefore b = ±1 and so 3a = 19b ± 1 = 19 ± 1 which is impossible. We deduce: There are no integer solutions x, y to x + 19 = y 3. However what about = 7 3 The mistake: The ring of integers of Q[ 19] is not the set of numbers of the form a + b 19 with a, b Z. It is (a + b 19)/ with a, b Z and a b (mod ).
96 Invariants of number fields 95 Integer solutions x, y to x + 19 = y 3? The ring of integers of Q[ 19] has class number one. So every ideal is principal. Hence x + 19 = ( a+b 19 ) 3 8x = (a + b 19) 3 = a(a 57b ) + b(3a 19b ) 19, so that b(3a 19b ) = 8. Therefore b = ±1, ±, ±4 or ±8 and so 3a = 19 ± 8, 19 4 ± 4, ± or ± 1. The only solution is b = 1, a = ±3 leading to x = 18, y = 7, the only solutions.
Quadratics. Shawn Godin. Cairine Wilson S.S Orleans, ON October 14, 2017
Quadratics Shawn Godin Cairine Wilson S.S Orleans, ON Shawn.Godin@ocdsb.ca October 14, 2017 Shawn Godin (Cairine Wilson S.S.) Quadratics October 14, 2017 1 / 110 Binary Quadratic Form A form is a homogeneous
More informationIdeal Composition in Quadratic Fields: from Bhargava to Gauss
Ideal Composition in Quadratic Fields: from Bhargava to Gauss Duncan Buell Department of Computer Science and Engineering University of South Carolina Clemson, 10 Oct 010 DAB Page 1 Composition in Quadratic
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationObjective Type Questions
DISTANCE EDUCATION, UNIVERSITY OF CALICUT NUMBER THEORY AND LINEARALGEBRA Objective Type Questions Shyama M.P. Assistant Professor Department of Mathematics Malabar Christian College, Calicut 7/3/2014
More informationAMBIGUOUS FORMS AND IDEALS IN QUADRATIC ORDERS. Copyright 2009 Please direct comments, corrections, or questions to
AMBIGUOUS FORMS AND IDEALS IN QUADRATIC ORDERS JOHN ROBERTSON Copyright 2009 Please direct comments, corrections, or questions to jpr2718@gmail.com This note discusses the possible numbers of ambiguous
More informationMath Circles: Number Theory III
Math Circles: Number Theory III Centre for Education in Mathematics and Computing University of Waterloo March 9, 2011 A prime-generating polynomial The polynomial f (n) = n 2 n + 41 generates a lot of
More informationCONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS
CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get short-changed at PROMYS, but they are interesting in their own right and useful in other areas
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationThe Mass Formula for Binary Quadratic Forms
The Mass Formula for Binary Quadratic Forms by John Paul Cook A well-documented question from classical number theory pertains to the different representations of an integer k by a binary quadratic form.
More informationComputing in Quadratic Orders
Computing in Quadratic Orders John Robertson November 27, 2009 Copyright 2009 Please direct comments, corrections, or questions to jpr2718@gmail.com 1 Introduction When studying binary quadratic forms
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationArithmetic Statistics Lecture 3
Arithmetic Statistics Lecture 3 Álvaro Lozano-Robledo Department of Mathematics University of Connecticut May 28 th CTNT 2018 Connecticut Summer School in Number Theory PREVIOUSLY... We can define an action
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 informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More informationHASSE-MINKOWSKI THEOREM
HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.
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 informationPrimes - Problem Sheet 5 - Solutions
Primes - Problem Sheet 5 - Solutions Class number, and reduction of quadratic forms Positive-definite Q1) Aly the roof of Theorem 5.5 to find reduced forms equivalent to the following, also give matrices
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 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 informationTrabajo de fin de grado BINARY QUADRATIC FORMS
Universidad Politécnica de Cataluña Facultad de Matemáticas y Estadística Trabajo de fin de grado BINARY QUADRATIC FORMS Cassius Manuel Pérez de los Cobos Hermosa Director: Jordi Quer Bosor Forse altro
More informationBINARY QUADRATIC DIOPHANTINE EQUATIONS
BINARY QUADRATIC DIOPHANTINE EQUATIONS These equations have the form: a xx x 2 + a xy xy + a yy y 2 + a x x + a y y + a 0 = 0... (1) where a xx, a xy, a yy, a x, a y and a 0 are integers and solutions
More information6 Binary Quadratic forms
6 Binary Quadratic forms 6.1 Fermat-Euler Theorem A binary quadratic form is an exression of the form f(x,y) = ax 2 +bxy +cy 2 where a,b,c Z. Reresentation of an integer by a binary quadratic form has
More informationCHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and
CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
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 informationAlgebraic number theory Solutions to exercise sheet for chapter 4
Algebraic number theory Solutions to exercise sheet for chapter 4 Nicolas Mascot n.a.v.mascot@warwick.ac.uk), Aurel Page a.r.page@warwick.ac.uk) TAs: Chris Birkbeck c.d.birkbeck@warwick.ac.uk), George
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationTRACE AND NORM KEITH CONRAD
TRACE AND NORM KEITH CONRAD 1. Introduction Let L/K be a finite extension of fields, with n = [L : K]. We will associate to this extension two important functions L K, called the trace and the norm. They
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
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 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 informationCONNECTIONS BETWEEN SL 2 (Z) MATRICES, QUADRATIC FORMS, AND ORDERS OF QUADRATIC FIELDS
CONNECTIONS BETWEEN SL Z MATRICES, QUADRATIC FORMS, AND ORDERS OF QUADRATIC FIELDS 1 Abstract We investigate SL Z matrices and look for a criterion when such matrix is conjugate to its inverse. A correspondence
More informationClass Field Theory. Steven Charlton. 29th February 2012
Class Theory 29th February 2012 Introduction Motivating examples Definition of a binary quadratic form Fermat and the sum of two squares The Hilbert class field form x 2 + 23y 2 Motivating Examples p =
More informationALGEBRA PH.D. QUALIFYING EXAM September 27, 2008
ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved completely
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
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 informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationMINKOWSKI THEORY AND THE CLASS NUMBER
MINKOWSKI THEORY AND THE CLASS NUMBER BROOKE ULLERY Abstract. This paper gives a basic introduction to Minkowski Theory and the class group, leading up to a proof that the class number (the order of the
More information18. Cyclotomic polynomials II
18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients
More informationMath 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby
Math 8: Advanced Number Theory Samit Dasgupta and Gary Kirby April, 05 Contents Basics of Number Theory. The Fundamental Theorem of Arithmetic......................... The Euclidean Algorithm and Unique
More informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More informationDiscrete Math, Second Problem Set (June 24)
Discrete Math, Second Problem Set (June 24) REU 2003 Instructor: Laszlo Babai Scribe: D Jeremy Copeland 1 Number Theory Remark 11 For an arithmetic progression, a 0, a 1 = a 0 +d, a 2 = a 0 +2d, to have
More informationMA4H9 Modular Forms: Problem Sheet 2 Solutions
MA4H9 Modular Forms: Problem Sheet Solutions David Loeffler December 3, 010 This is the second of 3 problem sheets, each of which amounts to 5% of your final mark for the course This problem sheet will
More informationGalois Theory Overview/Example Part 1: Extension Fields. Overview:
Galois Theory Overview/Example Part 1: Extension Fields I ll start by outlining very generally the way Galois theory works. Then, I will work through an example that will illustrate the Fundamental Theorem
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationSolving x 2 Dy 2 = N in integers, where D > 0 is not a perfect square. Keith Matthews
Solving x 2 Dy 2 = N in integers, where D > 0 is not a perfect square. Keith Matthews Abstract We describe a neglected algorithm, based on simple continued fractions, due to Lagrange, for deciding the
More information(January 14, 2009) q n 1 q d 1. D = q n = q + d
(January 14, 2009) [10.1] Prove that a finite division ring D (a not-necessarily commutative ring with 1 in which any non-zero element has a multiplicative inverse) is commutative. (This is due to Wedderburn.)
More informationarxiv:math/ v1 [math.nt] 9 Aug 2004
arxiv:math/0408107v1 [math.nt] 9 Aug 2004 ELEMENTARY RESULTS ON THE BINARY QUADRATIC FORM a 2 + ab + b 2 UMESH P. NAIR Abstract. This paper examines with elementary proofs some interesting properties of
More informationSQUARE ROOTS OF 2x2 MATRICES 1. Sam Northshield SUNY-Plattsburgh
SQUARE ROOTS OF x MATRICES Sam Northshield SUNY-Plattsburgh INTRODUCTION A B What is the square root of a matrix such as? It is not, in general, A B C D C D This is easy to see since the upper left entry
More informationINDEFINITE QUADRATIC FORMS AND PELL EQUATIONS INVOLVING QUADRATIC IDEALS
INDEFINITE QUADRATIC FORMS AND PELL EQUATIONS INVOLVING QUADRATIC IDEALS AHMET TEKCAN Communicated by Alexandru Zaharescu Let p 1(mod 4) be a prime number, let γ P + p Q be a quadratic irrational, let
More informationAlgebraic Number Theory and Representation Theory
Algebraic Number Theory and Representation Theory MIT PRIMES Reading Group Jeremy Chen and Tom Zhang (mentor Robin Elliott) December 2017 Jeremy Chen and Tom Zhang (mentor Robin Algebraic Elliott) Number
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 informationProblem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that
Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume
More informationGauss and Riemann versus elementary mathematics
777-855 826-866 Gauss and Riemann versus elementary mathematics Problem at the 987 International Mathematical Olympiad: Given that the polynomial [ ] f (x) = x 2 + x + p yields primes for x =,, 2,...,
More informationOfficial Solutions 2014 Sun Life Financial CMO Qualifying Rêpechage 1
Official s 2014 Sun Life Financial CMO Qualifying Rêpechage 1 1. Let f : Z Z + be a function, and define h : Z Z Z + by h(x, y) = gcd(f(x), f(y)). If h(x, y) is a two-variable polynomial in x and y, prove
More informationDiophantine equations
Diophantine equations F.Beukers Spring 20 2 Mordell s equation 2. Introduction Let d Z with d 0 and consider the equation y 2 + d = x 3 in x, y Z. This equation is known as Mordell s equation. We shall
More information3 The fundamentals: Algorithms, the integers, and matrices
3 The fundamentals: Algorithms, the integers, and matrices 3.4 The integers and division This section introduces the basics of number theory number theory is the part of mathematics involving integers
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 informationAlgebra II Vocabulary Alphabetical Listing. Absolute Maximum: The highest point over the entire domain of a function or relation.
Algebra II Vocabulary Alphabetical Listing Absolute Maximum: The highest point over the entire domain of a function or relation. Absolute Minimum: The lowest point over the entire domain of a function
More informationModern Algebra Lecture Notes: Rings and fields set 6, revision 2
Modern Algebra Lecture Notes: Rings and fields set 6, revision 2 Kevin Broughan University of Waikato, Hamilton, New Zealand May 20, 2010 Solving quadratic equations: traditional The procedure Work in
More informationPrime Numbers and Irrational Numbers
Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is closed under addition, subtraction, multiplication, and also
More information6]. (10) (i) Determine the units in the rings Z[i] and Z[ 10]. If n is a squarefree
Quadratic extensions Definition: Let R, S be commutative rings, R S. An extension of rings R S is said to be quadratic there is α S \R and monic polynomial f(x) R[x] of degree such that f(α) = 0 and S
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #2 09/10/2013
18.78 Introduction to Arithmetic Geometry Fall 013 Lecture # 09/10/013.1 Plane conics A conic is a plane projective curve of degree. Such a curve has the form C/k : ax + by + cz + dxy + exz + fyz with
More informationON DIFFERENCES OF TWO SQUARES IN SOME QUADRATIC FIELDS
ON DIFFERENCES OF TWO SQUARES IN SOME QUADRATIC FIELDS ANDREJ DUJELLA AND ZRINKA FRANUŠIĆ Abstract. It this paper, we study the problem of determining the elements in the rings of integers of quadratic
More informationPell Equation x 2 Dy 2 = 2, II
Irish Math Soc Bulletin 54 2004 73 89 73 Pell Equation x 2 Dy 2 2 II AHMET TEKCAN Abstract In this paper solutions of the Pell equation x 2 Dy 2 2 are formulated for a positive non-square integer D using
More informationChapter 4 Finite Fields
Chapter 4 Finite Fields Introduction will now introduce finite fields of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public Key concern operations on numbers what constitutes a number
More informationTwisted integral orbit parametrizations
Institute for Advanced Study 4 Octoer 017 Disclaimer All statements are to e understood as essentially true (i.e., true once the statement is modified slightly). Arithmetic invariant theory This talk is
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationSchool of Mathematics
School of Mathematics Programmes in the School of Mathematics Programmes including Mathematics Final Examination Final Examination 06 22498 MSM3P05 Level H Number Theory 06 16214 MSM4P05 Level M Number
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,
More informationUniqueness of Factorization in Quadratic Fields
Uniqueness of Factorization in Quadratic Fields Pritam Majumder Supervisors: (i Prof. G. Santhanam, (ii Prof. Nitin Saxena A project presented for the degree of Master of Science Department of Mathematics
More information1. Suppose that a, b, c and d are four different integers. Explain why. (a b)(a c)(a d)(b c)(b d)(c d) a 2 + ab b = 2018.
New Zealand Mathematical Olympiad Committee Camp Selection Problems 2018 Solutions Due: 28th September 2018 1. Suppose that a, b, c and d are four different integers. Explain why must be a multiple of
More informationChapter 7 Polynomial Functions. Factoring Review. We will talk about 3 Types: ALWAYS FACTOR OUT FIRST! Ex 2: Factor x x + 64
Chapter 7 Polynomial Functions Factoring Review We will talk about 3 Types: 1. 2. 3. ALWAYS FACTOR OUT FIRST! Ex 1: Factor x 2 + 5x + 6 Ex 2: Factor x 2 + 16x + 64 Ex 3: Factor 4x 2 + 6x 18 Ex 4: Factor
More informationPolynomial Rings. (Last Updated: December 8, 2017)
Polynomial Rings (Last Updated: December 8, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from Chapters
More information... z = (2x y) 2 2y 2 3y.
1. [4] Let R be the rectangle in the Cartesian plane with vertices at (0,0),(2,0),(2,1), and (0,1). R can be divided into two unit squares, as shown. The resulting figure has 7 segments of unit length,
More informationLocal properties of plane algebraic curves
Chapter 7 Local properties of plane algebraic curves Throughout this chapter let K be an algebraically closed field of characteristic zero, and as usual let A (K) be embedded into P (K) by identifying
More informationIntroduction to Number Theory
Introduction to Number Theory Paul Yiu Department of Mathematics Florida Atlantic University Spring 017 March 7, 017 Contents 10 Pythagorean and Heron triangles 57 10.1 Construction of Pythagorean triangles....................
More informationArithmetic Operations. The real numbers have the following properties: In particular, putting a 1 in the Distributive Law, we get
MCA AP Calculus AB Summer Assignment The following packet is a review of many of the skills needed as we begin the study of Calculus. There two major sections to this review. Pages 2-9 are review examples
More informationMaterial covered: Class numbers of quadratic fields, Valuations, Completions of fields.
ALGEBRAIC NUMBER THEORY LECTURE 6 NOTES Material covered: Class numbers of quadratic fields, Valuations, Completions of fields. 1. Ideal class groups of quadratic fields These are the ideal class groups
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationRepresented Value Sets for Integral Binary Quadratic Forms and Lattices
Southern Illinois University Carbondale OpenSIUC Articles and Preprints Department of Mathematics 2007 Represented Value Sets for Integral Binary Quadratic Forms and Lattices A. G. Earnest Southern Illinois
More informationQUADRATIC FORMS. A mathematical vignette. Ed Barbeau, University of Toronto
QUADRATIC FORMS A mathematical vignette Ed Barbeau, University of Toronto 1. Difference of squares. Question: What positive integers can be written as the difference of two squares? This is a good problem
More informationComplex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i
Complex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i 2 = 1 Sometimes we like to think of i = 1 We can treat
More informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationAddition sequences and numerical evaluation of modular forms
Addition sequences and numerical evaluation of modular forms Fredrik Johansson (INRIA Bordeaux) Joint work with Andreas Enge (INRIA Bordeaux) William Hart (TU Kaiserslautern) DK Statusseminar in Strobl,
More informationOctonions, Cubes, Embeddings. Martin H. Weissman
Octonions, Cubes, Embeddings Martin H. Weissman March 2, 2009 Let k be a field, with char(k) 2. A Hurwitz algebra over k is a finite-dimensional, unital, k-algebra A, together with a quadratic form N :
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationElementary Number Theory Review. Franz Luef
Elementary Number Theory Review Principle of Induction Principle of Induction Suppose we have a sequence of mathematical statements P(1), P(2),... such that (a) P(1) is true. (b) If P(k) is true, then
More informationAnalytic Number Theory Solutions
Analytic Number Theory Solutions Sean Li Cornell University sxl6@cornell.edu Jan. 2013 Introduction This document is a wor-in-progress solution manual for Tom Apostol s Introduction to Analytic Number
More information2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.
2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say
More informationTHE UNREASONABLE SLIGHTNESS OF E 2 OVER IMAGINARY QUADRATIC RINGS
THE UNREASONABLE SLIGHTNESS OF E 2 OVER IMAGINARY QUADRATIC RINGS BOGDAN NICA ABSTRACT. It is almost always the case that the elementary matrices generate the special linear group SL n over a ring of integers
More informationc ij x i x j c ij x i y j
Math 48A. Class groups for imaginary quadratic fields In general it is a very difficult problem to determine the class number of a number field, let alone the structure of its class group. However, in
More informationDiscrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
More informationSYMBOL NAME DESCRIPTION EXAMPLES. called positive integers) negatives, and 0. represented as a b, where
EXERCISE A-1 Things to remember: 1. THE SET OF REAL NUMBERS SYMBOL NAME DESCRIPTION EXAMPLES N Natural numbers Counting numbers (also 1, 2, 3,... called positive integers) Z Integers Natural numbers, their
More informationw d : Y 0 (N) Y 0 (N)
Upper half-plane formulas We want to explain the derivation of formulas for two types of objects on the upper half plane: the Atkin- Lehner involutions and Heegner points Both of these are treated somewhat
More informationCh 7 Summary - POLYNOMIAL FUNCTIONS
Ch 7 Summary - POLYNOMIAL FUNCTIONS 1. An open-top box is to be made by cutting congruent squares of side length x from the corners of a 8.5- by 11-inch sheet of cardboard and bending up the sides. a)
More information