QUADRATIC RECIPROCITY

Size: px
Start display at page:

Download "QUADRATIC RECIPROCITY"

Transcription

1 QUADRATIC RECIPROCIT POOJA PATEL Abstract. This aer is an self-contained exosition of the law of uadratic recirocity. We will give two roofs of the Chinese remainder theorem and a roof of uadratic recirocity. These roofs will mainly involve concets from basic algebra and elementary number theory. Contents 1. Introduction 1. Fermat's two suares theorem 1 3. Fermat's Little Theorem, Euler's Theorem, and Wilson's Theorem 3 4. Chinese Remainder Theorem 6 5. Proof of uadratic recirocity 10 References Introduction There are numerous aroaches to roving uadratic recirocity, and here we resent a very elegant one discovered by George Rousseau [3]. This aer uses the language of basic abstract algebra and we will see its interlay with elementary number theory throughout. This exosition can also be used as a sulement material for learning basic algebra for the rst time. First we resent a roof [1] of an old theorem due to Fermat: rime numbers in the form 4m + 1 can be exressed as the sum of two suares. Later on, we will see that this gives us a secial case (Lemma 5.4) of Euler's criterion (Theorem 5.) Next, we will resent Fermat's Little Theorem and Euler's Theorem. In the language of elementary grou theory, both of these theorems will become easy corollaries of Lagrange's Theorem. Also we will rove Wilson's Theorem and its corollary. After these, we will rove the Chinese Remainder Theorem in two aroaches: one using only elementary number theory, the other reformulated and roven in the language of rings and ideals. Finally we will resent a roof of the Theorem of Quadratic Recirocity.. Fermat's two suares theorem The main result of this section is the following theorem. Theorem.1. A rime number can be written as a sum of two suares if and only if it is of the form 4m + 1 for some natural number m. Date: August 4,

2 Denition.. An euivalence relation on a set S is a binary relation that satises the following roerties: (1) Reexivity: for all a S; we have a a. () Symmetry: for all a; b S; if a b; then b a: (3) Transitivity: for all a; b; c S; if a b and b c; then a c: Given a set S and an euivalence relation on S. Let a S. We dene the euivalence class of a S to be [a] : fb S j b ag: Then a is called a reresentative of [a]. We denote the collection of all euivalence classes by S : f[a] j a Sg. Here is an examle. Let be a rime number. Let ZZ Z, where is dened as the following: for all a; b Z; a b if and only if j(a b), i.e. there exists k Z; such that k a b. We can denote ZZ by f0; 1; ; 1g. Then we dene (ZZ) to be the collection of nonzero elements f1; ; 1g. Lemma.3. For rimes of the form 4m + 1, there exists s Z such that s 1 mod : Proof. Let 4m + 1 for some m N. Then for all x (ZZ), we consider the set fx; x; x; xg where x is the additive inverse of x and x is the multilicative inverse of x. First we notice that x 6 x because is an odd rime number. For the same reason, x 6 x. Thus jfx; x; x; xgj or 4. Now let's consider the two cases for which jfx; x; x; xgj. Case 1: x x. This imlies x 1, so (x 1)(x + 1) 0 in ZZ. This means x could only be 1 or 1. Let A 0 : f1; 1g: Case : x x. This imlies x 1: Now it suces to show that Case haens for some x (ZZ). Let A f fx; x; x; xg j x (ZZ) g; B f A A j jaj g; C A B f A A j jaj 4g: Since 1 j(zz) j j S AA Aj P AA jaj jbj + 4jC j is divisible by 4, we have jbj is even. Also we already know that A 0 B, so jbj, hence there exists A 1 B with A 1 6 A 0, say A 1 fs; sg for some s (ZZ). Then A 1 falls into Case, so s 1. Proosition.4. Any rime number in the form 4m + 1 is a sum of two suares. Proof. We know there are (b c + 1) airs of integers (x 0 ; y 0 ) with 0 x 0 ; y 0. By the igeon hole rincile, for every s Z, there are two airs (x 0 ; y 0 ); (x 00 ; y 00 ) such that x 0 sy 0 x 00 sy 00 mod : Hence x sy mod, where x jx 0 x 00 j; y jy 0 y 00 j: By Lemma.3, we can take s to be such that s 1 mod. Then x s y y mod. Therefore we have found (x; y) Z with 0 < x + y < and x + y 0 mod. Since is the only rime between 0 and divisible by, we conclude that x + y.

