Formulas for the Determinant

Size: px
Start display at page:

Download "Formulas for the Determinant"

Transcription

1 page CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use Cramer s rule to solve the gven lnear system x 1 3x 2 = 2, x 1 + 2x 2 = 4 3x 1 2x 2 + x 3 = 4, x 1 + x 2 x 3 = 2, x 1 + x 3 = 1 x 1 3x 2 + x 3 = 0, x 1 + 4x 2 x 3 = 0, 2x 1 + x 2 3x 3 = 0 x 1 2x 2 + 3x 3 x 4 = 1, 2x 1 + x 3 = 2, x 1 + x 2 x 4 = 0, x 2 2x 3 + x 4 = 3 44 Use Cramer s rule to determne x 1 and x 2 f e t x 1 + e 2t x 2 = 3snt, e t x 1 2e 2t x 2 = 4 cos t 45 Determne the value of x 2 such that x 1 + 4x 2 2x 3 + x 4 = 2, 2x 1 + 9x 2 3x 3 2x 4 = 5, x 1 + 5x 2 + x 3 x 4 = 3, 3x x 2 + 7x 3 2x 4 = 6 46 Fnd all solutons to the system (b + c)x 1 + a(x 2 + x 3 ) = a, (c + a)x 1 + b(x 3 + x 1 ) = b, (a + b)x 1 + c(x 1 + x 2 ) = c, where a,b,c are constants Make sure you consder all cases (that s, those when there s a unque soluton, an nfnte number of solutons, and no solutons) 47 Prove Equaton (333) 48 Let A be a randomly generated nvertble 4 4 matrx Verfy the Cofactor Expanson Theorem for expanson along row 1 49 Let A be a randomly generated 4 4 matrx Verfy Equaton (333) when = 2 and j = 4 50 Let A be a randomly generated 5 5 matrx Determne adj(a) and compute A adj(a) Use your result to determne det(a) 51 Solve the system of equatons 121x x x 3 = 325, 541x x x 3 = 461, 2163x x x 3 = 993 Round answers to two decmal places 52 Use Cramer s rule to solve the system Ax = b f A = , and b = Verfy that BA = I n n the proof of Theorem Summary of Determnants The prmary am of ths secton s to serve as a stand-alone ntroducton to determnants for readers who desre only a cursory revew of the major facts pertanng to determnants It may also be used as a revew of the results derved n Sectons Formulas for the Determnant The determnant of an n n matrx A, denoted det(a), s a scalar whose value can be obtaned n the followng manner 1 If A =[a 11 ], then det(a) = a 11

2 page Summary of Determnants 225 [ ] a11 a 2 If A = 12, then det(a) = a a 21 a 11 a 22 a 12 a For n>2, the determnant of A can be computed usng ether of the followng formulas: det(a) = a 1 C 1 + a 2 C 2 + +a n C n, (341) det(a) = a 1j C 1j + a 2j C 2j + +a nj C nj, (342) where C j = ( 1) +j M j, and M j s the determnant of the matrx obtaned by deletng the th row and jth column of A The formulas (341) and (342) are referred to as cofactor expanson along the th row and cofactor expanson along the j th column, respectvely The determnants M j and C j are called the mnors and cofactors of A, respectvely We also denote det(a) by a 11 a 12 a 1n a 21 a 22 a 2n a n1 a n2 a nn a 11 a 12 a 13 a 11 a 12 a 21 a 22 a 23 a 21 a 22 a 31 a 32 a 33 a 31 a 32 Fgure 341: A schematc for obtanng the determnant of a 3 3 matrx A =[a j ] As an example, consder the general 3 3 matrx a 11 a 12 a 13 A = a 21 a 22 a 23 a 31 a 32 a 33 Usng cofactor expanson along row 1, we have We next compute the requred cofactors: det(a) = a 11 C 11 + a 12 C 12 + a 13 C 13 (343) C 11 =+M 11 = a 22 a 23 a 32 a 33 = a 22 a 33 a 23 a 32, C 12 = M 12 = a 21 a 23 a 31 a 33 = (a 21 a 33 a 23 a 31 ), C 13 =+M 13 = a 21 a 22 = a a 31 a 21 a 32 a 22 a Insertng these expressons for the cofactors nto Equaton (343) yelds det(a) = a 11 (a 22 a 33 a 23 a 32 ) a 12 (a 21 a 33 a 23 a 31 ) + a 13 (a 21 a 32 a 22 a 31 ), whch can be wrtten as det(a) = a 11 a 22 a 33 + a 12 a 23 a 31 + a 13 a 21 a 32 a 11 a 23 a 32 a 12 a 21 a 33 a 13 a 22 a 31 Although we chose to use cofactor expanson along the frst row to obtan the precedng formula, accordng to (341) and (342), the same result would have been obtaned f we had chosen to expand along any row or column of A A smple schematc for obtanng the terms n the determnant of a 3 3 matrx s gven n Fgure 341 By takng the product of the elements joned by each arrow and attachng the ndcated sgn to the result, we obtan the sx terms n the determnant of the 3 3 matrx A =[a j ] Note that ths technque for obtanng the terms n a 3 3 determnant does not generalze to determnants of larger matrces

