Kronecker-Jacobi symbol and Quadratic Reciprocity. Q b /Q p

Size: px
Start display at page:

Download "Kronecker-Jacobi symbol and Quadratic Reciprocity. Q b /Q p"

Transcription

1 Kronecker-Jcoi symol nd Qudrtic Recirocity Let Q e the field of rtionl numers, nd let Q, 0. For ositive rime integer, the Artin symol Q /Q hs the vlue 1 if Q is the slitting field of in Q, 0 if is rmified in Q, nd 1 otherwise i.e., if Q Q nd is inertil. Here we hve identified the Glois grou Aut Q with sugrou of the multilictive grou {±1}. For ritrry ositive rtionl m i1 n i i, we set Q /Q : m i1 ni Q /Q : 1 if m 0, i.e., 1. i This gives rise to homomorhism recirocity m from the multilictive grou of non zero rtionl numers > 0 reltively rime to the discriminnt d of Q /Q, into the Glois grou of Q /Q. Exercise. If div is the norm of divisor of Q, nd,d 1, then lies in the kernel of the recirocity m. For ny 0 x Q, the sign of x is sgnx: x/ x 1 εx where εx: sgnx 1/. The numer x cn e written uniquely in the form x x y, where x 1 εx 1... m with m 0 distinct rimes i. For nonzero rtionl,, define the Kronecker symol Q /Q : 1 εε 1