3 Proosition.5. No number in the form n 4m + 3 is a sum of two suares. Proof. Let n 4m + 3 for some m Z. Assume n x + y for some x; y Z. Then by a simle calculation we see that x 0 or 1 mod 4: Similarly, y 0 or 1 mod 4. Hence n 6 3 mod, so we have a contradiction. Thus n is not a sum of two suares. 3. Fermat's Little Theorem, Euler's Theorem, and Wilson's Theorem In this section we will see the interlay between basic algebra and elementary number theory. We will see that Fermat's Little Theorem follows easily from Lagrange's Theorem. Denition 3.1. A grou is a set G together with a binary oeration \ " : G G! G, satisfying the following three axioms: (1) Associativity: if a; b; c S, then a (b c) (a b) c. () Identity: there exists a uniue e such that for all a G we have a e e a a. (3) Inverse: for all a G there exists a 1 such that a a 1 a 1 a e where e is the identity. A grou is Abelian if it is commutative. That is, for all a; b S, we have a b b a. Examle 3.. (1) (ZnZ, +) () ((ZZ) ; ) Denition 3.3. The order of a grou G is the cardinality of G, in other words it is the number of elements in G. It is denoted by jgj. Denition 3.4. H is a subgrou of a grou G if H is a subset of G and forms a grou under the binary oeration inherited from G. This is denoted by H G. Theorem 3.5 (Lagrange's Theorem). Suose H is a subgrou of a nite grou G. Then jhj divides jgj. Proof. To rove this theorem, we will show that all the cosets of H form a artition of G, and each coset has the same cardinality. Claim: Let k H. Dene kh fkh : h Hg. Then kh H. Proof: For all h H, we have k h H so kh H. We also know that for all h H, h k k 1 h kh; so H kh. Therefore kh H. Next we rove a necessary and sucient condition for two cosets to coincide. Claim: Let ah and bh be any two cosets. Then ah bh if and only if b 1 a H. Proof: ( ) ) Suose ah bh. Let c H. Then there exists d H, ac bd so b 1 a dc 1 H. ( ( ) Let b 1 a H. Then by claim 1, H b 1 ah. So bh b(b 1 ah) ah. Now we will show that if two cosets are not eual then their intersection is emty. Claim: Suose a; b G where ah 6 bh. Then ah \ bh. Proof: Assume ah \ bh 6. So we can take some g ah \ bh. So there exists c; d H such that g ac bd. So b 1 a dc 1 H. Thus by claim, we have ah bh. Furthermore, we show that cosets of a subgrou form a artition of the grou. Claim: If H fch : c Gg, then it forms a artition of G. Proof: It is clear that [ cg ch G, because H, as a subgrou of G, contains e. We also know that ah 6 bh imlies ah \ bh. Thus, all of the distinct ch are disjoint. 3

4 Now we show that all cosets have the same cardinality. Claim: For all a; b G, jahj jbhj. Proof: It suces to show that for all a G, we have jahj jhj. Consider the function f : H! ah; h 7! a h: We see that it is a bijection because it has a two-sided inverse f 1 : ah! H; g 7! a 1 g: Now our claim follows. From the above claims we know that the left cosets of G form a artition of G, each coset with cardinality jhj. Therefore jhj divides jgj. Theorem 3.6. Let G be a nite grou, with jgj n. Let a G. Then where e is the identity element in G. a n e; Proof. Let H be the cyclic subgrou generated by a, i.e. H fe; a; a ; ; a m 1 g. By Lagrange's theorem, mjn, so there exists some k N such that n m k. Thus a n a m k (a m ) k e k e: Corollary 3.7 (Fermat's little theorem). Let be a rime number, and let a Z. Then a a mod. Proof. We can rove this using Theorem 3.6. Let a Z. It suces to show that a and a reresent the same class in ZZ. If j a, then both a and a will reresent 0 ZZ, and we are done. If - a, then a reresents some [a] (ZZ). Let's also denote it by a. By alying Theorem 3.6 with G (ZZ), we have a 1 1. Thus a a as elements in (ZZ). This roves our statement. Our next goal is to rove Euler's Theorem, a generalization of Fermat's Little Theorem. In order to rove this theorem, we need to dene what a ring is. Denition 3.8. A ring R is an additive Abelian grou that also has a multilicative oeration \ " which is associative and distributive: i.e. For all a; b; c R, we have a (b c) (a b) c a (b + c) a b + a c (b + c) a b a + c a In this aer we always assume a ring has multilicative identity: i.e. There exists a uniue 1 R R; such that for all a R we have 1 R a a 1 R a: A ring is commutative if for all a; b R, we have a b b a. Examle 3.9. (1) (ZnZ; +; ) () Polynomials with coecients in any eld. Denition Let R be a ring. Then we say a is a unit in R, if there exists b R such that ab ba 1. We denote the collection of all units in R by R. Examle (1) (ZnZ) fa ZnZ j a is co-rime to n:g 4

5 Lemma 3.1. Let R be a ring, and let U R : Then for all a; b U, we have a b U. Proof. Since a is a unit, there exists c such that a c 1. Similarly there exists d such that b d 1. Then (a b) (d c) a (1) c a c 1, so a b U. Remark From the above lemma and the denition of rings, we see that the units of a ring form a multilicative grou. Theorem 3.14 (Euler's theorem). Let m, and let a Z be co-rime to m (i.e. gcd(a; m) 1). Then we have a (m) 1 mod m where (m) is the number of integers in f0; 1; ; ; m m. 1g that are co-rime to Proof. Similar to the roof of Corollary 3.7, we can also rove this by alying Theorem 3.6. Let U m (ZmZ). Then (m) ju m j. Since a is co-rime to m, we have that a reresents some [a] U m. Let's also denote this by a. Then by alying Theorem 3.6 with G U m, we have a (m) 1. This roves our statement. Another imortant result which we will use later is Wilson's Theorem. Theorem 3.15 (Wilson's theorem). If is a rime, then ( 1)! 1 mod. Proof. Each of 1; ; ; 1, when considered as elements in the grou (ZZ), has an multilicative inverse. And among these elements, only 1 and 1 are their own inverses, because if x 1 mod, then x 1 (x + 1)(x 1) 0 mod ; so x 1 mod. Thus all factors in the dening roduct of ( 1)! cancel out with their inverses, excet for 1 and 1. Hence ( 1)! (1) ( 1) 1 mod. Corollary If is a rime, then [( 1 )!] ( 1)( 1) 1 mod : Proof. By Wilson's theorem, Therefore, we get 1 ( 1)! 1 ( 1) ( ( 1)) ( )( 1) [(( 1))!] ( 1) 1 mod : ( 1 )! ( 1)( 1) 1 mod : Next we dene what a eld is, a concet that was already alied in section 1. Denition A eld F (F; +; ) is a commutative ring (with multilicative identity) such that every non-zero element has a multilicative inverse. This means all non-zero elements are units in a eld. Examle (ZZ; +; ). See the following roosition. Proosition Let be a rime. Then (ZZ; +; ) is a eld. 5

6 Before we rove this roosition, we rst rove an imortant lemma which will be alied in later sections as well. Lemma 3.0 (Bezout's Lemma). If gcd(a; b)c, then there exists s; t Z such that as + bt c: Proof. Since gcd(a; b) gcd( a; b), we can assume a and b are ositive. If we were to use the Euclidean algorithm to nd gcd(a; b), we would get the following seuence of uotients and remainders: a b 1 + r 1 b r 1 + r r 1 r 3 + r 3. r n r n 1 n + r n r n 1 r n n From Euclidean algorithm we know that r n c. We will use strong induction on n to rove that r n is a linear combination of a and b for 1 k n. First, for n 1 we have r 1 a b 1 so we know that P 1 is true. Now for the inductive ste, let ositive integer k < n, we assume that r i is a linear combination of a and b for all 1 i k. Since r k+1 r k 1 r k k+1, and by the inductive hyothesis we know that r k 1 and r k are both linear combinations of a and b, so r k+1 is also a linear combination of a and b. Therefore, by strong induction r n is a linear combination of a and b. Proof of Proosition. We know most of the axioms holds trivially, so it suces to show that every element in (ZZ) has a multilicative inverse. Let a (ZZ), and let a Z be a reresentative of a. Since is a rime, gcd(a; )1. This imlies that there exists s; t Z such that as + t 1: Thus we have ab 1, i.e. a has a multilicative inverse. 4. Chinese Remainder Theorem Theorem 4.1 (Chinese remainder theorem). If 1 t where gcd( i ; j )1 for any i 6 j, and we have some integers b 1 ; b ; ; b t, we can always nd x Z such that x b i mod i for all i. Any two such solutions will dier by a multile of. We will rst begin by roving a lemma. Lemma 4.. If 1 ; ; ; t divide n and gcd( i ; j )1 for i 6 j, then 1 t will divide n. Proof. For t 1 this holds. Let t and suose the lemma holds for t 1 so that 1 t 1 divides n. Let 0 1 t 1 and 0 t. Since t is relatively rime to 1 ; ; ; t, we know that gcd( t ; 0 ) 1: Thus by Lemma 3.0 in the end of revious section, there exists a; b Z such that a t + b 0 1: 6

7 Thus n na t + nb 0. Since 0 divides n, we get that divides na t. Furthermore, since t divides n, divides nb 0. Thus divides n and this comletes the induction. Now we are ready to rove the Chinese Remainder Theorem. Proof of Chinese Remainder Theorem. Let 1 t, and for all i; let n i i. Then we know that there exists a i ; b i Z such that a i i + b i n i 1: We also know that b i n i 1 mod i, and b i n i 0 mod j for i 6 j: Let tx x 0 r i b i n i : i0 Then for each i, x 0 r i b i n i r i mod i : This imlies that x 0 is a solution. Suose we have another solution x 1. Then x 1 x 0 0 mod i for i 1; ; ; t: Thus 1 t divides (x 1 x 0 ) by lemma 4.. Next we formulate a ring theoretic corollary of the Chinese Remainder Theorem. Denition 4.3. Let R; S be two rings. Then a ma ' : R! S which satises the following three roerties for all a; b R is called a ring homomorhism: (1) '(a + b) '(a) + '(b) () '(a b) '(a) '(b) (3) f(1 R ) 1 S If a homomorhism f is also bijective, then we call it a ring isomorhism. Corollary 4.4. Let ; be two co-rime natural numbers. Then (ZZ) (ZZ) (ZZ) as rings. Proof. Let and Consider the ma : Z! (ZZ) x 7! x mod ; : Z! (ZZ) x 7! x mod ; : Z! (ZZ) x 7! x mod : ' : Z! (ZZ) (ZZ) x 7! (x) ; (x) : We rst show that ' is a ring homomorhism: Let x; y Z. Then '(x + y) (x + y); (x + y) (x)+ (y); (x)+ (y) (x); (x) + (y); (y) '(x) + '(y); '(x y) (x y); (x y) (x) (y); (x) (y) (x); (x) (y); (y) '(x) '(y): '(1) (1); (1) 1 ZZ ; 1 ZZ 1(ZZ) (ZZ) : 7

8 Now let x; y be two integers with (x) (y). Then divides (x y) evenly, so do and. Thus (x) (y) and (x) (y), hence '(x) '(y). So ' decends to a ring homomorhism e' : (ZZ)! (ZZ) (ZZ): Furthermore, e' is surjective by the Chinese Remainder Theorem. Now observe that j(zz) (ZZ)j j(zz)j < 1; so e' is a surjective ma between two nite sets with the same cardinality. Thus e' is also injective, hence bijective. Therefore e' is an isomorhism. Next we formulate a roof of the Chinese Remainder Theorem that uses rings and ideals. Denition 4.5. A subring Q of ring R is a subset of R which also forms a ring with the oerations inherited from R. A subring also has that 1 Q 1 R. Denition 4.6. An Abelian (additive) subgrou I of R is called a left ideal of R if it absorbs multilication by elements of R, i.e. for all a I, r R, we have r a I. Similarly, if for all a I, r R, we have a r I, we say I is a right ideal of R. If an ideal is both a right and left ideal, then it is called a two-sided ideal. We simly call this an ideal of R. Remark 4.7. Let I and J be two ideals of a ring R. The sum of the two ideals, dened as I + J fx + y; x I; y Jg, is an ideal. Furthermore, the intersection of nitely many ideals is also an ideal. Denition 4.8. Let f : R! S be a ring homomorhism. We dene the kernel of f as ker f fr R; f(r) 0g, and the image of f as imf ff(r) j r Rg. Then we can check that the image of f is a subring of S, and that the kernel of f is a two sided ideal of R. We also notice that f is injective if and only if ker f 0: Denition 4.9. Let I be an ideal of a ring R. We can dene the uotient ring as RI : fr + I; r Rg. The addition and multilication oerations on RI are dened as (r + I) (s + I) r s + I, and (r + I) + (s + I) (r + s) + I, with identity 1 R + I and zero element 0 R + I. Theorem 4.10 (First isomorhism theorem for rings). Let R be a ring. Let ' : R! S be a ring homomorhism. Then the ma is a well dened isomorhism. f : R ker(')! im' r + ker ' 7! '(r) Proof. We rst need to show that the ma f is well dened. Let r; r 0 R with r + ker ' r 0 + ker '. Then r r 0 + s for some s ker f, so '(r) '(r 0 + s) '(r 0 ) + '(s) '(r 0 ) + 0 '(r 0 ): Since ' is a ring homomorhism, we can easily check that f is also a ring homomorhism. Now we show that f is bijective. First it is clear that f is surjective. This is because for all t im'; there exists r R; such that '(r) t; so we have f(r+ker ') t: Furthermore, we can show that f is injective. Let (r+ker ') ker f. Then '(r) f(r + ker ') 0, so r ker '. Thus r + ker ' ker ': This means ker f is trivial, hence f is injective. Therefore, f is an isomorhism as desired. 8