3 page CHAPTER 3 Determnants Example 341 Evaluate Soluton: so that In ths case, the schematc gven n Fgure 341 s = (2)(4)(8) + ( 1)(2)(7) + (1)(3)(5) (7)(4)(1) (5)(2)(2) (8)(3)( 1) = 41 Propertes of Determnants Let A and B be n n matrces The determnant has the followng propertes: P1 If B s obtaned by permutng two rows (or columns) of A, then det(b) = det(a) P2 If B s obtaned by multplyng any row (or column) of A by a scalar k, then det(b) = k det(a) P3 If B s obtaned by addng a multple of any row (or column) of A to another row (or column) of A, then det(b) = det(a) P4 det(a T ) = det(a) P5 Let a 1, a 2,, a n denote the row vectors of A Iftheth row vector of A s the sum of two row vectors, say a = b + c, then where and det(a) = det(b) + det(c), B =[a 1, a 2,,a 1, b, a +1,,a n ] T C =[a 1, a 2,,a 1, c, a +1,,a n ] T The correspondng property for columns s also true P6 If A has a row (or column) of zeros, then det(a) = 0 P7 If two rows (or columns) of A are the same, then det(a) = 0 P8 det(ab) = det(a)det(b)

4 page Summary of Determnants 227 The frst three propertes tell us how elementary row operatons and elementary column operatons performed on a matrx A alter the value of det(a) They can be very helpful n reducng the amount of work requred to evaluate a determnant, snce we can use elementary row operatons to put several zeros n a row or column of A and then use cofactor expanson along that row or column We llustrate wth an example Example 342 Evaluate Soluton: Before performng a cofactor expanson, we frst use elementary row operatons to smplfy the determnant: Accordng to P3, the determnants of the two matrces above are the same To evaluate the determnant of the matrx on the rght, we use cofactor expanson along the frst column = ( 1) To evaluate the determnant of the 3 3 matrx on the rght, we can use the schematc gven n Fgure 341, or, we can contnue to use elementary row operatons to ntroduce zeros nto the matrx: = = = 166 Here, we have reduced the 3 3 determnant to a 2 2 determnant by usng cofactor expanson along the frst column of the 3 3 matrx 1 A 21 (2), A 23 (5), A 24 ( 2) 2 A 31 ( 3), A 32 ( 6) Basc Theoretcal Results The determnant s a useful theoretcal tool n lnear algebra We lst next the major results that wll be needed n the remander of the text 1 The volume of the parallelepped determned by the vectors s a = a 1 + a 2 j + a 3 k, b = b 1 + b 2 j + b 3 k, c = c 1 + c 2 j + c 3 k a 1 a 2 a 3 where A = b 1 b 2 b 3 c 1 c 2 c 3 Volume = det(a),

5 page CHAPTER 3 Determnants 2 An n n matrx s nvertble f and only f det(a) 0 3 An n n lnear system Ax = b has a unque soluton f and only f det(a) 0 4 An n n homogeneous lnear system Ax = 0 has an nfnte number of solutons f and only f det(a) = 0 We see, for example, that accordng to (2), the matrces n Examples 341 and 342 are both nvertble If A s an n n matrx wth det(a) 0, then the followng two methods can be derved for obtanng the nverse of A and for fndng the unque soluton to the lnear system Ax = b, respectvely 1 Adjont Method for A 1 : If A s nvertble, then A 1 = 1 det(a) adj(a), where adj(a) denotes the transpose of the matrx obtaned by replacng each element n A by ts cofactor 2 Cramer s Rule: If det(a) 0, then the unque soluton to Ax = b s x = (x 1,x 2,,x n ), where x k = det(b k) det(a), k = 1, 2,,n, and B k denotes the matrx obtaned when the kth column vector of A s replaced by b Example 343 Use the adjont method to fnd A 1 f A = Soluton: We have already shown n Example 341 that det(a) = 41, so that A s nvertble Replacng each element n A wth ts cofactor yelds the matrx of cofactors M C = , so that Consequently, adj(a) = MC T = A 1 = 1 det(a) adj(a) = Example 344 Use Cramer s rule to solve the lnear system 2x 1 x 2 + x 3 = 2, 3x 1 + 4x 2 + 2x 3 = 5, 7x 1 + 5x 2 + 8x 3 = 3