2 i ii iii iv One checks tht: 1 1; 1 ε sgn. 1 1 { d if 1 mod 4. Recll: d d 4 otherwise 0 iff nd d re reltively rime. s long s the right hnd memer does not vnish. 1 1 Well known fcts out ehvior of rimes in qudrtic numer fields give, further: v If is n odd rime nd is n integer then is just the usul Legendre symol. vi If does not divide d i.e., d 1 mod 4, then ±1 ccording s is or is not squre mod d 8. Now iv, v, vi llow us to define solely in terms of Legendre symols, to wit: 1 εε rime d This is how it ws done originlly. From this definition, one gets t once: 1 1 vii s long s the right hnd memer does not vnish. viii If > 0 nd 1, re integers with 1 mod d, then 1 If is n odd ositive integer, it is even sufficient tht 1 mod

3 The hert of the recirocity lw lies in the following fct. Theorem. The ming induces homomorhism χ from the multilictive grou Z/dZ of units in Z/dZ onto the Glois grou Aut Q. This χ, clled the qudrtic chrcter of Q /Q when Q Q i.e., 1, is the unique homomorhism tking ny odd rime not dividing to the Legendre symol. In other words: if 1 mod d then 1. Moreover, if Q Q then there exists with 1. Proof. Uniqueness is shown y relcing y [n] : + nd where n is such tht [n] is ositive nd odd, nd then fctoring [n] into rimes. Such n n clerly exists if is odd or if is even nd reltively rime to d so tht d is odd. It is n exercise to show tht the unique qudrtic numer field with discriminnt d nmely Q d is sufield of the cyclotomic field Qζ d, where ζ d is rimitive d -th root of unity. [Strt with the fcts tht Q ± Qζ 8 nd tht for n odd rime, Q Qζ.] For ny rime, is the imge of under the Artin m into Q, hence the restriction of the imge of under the Artin m into Qζ d d : d, i.e., the utomorhism tking ζ d to ζ d. Here, in view of iv, we cn relce y ny ositive integer ; nd furthermore, to do the sme for negtive, it will suffice to do it for 1, i.e., to show tht the utomorhism θ tking ζ d to ζ 1 d tkes to 1 sgn. But this follows t once from the fct tht the fixed field of θ is Q ζ d R whenever d > 1. Surjectivity of χ results from its fctoriztion s Z/dZ Aut Qζ d Aut Q. Corollry 1. For ny odd integer, 1 sgn ±1 ccording s is or is not squre mod d 1 4. Q.E.D. Proof. Since d 1 4, the Theorem with 1 reduces the rolem to the two simle cses 1, 3. 3

4 Corollry. For ny odd integer, ±1 ccording s is or is not squre mod d 8. Proof. Since d 8, the Theorem with reduces the rolem to the simle cses 1,3,5,7. Corollry 3. If q is n odd rime, q 1 q 1 q, nd 0 is n integer, then q q q Proof. Note tht dq q. So for vrile with,q 1, nd re q oth homomorhisms of the cyclic grou of units in Z/qZ onto grou of order. But there is only one such homomorhism, hence the ssertion holds in this cse. Corollry 4. Let e ny odd integer, set : 1 1 so tht d, nd let 0 e n integer. Then Proof. We my ssume tht is squre free, nd, 1; nd then use 1 1 nd to reduce, vi iv nd vii, to Corollry 3. Comining these corollries we otin the recirocity lw for the Kronecker symol: If,d,d 1, then, with m 0, n 0, 0 nd 0 odd, it holds tht εε Proof. We cn relce y nd y see ii, i.e., we my ssume tht nd re squrefree integers. Then t lest one of, must e odd; we my ssume odd. Now if 1 mod 4 then 0 1 is even, 0, nd y Corollry 4, whence the ssertion in this cse. 1 εε, 4

5 If 3 mod 4 then 0, 0 since 1,d,4, nd y vii, vi nd Corollry 4, εε, whence the ssertion in this cse too. Q.E.D. Remrk. The kernel of χ consists of ll residue clsses in Z/dZ of norms of idels in the ring of integers of Q which re reltively rime to d. Sufficiency follows from the exercise on ge 1. When is rime, nd χ : 1 then slits in Q, so is norm. Then use Dirichlet s theorem on rimes in rithmetic rogressions to see tht for ny integer with,d 1, there exists rime such tht mod d. Exmle is rime numer. Is 819 qudrtic residue or non residue? 819/ / /819 /819679/ / / / /103 61/ /61 4/61 /611/61 61/1 19/1 1/19 /19 1 nonresidue. Exercises. 1. Check tht 5 6 1, nd tht 5 is not squre mod 6.. Show tht 50009/ is rime. 3. Try to show, without using the Theorem, tht for integers, with 0 < < d, d Remrks. 1. The key to the ove roch to recirocity ws the fct tht ny qudrtic extension of Q is contined in cyclotomic field. An imortnt theorem Kronecker Weer sttes tht ny elin extension of Q is contined in cyclotomic field. It follows, s in the ove roof, tht if K/Q is n elin extension, with, sy K Q n 1 then the slitting field of rime which does not rmify in K deends only on the residue clss of in Z/nZ. Similr simle decomosition lws hold for elin extensions of ritrry numer fields; this is sic fct of clss field theory.. In more sohisticted tretments of recirocity, sign comlictions re delt with more elegntly in terms of ehvior t the infinite rime. 5

6 6

Quadratic reciprocity

Quadratic reciprocity Qudrtic recirocity Frncisc Bozgn Los Angeles Mth Circle Octoer 8, 01 1 Qudrtic Recirocity nd Legendre Symol In the eginning of this lecture, we recll some sic knowledge out modulr rithmetic: Definition

More information

QUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN

QUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN QUADRATIC RESIDUES MATH 37 FALL 005 INSTRUCTOR: PROFESSOR AITKEN When is n integer sure modulo? When does udrtic eution hve roots modulo? These re the uestions tht will concern us in this hndout 1 The

More information

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ

More information

Supplement 4 Permutations, Legendre symbol and quadratic reciprocity

Supplement 4 Permutations, Legendre symbol and quadratic reciprocity Sulement 4 Permuttions, Legendre symbol nd qudrtic recirocity 1. Permuttions. If S is nite set contining n elements then ermuttion of S is one to one ming of S onto S. Usully S is the set f1; ; :::; ng

More information

Quadratic Residues. Chapter Quadratic residues

Quadratic Residues. Chapter Quadratic residues Chter 8 Qudrtic Residues 8. Qudrtic residues Let n>be given ositive integer, nd gcd, n. We sy tht Z n is qudrtic residue mod n if the congruence x mod n is solvble. Otherwise, is clled qudrtic nonresidue

More information

Duke Math Meet

Duke Math Meet Duke Mth Meet 01-14 Power Round Qudrtic Residues nd Prime Numers For integers nd, we write to indicte tht evenly divides, nd to indicte tht does not divide For exmle, 4 nd 4 Let e rime numer An integer

More information

LECTURE 10: JACOBI SYMBOL

LECTURE 10: JACOBI SYMBOL LECTURE 0: JACOBI SYMBOL The Jcobi symbol We wish to generlise the Legendre symbol to ccomodte comosite moduli Definition Let be n odd ositive integer, nd suose tht s, where the i re rime numbers not necessrily

More information

PRIMES AND QUADRATIC RECIPROCITY

PRIMES AND QUADRATIC RECIPROCITY PRIMES AND QUADRATIC RECIPROCITY ANGELICA WONG Abstrct We discuss number theory with the ultimte gol of understnding udrtic recirocity We begin by discussing Fermt s Little Theorem, the Chinese Reminder

More information

MATH 573 FINAL EXAM. May 30, 2007

MATH 573 FINAL EXAM. May 30, 2007 MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.

More information

(9) P (x)u + Q(x)u + R(x)u =0

(9) P (x)u + Q(x)u + R(x)u =0 STURM-LIOUVILLE THEORY 7 2. Second order liner ordinry differentil equtions 2.1. Recll some sic results. A second order liner ordinry differentil eqution (ODE) hs the form (9) P (x)u + Q(x)u + R(x)u =0

More information

MATH1050 Cauchy-Schwarz Inequality and Triangle Inequality

MATH1050 Cauchy-Schwarz Inequality and Triangle Inequality MATH050 Cuchy-Schwrz Inequlity nd Tringle Inequlity 0 Refer to the Hndout Qudrtic polynomils Definition (Asolute extrem for rel-vlued functions of one rel vrile) Let I e n intervl, nd h : D R e rel-vlued

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, Lecture 15: Equations for Deterministic Automata Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

More information

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar) Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of