9 Before we state and rove the ring theoretic version of the Chinese Remainder Theorem, we need the following two denitions. Denition Let R 1 ; : : : ; R n be rings. We dene the ring of direct roduct n i1 R i : f(a 1 ; ; a n ) j each a i R i g with comonent-wise addition and multilication. The zero element is (0 R1 ; ; 0 Rn ), and the identity is (1 R1 ; ; 1 Rn ). We can easily check that this forms a ring. Denition 4.1. The ideals I and J of ring R are co-rime if I + J R. Remark This terminology is motivated by the examle R Z; I nz; J mz. By Bezout's lemma, I and J are co-rime if and only if n and m are co-rime. Now we can rove the ring theoretic version of the Chinese Remainder Theorem. Theorem 4.14 (Chinese remainder theorem). Let R be a commutative ring with multilicative unit. Let I 1 ; : : : ; I n be airwise co-rime ideals in R, i.e. I i + I j R for all i 6 j. Then we have R \ n i1 I i n i1 Proof. We can dene a ring homomorhism f as f : R! n i1 RI i RI i : a 7! (a + I 1 ; : : : ; a + I n ): First we show that f is surjective. Let a 1 ; ; a n R. Now we look for a R with a a i mod I i for each i. Fix i f1; ; ; ng. We rst construct c i R such that c i 1 mod I i ; and c i 0 mod I j ; for all j 6 i: Let j f1; ; ; ng with j 6 i. Since I i + I j R, there exists b j I i ; d j I j such that b j + d j 1. Let c i : j6i d j : Since for each j 6 i we have b j 0 mod I i ; so c i Q j6i (b j + d j ) 1 mod I i : Also, for each j 6 i we have c i 0 mod I j : This construction works for each i. Now let a a 1 c a n c n. This imlies that we have a a i mod I i for each i. Hence f is surjective. We notice that ker f fa R j f(a) (I 1 ; ; I n )g fa R j a I i ; for all i 1; ; ; ng \ n i1 I i: Thus by the rst isomorhism theorem, we have roven the Chinese Remainder Theorem, again. Remark Now we see that the ring theoretic corollary of the Chinese Remainder Theorem follows from this version by taking R Z; I 1 Z; I Z: 9