6 page Summary of Determnants 229 Soluton: The matrx of coeffcents s A = We have already shown n Example 341 that det(a) = 41 Consequently, Cramer s rule can ndeed be appled In ths problem, we have det(b 1 ) = det(b 2 ) = det(b 3 ) = It therefore follows from Cramer s rule that = 91, = 22, = 78 x 1 = det(b 1) det(a) = 91 41, x 2 = det(b 2) det(a) = 22 41, x 3 = det(b 3) det(a) = Exercses for 34 Sklls Be able to compute the determnant of an n n matrx Know the effects that elementary row operatons and elementary column operatons have on the determnant of a matrx Be able to use the determnant to decde f a matrx s nvertble Know how the determnant s affected by matrx multplcaton and by matrx transpose Be able to compute the adjont of a matrx and use t to fnd A 1 for an nvertble matrx A Problems For Problems 1 7, evaluate the gven determnant abc bca cab

7 page CHAPTER 3 Determnants For Problems 8 12, fnd det(a) IfA s nvertble, use the adjont method to fnd A 1 [ ] 35 8 A = A = A = A = A = For Problems 13 17, use Cramer s rule to determne the unque soluton to the system Ax = b for the gven matrx and vector [ ] [ ] A =, b = A = [ ] [ ] cos t sn t e t, b = sn t cos t 3e t A = 2 1 5, b = A = 24 7, b = A = , b = If A s an nvertble n n matrx, prove that det(a 1 ) = 1 det(a) 19 Let A and B be 3 3 matrces wth det(a) = 3 and det(b) = 4 Determne det(2a), det(a 1 ), det(a T B), det(b 5 ), det(b 1 AB) 35 Chapter Revew Ths chapter has lad out a basc ntroducton to the theory of determnants Determnants and Elementary Row Operatons For a square matrx A, one approach for computng the determnant of A, det(a), s to use elementary row operatons to reduce A to row-echelon form The effects of the varous types of elementary row operatons on det(a) are as follows: P j : permutng two rows of A alters the determnant by a factor of 1 M (k): multplyng the th row of A by k multples the determnant of the matrx by a factor of k A j (k): addng a multple of one row of A to another has no effect whatsoever on det(a) A crucal fact n ths approach s the followng: Theorem 351 If A s an n n upper (or lower) trangular matrx, ts determnant s det(a) = a 11 a 22 a nn Therefore, snce the row-echelon form of A s upper trangular, we can compute det(a) by usng Theorem 351 and by keepng track of the elementary row operatons nvolved n the row-reducton process

8 page Chapter Revew 231 Cofactor Expanson Another way to compute det(a) s va the Cofactor Expanson Theorem: For n 2, the determnant of A can be computed usng ether of the followng formulas: det(a) = a 1 C 1 + a 2 C 2 + +a n C n, (351) det(a) = a 1j C 1j + a 2j C 2j + +a nj C nj, (352) where C j = ( 1) +j M j, and M j s the determnant of the matrx obtaned by deletng the th row and jth column of A The formulas (351) and (352) are referred to as cofactor expanson along the th row and cofactor expanson along the j th column, respectvely The determnants M j and C j are called the mnors and cofactors of A, respectvely Adjont Method and Cramer s Rule If A s an n n matrx wth det(a) 0, then the followng two methods can be derved for obtanng the nverse of A and for fndng the unque soluton to the lnear system Ax = b, respectvely 1 Adjont Method for A 1 : If A s nvertble, then A 1 = 1 det(a) adj(a), where adj(a) denotes the transpose of the matrx obtaned by replacng each element n A by ts cofactor 2 Cramer s Rule: If det(a) 0, then the unque soluton to Ax = b s x = (x 1,x 2,,x n ), where x k = det(b k) det(a), k = 1, 2,,n, and B k denotes the matrx obtaned when the kth column vector of A s replaced by b Addtonal Problems For Problems 1 6, evaluate the determnant of the gven matrx A by usng (a) the defnton, (b) elementary row operatons to reduce A to an upper trangular matrx, and (c) the Cofactor Expanson Theorem [ ] A = 1 5 [ ] 66 2 A = A = A = A = A =

