Walk Like a Mathematician Learning Task:

Similar documents
1 Introduction to Modulo 7 Arithmetic

Instructions for Section 1

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

Present state Next state Q + M N

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

TOPIC 5: INTEGRATION

QUESTIONS BEGIN HERE!

Linear Algebra Existence of the determinant. Expansion according to a row.

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

Floating Point Number System -(1.3)

Floating Point Number System -(1.3)

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

First order differential equation Linear equation; Method of integrating factors

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Chem 104A, Fall 2016, Midterm 1 Key

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Minimum Spanning Trees

Examples and applications on SSSP and MST

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

CONTINUITY AND DIFFERENTIABILITY

Basic Polyhedral theory

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

The Matrix Exponential

CSI35 Chapter 11 Review

Seven-Segment Display Driver

Last time: introduced our first computational model the DFA.

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.

The Matrix Exponential

Section 3: Antiderivatives of Formulas

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

QUESTIONS BEGIN HERE!

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

OpenMx Matrices and Operators

y = 2xe x + x 2 e x at (0, 3). solution: Since y is implicitly related to x we have to use implicit differentiation: 3 6y = 0 y = 1 2 x ln(b) ln(b)

Mathematics. Mathematics 3. hsn.uk.net. Higher HSN23000

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

Ch 1.2: Solutions of Some Differential Equations

Case Study VI Answers PHA 5127 Fall 2006

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Limits Indeterminate Forms and L Hospital s Rule

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

Numbering Boundary Nodes

DFA (Deterministic Finite Automata) q a

Errata for Second Edition, First Printing

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9

Relation between Fourier Series and Transform

Practice Final Exam. 3.) What is the 61st term of the sequence 7, 11, 15, 19,...?

Errata for Second Edition, First Printing

COMP108 Algorithmic Foundations

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

Garnir Polynomial and their Properties

64. A Conic Section from Five Elements.

temperature T speed v time t density ρ scalars may be constant or may be variable yes distributive a(b+c) = ab+ac

CS 461, Lecture 17. Today s Outline. Example Run

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function

CS September 2018

10. EXTENDING TRACTABILITY

a 1and x is any real number.

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Week 3: Connected Subgraphs

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Schematic of a mixed flow reactor (both advection and dispersion must be accounted for)

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

ME 321 Kinematics and Dynamics of Machines S. Lambert Winter 2002

0.1. Exercise 1: the distances between four points in a graph

The Equitable Dominating Graph

13. Binary tree, height 4, eight terminal vertices 14. Full binary tree, seven vertices v 7 v13. v 19

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

as a derivative. 7. [3.3] On Earth, you can easily shoot a paper clip straight up into the air with a rubber band. In t sec

Grade 12 (MCV4UE) AP Calculus Page 1 of 5 Derivative of a Function & Differentiability

Section 10.4 Connectivity (up to paths and isomorphism, not including)

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the

Computing and Communications -- Network Coding

Minimum Spanning Trees

Fractions. Mathletics Instant Workbooks. Simplify. Copyright

Abstract Interpretation: concrete and abstract semantics

Weighted Matching and Linear Programming

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

VLSI Testing Assignment 2

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations.

Transcription:

Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics inclu solvin systms of qutions, finin th r of trinls ivn th coorints of th vrtics, finin qutions for rphs ivn sts of orr pirs, n trminin informtion contin in vrtx rphs. In orr to rss ths typs of problms, it is ncssry to unrstn mor bout mtrix oprtions n proprtis; n, to us tchnoloy to prform som of th computtions. Mtrix oprtions hv mny of th sm proprtis s rl numbrs. Thr r mor rstrictions on mtrics thn on rl numbrs, howvr, bcus of th ruls ovrnin mtrix ition, subtrction, n multipliction. Som of th rl numbr proprtis which r mor usful whn consirin mtrix proprtis r list blow. Lt, b, n c b rl numbrs ADDITION PROPERTIES MULTIPLICATION PROPERTIES COMMUTATIVE + b = b + b = b ASSOCIATIVE ( + b) + c = + (b + c) (b)c = (bc) IDENTITY Thr xists uniqu rl Thr xists uniqu rl numbr zro, 0, such tht numbr on,, such tht + 0 = 0 + = * = * = INVERSE For ch rl numbr, For ch nonzro rl numbr thr is uniqu rl, thr is uniqu rl numbr - such tht numbr such tht + (-) = (-) + = 0 ( ) = ( ) = Mthmtics : Mtrics Richr Woos, Stt School Suprintnnt July 205 P 2 of 70