10 5. Proof of uadratic recirocity We will now give Rousseau's roof for uadratic recirocity. Denition 5.1 (Legendre Symbol). Let a (ZZ). Then we dene ( a 1; if a is a suare in (ZZ) ; : 1; if a is a suare in (ZZ) : And for all a Z not divisible by, we can dene a naturally. Theorem 5. (Euler's criterion). Let be an odd rime. Then, for Z not divisible by, we have 1 mod : Proof. Let x 1 : Then x 1 1 mod, so x 1 mod. Now it suces to show that is a suare in (ZZ) () 1 1 mod : Suose is a suare in (ZZ), i.e. there exists a such that Then by Fermat's theorem, a mod and 1: 1 a 1 1 mod : To show the converse, suose 1 1 mod. Since ZZ is a eld, the olynomial y 1 1 has at most 1 roots in ZZ. In fact, these roots will be 1 ; ; ; ( 1 ). Similar to the roof of the other direction, we can aly Fermat's Little Theorem to nd that all these numbers are roots of the olynomial y 1 1. Since we have 1 of them listed here, it suces to show that these roots are all distinct in ZZ. Let x; y f1; ; ; 1 g. Assume x y mod. Then x y 0 mod, so (x y)(x + y) 0 mod : Since both x; y are less or eual to 1, we have x + y 6 0 mod. Since ZZ is an integral domain, we have x y 0 mod. Also from the range of x and y, we know that 0 jx yj 1. So x y 0, hence x y. Thus all the roots of the olynomial y 1 1 in ZZ are suares in (ZZ). Now since is a root of y 1 1, we have that is a suare in (ZZ). Thus, 1. We will now rove three lemmas that will be used in the roof of uadratic recirocity. Lemma 5.3 (The multilicative roerty of ). Let be a rime number. Let 1 ; Z, both not divisible by. Then we have :