9 page CHAPTER 3 Determnants For Problems 7 10, suppose that abc A = d e f, and det(a) = 4 gh Compute the determnant of each matrx below g h 7 4a 4b 4c 2d 2e 2f a 5d b 5e c 5f 8 3g 3h 3 d + 3g e + 3h f + 3 3b 3e 3h 9 c 2a f 2d 2g a d g a db ec f g 2h 2 d e f For Problems 11 14, suppose that A and B are 4 4nvertble matrces If det(a) = 2 and det(b) = 3, compute each determnant below 11 det(ab) 12 det(b 2 A 1 ) 13 det(((a 1 B) T )(2B 1 )) 14 det(( A) 3 (2B 2 )) 15 Let A = 16 Let [ ] 12 1, B = 21 4 Determne, f possble, , C = det(a), det(b), det(c), det(c T ), det(ab), det(ba), det(b T A T ), det(bac), det(acb) A = [ ] 12, and B = 34 [ ] Use the adjont method to fnd B 1 and then determne (A 1 B T ) 1 For Problems 17 21, use the adjont method to determne A 1 for the gven matrx A 17 A = A = A = A = A = Add one row to the matrx [ ] A = so as to create a 3 3 matrx B wth det(b) = True or False: Gven any real number r and any 3 3 matrx A whose entres are all nonzero, t s always possble to change at most one entry of A to get a matrx B wth det(b) = r Let A = 316 k 32 (a) Fnd all value(s) of k for whch the matrx A fals to be nvertble (b) In terms of k, determne the volume of the parallelepped determned by the row vectors of the matrx A Is that the same as the volume of the parallelepped determned by the column vectors of the matrx A? Explan how you know ths wthout any calculaton 25 Repeat the precedng problem for the matrx k A = 0 3 k Repeat the precedng problem for the matrx A = 2 k 3 k k 0

10 page Let A and B be n n matrces such that AB = BA Use determnants to prove that f n s odd, then A and B cannot both be nvertble 28 A real n n matrx A s called orthogonal f AA T = A T A = I n IfA s an orthogonal matrx, prove that det(a) =±1 For Problems 29 31, use Cramer s rule to solve the gven lnear system x 1 + x 2 = 3, x 1 + 2x 2 = 1 2x 1 x 2 + x 3 = 2, 4x 1 + 5x 2 + 3x 3 = 0, 4x 1 3x 2 + 3x 3 = 2 3x 1 + x 2 + 2x 3 = 1, 2x 1 x 2 + x 3 = 1, 5x 2 + 5x 3 = 5 35 Chapter Revew 233 Project: Volume of a Tetrahedron In ths project, we use determnants and vectors to derve the formula for the volume of a tetrahedron wth vertces A = (x 1,y 1,z 1 ), B = (x 2,y 2,z 2 ), C = (x 3,y 3,z 3 ), and D = (x 4,y 4,z 4 ) Let h denote the dstance from A to the plane determned by B,C, and D From geometry, the volume of the tetrahedron s gven by Volume = 1 3h(area of trangle BCD) (353) (a) Express the area of trangle BCD n terms of a cross product of vectors (b) Use trgonometry to express h n terms of the dstance from A to B and the angle between the vector AB and the segment connectng A to the base BCD at a rght angle (c) Combnng (a) and (b) wth the volume of the tetrahedron gven above, express the volume of the tetrahedron n terms of dot products and cross products of vectors (d) Followng the proof of part 2 of Theorem 3111, express the volume of the tetrahedron n terms of a determnant wth entres n terms of the x,y, and z for 1 4 (e) Show that the expresson n part (d) s the same as Volume = 1 6 x 1 y 1 z 1 1 x 2 y 2 z 2 1 (354) x 3 y 3 z 3 1 x 4 y 4 z 4 1 (f) For each set of four ponts below, determne the volume of the tetrahedron wth those ponts as vertces by usng (353) and by usng (354) Both formulas should yeld the same answer () (0, 0, 0), (1, 0, 0), (0, 1, 0), (0, 0, 1) () ( 1, 1, 2), (0, 3, 3), (1, 1, 2), (0, 0, 1)