More information

Some Results on Cubic Residues

Some Results on Cubic Residues Interntionl Journl of Algebr, Vol. 9, 015, no. 5, 45-49 HIKARI Ltd, www.m-hikri.com htt://dx.doi.org/10.1988/ij.015.555 Some Results on Cubic Residues Dilek Nmlı Blıkesir Üniversiresi Fen-Edebiyt Fkültesi

More information

Chapter 6 Techniques of Integration

Chapter 6 Techniques of Integration MA Techniques of Integrtion Asst.Prof.Dr.Suprnee Liswdi Chpter 6 Techniques of Integrtion Recll: Some importnt integrls tht we hve lernt so fr. Tle of Integrls n+ n d = + C n + e d = e + C ( n ) d = ln

More information

Quadratic Forms. Quadratic Forms

Quadratic Forms. Quadratic Forms Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

(II.G) PRIME POWER MODULI AND POWER RESIDUES

(II.G) PRIME POWER MODULI AND POWER RESIDUES II.G PRIME POWER MODULI AND POWER RESIDUES I II.C, we used the Chiese Remider Theorem to reduce cogrueces modulo m r i i to cogrueces modulo r i i. For exmles d roblems, we stuck with r i 1 becuse we hd

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

13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS

13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS 33 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS As simple ppliction of the results we hve obtined on lgebric extensions, nd in prticulr on the multiplictivity of extension degrees, we cn nswer (in

More information

LECTURE 2: ARTIN SYMBOL, ARTIN MAP, ARTIN RECIPROCITY LAW AND FINITENESS OF GENERALIZED IDEAL CLASS GROUP

LECTURE 2: ARTIN SYMBOL, ARTIN MAP, ARTIN RECIPROCITY LAW AND FINITENESS OF GENERALIZED IDEAL CLASS GROUP Clss Field Theory Study Seminr Jnury 25 2017 LECTURE 2: ARTIN SYMBOL, ARTIN MAP, ARTIN RECIPROCITY LAW AND FINITENESS OF GENERALIZED IDEAL CLASS GROUP YIFAN WU Plese send typos nd comments to wuyifn@umich.edu

More information

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b

More information

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

More information

#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z

#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z #A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z Kurt Girstmir Institut für Mthemtik, Universität Innsruck, Innsruck, Austri kurt.girstmir@uik.c.t Received: 10/4/16, Accepted: 7/3/17, Pulished:

More information

arxiv: v6 [math.nt] 20 Jan 2016

arxiv: v6 [math.nt] 20 Jan 2016 EXPONENTIALLY S-NUMBERS rxiv:50.0594v6 [mth.nt] 20 Jn 206 VLADIMIR SHEVELEV Abstrct. Let S be the set of ll finite or infinite incresing sequences of ositive integers. For sequence S = {sn)},n, from S,