11 Proof. From Euler's criterion we know Thus mod ; and mod ( 1 ) 1 mod 1 mod : 1 mod : Lemma 5.4. For all odd rime, we have ( 1 1; if 4n + 1; 1; if 4n + 3: 1 Proof. From Euler's criterion we know that If 4n + 1, then 1 Since is not, we have 1 Lemma 5.5. For an odd rime, we have Proof. Suose 4n + 1. Then we have ( 1) n n (k 1) ( 1) 1 mod. ( 1) n 1 mod : 1. Similarly, if 4n + 3, then 1 (( 1) 1 4 mod ; if 4n + 1; ( 1) +1 4 mod ; if 4n + 3: n n n Q Q n Since (k) n n ( to get: ( 1) n " n (k 1) #" n [ (k 1)] (4n k + ) (n + k) n n [ (k 1)] mod n kn+1 [4n (n + 1 k) + ] k mod : 1. k), we can multily these two euations together k # n " n 11 k #" n kn+1 k # mod

12 However, we also have " n (k 1) #" n k # " n " n (k 1) k #" n kn+1 #" n k # k : #" n kn+1 So we have ( 1) n n mod, that is 1 ( 1) 1 4 mod : Therefore, by Euler's Criterion 1 ( 1) 4 mod : Similarly for 4n we can rove ( 1) 4 mod : Thus, is a suare modulo if and only if 8m 1. Theorem 5.6 (The Law of Quadratic Recirocity). Let, be two distinct odd rimes. Then, ( 1) 1 1 : Proof. Let us consider the following set A fx N j 1 x 1 ; where x is relatively rime to both and g: In other words, all elements in A reresent units in (ZZ). We also know for all u (ZZ) ; there exists a uniue x such that either x reresents u or x reresents u. By a straightforward calculation we have (Q Q 1 x k) 1 ( 1 k) [( 1)!] 1 [( 1)]! Q ( 1) 1 1 xa k 1 mod [( 1)]! where we have used the facts ( 1)! 1 by Wilson's theorem and 1 by Euler's criterion. Similarly we have x ( 1) 1 mod : This means (x; x) xa xa ( 1) 1 ; ( 1) 1 k mod (; ): From the Chinese Remainder Theorem, we know that there is a ring isomorhism ' : ZZ! ZZ ZZ. Let B f(a; b) N j 1 a 1; and 1 b ( 1)g: Then, each element in B reresents an element in (ZZ) (ZZ). We can also see that for each x A; exactly one of '(x); '(x) is reresented by an element in B. Thus we have (x; x) (a; b): We also know (a;b)b xa '(x) xa (a; b) (a;b)b [( 1)!] 1 ; [( 1 )!] 1 : 1 #

13 By a corollary of Wilson's Theorem we know that [( 1 )!] ( 1)( 1) 1 mod : Thus, (a;b)b (a; b) ( 1) 1 ; ( 1) 1 1 ( 1) 1 Q From the calculation above, and the relation xa (x; x) Q (a;b)b have Therefore, ( 1) 1 1 ( 1) : ( 1) 1 ( 1) 1 ( 1) ( 1 )( 1 ) : ( 1) 1 1 : (a; b), we Acknowledgments I would like to thank my mentor, Boming Jia, for teaching me the Chinese Remainder Theorem and for heling me extensively with this aer. I would also like to thank Matthew Emerton for teaching me about uadratic recirocity, and Peter May for organizing the REU and reviewing this aer. References [1] Aigner, M., Ziegler, G. M., & Quarteroni, A. (010). Proofs from the Book (Vol. 74). Berlin: Sringer. [] Dummit, D. S., & Foote, R. M. (004). Abstract algebra (Vol. 3). Hoboken: Wiley. [3] Rousseau, G. (1991). On the uadratic recirocity law. Journal of the Australian Mathematical Society, 51(3), [4] Stillwell, J. (00). Elements of number theory. Sringer Science & Business Media. 13

RECIPROCITY LAWS JEREMY BOOHER

RECIPROCITY LAWS JEREMY BOOHER RECIPROCITY LAWS JEREMY BOOHER 1 Introduction The law of uadratic recirocity gives a beautiful descrition of which rimes are suares modulo Secial cases of this law going back to Fermat, and Euler and Legendre

More information

Jacobi symbols and application to primality

Jacobi symbols and application to primality Jacobi symbols and alication to rimality Setember 19, 018 1 The grou Z/Z We review the structure of the abelian grou Z/Z. Using Chinese remainder theorem, we can restrict to the case when = k is a rime

More information

MATH 371 Class notes/outline September 24, 2013

MATH 371 Class notes/outline September 24, 2013 MATH 371 Class notes/outline Setember 24, 2013 Rings Armed with what we have looked at for the integers and olynomials over a field, we re in a good osition to take u the general theory of rings. Definitions:

More information

Algebraic Number Theory

Algebraic Number Theory Algebraic Number Theory Joseh R. Mileti May 11, 2012 2 Contents 1 Introduction 5 1.1 Sums of Squares........................................... 5 1.2 Pythagorean Triles.........................................

More information

MATH 371 Class notes/outline October 15, 2013

MATH 371 Class notes/outline October 15, 2013 MATH 371 Class notes/outline October 15, 2013 More on olynomials We now consider olynomials with coefficients in rings (not just fields) other than R and C. (Our rings continue to be commutative and have

More information

3 Properties of Dedekind domains

3 Properties of Dedekind domains 18.785 Number theory I Fall 2016 Lecture #3 09/15/2016 3 Proerties of Dedekind domains In the revious lecture we defined a Dedekind domain as a noetherian domain A that satisfies either of the following

More information

DISCRIMINANTS IN TOWERS

DISCRIMINANTS IN TOWERS DISCRIMINANTS IN TOWERS JOSEPH RABINOFF Let A be a Dedekind domain with fraction field F, let K/F be a finite searable extension field, and let B be the integral closure of A in K. In this note, we will

More information

QUADRATIC RECIPROCITY

QUADRATIC RECIPROCITY QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick

More information

QUADRATIC RECIPROCITY

QUADRATIC RECIPROCITY QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick

More information

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2, MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write

More information

GAUSSIAN INTEGERS HUNG HO

GAUSSIAN INTEGERS HUNG HO GAUSSIAN INTEGERS HUNG HO Abstract. We will investigate the ring of Gaussian integers Z[i] = {a + bi a, b Z}. First we will show that this ring shares an imortant roerty with the ring of integers: every

More information

Factor Rings and their decompositions in the Eisenstein integers Ring Z [ω]

Factor Rings and their decompositions in the Eisenstein integers Ring Z [ω] Armenian Journal of Mathematics Volume 5, Number 1, 013, 58 68 Factor Rings and their decomositions in the Eisenstein integers Ring Z [ω] Manouchehr Misaghian Deartment of Mathematics, Prairie View A&M

More information

CS 6260 Some number theory. Groups

CS 6260 Some number theory. Groups Let Z = {..., 2, 1, 0, 1, 2,...} denote the set of integers. Let Z+ = {1, 2,...} denote the set of ositive integers and = {0, 1, 2,...} the set of non-negative integers. If a, are integers with > 0 then

More information

Math 261 Exam 2. November 7, The use of notes and books is NOT allowed.

Math 261 Exam 2. November 7, The use of notes and books is NOT allowed. Math 261 Eam 2 ovember 7, 2018 The use of notes and books is OT allowed Eercise 1: Polynomials mod 691 (30 ts In this eercise, you may freely use the fact that 691 is rime Consider the olynomials f( 4

More information

On the Multiplicative Order of a n Modulo n

On the Multiplicative Order of a n Modulo n 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 2010), Article 10.2.1 On the Multilicative Order of a n Modulo n Jonathan Chaelo Université Lille Nord de France F-59000 Lille France jonathan.chaelon@lma.univ-littoral.fr

More information

Math 104B: Number Theory II (Winter 2012)

Math 104B: Number Theory II (Winter 2012) Math 104B: Number Theory II (Winter 01) Alina Bucur Contents 1 Review 11 Prime numbers 1 Euclidean algorithm 13 Multilicative functions 14 Linear diohantine equations 3 15 Congruences 3 Primes as sums

More information

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski

More information

MATH 361: NUMBER THEORY EIGHTH LECTURE

MATH 361: NUMBER THEORY EIGHTH LECTURE MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first

More information

2 ALGEBRA II. Contents

2 ALGEBRA II. Contents ALGEBRA II 1 2 ALGEBRA II Contents 1. Results from elementary number theory 3 2. Groups 4 2.1. Denition, Subgroup, Order of an element 4 2.2. Equivalence relation, Lagrange's theorem, Cyclic group 9 2.3.

More information

t s (p). An Introduction

t s (p). An Introduction Notes 6. Quadratic Gauss Sums Definition. Let a, b Z. Then we denote a b if a divides b. Definition. Let a and b be elements of Z. Then c Z s.t. a, b c, where c gcda, b max{x Z x a and x b }. 5, Chater1

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 In this lecture we lay the groundwork needed to rove the Hasse-Minkowski theorem for Q, which states that a quadratic form over

More information

A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract

A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave

More information

Introduction to Group Theory Note 1

Introduction to Group Theory Note 1 Introduction to Grou Theory Note July 7, 009 Contents INTRODUCTION. Examles OF Symmetry Grous in Physics................................. ELEMENT OF GROUP THEORY. De nition of Grou................................................

More information

Chapter 3. Number Theory. Part of G12ALN. Contents

Chapter 3. Number Theory. Part of G12ALN. Contents Chater 3 Number Theory Part of G12ALN Contents 0 Review of basic concets and theorems The contents of this first section well zeroth section, really is mostly reetition of material from last year. Notations:

More information

ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM

ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to

More information

NUMBER 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: 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 oerations defined on them, addition and multilication,

More information

p-adic Measures and Bernoulli Numbers

p-adic Measures and Bernoulli Numbers -Adic Measures and Bernoulli Numbers Adam Bowers Introduction The constants B k in the Taylor series exansion t e t = t k B k k! k=0 are known as the Bernoulli numbers. The first few are,, 6, 0, 30, 0,

More information

MA3H1 TOPICS IN NUMBER THEORY PART III

MA3H1 TOPICS IN NUMBER THEORY PART III MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced

More information

An Overview of Witt Vectors

An Overview of Witt Vectors An Overview of Witt Vectors Daniel Finkel December 7, 2007 Abstract This aer offers a brief overview of the basics of Witt vectors. As an alication, we summarize work of Bartolo and Falcone to rove that

More information

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p,

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p, 13. Quadratic Residues We now turn to the question of when a quadratic equation has a solution modulo m. The general quadratic equation looks like ax + bx + c 0 mod m. Assuming that m is odd or that b

More information

Quadratic Reciprocity

Quadratic Reciprocity Quadratic Recirocity 5-7-011 Quadratic recirocity relates solutions to x = (mod to solutions to x = (mod, where and are distinct odd rimes. The euations are oth solvale or oth unsolvale if either or has

More information

Mobius Functions, Legendre Symbols, and Discriminants

Mobius Functions, Legendre Symbols, and Discriminants Mobius Functions, Legendre Symbols, and Discriminants 1 Introduction Zev Chonoles, Erick Knight, Tim Kunisky Over the integers, there are two key number-theoretic functions that take on values of 1, 1,

More information

Piotr Blass. Jerey Lang

Piotr Blass. Jerey Lang Ulam Quarterly Volume 2, Number 1, 1993 Piotr Blass Deartment of Mathematics Palm Beach Atlantic College West Palm Beach, FL 33402 Joseh Blass Deartment of Mathematics Bowling Green State University Bowling

More information

A review of the foundations of perfectoid spaces

A review of the foundations of perfectoid spaces A review of the foundations of erfectoid saces (Notes for some talks in the Fargues Fontaine curve study grou at Harvard, Oct./Nov. 2017) Matthew Morrow Abstract We give a reasonably detailed overview

More information

MATH 210A, FALL 2017 HW 5 SOLUTIONS WRITTEN BY DAN DORE

MATH 210A, FALL 2017 HW 5 SOLUTIONS WRITTEN BY DAN DORE MATH 20A, FALL 207 HW 5 SOLUTIONS WRITTEN BY DAN DORE (If you find any errors, lease email ddore@stanford.edu) Question. Let R = Z[t]/(t 2 ). Regard Z as an R-module by letting t act by the identity. Comute

More information

MA3H1 Topics in Number Theory. Samir Siksek

MA3H1 Topics in Number Theory. Samir Siksek MA3H1 Toics in Number Theory Samir Siksek Samir Siksek, Mathematics Institute, University of Warwick, Coventry, CV4 7AL, United Kingdom E-mail address: samir.siksek@gmail.com Contents Chater 0. Prologue

More information

GENERALIZED FACTORIZATION

GENERALIZED FACTORIZATION GENERALIZED FACTORIZATION GRANT LARSEN Abstract. Familiarly, in Z, we have unique factorization. We investigate the general ring and what conditions we can imose on it to necessitate analogs of unique

More information

MAS 4203 Number Theory. M. Yotov

MAS 4203 Number Theory. M. Yotov MAS 4203 Number Theory M. Yotov June 15, 2017 These Notes were comiled by the author with the intent to be used by his students as a main text for the course MAS 4203 Number Theory taught at the Deartment

More information

MATH342 Practice Exam

MATH342 Practice Exam MATH342 Practice Exam This exam is intended to be in a similar style to the examination in May/June 2012. It is not imlied that all questions on the real examination will follow the content of the ractice

More information

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 J. E. CREMONA Contents 0. Introduction: What is Number Theory? 2 Basic Notation 3 1. Factorization 4 1.1. Divisibility in Z 4 1.2. Greatest Common

More information

Dirichlet s Theorem on Arithmetic Progressions

Dirichlet s Theorem on Arithmetic Progressions Dirichlet s Theorem on Arithmetic Progressions Thai Pham Massachusetts Institute of Technology May 2, 202 Abstract In this aer, we derive a roof of Dirichlet s theorem on rimes in arithmetic rogressions.

More information

(Workshop on Harmonic Analysis on symmetric spaces I.S.I. Bangalore : 9th July 2004) B.Sury

(Workshop on Harmonic Analysis on symmetric spaces I.S.I. Bangalore : 9th July 2004) B.Sury Is e π 163 odd or even? (Worksho on Harmonic Analysis on symmetric saces I.S.I. Bangalore : 9th July 004) B.Sury e π 163 = 653741640768743.999999999999.... The object of this talk is to exlain this amazing

More information

Representing Integers as the Sum of Two Squares in the Ring Z n

Representing Integers as the Sum of Two Squares in the Ring Z n 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 (2014), Article 14.7.4 Reresenting Integers as the Sum of Two Squares in the Ring Z n Joshua Harrington, Lenny Jones, and Alicia Lamarche Deartment

More information

Heuristics on Tate Shafarevitch Groups of Elliptic Curves Defined over Q

Heuristics on Tate Shafarevitch Groups of Elliptic Curves Defined over Q Heuristics on Tate Shafarevitch Grous of Ellitic Curves Defined over Q Christohe Delaunay CONTENTS. Introduction 2. Dirichlet Series and Averages 3. Heuristics on Tate Shafarevitch Grous References In

More information

A structure theorem for product sets in extra special groups

A structure theorem for product sets in extra special groups A structure theorem for roduct sets in extra secial grous Thang Pham Michael Tait Le Anh Vinh Robert Won arxiv:1704.07849v1 [math.nt] 25 Ar 2017 Abstract HegyváriandHennecartshowedthatifB isasufficientlylargebrickofaheisenberg

More information

Weil s Conjecture on Tamagawa Numbers (Lecture 1)

Weil s Conjecture on Tamagawa Numbers (Lecture 1) Weil s Conjecture on Tamagawa Numbers (Lecture ) January 30, 204 Let R be a commutative ring and let V be an R-module. A quadratic form on V is a ma q : V R satisfying the following conditions: (a) The

More information

SOME SUMS OVER IRREDUCIBLE POLYNOMIALS

SOME SUMS OVER IRREDUCIBLE POLYNOMIALS SOME SUMS OVER IRREDUCIBLE POLYNOMIALS DAVID E SPEYER Abstract We rove a number of conjectures due to Dinesh Thakur concerning sums of the form P hp ) where the sum is over monic irreducible olynomials

More information

HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH

HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH 1. Section 2.1, Problems 5, 8, 28, and 48 Problem. 2.1.5 Write a single congruence that is equivalent to the air of congruences x 1 mod 4 and x 2

More information

NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

More information

Modeling Chebyshev s Bias in the Gaussian Primes as a Random Walk

Modeling Chebyshev s Bias in the Gaussian Primes as a Random Walk Modeling Chebyshev s Bias in the Gaussian Primes as a Random Walk Daniel J. Hutama July 18, 2016 Abstract One asect of Chebyshev s bias is the henomenon that a rime number,, modulo another rime number,,

More information

Foundations of Cryptography

Foundations of Cryptography Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 7 1 of 18 Cosets Definition 2.12 Let G be a

More information

MATH 25 CLASS 21 NOTES, NOV Contents. 2. Subgroups 2 3. Isomorphisms 4

MATH 25 CLASS 21 NOTES, NOV Contents. 2. Subgroups 2 3. Isomorphisms 4 MATH 25 CLASS 21 NOTES, NOV 7 2011 Contents 1. Groups: definition 1 2. Subgroups 2 3. Isomorphisms 4 1. Groups: definition Even though we have been learning number theory without using any other parts

More information

MATH 3240Q Introduction to Number Theory Homework 7

MATH 3240Q Introduction to Number Theory Homework 7 As long as algebra and geometry have been searated, their rogress have been slow and their uses limited; but when these two sciences have been united, they have lent each mutual forces, and have marched

More information

Algebraic number theory LTCC Solutions to Problem Sheet 2

Algebraic number theory LTCC Solutions to Problem Sheet 2 Algebraic number theory LTCC 008 Solutions to Problem Sheet ) Let m be a square-free integer and K = Q m). The embeddings K C are given by σ a + b m) = a + b m and σ a + b m) = a b m. If m mod 4) then