Gori Dprtmnt of Euction Th followin is st of mtrics without row n column lbls. Us ths mtrics to complt th problms. D = 2 0 E = 2 0 4 0 2 F = 5 2 G = 0 2 H = 2 0 0 4 5 2 = 4 2 I 0 0 J = K = 0 2 L = 0 0 0 5 2. In this problm, you will trmin whthr mtrix ition n mtrix multipliction r commuttiv by prformin oprtions n comprin th rsults. D + J = J + D?. Dos [ ] [ ] [ ] [ ] b. Dos [ E ] [ K ] = [ K ] + [ E] +? c. Is mtrix ition commuttiv? Why or why not?. Dos [ D ] [ J ] [ J ]*[ D] * =?. Dos [ E ] [ H ] [ H ]*[ E] * =? f. Is mtrix multipliction commuttiv? Why or why not? Mthmtics : Mtrics Richr Woos, Stt School Suprintnnt July 205 P of 70

Gori Dprtmnt of Euction 2. Ar mtrix ition n mtrix multipliction ssocitiv? D + J + L = D + J + L?. Dos ([ ] [ ]) [ ] [ ] ([ ] [ ]) b. Is mtrix ition ssocitiv? Why or why not? c. Dos ([ D ] [ J ]) *[ L] [ D] *([ J ]*[ L] ) * =?. Is mtrix multipliction ssocitiv? Why or why not?. Is thr zro or intity, 0, for ition in mtrics? If so, wht os zro mtrix look lik? Provi n xmpl illustrtin th itiv intity proprty of mtrics. 4. Do mtrics hv on or n intity, I, for multipliction? If so wht os n intity mtrix look lik; is it uniqu; n, os it stisfy th proprty * = * =?. Multiply [ E ]*[ I ] n [ I ]*[ E]. Dscrib wht you s. 5. Fin [D]*[G] n [G]*[D]. Dscrib wht you s. D n G r cll invrs mtrics. In orr for mtrix to hv n invrs, it must stisfy two conitions.. Th mtrix must b squr mtrix. 2. No row of th mtrix cn b multipl of ny othr row. Both D n G r 2x2 mtrics; n, th rows in D r not multipls of ch othr. Th sm is tru of G. Th nottion normlly us for mtrix n its invrs is D n D - or G n G -. Mthmtics : Mtrics Richr Woos, Stt School Suprintnnt July 205 P 4 of 70

Gori Dprtmnt of Euction 6. Multiply G by n look t th rsult. Cn you s ny rltionship btwn D n th rsult? Th followin formul cn b us to fin th invrs of 2x2 mtrix. Givn mtrix A whr th rows of A r not multipls of ch othr: b A = thn A - = c bc c b. Fin th invrs of mtrix J from th mtrics list bov. Vrify tht J n J - r invrss. b. Now your tchr will show you how to us tchnoloy to fin th invrs of this mtrix. 7. A uniqu numbr ssocit with vry squr mtrix is cll th trminnt. Only squr mtrics hv trminnts. A. To fin trminnts of 2x2 mtrics by hn us th followin procur. b trminnt(a) = t(a) = A = = bc c. Fin D b. Fin J c. Cn you fin F? Why or why not? B. On wy to fin trminnts of x mtrics us th followin procur: ivn mtrix b c b c b B = f, rwrit th mtrix n rpt columns n 2 to t f. h i h i h Now multiply n combin proucts ccorin to th followin pttrns. Mthmtics : Mtrics Richr Woos, Stt School Suprintnnt July 205 P 5 of 70

Gori Dprtmnt of Euction b h c f i b h n b h c f i b h = t(b) = i + bf + ch c fh bi.. Fin E b. Fin K c. Now your tchr will show you how to us tchnoloy to fin th trminnts of ths mtrics. 8. Th trminnt of mtrix cn b us to fin th r of trinl. If (x, y ), (x 2, y 2 ), n (x, y ) r vrtics of trinl, th r of th trinl is x y Ar = x2 y2. 2 x y. Givn trinl with vrtics (-, 0), (, ), n (5, 0), fin th r usin th trminnt formul. Vrify tht r you foun is corrct usin omtric formuls. Mthmtics : Mtrics Richr Woos, Stt School Suprintnnt July 205 P 6 of 70

Gori Dprtmnt of Euction b. Suppos you r finin th r of trinl with vrtics (-, -), (4, 7), n (9, -6). You fin hlf th trminnt to b -52.5 n your prtnr works th sm problm n ts +52.5. Aftr chckin both solutions, you ch hv on your work corrctly. How cn you xplin this iscrpncy? c. Suppos nothr trinl with vrtics (, ), (4, 2), n (7, ) ivs n r of 0. Wht o you know bout th trinl n th points?. A rnr is tryin to fin trinulr r bhin his hous tht ncloss 750 squr ft. H hs plc th first two fnc posts t (0, 50) n t (40, 0). Th finl fnc post is on th proprty lin t y = 00. Fin th point whr th rnr cn plc th finl fnc post. Mthmtics : Mtrics Richr Woos, Stt School Suprintnnt July 205 P 7 of 70