More information

Homework Solution - Set 5 Due: Friday 10/03/08

Homework Solution - Set 5 Due: Friday 10/03/08 CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution - et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte non-finl.

More information

Mrgolius 2 In the rticulr cse of Ploue's constnt, we tke = 2= 5+i= 5, nd = ;1, then ; C = tn;1 1 2 = ln(2= 5+i= 5) ln(;1) More generlly, we would hve

Mrgolius 2 In the rticulr cse of Ploue's constnt, we tke = 2= 5+i= 5, nd = ;1, then ; C = tn;1 1 2 = ln(2= 5+i= 5) ln(;1) More generlly, we would hve Ploue's Constnt is Trnscendentl Brr H. Mrgolius Clevelnd Stte University Clevelnd, Ohio 44115.mrgolius@csuohio.edu Astrct Ploue's constnt tn;1 ( 1 2) is trnscendentl. We rove this nd more generl result

More information

k and v = v 1 j + u 3 i + v 2

k and v = v 1 j + u 3 i + v 2 ORTHOGONAL FUNCTIONS AND FOURIER SERIES Orthogonl functions A function cn e considered to e generliztion of vector. Thus the vector concets like the inner roduct nd orthogonlity of vectors cn e extended

More information

Lecture 3: Equivalence Relations

Lecture 3: Equivalence Relations Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts

More information

Multiplicative functions of polynomial values in short intervals

Multiplicative functions of polynomial values in short intervals ACTA ARITHMETICA LXII3 1992 Multilictive functions of olnomil vlues in short intervls b Mohn Nir Glsgow 1 Introduction Let dn denote the divisor function nd let P n be n irreducible olnomil of degree g

More information

USA Mathematical Talent Search Round 1 Solutions Year 25 Academic Year

USA Mathematical Talent Search Round 1 Solutions Year 25 Academic Year 1/1/5. Alex is trying to oen lock whose code is sequence tht is three letters long, with ech of the letters being one of A, B or C, ossibly reeted. The lock hs three buttons, lbeled A, B nd C. When the

More information

set is not closed under matrix [ multiplication, ] and does not form a group.

set is not closed under matrix [ multiplication, ] and does not form a group. Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

2.4 Linear Inequalities and Interval Notation

2.4 Linear Inequalities and Interval Notation .4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or

More information

Theoretical foundations of Gaussian quadrature

Theoretical foundations of Gaussian quadrature Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of

More information

Symbolic enumeration methods for unlabelled structures

Symbolic enumeration methods for unlabelled structures Go & Šjn, Comintoril Enumertion Notes 4 Symolic enumertion methods for unlelled structures Definition A comintoril clss is finite or denumerle set on which size function is defined, stisfying the following

More information

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.

More information