More information

PartII Number Theory

PartII Number Theory PartII Number Theory zc3 This is based on the lecture notes given by Dr.T.A.Fisher, with some other toics in number theory (ossibly not covered in the lecture). Some of the theorems here are non-examinable.

More information

Multiplicative group law on the folium of Descartes

Multiplicative group law on the folium of Descartes Multilicative grou law on the folium of Descartes Steluţa Pricoie and Constantin Udrişte Abstract. The folium of Descartes is still studied and understood today. Not only did it rovide for the roof of

More information

RECIPROCITY, BRAUER GROUPS AND QUADRATIC FORMS OVER NUMBER FIELDS

RECIPROCITY, BRAUER GROUPS AND QUADRATIC FORMS OVER NUMBER FIELDS RECIPROCITY, BRAUER GROUPS AND QUADRATIC FORMS OVER NUMBER FIELDS THOMAS POGUNTKE Abstract. Artin s recirocity law is a vast generalization of quadratic recirocity and contains a lot of information about

More information

New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review

New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review University of Wollongong Research Online Faculty of Informatics - Paers (Archive) Faculty of Engineering and Information Sciences 1999 New weighing matrices and orthogonal designs constructed using two

More information

Elementary Analysis in Q p

Elementary Analysis in Q p Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some

More information