11 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrely Abstracton s what makes mathematcs work Ian Stewart The man am of ths text s to study lnear mathematcs In Chapter 2 we studed systems of lnear equatons, and the theory underlyng the soluton of a system of lnear equatons can be consdered as a specal case of a general mathematcal framework for lnear problems To llustrate ths framework, we dscuss an example Consder the homogeneous lnear system Ax = 0, where A = It s straghtforward to show that ths system has soluton set S = {(r 2s, r, s) : r, s R} Geometrcally we can nterpret each soluton as definng the coordnates of a pont n space or, equvalently, as the geometrc vector wth components v = (r 2s, r, s) Usng the standard operatons of vector addton and multplcaton of a vector by a real number, t follows that v can be wrtten n the form v = r(1, 1, 0) + s( 2, 0, 1) We see that every soluton to the gven lnear problem can be expressed as a lnear combnaton of the two basc solutons (see Fgure 401): v1 = (1, 1, 0) and v2 = ( 2, 0, 1) 234

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system. Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

CHAPTER 4. Vector Spaces

CHAPTER 4. Vector Spaces man 2007/2/16 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrel. Abstracton s what makes mathematcs work. Ian Stewart The man am of ths tet s to stud lnear

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Important Instructions to the Examiners:

Important Instructions to the Examiners: Summer 0 Examnaton Subject & Code: asc Maths (70) Model Answer Page No: / Important Instructons to the Examners: ) The Answers should be examned by key words and not as word-to-word as gven n the model

More information

332600_08_1.qxp 4/17/08 11:29 AM Page 481

332600_08_1.qxp 4/17/08 11:29 AM Page 481 336_8_.qxp 4/7/8 :9 AM Page 48 8 Complex Vector Spaces 8. Complex Numbers 8. Conjugates and Dvson of Complex Numbers 8.3 Polar Form and DeMovre s Theorem 8.4 Complex Vector Spaces and Inner Products 8.5

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

More information

Complex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)

Complex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1) Complex Numbers If you have not yet encountered complex numbers, you wll soon do so n the process of solvng quadratc equatons. The general quadratc equaton Ax + Bx + C 0 has solutons x B + B 4AC A For

More information

2 More examples with details

2 More examples with details Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and

More information

Lecture 5 Decoding Binary BCH Codes

Lecture 5 Decoding Binary BCH Codes Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture

More information

Homework Notes Week 7

Homework Notes Week 7 Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we

More information

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)? Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2

More information

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

More information

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1 C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

THE SUMMATION NOTATION Ʃ

THE SUMMATION NOTATION Ʃ Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the

More information

System in Weibull Distribution

System in Weibull Distribution Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co

More information

Section 3.6 Complex Zeros

Section 3.6 Complex Zeros 04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there

More information

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion Chapter 2:Determinants Section 2.1: Determinants by cofactor expansion [ ] a b Recall: The 2 2 matrix is invertible if ad bc 0. The c d ([ ]) a b function f = ad bc is called the determinant and it associates

More information

A FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX

A FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX Hacettepe Journal of Mathematcs and Statstcs Volume 393 0 35 33 FORMUL FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIGONL MTRIX H Kıyak I Gürses F Yılmaz and D Bozkurt Receved :08 :009 : ccepted 5

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41, The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson

More information

p 1 c 2 + p 2 c 2 + p 3 c p m c 2

p 1 c 2 + p 2 c 2 + p 3 c p m c 2 Where to put a faclty? Gven locatons p 1,..., p m n R n of m houses, want to choose a locaton c n R n for the fre staton. Want c to be as close as possble to all the house. We know how to measure dstance

More information

Complex Numbers Alpha, Round 1 Test #123

Complex Numbers Alpha, Round 1 Test #123 Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test

More information

The exponential map of GL(N)

The exponential map of GL(N) The exponental map of GLN arxv:hep-th/9604049v 9 Apr 996 Alexander Laufer Department of physcs Unversty of Konstanz P.O. 5560 M 678 78434 KONSTANZ Aprl 9, 996 Abstract A fnte expanson of the exponental

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