DEFINITION The inner product of two functions f 1 and f 2 on an interval [a, b] is the number. ( f 1, f 2 ) b DEFINITION 11.1.

DEFINITION The inner product of two functions f 1 and f 2 on an interval [a, b] is the number. ( f 1, f 2 ) b DEFINITION 11.1. 398 CHAPTER 11 ORTHOGONAL FUNCTIONS AND FOURIER SERIES 11.1 ORTHOGONAL FUNCTIONS REVIEW MATERIAL The notions of generlized vectors nd vector spces cn e found in ny liner lger text. INTRODUCTION The concepts

More information

ad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4)

ad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4) 10 Most proofs re left s reding exercises. Definition 10.1. Z = Z {0}. Definition 10.2. Let be the binry reltion defined on Z Z by, b c, d iff d = cb. Theorem 10.3. is n equivlence reltion on Z Z. Proof.

More information

Bridging the gap: GCSE AS Level

Bridging the gap: GCSE AS Level Bridging the gp: GCSE AS Level CONTENTS Chpter Removing rckets pge Chpter Liner equtions Chpter Simultneous equtions 8 Chpter Fctors 0 Chpter Chnge the suject of the formul Chpter 6 Solving qudrtic equtions

More information

Integral points on the rational curve

Integral points on the rational curve Integrl points on the rtionl curve y x bx c x ;, b, c integers. Konstntine Zeltor Mthemtics University of Wisconsin - Mrinette 750 W. Byshore Street Mrinette, WI 5443-453 Also: Konstntine Zeltor P.O. Box

More information

Beginning Darboux Integration, Math 317, Intro to Analysis II

Beginning Darboux Integration, Math 317, Intro to Analysis II Beginning Droux Integrtion, Mth 317, Intro to Anlysis II Lets strt y rememering how to integrte function over n intervl. (you lerned this in Clculus I, ut mye it didn t stick.) This set of lecture notes

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

7. Indefinite Integrals

7. Indefinite Integrals 7. Indefinite Integrls These lecture notes present my interprettion of Ruth Lwrence s lecture notes (in Herew) 7. Prolem sttement By the fundmentl theorem of clculus, to clculte n integrl we need to find

More information

Polynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230

Polynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230 Polynomil Approimtions for the Nturl Logrithm nd Arctngent Functions Mth 23 You recll from first semester clculus how one cn use the derivtive to find n eqution for the tngent line to function t given

More information

The Evaluation Theorem

The Evaluation Theorem These notes closely follow the presenttion of the mteril given in Jmes Stewrt s textook Clculus, Concepts nd Contexts (2nd edition) These notes re intended primrily for in-clss presenttion nd should not

More information

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations. Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one

More information

UniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that

UniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that Problemen/UWC NAW 5/7 nr juni 006 47 Problemen/UWC UniversitireWiskundeCompetitie Edition 005/4 For Session 005/4 we received submissions from Peter Vndendriessche, Vldislv Frnk, Arne Smeets, Jn vn de

More information

Best Approximation in the 2-norm

Best Approximation in the 2-norm Jim Lmbers MAT 77 Fll Semester 1-11 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the -norm Suppose tht we wish to obtin function f n (x) tht is liner combintion

More information

arxiv: v9 [math.nt] 8 Jun 2010

arxiv: v9 [math.nt] 8 Jun 2010 Int. J. Number Theory, in ress. ON SOME NEW CONGRUENCES FOR BINOMIAL COEFFICIENTS rxiv:0709.665v9 [mth.nt] 8 Jun 200 Zhi-Wei Sun Roberto Turso 2 Dertment of Mthemtics, Nning University Nning 2009, Peole

More information

IN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH

IN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A2 IN GAUSSIAN INTEGERS X + Y = Z HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH Elis Lmpkis Lmpropoulou (Term), Kiprissi, T.K: 24500,

More information

1 Structural induction