ISOSCELES TRIANGLES IN Q 3. Matt Noble Department of Mathematics, Middle Georgia State University, Macon, Georgia

ISOSCELES TRIANGLES IN Q 3. Matt Noble Department of Mathematics, Middle Georgia State University, Macon, Georgia #A9 INTEGERS 18 (2018) ISOSCELES TRIANGLES IN Q Matt Noble Deartment of Mathematics, Middle Georgia State University, Macon, Georgia matthew.noble@mga.edu Received: 7/2/17, Acceted: 2//18, Published: 2/19/18

More information

ON FREIMAN S 2.4-THEOREM

ON FREIMAN S 2.4-THEOREM ON FREIMAN S 2.4-THEOREM ØYSTEIN J. RØDSETH Abstract. Gregory Freiman s celebrated 2.4-Theorem says that if A is a set of residue classes modulo a rime satisfying 2A 2.4 A 3 and A < /35, then A is contained

More information

2 K. ENTACHER 2 Generalized Haar function systems In the following we x an arbitrary integer base b 2. For the notations and denitions of generalized

2 K. ENTACHER 2 Generalized Haar function systems In the following we x an arbitrary integer base b 2. For the notations and denitions of generalized BIT 38 :2 (998), 283{292. QUASI-MONTE CARLO METHODS FOR NUMERICAL INTEGRATION OF MULTIVARIATE HAAR SERIES II KARL ENTACHER y Deartment of Mathematics, University of Salzburg, Hellbrunnerstr. 34 A-52 Salzburg,

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

Group Theory Problems

Group Theory Problems Grou Theory Problems Ali Nesin 1 October 1999 Throughout the exercises G is a grou. We let Z i = Z i (G) and Z = Z(G). Let H and K be two subgrous of finite index of G. Show that H K has also finite index

More information

Solvability and Number of Roots of Bi-Quadratic Equations over p adic Fields

Solvability and Number of Roots of Bi-Quadratic Equations over p adic Fields Malaysian Journal of Mathematical Sciences 10(S February: 15-35 (016 Secial Issue: The 3 rd International Conference on Mathematical Alications in Engineering 014 (ICMAE 14 MALAYSIAN JOURNAL OF MATHEMATICAL

More information

IDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP

IDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 24, Number 5, May 996 IDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP TIM HSU (Communicated by Ronald M. Solomon) Abstract. We exhibit a simle

More information

Number Theory Naoki Sato

Number Theory Naoki Sato Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material that an IMO

More information

Frobenius Elements, the Chebotarev Density Theorem, and Reciprocity

Frobenius Elements, the Chebotarev Density Theorem, and Reciprocity Frobenius Elements, the Chebotarev Density Theorem, and Recirocity Dylan Yott July 30, 204 Motivation Recall Dirichlet s theorem from elementary number theory. Theorem.. For a, m) =, there are infinitely

More information

Factorability in the ring Z[ 5]

Factorability in the ring Z[ 5] University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Dissertations, Theses, and Student Research Paers in Mathematics Mathematics, Deartment of 4-2004 Factorability in the ring

More information

f(r) = a d n) d + + a0 = 0

f(r) = a d n) d + + a0 = 0 Math 400-00/Foundations of Algebra/Fall 07 Polynomials at the Foundations: Roots Next, we turn to the notion of a root of a olynomial in Q[x]. Definition 8.. r Q is a rational root of fx) Q[x] if fr) 0.

More information

Elementary Number Theory

Elementary Number Theory Elementary Number Theory WISB321 = F.Beukers 2012 Deartment of Mathematics UU ELEMENTARY NUMBER THEORY Frits Beukers Fall semester 2013 Contents 1 Integers and the Euclidean algorithm 4 1.1 Integers................................

More information

Groups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002

Groups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002 Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

MATH 361: NUMBER THEORY ELEVENTH LECTURE

MATH 361: NUMBER THEORY ELEVENTH LECTURE MATH 361: NUMBER THEORY ELEVENTH LECTURE The subjects of this lecture are characters, Gauss sums, Jacobi sums, and counting formulas for olynomial equations over finite fields. 1. Definitions, Basic Proerties

