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

Size: px
Start display at page:

Download "Math 4310 Solutions to homework 1 Due 9/1/16"

Transcription

1 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) = = = = = = = = = = = = = = = = = = Find the multiplictive inverses of the given elements, or explin why there is not one. () [38] 1 = [59] in Z 83 First we do the Eucliden lgorithm: Substituting bckwrds, Hence [38] 1 = [ 24] = [59] in Z = = = = = 7 (38 7 5) 2 = = ( ) =

2 Mth 4310 (Fll 2016) Solution 1 2 (b) [351] hs no inverse in Z 6669 becuse [351] [19] = [0]. (c) [91] 1 = [451] in Z 2565 First we do the Eucliden lgorithm: Substituting bckwrds, 2565 = = = = = = 6 (17 6 2) 1 = = ( ) = = 91 3 ( ) 16 = Hence [91] 1 = [451] in Z Prove the following fcts out divisors. In the following,, b, c N. () If b, then b c. Since b, there is nturl number k such tht bk =. Multipliction is well-defined, so (bk)c = c. Multipliction is lso ssocitive, so b(kc) = c. Finlly, since N is closed under multipliction, kc N, nd by definition, b c. (b) If b nd c b, then c. Since c b, there is nturl number k 1 such tht Since b, there is nturl number k 2 such tht ck 1 = b. (1) bk 2 =. (2) We cn multiply both sides of (1) by k 2 to get (ck 1 )k 2 = bk 2. Multipliction is ssocitive, so c(k 1 k 2 ) = bk 2. Equlity is trnsitive, so using (2), we hve c(k 1 k 2 ) =. Finlly, N is closed under multipliction, so k 1 k 2 N, nd by definition c. (c) If c nd c b, then c (m + nb) for ny integers m, n. Since c nd c b, there re nturl numbers k 1 nd k 2 such tht ck 1 =, ck 2 = b. Multipliction is well-defined nd ssocitive, so c(k 1 m) = m, c(k 2 n) = bn. Multipliction is lso commuttive, so c(k 1 m) = m, c(k 2 n) = nb.

3 Mth 4310 (Fll 2016) Solution 1 3 Addition is well-defined, so Distributivity gives c(k 1 m) + c(k 2 n) = m + nb. c(k 1 m + k 2 n) = m + nb. Finlly N is closed under multipliction nd ddition, so k 1 m + k 2 n N, nd by definition c (m + nb). 4. Fill in the ddition nd multipliction tles for F 5. + mod mod () How cn we conclude from the ddition nd multipliction tles tht the opertions re commuttive? The tles re symmetric cross the top-left-to-bottom-right digonl, so the opertions re commuttive. (b) How cn we conclude tht 0 is n dditive identity? The first row of the ddition tle shows tht 0 + = for ll, while the first column of the sme tle shows tht + 0 = for ll. This suffices to show tht 0 is n dditive identity. (c) How cn we conclude tht every non-zero element hs multiplictive inverse? Excluding the 0 row, ech row in the multipliction tle hs 1, showing tht for every, there is b such tht = 1. Excluding the 0 column, ech column in the multipliction tle hs 1, showing tht for every, there is b such tht b = 1. Hence every non-zero element hs left nd right multiplictive inverse. (d) Working with elements in F 5, find the solution to the liner eqution 3x + 2 = 4. Adding 3 to both sides, we get 3x = 2. Multiplying both sides by 2, we get x = Tking for grnted tht R is field, we cn verify the field xioms for C. Recll tht for two complex numbers z = + bi nd w = c + di, with, b, c, d R, we hve z + w = ( + c) + (b + d)i nd z w = (c bd) + (d + bc)i. () Prove tht + is ssocitive. (Sorry, it s messy! You hve to do this kind of thing once. Also, ssocitivity of is worse.)