1 Structural induction Discrete Structures Prelim 2 smple questions Solutions CS2800 Questions selected for Spring 2018 1 Structurl induction 1. We define set S of functions from Z to Z inductively s follows: Rule 1. For ny

More information

Let's start with an example:

Let's start with an example: Finite Automt Let's strt with n exmple: Here you see leled circles tht re sttes, nd leled rrows tht re trnsitions. One of the sttes is mrked "strt". One of the sttes hs doule circle; this is terminl stte

More information

Convert the NFA into DFA

Convert the NFA into DFA Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:

More information

Class Field Theory. Peter Stevenhagen. 1. Class Field Theory for Q

Class Field Theory. Peter Stevenhagen. 1. Class Field Theory for Q Class Field Theory Peter Stevenhagen Class field theory is the study of extensions Q K L K ab K = Q, where L/K is a finite abelian extension with Galois grou G. 1. Class Field Theory for Q First we discuss

More information

approaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below

approaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below . Eponentil nd rithmic functions.1 Eponentil Functions A function of the form f() =, > 0, 1 is clled n eponentil function. Its domin is the set of ll rel f ( 1) numbers. For n eponentil function f we hve.

More information

Some Theory of Computation Exercises Week 1

Some Theory of Computation Exercises Week 1 Some Theory of Computtion Exercises Week 1 Section 1 Deterministic Finite Automt Question 1.3 d d d d u q 1 q 2 q 3 q 4 q 5 d u u u u Question 1.4 Prt c - {w w hs even s nd one or two s} First we sk whether

More information

Homework 3 Solutions

Homework 3 Solutions CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.

More information

McGill University Math 354: Honors Analysis 3 Fall 2012 Solutions to selected Exercises. g(x) 2 dx 1 2 a

McGill University Math 354: Honors Analysis 3 Fall 2012 Solutions to selected Exercises. g(x) 2 dx 1 2 a McGill University Mth 354: Honors Anlysis 3 Fll 2012 Assignment 1 Solutions to selected Exercises Exercise 1. (i) Verify the identity for ny two sets of comlex numers { 1,..., n } nd { 1,..., n } ( n )

More information

QUADRATIC EQUATIONS OBJECTIVE PROBLEMS

QUADRATIC EQUATIONS OBJECTIVE PROBLEMS QUADRATIC EQUATIONS OBJECTIVE PROBLEMS +. The solution of the eqution will e (), () 0,, 5, 5. The roots of the given eqution ( p q) ( q r) ( r p) 0 + + re p q r p (), r p p q, q r p q (), (d), q r p q.

More information

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

MTH 505: Number Theory Spring 2017

MTH 505: Number Theory Spring 2017 MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

Review of Riemann Integral

Review of Riemann Integral 1 Review of Riemnn Integrl In this chpter we review the definition of Riemnn integrl of bounded function f : [, b] R, nd point out its limittions so s to be convinced of the necessity of more generl integrl.

More information

AQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system

AQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex

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

CS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions

CS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4

More information

QUADRATURE is an old-fashioned word that refers to

QUADRATURE is an old-fashioned word that refers to World Acdemy of Science Engineering nd Technology Interntionl Journl of Mthemticl nd Computtionl Sciences Vol:5 No:7 011 A New Qudrture Rule Derived from Spline Interpoltion with Error Anlysis Hdi Tghvfrd

More information

Well Centered Spherical Quadrangles

Well Centered Spherical Quadrangles Beiträge zur Algebr und Geometrie Contributions to Algebr nd Geometry Volume 44 (003), No, 539-549 Well Centered Sphericl Qudrngles An M d Azevedo Bred 1 Altino F Sntos Deprtment of Mthemtics, University

More information

than 1. It means in particular that the function is decreasing and approaching the x-

than 1. It means in particular that the function is decreasing and approaching the x- 6 Preclculus Review Grph the functions ) (/) ) log y = b y = Solution () The function y = is n eponentil function with bse smller thn It mens in prticulr tht the function is decresing nd pproching the

More information