More information

Characteristics of Fibonacci-type Sequences

Characteristics of Fibonacci-type Sequences Characteristics of Fibonacci-tye Sequences Yarden Blausa May 018 Abstract This aer resents an exloration of the Fibonacci sequence, as well as multi-nacci sequences and the Lucas sequence. We comare and

More information

120A LECTURE OUTLINES

120A LECTURE OUTLINES 120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication

More information

arxiv: v1 [math.nt] 9 Sep 2015

arxiv: v1 [math.nt] 9 Sep 2015 REPRESENTATION OF INTEGERS BY TERNARY QUADRATIC FORMS: A GEOMETRIC APPROACH GABRIEL DURHAM arxiv:5090590v [mathnt] 9 Se 05 Abstract In957NCAnkenyrovidedanewroofofthethreesuarestheorem using geometry of

More information

Sets of Real Numbers

Sets of Real Numbers Chater 4 Sets of Real Numbers 4. The Integers Z and their Proerties In our revious discussions about sets and functions the set of integers Z served as a key examle. Its ubiquitousness comes from the fact

More information

RINGS OF INTEGERS WITHOUT A POWER BASIS

RINGS OF INTEGERS WITHOUT A POWER BASIS RINGS OF INTEGERS WITHOUT A POWER BASIS KEITH CONRAD Let K be a number field, with degree n and ring of integers O K. When O K = Z[α] for some α O K, the set {1, α,..., α n 1 } is a Z-basis of O K. We

More information

#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS

#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS #A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt

More information

POINTS ON CONICS MODULO p

POINTS ON CONICS MODULO p POINTS ON CONICS MODULO TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR, AND KATHERINE REDFIELD Abstract. We comute the number of integer oints on conics modulo, where is an odd rime. We extend our results to conics

More information

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2)

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2) Chater 5 Pell s Equation One of the earliest issues graled with in number theory is the fact that geometric quantities are often not rational. For instance, if we take a right triangle with two side lengths

More information

Rings and Fields Theorems

Rings and Fields Theorems Rings and Fields Theorems Rajesh Kumar PMATH 334 Intro to Rings and Fields Fall 2009 October 25, 2009 12 Rings and Fields 12.1 Definition Groups and Abelian Groups Let R be a non-empty set. Let + and (multiplication)

More information

Number Theory. Lectured by V. Neale Michaelmas Term 2011

Number Theory. Lectured by V. Neale Michaelmas Term 2011 Number Theory Lectured by V Neale Michaelmas Term 0 NUMBER THEORY C 4 lectures, Michaelmas term Page Page 5 Page Page 5 Page 9 Page 3 Page 4 Page 50 Page 54 Review from Part IA Numbers and Sets: Euclid

More information

We collect some results that might be covered in a first course in algebraic number theory.

We collect some results that might be covered in a first course in algebraic number theory. 1 Aendices We collect some results that might be covered in a first course in algebraic number theory. A. uadratic Recirocity Via Gauss Sums A1. Introduction In this aendix, is an odd rime unless otherwise

More information

LECTURE NOTES IN CRYPTOGRAPHY

LECTURE NOTES IN CRYPTOGRAPHY 1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic

More information

Introductory Number Theory

Introductory Number Theory Introductory Number Theory Lecture Notes Sudita Mallik May, 208 Contents Introduction. Notation and Terminology.............................2 Prime Numbers.................................. 2 2 Divisibility,

More information

Almost All Palindromes Are Composite

Almost All Palindromes Are Composite Almost All Palindromes Are Comosite William D Banks Det of Mathematics, University of Missouri Columbia, MO 65211, USA bbanks@mathmissouriedu Derrick N Hart Det of Mathematics, University of Missouri Columbia,

More information

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and

CHAPTER 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 information

Diophantine Equations and Congruences

Diophantine Equations and Congruences International Journal of Algebra, Vol. 1, 2007, no. 6, 293-302 Diohantine Equations and Congruences R. A. Mollin Deartment of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada,

More information

Degree in Mathematics

Degree in Mathematics Degree in Mathematics Title: Gauss s roofs of the uadratic recirocity law Author: Anna Febrer Galvany Advisor: Jordi Quer Bosor Deartment: Matemàtica Alicada II Academic year: 01/013 Universitat Politècnica

More information

δ(xy) = φ(x)δ(y) + y p δ(x). (1)

δ(xy) = φ(x)δ(y) + y p δ(x). (1) LECTURE II: δ-rings Fix a rime. In this lecture, we discuss some asects of the theory of δ-rings. This theory rovides a good language to talk about rings with a lift of Frobenius modulo. Some of the material

More information

RATIONAL RECIPROCITY LAWS

RATIONAL RECIPROCITY LAWS RATIONAL RECIPROCITY LAWS MARK BUDDEN 1 10/7/05 The urose of this note is to rovide an overview of Rational Recirocity and in articular, of Scholz s recirocity law for the non-number theorist. In the first

More information

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS #A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,

More information

QUADRATIC RESIDUES AND DIFFERENCE SETS

QUADRATIC RESIDUES AND DIFFERENCE SETS QUADRATIC RESIDUES AND DIFFERENCE SETS VSEVOLOD F. LEV AND JACK SONN Abstract. It has been conjectured by Sárközy that with finitely many excetions, the set of quadratic residues modulo a rime cannot be

More information

Math 751 Lecture Notes Week 3

Math 751 Lecture Notes Week 3 Math 751 Lecture Notes Week 3 Setember 25, 2014 1 Fundamental grou of a circle Theorem 1. Let φ : Z π 1 (S 1 ) be given by n [ω n ], where ω n : I S 1 R 2 is the loo ω n (s) = (cos(2πns), sin(2πns)). Then

More information

On the Rank of the Elliptic Curve y 2 = x(x p)(x 2)

On 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 information

Unit Groups of Semisimple Group Algebras of Abelian p-groups over a Field*

Unit Groups of Semisimple Group Algebras of Abelian p-groups over a Field* JOURNAL OF ALGEBRA 88, 580589 997 ARTICLE NO. JA96686 Unit Grous of Semisimle Grou Algebras of Abelian -Grous over a Field* Nako A. Nachev and Todor Zh. Mollov Deartment of Algebra, Plodi Uniersity, 4000

More information

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a. Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms

More information

A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN

A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod ) ZHI-HONG SUN Deartment of Mathematics, Huaiyin Teachers College, Huaian 223001, Jiangsu, P. R. China e-mail: hyzhsun@ublic.hy.js.cn

More information