4 Mth 4310 (Fll 2016) Solution 1 4 Our three complex numbers will be z k = k + b k i for k = 1, 2, 3. Using the definition of ddition, (z 1 + z 2 ) + z 3 = (( 1 + b 1 i) + ( 2 + b 2 i)) + ( 3 + b 3 i) = (( ) + (b 1 + b 2 )i) + ( 3 + b 3 i) = (( ) + 3 ) + ((b 1 + b 2 ) + b 3 )i Since ddition for R is ssocitive, the lst line becomes (( ) + 3 ) + ((b 1 + b 2 ) + b 3 )i = ( 1 + ( )) + (b 1 + (b 2 + b 3 ))i. Use the definition of ddition gin but now in the opposite direction: s desired. (z 1 + z 2 ) + z 3 = ( 1 + ( )) + (b 1 + (b 2 + b 3 ))i = ( 1 + b 1 i) + (( ) + (b 2 + b 3 )i) = ( 1 + b 1 i) + (( 2 + b 2 i) + ( 3 + b 3 i)) = z 1 + (z 2 + z 3 ), (b) Suppose z = + bi stisfies 0 nd b 0. Wht is the multiplictive inverse of z? Let y = b i. Becuse nd b re both nonzero, their squres re both 2 +b 2 2 +b 2 positive, so 2 + b 2 > 0. Thus y is well-defined. Now we check the products: ( ) zy = ( + bi) 2 + b 2 b 2 + b 2 i = 2 + b 2 b 2 + b 2 i 2 + b 2 i2. Becuse i 2 = 1 nd multipliction is commuttive in R, this becomes zy = 2 + b b 2 = This shows tht y is right inverse of z. We check the other: ( ) yz = 2 + b 2 b 2 + b 2 i ( + bi) = 2 + b b 2 i b 2 + b 2 i 2 + b b 2 i2. Becuse i 2 = 1 nd multipliction is commuttive in R, this becomes yz = 2 + b b 2 i 2 + b 2 = 2 + b b 2 = b 2 = 1. This shows tht y is left inverse of z. Thus y is the multiplictive inverse of z.

5 Mth 4310 (Fll 2016) Solution 1 5 (c) In prt (b), if, b Q, is z 1 Q[i]? Becuse Q is closed under multipliction nd ddition, if, b re in Q, then so is 2 +b 2. As rgued before, 2 +b 2 0, nd Q is field, so ( 2 +b 2 ) 1 b Q. Then, Q, 2 +b 2 2 +b 2 so z 1 = 2 +b 2 + b 2 +b 2 i is in Q[i]. Extended Glossry. Plese give definition of prime number. Then give n exmple of prime number, n exmple of number tht is not prime number (don t forget to explin why!), nd stte nd prove theorem out prime numbers. In studying multipliction in the nturl numbers, we quickly run into the ide of expressing numbers s products of smller numbers. Since 1 is the multiplictive identity, it is most interesting when the components re not 1. For instnce 12 = 4 3, where both 4 nd 3 re smller thn 6 nd neither is 1. Eventully we cnnot brek numbers down further, giving us our miniml units of multipliction, which we cll prime numbers. Definition 1. A prime number is nturl number greter thn 1 with no positive divisors except 1 nd itself. Exmple 2. 3 is prime number. Any divisors of 3 must be smller thn 3, which mens the only possible nontrivil (i.e. neither 1 nor 3) divisor is 2. However 2 does not divide 3, so 3 is prime. Exmple is not prime becuse 12 is divisible by 2. A nturl question is, how mny prime numbers re there? We will show tht there re infinitely mny of them, but before we cn do tht, we need the following lemm: Lemm 4. Every nturl number greter thn 1 hs prime divisor. Proof. Let S be the set of nturl numbers greter thn 1 which hve no prime divisors, nd suppose S is nonempty. Then by the Well-Ordering Principle, S hs lest element l. Since l hs no prime divisors, in prticulr l is not prime number. We defined S such tht l > 1, so l hs divisor which is neither 1 nor itself, which we will cll d. We hve tht d divides l but 1 < d < l, so d must hve prime divisor p, since it is not in S. However if p divides d nd d divides l, then p divides l, which contrdicts our construction of l. Hence our initil ssumption must be incorrect, nd S is empty. Therefore every nturl number greter thn 1 hs prime divisor. Theorem 5. There re infinitely mny prime numbers in N. Proof. Suppose there re only finitely mny prime numbers in N, nd they re 1, 2,..., n. Let b = 1 2 n + 1. Since N is closed under ddition nd multipliction, b is in N. By lemm 4, every nturl number greter thn 1 hs prime divisor, so b hs prime divisor, which must be i for some i. Since i divides 1 2 n nd i divides 1 2 n + 1, i must divide 1. However 1 hs no prime divisors, so our initil ssumption ws wrong, nd there re infinitely mny primes in N.

