# MATH 573 FINAL EXAM. May 30, 2007

Size: px
Start display at page:

## Transcription

1 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. 3. Your proofs should e net nd legile. You my nd should use the ck of pges for scrp work. 4. You re welcome to use ny non-humn sources you choose. (Note, tlking to someone on the phone, over the internet, etc. flls under getting humn help. Be sure to cite your sources s uncknowledged sources constitute plgrism nd will receive 0 points. PROBLEM POINTS SCORE TOTAL 100

2 1.(6+5 points We proved in clss tht given integers 1,, m 1, m with gcd(m 1, m 1, then there is unique simultneous solution x modulo m 1 m to the system of equtions x 1 (mod m 1 x (mod m. ( If gcd(m 1, m d, prove tht there is simultneous solution x to the system of equtions x 1 (mod m 1 x (mod m if nd only if 1 (mod d. Show tht this solution x is unique modulo m 1 m /d. Proof: We know tht x 1 + m 1 t is solution to x 1 (mod m 1 for ny t Z. We now wnt to determine when we cn choose t Z so tht x 1 + m 1 t is lso solution to the congruence x (mod m. We hve tht x is solution to this second congruence if nd only if 1 + m 1 t (mod m, which is equivlent to m 1 t 1 (mod m. This is now liner congruence nd we know this hs solution if nd only if gcd(m 1, m ( 1, s desired. Suppose now tht x nd y re oth solutions to the system of congruences. Then x y(mod m 1 nd x y(mod m. Thus, we must hve the lest common multiple of m 1 nd m divides x y, i.e., m 1 m /d divides x y. This is precisely wht it mens for the solution to e unique modulo m 1 m /d. ( Find the smllest positive simultneous solution to the system of equtions: x 17(mod 65 x 4(mod 0. From prt ( we see tht we need to find solution to 65t 4 17(mod 0, i.e., solution to 5t 5(mod 0. This is ovious though with t 1. Thus, our simultneous solution is x

3 3. (10 points Let D e positive integer nd suppose there exists prime p dividing D so tht p 3(mod 4. Prove tht x Dy 1 hs no integer solutions. Proof: Suppose x 0, y 0 is n integer solution to the eqution, i.e., x 0, y 0 Z nd Looking t this eqution modulo p we otin x 0 dy 0 1. x 0 1(mod p. This implies tht 1 is qudrtic residue modulo p. Since p 3(mod 4 this cnnot e the cse. Thus, there re no integer solutions to this eqution. 3. (6+6 points ( Evlute the continued frction [ : 1, ]. Set x [1, ]. Then we hve x [1,, 1, ]. From this we hve This leds to the qudrtic eqution x x 1 + x x + 1 3x + 1 x + 1. x x 1 0. We cn use the qudrtic eqution to solve for x, noting tht x > 0 to discrd one of the solutions: So we hve x [ : 1, ] + 1 x

4 4 ( Express 71 s finite simple continued frction. Do this y hnd! We use the Eucliden lgorithm to ccomplish this: 71 ( ( ( + 7 ( ( + 0. We now convert these equtions into the form we need: Comining these equtions we otin the following continued frction: Thus, the continued frction expnsion of is [1; 3,, 3, ]..

5 5 4. (10 points Is 137 congruent numer? Be sure to justify your nswer. If it is congruent numer, find tringle with rtionl sides nd re 137. Using SAGE one finds the rtionl point ( , This is clerly not in the set E137 (Q tors, so 137 is congruent numer. Previous homework llows one to turn this rtionl point into the tringle with side lengths: , , , which one cn esily check hs re (10 points Prove tht 3 is primitive root of ll integers of the form 7 k nd 7 k for k 1. Proof: For this one needs to go ck to how we proved primitive roots existed for prime powers. In fct, with the proper set-up one could just quote these results. It is elementry to check tht 3 is primitive root modulo 7. We cn lso check tht 3 6 1(mod 49. Thus, 3 stisfies the hypotheses of Lemm on pge 160 of the textook (we lso covered this in clss, ut we didn t numer it there. Thus, we hve 3 7k 6 1(mod 7 k for ll k. Now the proof of Theorem 8.9 of the text shows tht 3 is primitive root for 7 k with k 1 nd the Corollry to Theorem 8.9 shows 3 is primitive root of 7 k for ll k (10 points Find 6 different positive vlues of n so tht n+1 nd n +1 re oth perfect squres. Are there infinitely mny different vlues for n so tht n + 1 nd n + 1 re oth perfect squres? Prove your nswer is true. (You my use ny theorems proven in clss to prove your result. Proof: Suppose n + 1 nd n + 1 re oth perfect squres, i.e., there exists x, y Z so tht n + 1 x nd n + 1 y, i.e., n + y. Sutrcting these two equtions gives tht n + 1 nd n + 1 re perfect squres if nd only if there is n integer solution to the eqution x y 1. We know from clss tht if we let p k q k e the convergents of the continued frction expnsion of, then p k q k ( 1k+1 k+1 where k+1 is defined s in clss. We sw tht this eqution hs solutions if nd only if the period of the continued frction expnsion of is odd, which in this cse it is with period n 1. We found the solutions to e given y p n(t+1 1, q n(t+1 1 with t 1, which in our cse re given y p t, q t. This shows in fct tht we hve infinitely mny x, y Z stisfying this eqution nd thus infinitely mny such n. We now just need to find 6 of them. The first 6 solutions of the eqution re: (x, y (7, 5, (41, 9, (39, 169, (1393, 985, (8119, 5741, (4731, The corresponding vlues of n re: 48, 1680, 5710, , ,

6 6 7. (5 points ech Let nd > 1 e reltively prime integers with odd. Write p 1 p r with the p i odd, define the Jcoi symol ( y p 1 ( Prove tht if is qudrtic residue of then 1. Is the converse true? Prove it or give counterexmple. Proof: Let p 1 p r with p i odd primes. If is qudrtic residue modulo then there exists n integer x so tht x (mod. Thus, (x. Since p i, we hve x (mod p i for ech i. Nmely, we hve n ( n 1 1. i1 p i The converse is flse. Consider 3 nd 35. Then is not qudrtic residue modulo 35 (check y computtion ut ( ( ( ( 1( ( Prove tht ( ( nd ( (. p r i1. Proof: Let p 1 p r. We hve ( n ( i1 p i n ( ( i1 p i p i where we hve used the nlogous property for the qudrtic residue symol. Let p r+1 p s with p j (r + 1 j s primes. We hve s climed. s ( i1 p i r ( s i1 p i jr+1 ( p j

7 7 (c Prove tht if nd re reltively prime positive odd integers ech greter then 1, then ( ( It my e helpful to note tht if u, v re odd integers, then (u 1/+(v 1/ (uv 1/(mod. Proof: Let p 1 p r nd q 1 q s. We hve s ( i1 s q i ( pj r q i1 j1 i s r ( qi i1 j1 p j ( 1 pj 1 ( s r ( 1 i1 j1 ( s i1 ( 1P ( s qi 1 i1 ( 1P ( ( 1 ( 1 1 pj 1 P r j1 pj 1 qi 1 qi 1 qi 1 ( 1P r j1 pj 1 (qudrtic reciprocity where the lst equlity follows from the hint. Now we use tht ( ( ±1 to move to the ( other side of the eqution ( (10 points Prove tht φ(p! (p 1φ((p 1! for p prime. Proof: We cn write p! p(p 1!. Since p is prime, gcd(p, (p 1! 1 nd so φ(p(p 1! φ(pφ((p 1! (p 1φ((p 1!, s climed.

8 8 Choose either version of prolem 9 to do. You my receive extr credit for doing the other one though! 9. (1 points Consider the eqution + p(c + d. Show tht if p 3(mod 4 tht this eqution hs no solutions. (You my wnt to use descent here! Proof: Let u 1, v 1, x 1, y 1 Z >0 e solution to the eqution so tht u 1 + v 1 p(x 1 + y 1. (1 This implies tht u 1 + v 1 0(mod p, ( i.e., u 1 v 1 (mod p. Suppose p v 1. Then we hve tht v 1. However, we know tht 1p 1 nd so we must hve 1. This is impossile ( v 1 p since p 3(mod 4. Thus, we hve p v 1 nd hence p u 1 s well. Set u u 1 /p nd v v 1 /p. Then we hve (pu + (pv p(x 1 + y 1 i.e., x 1 + y 1 p(u + v. Note tht u < u 1. We cn now repet the sme rgument to otin tht p x 1 nd p y 1. Setting x x 1 /p nd y y 1 /p nd pplying the sme rgument we otin u + v p(x + y. However, this gives nother solution (u, v, x, y with strictly smller positive vlues then our originl solution. Applying descent we see tht we hve strictly decresing sequence of positive integers, contrdiction. Thus there cn e no solutions. ( 1 p

9 9 9. (6+6 points Let m e positive squre-free integer. ( Show tht the elements + m with, Z re ll lgeric integers in Q( m. Proof: Set α + m with, Z. Oserve tht α + α Z nd αα m Z. Thus, the polynomil f(x x (α + αx + αα is monic polynomil with integer coefficients. Plugging in α we see tht f(α α (α + αα + αα 0. Thus, we see tht α is necessrily n lgeric integer in Q( m. ( Prove there re infinitely mny units in Q( m. Proof: Recll tht α + m Q( m is unit if nd only if N(α αα ±1 nd α is n lgeric integer. The sttement out the norm is equivlent to the sttement tht m ±1. Consider the eqution x my 1. This is Pell s eqution nd we know there re infinitely mny solutions to this eqution for m positive nd squre-free. For ny solution x n, y n of the eqution x my 1 we hve tht the element x n +y n m is then unit in Q( m y prt ( long with the fct tht it hs norm 1. Since there re infinitely mny integer solutions to Pell s eqution, there re infinitely mny units in Q( m.

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

### Math 4310 Solutions to homework 1 Due 9/1/16

Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1

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

### 378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),

### 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

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

### #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:

### 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

### 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

### 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.

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

### 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,

### 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 FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)

MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give

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.

### Homework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama

CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 4 1. UsetheproceduredescriedinLemm1.55toconverttheregulrexpression(((00) (11)) 01) into n NFA. Answer: 0 0 1 1 00 0 0 11 1 1 01 0 1 (00)

### Bases for Vector Spaces

Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

### 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

### Section 7.1 Integration by Substitution

Section 7. Integrtion by Substitution Evlute ech of the following integrls. Keep in mind tht using substitution my not work on some problems. For one of the definite integrls, it is not possible to find

### Linear Inequalities. Work Sheet 1

Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges \$ 15 per week plus \$ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend

### 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

### (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.

### 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

### Mathematics Number: Logarithms

plce of mind F A C U L T Y O F E D U C A T I O N Deprtment of Curriculum nd Pedgogy Mthemtics Numer: Logrithms Science nd Mthemtics Eduction Reserch Group Supported y UBC Teching nd Lerning Enhncement

### 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

### AM1 Mathematical Analysis 1 Oct Feb Exercises Lecture 3. sin(x + h) sin x h cos(x + h) cos x h

AM Mthemticl Anlysis Oct. Feb. Dte: October Exercises Lecture Exercise.. If h, prove the following identities hold for ll x: sin(x + h) sin x h cos(x + h) cos x h = sin γ γ = sin γ γ cos(x + γ) (.) sin(x

### 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

### September 13 Homework Solutions

College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are

### 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.

### Math 113 Exam 2 Practice

Mth Em Prctice Februry, 8 Em will cover sections 6.5, 7.-7.5 nd 7.8. This sheet hs three sections. The first section will remind you bout techniques nd formuls tht you should know. The second gives number

### 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}.

### Section 6.1 INTRO to LAPLACE TRANSFORMS

Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform

### Name Ima Sample ASU ID

Nme Im Smple ASU ID 2468024680 CSE 355 Test 1, Fll 2016 30 Septemer 2016, 8:35-9:25.m., LSA 191 Regrding of Midterms If you elieve tht your grde hs not een dded up correctly, return the entire pper to

### 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

### 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

### 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

### Review of Gaussian Quadrature method

Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

### 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

### SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 2014

SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 014 Mrk Scheme: Ech prt of Question 1 is worth four mrks which re wrded solely for the correct nswer.

### 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

### 1 ELEMENTARY ALGEBRA and GEOMETRY READINESS DIAGNOSTIC TEST PRACTICE

ELEMENTARY ALGEBRA nd GEOMETRY READINESS DIAGNOSTIC TEST PRACTICE Directions: Study the exmples, work the prolems, then check your nswers t the end of ech topic. If you don t get the nswer given, check

### 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.

### 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

### Lecture 2 : Propositions DRAFT

CS/Mth 240: Introduction to Discrete Mthemtics 1/20/2010 Lecture 2 : Propositions Instructor: Dieter vn Melkeeek Scrie: Dlior Zelený DRAFT Lst time we nlyzed vrious mze solving lgorithms in order to illustrte

### 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=

### Chapters Five Notes SN AA U1C5

Chpters Five Notes SN AA U1C5 Nme Period Section 5-: Fctoring Qudrtic Epressions When you took lger, you lerned tht the first thing involved in fctoring is to mke sure to fctor out ny numers or vriles

### CAAM 453 NUMERICAL ANALYSIS I Examination There are four questions, plus a bonus. Do not look at them until you begin the exam.

Exmintion 1 Posted 23 October 2002. Due no lter thn 5pm on Mondy, 28 October 2002. Instructions: 1. Time limit: 3 uninterrupted hours. 2. There re four questions, plus bonus. Do not look t them until you

### 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

### 2 b. , a. area is S= 2π xds. Again, understand where these formulas came from (pages ).

AP Clculus BC Review Chpter 8 Prt nd Chpter 9 Things to Know nd Be Ale to Do Know everything from the first prt of Chpter 8 Given n integrnd figure out how to ntidifferentite it using ny of the following

### APPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line

APPENDIX D Preclculus Review APPENDIX D.1 Rel Numers n the Rel Numer Line Rel Numers n the Rel Numer Line Orer n Inequlities Asolute Vlue n Distnce Rel Numers n the Rel Numer Line Rel numers cn e represente

### Special Numbers, Factors and Multiples

Specil s, nd Student Book - Series H- + 3 + 5 = 9 = 3 Mthletics Instnt Workooks Copyright Student Book - Series H Contents Topics Topic - Odd, even, prime nd composite numers Topic - Divisiility tests

Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl

### Formal languages, automata, and theory of computation

Mälrdlen University TEN1 DVA337 2015 School of Innovtion, Design nd Engineering Forml lnguges, utomt, nd theory of computtion Thursdy, Novemer 5, 14:10-18:30 Techer: Dniel Hedin, phone 021-107052 The exm

### Polynomials and Division Theory

Higher Checklist (Unit ) Higher Checklist (Unit ) Polynomils nd Division Theory Skill Achieved? Know tht polynomil (expression) is of the form: n x + n x n + n x n + + n x + x + 0 where the i R re the

### 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

### 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

### 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

### Introduction to Algebra - Part 2

Alger Module A Introduction to Alger - Prt Copright This puliction The Northern Alert Institute of Technolog 00. All Rights Reserved. LAST REVISED Oct., 008 Introduction to Alger - Prt Sttement of Prerequisite

### Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring

More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),

### Harvard University Computer Science 121 Midterm October 23, 2012

Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is

### 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

### 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

### 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

### Revision Sheet. (a) Give a regular expression for each of the following languages:

Theoreticl Computer Science (Bridging Course) Dr. G. D. Tipldi F. Bonirdi Winter Semester 2014/2015 Revision Sheet University of Freiurg Deprtment of Computer Science Question 1 (Finite Automt, 8 + 6 points)

### First Midterm Examination

24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet

### AT100 - Introductory Algebra. Section 2.7: Inequalities. x a. x a. x < a

Section 2.7: Inequlities In this section, we will Determine if given vlue is solution to n inequlity Solve given inequlity or compound inequlity; give the solution in intervl nottion nd the solution 2.7

### 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

### MAA 4212 Improper Integrals

Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which

### Before we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!

Nme: Algebr II Honors Pre-Chpter Homework Before we cn begin Ch on Rdicls, we need to be fmilir with perfect squres, cubes, etc Try nd do s mny s you cn without clcultor!!! n The nth root of n n Be ble

### I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

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

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

### 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

### Minimal DFA. minimal DFA for L starting from any other

Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA

### Lecture Solution of a System of Linear Equation

ChE Lecture Notes, Dept. of Chemicl Engineering, Univ. of TN, Knoville - D. Keffer, 5/9/98 (updted /) Lecture 8- - Solution of System of Liner Eqution 8. Why is it importnt to e le to solve system of liner

### 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

### 1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

### 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

### MATH 174A: PROBLEM SET 5. Suggested Solution

MATH 174A: PROBLEM SET 5 Suggested Solution Problem 1. Suppose tht I [, b] is n intervl. Let f 1 b f() d for f C(I; R) (i.e. f is continuous rel-vlued function on I), nd let L 1 (I) denote the completion

### Advanced Algebra & Trigonometry Midterm Review Packet

Nme Dte Advnced Alger & Trigonometry Midterm Review Pcket The Advnced Alger & Trigonometry midterm em will test your generl knowledge of the mteril we hve covered since the eginning of the school yer.

### 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

Clculus Module C Ares Integrtion Copright This puliction The Northern Alert Institute of Technolog 7. All Rights Reserved. LAST REVISED Mrch, 9 Introduction to Ares Integrtion Sttement of Prerequisite

### Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1

Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution

### Bernoulli Numbers Jeff Morton

Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f

### Number systems: the Real Number System

Numer systems: the Rel Numer System syllusref eferenceence Core topic: Rel nd complex numer systems In this ch chpter A Clssifiction of numers B Recurring decimls C Rel nd complex numers D Surds: suset

### 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

### First Midterm Examination

Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does

### 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

### 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,

### Spring 2017 Exam 1 MARK BOX HAND IN PART PIN: 17

Spring 07 Exm problem MARK BOX points HAND IN PART 0 5-55=x5 0 NAME: Solutions 3 0 0 PIN: 7 % 00 INSTRUCTIONS This exm comes in two prts. () HAND IN PART. Hnd in only this prt. () STATEMENT OF MULTIPLE

### Multiplying integers EXERCISE 2B INDIVIDUAL PATHWAYS. -6 ì 4 = -6 ì 0 = 4 ì 0 = -6 ì 3 = -5 ì -3 = 4 ì 3 = 4 ì 2 = 4 ì 1 = -5 ì -2 = -6 ì 2 = -6 ì 1 =

EXERCISE B INDIVIDUAL PATHWAYS Activity -B- Integer multipliction doc-69 Activity -B- More integer multipliction doc-698 Activity -B- Advnced integer multipliction doc-699 Multiplying integers FLUENCY

### If deg(num) deg(denom), then we should use long-division of polynomials to rewrite: p(x) = s(x) + r(x) q(x), q(x)

Mth 50 The method of prtil frction decomposition (PFD is used to integrte some rtionl functions of the form p(x, where p/q is in lowest terms nd deg(num < deg(denom. q(x If deg(num deg(denom, then we should

### How can we approximate the area of a region in the plane? What is an interpretation of the area under the graph of a velocity function?

Mth 125 Summry Here re some thoughts I ws hving while considering wht to put on the first midterm. The core of your studying should be the ssigned homework problems: mke sure you relly understnd those

### 6.2 The Pythagorean Theorems

PythgorenTheorems20052006.nb 1 6.2 The Pythgoren Theorems One of the best known theorems in geometry (nd ll of mthemtics for tht mtter) is the Pythgoren Theorem. You hve probbly lredy worked with this

### Lecture 19: Continuous Least Squares Approximation

Lecture 19: Continuous Lest Squres Approximtion 33 Continuous lest squres pproximtion We begn 31 with the problem of pproximting some f C[, b] with polynomil p P n t the discrete points x, x 1,, x m for

### AP Calculus Multiple Choice: BC Edition Solutions

AP Clculus Multiple Choice: BC Edition Solutions J. Slon Mrch 8, 04 ) 0 dx ( x) is A) B) C) D) E) Divergent This function inside the integrl hs verticl symptotes t x =, nd the integrl bounds contin this

### UNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3

UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,

### Lecture 1. Functional series. Pointwise and uniform convergence.

1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

### SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL (1 + µ(f n )) f(x) =. But we don t need the exact bound.) Set

SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL 28 Nottion: N {, 2, 3,...}. (Tht is, N.. Let (X, M be mesurble spce with σ-finite positive mesure µ. Prove tht there is finite positive mesure ν on (X, M such