1. Estimation, Approximation and Errors Percentages Polynomials and Formulas Identities and Factorization 52

1. Estimation, Approximation and Errors Percentages Polynomials and Formulas Identities and Factorization 52 ontents ommonly Used Formulas. Estmaton, pproxmaton and Errors. Percentages. Polynomals and Formulas 8. Identtes and Factorzaton. Equatons and Inequaltes 66 6. Rate and Rato 8 7. Laws of Integral Indces

More information

Quantum Mechanics for Scientists and Engineers. David Miller

Quantum Mechanics for Scientists and Engineers. David Miller Quantum Mechancs for Scentsts and Engneers Davd Mller Types of lnear operators Types of lnear operators Blnear expanson of operators Blnear expanson of lnear operators We know that we can expand functons

More information

Lecture 3. Ax x i a i. i i

Lecture 3. Ax x i a i. i i 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

More information

Norms, Condition Numbers, Eigenvalues and Eigenvectors

Norms, Condition Numbers, Eigenvalues and Eigenvectors Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b

More information

The optimal delay of the second test is therefore approximately 210 hours earlier than =2.

The optimal delay of the second test is therefore approximately 210 hours earlier than =2. THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

w ). Then use the Cauchy-Schwartz inequality ( v w v w ).] = in R 4. Can you find a vector u 4 in R 4 such that the

w ). Then use the Cauchy-Schwartz inequality ( v w v w ).] = in R 4. Can you find a vector u 4 in R 4 such that the Math S-b Summer 8 Homework #5 Problems due Wed, July 8: Secton 5: Gve an algebrac proof for the trangle nequalty v+ w v + w Draw a sketch [Hnt: Expand v+ w ( v+ w) ( v+ w ) hen use the Cauchy-Schwartz

More information

Linear Feature Engineering 11

Linear Feature Engineering 11 Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

Properties of the Determinant Function

Properties of the Determinant Function Properties of the Determinant Function MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Overview Today s discussion will illuminate some of the properties of the determinant:

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

UNIT 4 EXTENDING THE NUMBER SYSTEM Lesson 3: Operating with Complex Numbers Instruction

UNIT 4 EXTENDING THE NUMBER SYSTEM Lesson 3: Operating with Complex Numbers Instruction Prerequste Sklls Ths lesson requres the use of the followng sklls: understandng that multplyng the numerator and denomnator of a fracton by the same quantty produces an equvalent fracton multplyng complex

More information

18.781: Solution to Practice Questions for Final Exam

18.781: Solution to Practice Questions for Final Exam 18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,

More information

Lecture Notes Introduction to Cluster Algebra

Lecture Notes Introduction to Cluster Algebra Lecture Notes Introducton to Cluster Algebra Ivan C.H. Ip Updated: Ma 7, 2017 3 Defnton and Examples of Cluster algebra 3.1 Quvers We frst revst the noton of a quver. Defnton 3.1. A quver s a fnte orented

More information

Ballot Paths Avoiding Depth Zero Patterns

Ballot Paths Avoiding Depth Zero Patterns Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,

More information

Calculation of time complexity (3%)

Calculation of time complexity (3%) Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add

More information

Determinants Containing Powers of Generalized Fibonacci Numbers

Determinants Containing Powers of Generalized Fibonacci Numbers 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal

More information

Chapter 11: Simple Linear Regression and Correlation

Chapter 11: Simple Linear Regression and Correlation Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests

More information

8.6 The Complex Number System

8.6 The Complex Number System 8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want

More information

1 Generating functions, continued

1 Generating functions, continued Generatng functons, contnued. Generatng functons and parttons We can make use of generatng functons to answer some questons a bt more restrctve than we ve done so far: Queston : Fnd a generatng functon

More information

Lecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2

Lecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2 P470 Lecture 6/7 (February 10/1, 014) DIRAC EQUATION The non-relatvstc Schrödnger equaton was obtaned by notng that the Hamltonan H = P (1) m can be transformed nto an operator form wth the substtutons

More information

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence

More information

Indeterminate pin-jointed frames (trusses)

Indeterminate pin-jointed frames (trusses) Indetermnate pn-jonted frames (trusses) Calculaton of member forces usng force method I. Statcal determnacy. The degree of freedom of any truss can be derved as: w= k d a =, where k s the number of all

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

A property of the elementary symmetric functions