Lecture 08: Feb. 08, 2019

Lecture 08: Feb. 08, 2019 4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny

More information

a n+2 a n+1 M n a 2 a 1. (2)

a n+2 a n+1 M n a 2 a 1. (2) Rel Anlysis Fll 004 Tke Home Finl Key 1. Suppose tht f is uniformly continuous on set S R nd {x n } is Cuchy sequence in S. Prove tht {f(x n )} is Cuchy sequence. (f is not ssumed to be continuous outside

More information

Name of the Student:

Name of the Student: SUBJECT NAME : Discrete Mthemtics SUBJECT CODE : MA 2265 MATERIAL NAME : Formul Mteril MATERIAL CODE : JM08ADM009 Nme of the Student: Brnch: Unit I (Logic nd Proofs) 1) Truth Tble: Conjunction Disjunction

More information

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows: Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl

More information

Improper Integrals. Introduction. Type 1: Improper Integrals on Infinite Intervals. When we defined the definite integral.

Improper Integrals. Introduction. Type 1: Improper Integrals on Infinite Intervals. When we defined the definite integral. Improper Integrls Introduction When we defined the definite integrl f d we ssumed tht f ws continuous on [, ] where [, ] ws finite, closed intervl There re t lest two wys this definition cn fil to e stisfied:

More information

0.1 THE REAL NUMBER LINE AND ORDER

0.1 THE REAL NUMBER LINE AND ORDER 6000_000.qd //0 :6 AM Pge 0-0- CHAPTER 0 A Preclculus Review 0. THE REAL NUMBER LINE AND ORDER Represent, clssify, nd order rel numers. Use inequlities to represent sets of rel numers. Solve inequlities.

More information

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true. York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech

More information

Optimization Lecture 1 Review of Differential Calculus for Functions of Single Variable.

Optimization Lecture 1 Review of Differential Calculus for Functions of Single Variable. Optimiztion Lecture 1 Review of Differentil Clculus for Functions of Single Vrible http://users.encs.concordi.c/~luisrod, Jnury 14 Outline Optimiztion Problems Rel Numbers nd Rel Vectors Open, Closed nd

More information

Regular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15

Regular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15 Regulr Lnguge Nonregulr Lnguges The Pumping Lemm Models of Comput=on Chpter 10 Recll, tht ny lnguge tht cn e descried y regulr expression is clled regulr lnguge In this lecture we will prove tht not ll

More information

20 MATHEMATICS POLYNOMIALS

20 MATHEMATICS POLYNOMIALS 0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of

More information

Absolute values of real numbers. Rational Numbers vs Real Numbers. 1. Definition. Absolute value α of a real

Absolute values of real numbers. Rational Numbers vs Real Numbers. 1. Definition. Absolute value α of a real Rtionl Numbers vs Rel Numbers 1. Wht is? Answer. is rel number such tht ( ) =. R [ ( ) = ].. Prove tht (i) 1; (ii). Proof. (i) For ny rel numbers x, y, we hve x = y. This is necessry condition, but not

More information

CISC 4090 Theory of Computation

CISC 4090 Theory of Computation 9/6/28 Stereotypicl computer CISC 49 Theory of Computtion Finite stte mchines & Regulr lnguges Professor Dniel Leeds dleeds@fordhm.edu JMH 332 Centrl processing unit (CPU) performs ll the instructions

More information

M A T H F A L L CORRECTION. Algebra I 2 1 / 0 9 / U N I V E R S I T Y O F T O R O N T O

M A T H F A L L CORRECTION. Algebra I 2 1 / 0 9 / U N I V E R S I T Y O F T O R O N T O M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #1 CORRECTION Alger I 2 1 / 0 9 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O 1. Suppose nd re nonzero elements of field F. Using only the field xioms,

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

Definite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +

Definite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 + Definite Integrls --5 The re under curve cn e pproximted y dding up the res of rectngles. Exmple. Approximte the re under y = from x = to x = using equl suintervls nd + x evluting the function t the left-hnd