(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

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

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

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

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

Lecture 2: Fields, Formally

Lecture 2: Fields, Formally Mth 08 Lecture 2: Fields, Formlly Professor: Pdric Brtlett Week UCSB 203 In our first lecture, we studied R, the rel numbers. In prticulr, we exmined how the rel numbers intercted with the opertions of

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

Geometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio.

Geometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio. Geometric Sequences Geometric Sequence sequence whose consecutive terms hve common rtio. Geometric Sequence A sequence is geometric if the rtios of consecutive terms re the sme. 2 3 4... 2 3 The number

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

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

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

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

Introduction to Group Theory

Introduction to Group Theory Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements

More information

Name Solutions to Test 3 November 8, 2017

Name Solutions to Test 3 November 8, 2017 Nme Solutions to Test 3 November 8, 07 This test consists of three prts. Plese note tht in prts II nd III, you cn skip one question of those offered. Some possibly useful formuls cn be found below. Brrier

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

Bases for Vector Spaces

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

More information

Math 61CM - Solutions to homework 9

Math 61CM - Solutions to homework 9 Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ

More information

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

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

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

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

Review: set theoretic definition of the numbers. Natural numbers:

Review: set theoretic definition of the numbers. Natural numbers: Review: reltions A inry reltion on set A is suset R Ñ A ˆ A, where elements p, q re written s. Exmple: A Z nd R t pmod nqu. A inry reltion on set A is... (R) reflexive if for ll P A; (S) symmetric if implies

More information

MathCity.org Merging man and maths

MathCity.org Merging man and maths MthCity.org Merging mn nd mths Exercise.8 (s) Pge 46 Textbook of Algebr nd Trigonometry for Clss XI Avilble online @ http://, Version: 3.0 Question # Opertion performed on the two-member set G = {0, is

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

Math Solutions to homework 1

Math Solutions to homework 1 Mth 75 - Solutions to homework Cédric De Groote October 5, 07 Problem, prt : This problem explores the reltionship between norms nd inner products Let X be rel vector spce ) Suppose tht is norm on X tht

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

Linear Algebra 1A - solutions of ex.4