A property of the elementary symmetric functions Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

LECTURE 9 CANONICAL CORRELATION ANALYSIS

LECTURE 9 CANONICAL CORRELATION ANALYSIS LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be

More information

WINTER 2017 EXAMINATION

WINTER 2017 EXAMINATION (ISO/IEC - 700-00 Certfed) WINTER 07 EXAMINATION Model wer ject Code: Important Instructons to Eamners: ) The answers should be eamned by key words and not as word-to-word as gven n the model answer scheme.

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

NOTES ON SIMPLIFICATION OF MATRICES

NOTES ON SIMPLIFICATION OF MATRICES NOTES ON SIMPLIFICATION OF MATRICES JONATHAN LUK These notes dscuss how to smplfy an (n n) matrx In partcular, we expand on some of the materal from the textbook (wth some repetton) Part of the exposton

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim Causal Damonds M. Aghl, L. Bombell, B. Plgrm Introducton The correcton to volume of a causal nterval due to curvature of spacetme has been done by Myrhem [] and recently by Gbbons & Solodukhn [] and later

More information

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013 ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run

More information

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan

More information

Solution Thermodynamics

Solution Thermodynamics Soluton hermodynamcs usng Wagner Notaton by Stanley. Howard Department of aterals and etallurgcal Engneerng South Dakota School of nes and echnology Rapd Cty, SD 57701 January 7, 001 Soluton hermodynamcs

More information

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs

More information

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES COMPUTATIONAL FLUID DYNAMICS: FDM: Appromaton of Second Order Dervatves Lecture APPROXIMATION OF SECOMD ORDER DERIVATIVES. APPROXIMATION OF SECOND ORDER DERIVATIVES Second order dervatves appear n dffusve

More information

The Fundamental Theorem of Algebra. Objective To use the Fundamental Theorem of Algebra to solve polynomial equations with complex solutions

The Fundamental Theorem of Algebra. Objective To use the Fundamental Theorem of Algebra to solve polynomial equations with complex solutions 5-6 The Fundamental Theorem of Algebra Content Standards N.CN.7 Solve quadratc equatons wth real coeffcents that have comple solutons. N.CN.8 Etend polnomal denttes to the comple numbers. Also N.CN.9,

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Singular Value Decomposition: Theory and Applications

Singular Value Decomposition: Theory and Applications Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

P A = (P P + P )A = P (I P T (P P ))A = P (A P T (P P )A) Hence if we let E = P T (P P A), We have that

P A = (P P + P )A = P (I P T (P P ))A = P (A P T (P P )A) Hence if we let E = P T (P P A), We have that Backward Error Analyss for House holder Reectors We want to show that multplcaton by householder reectors s backward stable. In partcular we wsh to show fl(p A) = P (A) = P (A + E where P = I 2vv T s the

More information

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.

More information

Linear Regression Analysis: Terminology and Notation

Linear Regression Analysis: Terminology and Notation ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented

More information

REDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].

REDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1]. REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß

More information

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions to exam in SF1811 Optimization, Jan 14, 2015 Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable

More information

If the solution does not follow a logical thought process, it will be assumed in error.

If the solution does not follow a logical thought process, it will be assumed in error. Group # Please revew the followng statement: I certfy that I have not gven unauthorzed ad nor have I receved ad n the completon of ths exam. Sgnature: INSTRUCTIONS Begn each problem n the space provded

More information

One-sided finite-difference approximations suitable for use with Richardson extrapolation

One-sided finite-difference approximations suitable for use with Richardson extrapolation Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,

More information

1 GSW Iterative Techniques for y = Ax

1 GSW Iterative Techniques for y = Ax 1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn

More information

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem. prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove

More information

SIMPLE LINEAR REGRESSION

SIMPLE LINEAR REGRESSION Smple Lnear Regresson and Correlaton Introducton Prevousl, our attenton has been focused on one varable whch we desgnated b x. Frequentl, t s desrable to learn somethng about the relatonshp between two

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product 12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Exercises. 18 Algorithms

Exercises. 18 Algorithms 18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)

More information

1 Vectors over the complex numbers

1 Vectors over the complex numbers Vectors for quantum mechancs 1 D. E. Soper 2 Unversty of Oregon 5 October 2011 I offer here some background for Chapter 1 of J. J. Sakura, Modern Quantum Mechancs. 1 Vectors over the complex numbers What

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information