More information

Torsion in Groups of Integral Triangles

Torsion in Groups of Integral Triangles Advnces in Pure Mthemtics, 01,, 116-10 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,

More information

Chapter 3. Vector Spaces

Chapter 3. Vector Spaces 3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce

More information

Primitive. that ak=1 with K < 4cm ). mod 7. working. then, smaller than 6 will do. m ) =/ odm ) is called. modulo m ( 4) =3. ordz.

Primitive. that ak=1 with K < 4cm ). mod 7. working. then, smaller than 6 will do. m ) =/ odm ) is called. modulo m ( 4) =3. ordz. R Section 0 Primitive Roots lerned th if ( im cm \ @ odm Hover its ossible th k with K < cm For exmle working 7 so if ( 7 L mod 7 know th I ( mod 7 But often n exonent smller thn will do mod 7 : l s 5

More information

ON ALTERNATING POWER SUMS OF ARITHMETIC PROGRESSIONS

ON ALTERNATING POWER SUMS OF ARITHMETIC PROGRESSIONS ON ALTERNATING POWER SUMS OF ARITHMETIC PROGRESSIONS A. BAZSÓ Astrct. Depending on the prity of the positive integer n the lternting power sum T k n = k + k + + k...+ 1 n 1 n 1 + k. cn e extended to polynomil

More information

Boolean Algebra. Boolean Algebra

Boolean Algebra. Boolean Algebra Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with: - two inry opertions, commonly denoted y + nd, - unry opertion, usully denoted y ˉ or ~ or, - two elements usully clled zero nd

More information

Chapter 1: Logarithmic functions and indices

Chapter 1: Logarithmic functions and indices Chpter : Logrithmic functions nd indices. You cn simplify epressions y using rules of indices m n m n m n m n ( m ) n mn m m m m n m m n Emple Simplify these epressions: 5 r r c 4 4 d 6 5 e ( ) f ( ) 4

More information

MATH 118 HW 7 KELLY DOUGAN, ANDREW KOMAR, MARIA SIMBIRSKY, BRANDEN LASKE

MATH 118 HW 7 KELLY DOUGAN, ANDREW KOMAR, MARIA SIMBIRSKY, BRANDEN LASKE MATH 118 HW 7 KELLY DOUGAN, ANDREW KOMAR, MARIA SIMBIRSKY, BRANDEN LASKE Prt 1. Let be odd rime d let Z such tht gcd(, 1. Show tht if is qudrtic residue mod, the is qudrtic residue mod for y ositive iteger.

More information

USA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year

USA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year 1/1/21. Fill in the circles in the picture t right with the digits 1-8, one digit in ech circle with no digit repeted, so tht no two circles tht re connected by line segment contin consecutive digits.

More information

Nondeterminism and Nodeterministic Automata

Nondeterminism and Nodeterministic Automata Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely

More information

18 Dirichlet L-functions, primes in arithmetic progressions

18 Dirichlet L-functions, primes in arithmetic progressions 18.785 Number theory I Fll 2017 Lecture #18 11/8/2017 18 Dirichlet L-functions, rimes in rithmetic rogressions Hving roved the rime number theorem, we would like to rove n nlogous result for rimes in rithmetic

More information

plays an important role in many fields of mathematics. This sequence has nice number-theoretic properties; for example, E.

plays an important role in many fields of mathematics. This sequence has nice number-theoretic properties; for example, E. Tiwnese J. Mth. 17013, no., 13-143. FIBONACCI NUMBERS MODULO CUBES OF PRIMES Zhi-Wei Sun Dertment of Mthemtics, Nnjing University Nnjing 10093, Peole s Reublic of Chin zwsun@nju.edu.cn htt://mth.nju.edu.cn/

More information

8 Laplace s Method and Local Limit Theorems

8 Laplace s Method and Local Limit Theorems 8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

More information

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014 CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA

More information

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1. Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show

More information