Linear Algebra 1A - solutions of ex.4 Liner Algebr A - solutions of ex.4 For ech of the following, nd the inverse mtrix (mtritz hofkhit if it exists - ( 6 6 A, B (, C 3, D, 4 4 ( E i, F (inverse over C for F. i Also, pick n invertible mtrix

More information

Theory of Computation Regular Languages. (NTU EE) Regular Languages Fall / 38

Theory of Computation Regular Languages. (NTU EE) Regular Languages Fall / 38 Theory of Computtion Regulr Lnguges (NTU EE) Regulr Lnguges Fll 2017 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of Finite Automt A finite utomton hs finite set of control

More information

Handout: Natural deduction for first order logic

Handout: Natural deduction for first order logic MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes

More information

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

September 13 Homework Solutions

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

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

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

Chapter 14. Matrix Representations of Linear Transformations

Chapter 14. Matrix Representations of Linear Transformations Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn

More information

Theory of the Integral

Theory of the Integral Spring 2012 Theory of the Integrl Author: Todd Gugler Professor: Dr. Drgomir Sric My 10, 2012 2 Contents 1 Introduction 5 1.0.1 Office Hours nd Contct Informtion..................... 5 1.1 Set Theory:

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

Matrices and Determinants

Matrices and Determinants Nme Chpter 8 Mtrices nd Determinnts Section 8.1 Mtrices nd Systems of Equtions Objective: In this lesson you lerned how to use mtrices, Gussin elimintion, nd Guss-Jordn elimintion to solve systems of liner

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

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

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

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)

More information

Is there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them!

Is there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them! PUSHING PYTHAGORAS 009 Jmes Tnton A triple of integers ( bc,, ) is clled Pythgoren triple if exmple, some clssic triples re ( 3,4,5 ), ( 5,1,13 ), ( ) fond of ( 0,1,9 ) nd ( 119,10,169 ). + b = c. For

More information

Matrices. Elementary Matrix Theory. Definition of a Matrix. Matrix Elements:

Matrices. Elementary Matrix Theory. Definition of a Matrix. Matrix Elements: Mtrices Elementry Mtrix Theory It is often desirble to use mtrix nottion to simplify complex mthemticl expressions. The simplifying mtrix nottion usully mkes the equtions much esier to hndle nd mnipulte.

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

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

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

MATRIX DEFINITION A matrix is any doubly subscripted array of elements arranged in rows and columns.

MATRIX DEFINITION A matrix is any doubly subscripted array of elements arranged in rows and columns. 4.5 THEORETICL SOIL MECHNICS Vector nd Mtrix lger Review MTRIX DEFINITION mtrix is ny douly suscripted rry of elements rrnged in rows nd columns. m - Column Revised /0 n -Row m,,,,,, n n mn ij nd Order

More information

Introduction To Matrices MCV 4UI Assignment #1

Introduction To Matrices MCV 4UI Assignment #1 Introduction To Mtrices MCV UI Assignment # INTRODUCTION: A mtrix plurl: mtrices) is rectngulr rry of numbers rrnged in rows nd columns Exmples: ) b) c) [ ] d) Ech number ppering in the rry is sid to be

More information

Theory of Computation Regular Languages

Theory of Computation Regular Languages Theory of Computtion Regulr Lnguges Bow-Yw Wng Acdemi Sinic Spring 2012 Bow-Yw Wng (Acdemi Sinic) Regulr Lnguges Spring 2012 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of

More information

MAT 215: Analysis in a single variable Course notes, Fall Michael Damron

MAT 215: Analysis in a single variable Course notes, Fall Michael Damron MAT 215: Anlysis in single vrible Course notes, Fll 2012 Michel Dmron Compiled from lectures nd exercises designed with Mrk McConnell following Principles of Mthemticl Anlysis, Rudin Princeton University

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties

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

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

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

Math Lecture 23

Math Lecture 23 Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of

More information

42nd International Mathematical Olympiad

42nd International Mathematical Olympiad nd Interntionl Mthemticl Olympid Wshington, DC, United Sttes of Americ July 8 9, 001 Problems Ech problem is worth seven points. Problem 1 Let ABC be n cute-ngled tringle with circumcentre O. Let P on

More information

CH 9 INTRO TO EQUATIONS

CH 9 INTRO TO EQUATIONS CH 9 INTRO TO EQUATIONS INTRODUCTION I m thinking of number. If I dd 10 to the number, the result is 5. Wht number ws I thinking of? R emember this question from Chpter 1? Now we re redy to formlize the

More information

The usual algebraic operations +,, (or ), on real numbers can then be extended to operations on complex numbers in a natural way: ( 2) i = 1

The usual algebraic operations +,, (or ), on real numbers can then be extended to operations on complex numbers in a natural way: ( 2) i = 1 Mth50 Introduction to Differentil Equtions Brief Review of Complex Numbers Complex Numbers No rel number stisfies the eqution x =, since the squre of ny rel number hs to be non-negtive. By introducing

More information

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More

More information

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

SUMMER KNOWHOW STUDY AND LEARNING CENTRE SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18

More information

Things to Memorize: A Partial List. January 27, 2017

Things to Memorize: A Partial List. January 27, 2017 Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors - Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved

More information

1.2. Linear Variable Coefficient Equations. y + b "! = a y + b " Remark: The case b = 0 and a non-constant can be solved with the same idea as above.

1.2. Linear Variable Coefficient Equations. y + b ! = a y + b  Remark: The case b = 0 and a non-constant can be solved with the same idea as above. 1 12 Liner Vrible Coefficient Equtions Section Objective(s): Review: Constnt Coefficient Equtions Solving Vrible Coefficient Equtions The Integrting Fctor Method The Bernoulli Eqution 121 Review: Constnt

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

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct

More information

CSCI FOUNDATIONS OF COMPUTER SCIENCE

CSCI FOUNDATIONS OF COMPUTER SCIENCE 1 CSCI- 2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 My 7, 2015 2 Announcements Homework 9 is due now. Some finl exm review problems will be posted on the web site tody. These re prcqce problems not

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

Lecture 2e Orthogonal Complement (pages )

Lecture 2e Orthogonal Complement (pages ) Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process

More information

Harvard University Computer Science 121 Midterm October 23, 2012

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

More information

First Midterm Examination

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

More information

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

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

More information

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24 Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the

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

Rudin s Principles of Mathematical Analysis: Solutions to Selected Exercises. Sam Blinstein UCLA Department of Mathematics

Rudin s Principles of Mathematical Analysis: Solutions to Selected Exercises. Sam Blinstein UCLA Department of Mathematics Rudin s Principles of Mthemticl Anlysis: Solutions to Selected Exercises Sm Blinstein UCLA Deprtment of Mthemtics Mrch 29, 2008 Contents Chpter : The Rel nd Complex Number Systems 2 Chpter 2: Bsic Topology

More information

MTH 5102 Linear Algebra Practice Exam 1 - Solutions Feb. 9, 2016

MTH 5102 Linear Algebra Practice Exam 1 - Solutions Feb. 9, 2016 Nme (Lst nme, First nme): MTH 502 Liner Algebr Prctice Exm - Solutions Feb 9, 206 Exm Instructions: You hve hour & 0 minutes to complete the exm There re totl of 6 problems You must show your work Prtil

More information

Minimal DFA. minimal DFA for L starting from any other

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

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

Infinite Geometric Series

Infinite Geometric Series Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to

More information

Presentation Problems 5

Presentation Problems 5 Presenttion Problems 5 21-355 A For these problems, ssume ll sets re subsets of R unless otherwise specified. 1. Let P nd Q be prtitions of [, b] such tht P Q. Then U(f, P ) U(f, Q) nd L(f, P ) L(f, Q).

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

MORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)

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

More information

PARTIAL FRACTION DECOMPOSITION

PARTIAL FRACTION DECOMPOSITION PARTIAL FRACTION DECOMPOSITION LARRY SUSANKA 1. Fcts bout Polynomils nd Nottion We must ssemble some tools nd nottion to prove the existence of the stndrd prtil frction decomposition, used s n integrtion

More information

f = ae b e , i.e., ru + P = (r + P )(u + P ) = (s + P )(t + P ) = st + P. Then since ru st P and su P we conclude that r s t u = ru st

f = ae b e , i.e., ru + P = (r + P )(u + P ) = (s + P )(t + P ) = st + P. Then since ru st P and su P we conclude that r s t u = ru st Mth 662 Spring 204 Homewor 2 Drew Armstrong Problem 0. (Drwing Pictures) The eqution y 2 = x 3 x defines curve in the complex plne C 2. Wht does it loo lie? Unfortuntely we cn only see rel things, so we

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

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

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

More information

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors: Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )

More information

INTRODUCTION TO LINEAR ALGEBRA

INTRODUCTION TO LINEAR ALGEBRA ME Applied Mthemtics for Mechnicl Engineers INTRODUCTION TO INEAR AGEBRA Mtrices nd Vectors Prof. Dr. Bülent E. Pltin Spring Sections & / ME Applied Mthemtics for Mechnicl Engineers INTRODUCTION TO INEAR

More information

Lecture 09: Myhill-Nerode Theorem

Lecture 09: Myhill-Nerode Theorem CS 373: Theory of Computtion Mdhusudn Prthsrthy Lecture 09: Myhill-Nerode Theorem 16 Ferury 2010 In this lecture, we will see tht every lnguge hs unique miniml DFA We will see this fct from two perspectives

More information

308K. 1 Section 3.2. Zelaya Eufemia. 1. Example 1: Multiplication of Matrices: X Y Z R S R S X Y Z. By associativity we have to choices:

308K. 1 Section 3.2. Zelaya Eufemia. 1. Example 1: Multiplication of Matrices: X Y Z R S R S X Y Z. By associativity we have to choices: 8K Zely Eufemi Section 2 Exmple : Multipliction of Mtrices: X Y Z T c e d f 2 R S X Y Z 2 c e d f 2 R S 2 By ssocitivity we hve to choices: OR: X Y Z R S cr ds er fs X cy ez X dy fz 2 R S 2 Suggestion

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

Bernoulli Numbers Jeff Morton

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

More information

Myhill-Nerode Theorem

Myhill-Nerode Theorem Overview Myhill-Nerode Theorem Correspondence etween DA s nd MN reltions Cnonicl DA for L Computing cnonicl DFA Myhill-Nerode Theorem Deepk D Souz Deprtment of Computer Science nd Automtion Indin Institute

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

Operations with Polynomials

Operations with Polynomials 38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: How to identify the leding coefficients nd degrees of polynomils How to dd nd subtrct polynomils How to multiply polynomils

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

Boolean Algebra. Boolean Algebras

Boolean Algebra. Boolean Algebras Boolen Algebr Boolen Algebrs A Boolen lgebr is set B of vlues together with: - two binry opertions, commonly denoted by + nd, - unry opertion, usully denoted by or ~ or, - two elements usully clled zero

More information

We will see what is meant by standard form very shortly

We will see what is meant by standard form very shortly THEOREM: For fesible liner progrm in its stndrd form, the optimum vlue of the objective over its nonempty fesible region is () either unbounded or (b) is chievble t lest t one extreme point of the fesible

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

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers.

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers. 8. Complex Numers The rel numer system is dequte for solving mny mthemticl prolems. But it is necessry to extend the rel numer system to solve numer of importnt prolems. Complex numers do not chnge the

More information

Each term is formed by adding a constant to the previous term. Geometric progression

Each term is formed by adding a constant to the previous term. Geometric progression Chpter 4 Mthemticl Progressions PROGRESSION AND SEQUENCE Sequence A sequence is succession of numbers ech of which is formed ccording to definite lw tht is the sme throughout the sequence. Arithmetic Progression

More information

MTH3101 Spring 2017 HW Assignment 6: Chap. 5: Sec. 65, #6-8; Sec. 68, #5, 7; Sec. 72, #8; Sec. 73, #5, 6. The due date for this assignment is 4/06/17.

MTH3101 Spring 2017 HW Assignment 6: Chap. 5: Sec. 65, #6-8; Sec. 68, #5, 7; Sec. 72, #8; Sec. 73, #5, 6. The due date for this assignment is 4/06/17. MTH30 Spring 07 HW Assignment 6: Chp. 5: Sec. 65, #6-8; Sec. 68, #5, 7; Sec. 7, #8; Sec. 73, #5, 6. The due dte for this ssignment is 4/06/7. Sec. 65: #6. Wht is the lrgest circle within which the Mclurin

More information

Formal languages, automata, and theory of computation

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

More information