,\ I. . <- c}. " C:-)' ) I- p od--- -;::: 'J.--- d, cl cr -- I. ( I) Cl c,\. c. 1\'0\ ~ '~O'-_. e ~.\~\S

Size: px
Start display at page:

Download ",\ I. . <- c}. " C:-)' ) I- p od--- -;::: 'J.--- d, cl cr -- I. ( I) Cl c,\. c. 1\'0\ ~ '~O'-_. e ~.\~\S"

Transcription

1 Math Test 1 Name: An d {"0v\ ( _ roj ~ ed Date: l'( ~0 { 1\ Fall (to Pts) Let S == {I, 2, 3,4, 5,6,7,8,9, 10}. of each of the following types of mappings, provide justification for why the example satisfies the conditions. // ::: -.J r l/... a. Give an example a bijection a : S ~ s. ~{..\ ~ \Ji " (..' 1)') I '" ):( 0' Vl1r V\ ->\('~ j J) -:.' d' _ -:., 11 <):' / b. Describe your above bijection as a permutation of th ments of S in 2-row notation and also in cyclic notation.,-. ( I. 2. S '-1- S <:, '1 '3 "1 \ ~ '2- 'S '-t S ' I ~ 0 ) ( I) Cl c,\. c. 1\'0\ ~ '~O'-_ **** The 2 theorems below will be used for reference **** Theorem 2.1 Assume that ex: S ~ T and {3( T ~ U. (a) If ex and (3 are onto, then (3 0 ex is onto. I (b) If {3 0 ex is onto, then {3 is onto. (c) If ex and,6 are one-to-one, then j3 0 ex is ohe-to-one., (d) If j3 0 ex is one-to-one, then ex is one-to-one. Theorem 2.2 A mapping is invertible if and only if it is both one-to-one and onto. 2. (5 Pts) Particularly in light of Theorem 2.2, the definition of an invertible mapping cannot be simply that it is one-to-one and onto (although as the theorem proports this is logically +5 equivlent). Thus, provide the formal definitions of inverse and invertible assumed in our,\ I. ~ ~. <- c}. " C:-)' ) I-,, ;>;) f ~$ 11-e.. 'J,r. J ea~ 0" Ii-. textbook., ~ 1 ;.. p od--- -;::: 'J.--- d, cl cr -- I... ~-r Ls V A tvl~l?pi "') i ) II/',!l,{.L1-1r) 1e -.1-1L.c 1V\'Je- ')e. e ~.\~\S

2 !. J ' ft, If '!'\-; ~I ""J i-. <..1.' l.".r.' C-'v-d ';). 0 "" 1 rr~(,,, l ' J 1':"-1.,) ~,- f~ t-..,..~ (), o.... fc-' I 7 '" S,~.u. ''i) - -;,. e., - ' I r.'- '. >\., 'e-\'\'r.p...e- h Q, \~. ;...J -,. I J.. If" "" 0 ' r '~)) ~ ~l!'h' / ft.'. 1(..I.!(e.".',Pv/x" S '~1 '< i' t. Qi) 1'rz:,S''''N,~~Q''.,..U.. t :;'o! i (>--<-- h ki_'l.~ ' l,," " ', J.,;.. l. \J:)" o,c..l.., \"'r II J' ' U;, ce--- "ef " ' ' L \ 1\ O S...,- ty'4 "1 ""-v-.'b- to }V'" ') : \ n I ', ~. ~ I. '\ 3. 1(81 ts) Assume that a: S --t T nd /3: T --t U. Use Theorems 2.1 & 2.2 to prove the following: (a) If a and /3 are invertible, then /3 0 a is invertible. (b) If /3 0 a is invertible, then /3 is onto and a is one-to-one. A.:s.s,~J".e '"")..". t<?j /: ( -!. I ' \ J'!Jl ~. ~./,-" +0 ~~/'.,. -')/\{ 'r-o <QV\-e ~ +0 ~ Ov: -c :J..v.,..~ c A'.'~ ~..' I<~' (.. A -,,,r..,,i b~ ;.. " ~v\':'ij,i I..N~, (l \, ~ [. r '~' tl \ 1-4. (8 Pts) For each equation below: Does * define an operation on the set of integers? Explain your answers. 4b.

3 Name_...:... l'_, _ ).:...:._ ( ''. _ 'V o.....;.-'-"e \ ~ =---.J('--_ Page 3 S. (8 Pts) Let Q = { m 1m, n are integers with n =I- O} be the set of rational numbers n and * be the operation on Q defined by Mb = ab + 3 for all a, b E Q. Sa. Determine whether the operation * is commutative. If not, give a count~rexample. i a _ ::'- ' JU~ ",.}. o S---..J b-::;. ~ \"'e"~ s-to. ~,> CO I\'\-"'\.Q. ~ c~,; y\ L.'0f' IS" I6u C;v.~.I')i.\l ;(. ~ c::o. ~~:t.. ~ ~-.\- ~ J)' -, 1'\ :; f' So ::>,)~ d b :x-~;:..i >f- ~ ~ ~..,.<;. '5 ''1 S t" ( ' Sb. ~etermine whether th,e operation * is associative. If not, give a counterexamj?le. >f s 'd.sc,00~~ /:- 1\ o-. ~ {~ ~c.') -- ~ -l"b/,' C,.i..)(.ad" ~ \ b, c. t:: ~. ) +/j _ \.~ ~ 1:;~?,,_..!o 0. t 0-.. &>*c..)~ ",'.. a..r- ~-ts ~o.. l bg -t--o -j-? ';::: a...b'-+~o.. rs' ( q \:;,) *c. :::- (0lo-r~ G- ~(~'o n)c.. + s ~.3bc. + '3, <=- '3 Q", h'e....>- 3<: ~ --; -4- ~!a \'-' S~~ ~ / >A.) no1- ";.). '3 ':- c. ~~ '<I.e.. 6. (9 Pts) Given here is a table that defines an operation on the set S = {a, b, c}. * a b c a a a a b c a b c a c c 6a. Explain why * given in the above table is an operation on S. e (. '4,v.<;~_ h-. ~(e ~<; [.\01",,' <(.. / {f 6b. Is the operation * commutative? Explain. -f= ~) V\ D 1- C:..o...,..,. "'- ~ Jr., Ie: O. y b -:f. b- 0. :e. CA* b -;: ~ ~ y. ~ ~ C! 6c. Does the operation * have an identity element? If yes, which element is the identity element? ~l~,-th U~~ ~. I..- ~,Je,.V\.f,1 d v~e.~-'r ' r, -.fo ':~. ','~ JS' ;/, ' c ~'\, t~... ";). J~.

4 (c_ ""'.'..(f1' L 8. (8 Pts) Explain why each of the following sets with the given operation is not a group. 8a. The set of all integers Z under subtraction. -:z, L I...l. oeul1j:.e j I j '3 Q---- \.II. V\..~ ~ ( SV\':.H('C C. <"I.;) '\ 1'-: V'II), \ - '" -\ " \ ) 8b. The set of all rational numbers, Q = {m 1m, nez, n i= O}, under multiplication. (n J n VV\ ~ ttf::\ \A)1".Ue.. n;;/:-o \'1 \ \ ', ~ 0 t- -; L/1QV'. ~ 'C...--' IJ.?I. I Y. "f1 &< ~ ~ :~c:: o;, ;~.: ' :ro.'~l~u: "A \h, \~"~r ~ ~. VV\ ~OV0e"Qj v. y V, 9. (4 Pts)~~ or False: If G is a group under operation *, then G has a unique identity. / ~ r False: If G is a group under operation *, then every element of G has a UnIque Inverse. -1-1

5 PageS 10. (8 Pts) Suppose the partially completed table below is a Cayley group table. Fill in the blank entries. * e a b c e e a b c a 0\ b C- e, / b ~ L- " t{ c v e- O( b 11. (12 Pts) In parts a and b, write each permutation as a single cycle or as a product of disjoint cycles. 12. (8 Pts) The positive rationals Q+ with the binary operation * defined by a*b = ~g form a group.. + a. Find the identity element of this group. \j1 de.~-~, h~... (J~ ; Je~~~ -I\.. C( {.P 1..$ e. ~ (Q S~~ ~ ". r.;, I) - 0 \I.0-0 p, fj\~ I. \ 10,., ~ -.. " '- -. ~ c~<o. C :'C>' f' ~! ~ 0"" \0"10. ~ ~ (v 'J..''-'f '1 t;- fr '" r-~~ -= l\, y,", <.1e r Pf ffl 10 w( ~S-\/~ e r '& d h. f h I 4 <?.n (} _l.~ "; 9~ "\ \' ( e'l.l 0, e:. f;jf- \ 1L~(i- ls ~, b F In t e Inverse 0 tee ement g. '!:::> 0' _ r y, '\ "1.--'\ v~... b ec;t ~ o ~A~~ b ~- " :: (J :::;- e I

6 Evaluate 0:10:2 = c<.. / ) Evaluate a2a2 = DZ I Evaluate a.la 2 = 1')("1 True or@it is the case that al and a2 are inverses. 13c. Complete the following table for H. al a2 a3 arj al 0:1 0:2 0:3 0:4 a2 a2 rj I cz LY Jvl.. a3 a3 0(1{ C! ~l- / 0:4 a4 cf ') d- )- Cl I List the elements of the following subset of H.(Hint recall that permutations are mappings) 13d. {a E HI a(l) = 1 and a(3) = 3} c{j t.,/ -,.J, '-~, - -\

Mathematics 222a Quiz 2 CODE 111 November 21, 2002

Mathematics 222a Quiz 2 CODE 111 November 21, 2002 Student s Name [print] Student Number Mathematics 222a Instructions: Print your name and student number at the top of this question sheet. Print your name and your instructor s name on the answer sheet.

More information

A L A BA M A L A W R E V IE W

A L A BA M A L A W R E V IE W A L A BA M A L A W R E V IE W Volume 52 Fall 2000 Number 1 B E F O R E D I S A B I L I T Y C I V I L R I G HT S : C I V I L W A R P E N S I O N S A N D TH E P O L I T I C S O F D I S A B I L I T Y I N

More information

Groups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group

Groups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group C H A P T E R t h r e E Groups Introduction Some of the standard topics in elementary group theory are treated in this chapter: subgroups, cyclic groups, isomorphisms, and homomorphisms. In the development

More information

RELATIONS AND FUNCTIONS

RELATIONS AND FUNCTIONS For more important questions visit : www.4ono.com CHAPTER 1 RELATIONS AND FUNCTIONS IMPORTANT POINTS TO REMEMBER Relation R from a set A to a set B is subset of A B. A B = {(a, b) : a A, b B}. If n(a)

More information

i;\-'i frz q > R>? >tr E*+ [S I z> N g> F 'x sa :r> >,9 T F >= = = I Y E H H>tr iir- g-i I * s I!,i --' - = a trx - H tnz rqx o >.F g< s Ire tr () -s

i;\-'i frz q > R>? >tr E*+ [S I z> N g> F 'x sa :r> >,9 T F >= = = I Y E H H>tr iir- g-i I * s I!,i --' - = a trx - H tnz rqx o >.F g< s Ire tr () -s 5 C /? >9 T > ; '. ; J ' ' J. \ ;\' \.> ). L; c\ u ( (J ) \ 1 ) : C ) (... >\ > 9 e!) T C). '1!\ /_ \ '\ ' > 9 C > 9.' \( T Z > 9 > 5 P + 9 9 ) :> : + (. \ z : ) z cf C : u 9 ( :!z! Z c (! $ f 1 :.1 f.

More information

::::l<r/ L- 1-1>(=-ft\ii--r(~1J~:::: Fo. l. AG -=(0,.2,L}> M - &-c ==- < ) I) ~..-.::.1 ( \ I 0. /:rf!:,-t- f1c =- <I _,, -2...

::::l<r/ L- 1-1>(=-ft\ii--r(~1J~:::: Fo. l. AG -=(0,.2,L}> M - &-c ==- < ) I) ~..-.::.1 ( \ I 0. /:rf!:,-t- f1c =- <I _,, -2... Math 3298 Exam 1 NAME: SCORE: l. Given three points A(I, l, 1), B(l,;2, 3), C(2, - l, 2). (a) Find vectors AD, AC, nc. (b) Find AB+ DC, AB - AC, and 2AD. -->,,. /:rf!:,-t- f1c =-

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

APPH 4200 Physics of Fluids

APPH 4200 Physics of Fluids APPH 42 Physics of Fluids Problem Solving and Vorticity (Ch. 5) 1.!! Quick Review 2.! Vorticity 3.! Kelvin s Theorem 4.! Examples 1 How to solve fluid problems? (Like those in textbook) Ç"Tt=l I $T1P#(

More information

Tausend Und Eine Nacht

Tausend Und Eine Nacht Connecticut College Digital Commons @ Connecticut College Historic Sheet Music Collection Greer Music Library 87 Tausend Und Eine Nacht Johann Strauss Follow this and additional works at: https:digitalcommonsconncolledusheetmusic

More information

176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s

176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s A g la di ou s F. L. 462 E l ec tr on ic D ev el op me nt A i ng er A.W.S. 371 C. A. M. A l ex an de r 236 A d mi ni st ra ti on R. H. (M rs ) A n dr ew s P. V. 326 O p ti ca l Tr an sm is si on A p ps

More information

P a g e 3 6 of R e p o r t P B 4 / 0 9

P a g e 3 6 of R e p o r t P B 4 / 0 9 P a g e 3 6 of R e p o r t P B 4 / 0 9 p r o t e c t h um a n h e a l t h a n d p r o p e r t y fr om t h e d a n g e rs i n h e r e n t i n m i n i n g o p e r a t i o n s s u c h a s a q u a r r y. J

More information

I-1. rei. o & A ;l{ o v(l) o t. e 6rf, \o. afl. 6rt {'il l'i. S o S S. l"l. \o a S lrh S \ S s l'l {a ra \o r' tn $ ra S \ S SG{ $ao. \ S l"l. \ (?

I-1. rei. o & A ;l{ o v(l) o t. e 6rf, \o. afl. 6rt {'il l'i. S o S S. ll. \o a S lrh S \ S s l'l {a ra \o r' tn $ ra S \ S SG{ $ao. \ S ll. \ (? >. 1! = * l >'r : ^, : - fr). ;1,!/!i ;(?= f: r*. fl J :!= J; J- >. Vf i - ) CJ ) ṯ,- ( r k : ( l i ( l 9 ) ( ;l fr i) rf,? l i =r, [l CB i.l.!.) -i l.l l.!. * (.1 (..i -.1.! r ).!,l l.r l ( i b i i '9,

More information

Kevin James. MTHSC 3110 Section 2.2 Inverses of Matrices

Kevin James. MTHSC 3110 Section 2.2 Inverses of Matrices MTHSC 3110 Section 2.2 Inverses of Matrices Definition Suppose that T : R n R m is linear. We will say that T is invertible if for every b R m there is exactly one x R n so that T ( x) = b. Note If T is

More information

MATH 433 Applied Algebra Lecture 22: Review for Exam 2.

MATH 433 Applied Algebra Lecture 22: Review for Exam 2. MATH 433 Applied Algebra Lecture 22: Review for Exam 2. Topics for Exam 2 Permutations Cycles, transpositions Cycle decomposition of a permutation Order of a permutation Sign of a permutation Symmetric

More information

Solutions to Assignment 3

Solutions to Assignment 3 Solutions to Assignment 3 Question 1. [Exercises 3.1 # 2] Let R = {0 e b c} with addition multiplication defined by the following tables. Assume associativity distributivity show that R is a ring with

More information

Matrix Algebra. Matrix Algebra. Chapter 8 - S&B

Matrix Algebra. Matrix Algebra. Chapter 8 - S&B Chapter 8 - S&B Algebraic operations Matrix: The size of a matrix is indicated by the number of its rows and the number of its columns. A matrix with k rows and n columns is called a k n matrix. The number

More information

* 8 Groups, with Appendix containing Rings and Fields.

* 8 Groups, with Appendix containing Rings and Fields. * 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that

More information

5 Group theory. 5.1 Binary operations

5 Group theory. 5.1 Binary operations 5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1

More information

OH BOY! Story. N a r r a t iv e a n d o bj e c t s th ea t e r Fo r a l l a g e s, fr o m th e a ge of 9

OH BOY! Story. N a r r a t iv e a n d o bj e c t s th ea t e r Fo r a l l a g e s, fr o m th e a ge of 9 OH BOY! O h Boy!, was or igin a lly cr eat ed in F r en ch an d was a m a jor s u cc ess on t h e Fr en ch st a ge f or young au di enc es. It h a s b een s een by ap pr ox i ma t ely 175,000 sp ect at

More information

Algebraic Structures Exam File Fall 2013 Exam #1

Algebraic Structures Exam File Fall 2013 Exam #1 Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write

More information

Math 430 Final Exam, Fall 2008

Math 430 Final Exam, Fall 2008 IIT Dept. Applied Mathematics, December 9, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 430 Final Exam, Fall 2008 Grades should be posted Friday 12/12. Have a good break, and don t forget

More information

Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9

Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Section 0. Sets and Relations Subset of a set, B A, B A (Definition 0.1). Cartesian product of sets A B ( Defintion 0.4). Relation (Defintion 0.7). Function,

More information

'NOTAS"CRITICAS PARA UNA TEDRIA DE M BUROCRACIA ESTATAL * Oscar Oszlak

'NOTASCRITICAS PARA UNA TEDRIA DE M BUROCRACIA ESTATAL * Oscar Oszlak OVí "^Ox^ OqAÍ"^ Dcument SD-11 \ 'NOTAS"CRTCAS PARA UNA TEDRA DE M BUROCRACA ESTATAL * Oscr Oszlk * El presente dcument que se reprduce pr us exclusv de ls prtcpntes de curss de Prrms de Cpctcón, se h

More information

MAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to :

MAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to : MAC 0 Module Systems of Linear Equations and Matrices II Learning Objectives Upon completing this module, you should be able to :. Find the inverse of a square matrix.. Determine whether a matrix is invertible..

More information

~,. :'lr. H ~ j. l' ", ...,~l. 0 '" ~ bl '!; 1'1. :<! f'~.., I,," r: t,... r':l G. t r,. 1'1 [<, ."" f'" 1n. t.1 ~- n I'>' 1:1 , I. <1 ~'..

~,. :'lr. H ~ j. l' , ...,~l. 0 ' ~ bl '!; 1'1. :<! f'~.., I,, r: t,... r':l G. t r,. 1'1 [<, . f' 1n. t.1 ~- n I'>' 1:1 , I. <1 ~'.. ,, 'l t (.) :;,/.I I n ri' ' r l ' rt ( n :' (I : d! n t, :?rj I),.. fl.),. f!..,,., til, ID f-i... j I. 't' r' t II!:t () (l r El,, (fl lj J4 ([) f., () :. -,,.,.I :i l:'!, :I J.A.. t,.. p, - ' I I I

More information

Math /Foundations of Algebra/Fall 2017 Foundations of the Foundations: Proofs

Math /Foundations of Algebra/Fall 2017 Foundations of the Foundations: Proofs Math 4030-001/Foundations of Algebra/Fall 017 Foundations of the Foundations: Proofs A proof is a demonstration of the truth of a mathematical statement. We already know what a mathematical statement is.

More information

R e p u b lic o f th e P h ilip p in e s. R e g io n V II, C e n tra l V isa y a s. C ity o f T a g b ila ran

R e p u b lic o f th e P h ilip p in e s. R e g io n V II, C e n tra l V isa y a s. C ity o f T a g b ila ran R e p u b l f th e P h lp p e D e p rt e t f E d u t R e V, e tr l V y D V N F B H L ty f T b l r Ju ly, D V N M E M R A N D U M N. 0,. L T F E N R H G H H L F F E R N G F R 6 M P L E M E N T A T N T :,

More information

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed. Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply

More information

MATH 2050 Assignment 4 Fall Due: Thursday. u v v 2 v = P roj v ( u) = P roj u ( v) =

MATH 2050 Assignment 4 Fall Due: Thursday. u v v 2 v = P roj v ( u) = P roj u ( v) = MATH 5 Assignment 4 Fall 8 Due: Thursday [5]. Let u = and v =. Find the projection of u onto v; and the projection of v onto u respectively. ANS: The projection of u onto v is P roj v ( u) = u v v. Note

More information

Relations. Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations. Reading (Epp s textbook)

Relations. Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations. Reading (Epp s textbook) Relations Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations Reading (Epp s textbook) 8.-8.3. Cartesian Products The symbol (a, b) denotes the ordered

More information

Written Homework # 4 Solution

Written Homework # 4 Solution Math 516 Fall 2006 Radford Written Homework # 4 Solution 12/10/06 You may use results form the book in Chapters 1 6 of the text, from notes found on our course web page, and results of the previous homework.

More information

Math 430 Exam 2, Fall 2008

Math 430 Exam 2, Fall 2008 Do not distribute. IIT Dept. Applied Mathematics, February 16, 2009 1 PRINT Last name: Signature: First name: Student ID: Math 430 Exam 2, Fall 2008 These theorems may be cited at any time during the test

More information

MATH 2030: MATRICES. Example 0.2. Q:Define A 1 =, A. 3 4 A: We wish to find c 1, c 2, and c 3 such that. c 1 + c c

MATH 2030: MATRICES. Example 0.2. Q:Define A 1 =, A. 3 4 A: We wish to find c 1, c 2, and c 3 such that. c 1 + c c MATH 2030: MATRICES Matrix Algebra As with vectors, we may use the algebra of matrices to simplify calculations. However, matrices have operations that vectors do not possess, and so it will be of interest

More information

Solutions of Assignment 10 Basic Algebra I

Solutions of Assignment 10 Basic Algebra I Solutions of Assignment 10 Basic Algebra I November 25, 2004 Solution of the problem 1. Let a = m, bab 1 = n. Since (bab 1 ) m = (bab 1 )(bab 1 ) (bab 1 ) = ba m b 1 = b1b 1 = 1, we have n m. Conversely,

More information

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1 2 3 style total Math 415 Examination 3 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. The rings

More information

MATH 326: RINGS AND MODULES STEFAN GILLE

MATH 326: RINGS AND MODULES STEFAN GILLE MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called

More information

MATH 3330 ABSTRACT ALGEBRA SPRING Definition. A statement is a declarative sentence that is either true or false.

MATH 3330 ABSTRACT ALGEBRA SPRING Definition. A statement is a declarative sentence that is either true or false. MATH 3330 ABSTRACT ALGEBRA SPRING 2014 TANYA CHEN Dr. Gordon Heier Tuesday January 14, 2014 The Basics of Logic (Appendix) Definition. A statement is a declarative sentence that is either true or false.

More information

Mathematics Extension 1

Mathematics Extension 1 BAULKHAM HILLS HIGH SCHOOL TRIAL 04 YEAR TASK 4 Mathematics Etension General Instructions Reading time 5 minutes Working time 0 minutes Write using black or blue pen Board-approved calculators may be used

More information

r(j) -::::.- --X U.;,..;...-h_D_Vl_5_ :;;2.. Name: ~s'~o--=-i Class; Date: ID: A

r(j) -::::.- --X U.;,..;...-h_D_Vl_5_ :;;2.. Name: ~s'~o--=-i Class; Date: ID: A Name: ~s'~o--=-i Class; Date: U.;,..;...-h_D_Vl_5 _ MAC 2233 Chapter 4 Review for the test Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Find the derivative

More information

MATH 2200 Final LC Review

MATH 2200 Final LC Review MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from

More information

Linear Algebra. Session 8

Linear Algebra. Session 8 Linear Algebra. Session 8 Dr. Marco A Roque Sol 08/01/2017 Abstract Linear Algebra Range and kernel Let V, W be vector spaces and L : V W, be a linear mapping. Definition. The range (or image of L is the

More information

GROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION

GROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations

More information

MULTI-RESTRAINED STIRLING NUMBERS

MULTI-RESTRAINED STIRLING NUMBERS MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained

More information

MODEL ANSWERS TO HWK #7. 1. Suppose that F is a field and that a and b are in F. Suppose that. Thus a = 0. It follows that F is an integral domain.

MODEL ANSWERS TO HWK #7. 1. Suppose that F is a field and that a and b are in F. Suppose that. Thus a = 0. It follows that F is an integral domain. MODEL ANSWERS TO HWK #7 1. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above by c on the left, we get 0

More information

1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5

1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5 J. Korean Math. Soc. 36 (1999), No. 6, pp. 1181{1190 LINEAR OPERATORS THAT PRESERVE ZERO-TERM RANK OF BOOLEAN MATRICES LeRoy. B. Beasley, Seok-Zun Song, and Sang-Gu Lee Abstract. Zero-term rank of a matrix

More information

Ranking accounting, banking and finance journals: A note

Ranking accounting, banking and finance journals: A note MPRA Munich Personal RePEc Archive Ranking accounting, banking and finance ournals: A note George Halkos and Nickolaos Tzeremes University of Thessaly, Department of Economics January 2012 Online at https://mpra.ub.uni-muenchen.de/36166/

More information

Ring Theory Problem Set 2 Solutions

Ring Theory Problem Set 2 Solutions Ring Theory Problem Set 2 Solutions 16.24. SOLUTION: We already proved in class that Z[i] is a commutative ring with unity. It is the smallest subring of C containing Z and i. If r = a + bi is in Z[i],

More information

Introduction to Groups

Introduction to Groups Introduction to Groups S F Ellermeyer November 2, 2006 A group, G, is a set, A, endowed with a single binary operation,, such that: The operation is associative, meaning that a (b c) = (a b) c for all

More information

T h e C S E T I P r o j e c t

T h e C S E T I P r o j e c t T h e P r o j e c t T H E P R O J E C T T A B L E O F C O N T E N T S A r t i c l e P a g e C o m p r e h e n s i v e A s s es s m e n t o f t h e U F O / E T I P h e n o m e n o n M a y 1 9 9 1 1 E T

More information

Algebraic structures I

Algebraic structures I MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one

More information

Review Let A, B, and C be matrices of the same size, and let r and s be scalars. Then

Review Let A, B, and C be matrices of the same size, and let r and s be scalars. Then 1 Sec 21 Matrix Operations Review Let A, B, and C be matrices of the same size, and let r and s be scalars Then (i) A + B = B + A (iv) r(a + B) = ra + rb (ii) (A + B) + C = A + (B + C) (v) (r + s)a = ra

More information

Linear Algebra. Week 7

Linear Algebra. Week 7 Linear Algebra. Week 7 Dr. Marco A Roque Sol 10 / 09 / 2018 If {v 1, v 2,, v n } is a basis for a vector space V, then any vector v V, has a unique representation v = x 1 v 1 + x 2 v 2 + + x n v n where

More information

MODEL ANSWERS TO THE FIRST HOMEWORK

MODEL ANSWERS TO THE FIRST HOMEWORK MODEL ANSWERS TO THE FIRST HOMEWORK 1. Chapter 4, 1: 2. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above

More information

A Generalization of VNL-Rings and P P -Rings

A Generalization of VNL-Rings and P P -Rings Journal of Mathematical Research with Applications Mar, 2017, Vol 37, No 2, pp 199 208 DOI:103770/jissn:2095-2651201702008 Http://jmredluteducn A Generalization of VNL-Rings and P P -Rings Yueming XIANG

More information

Mathematics Review for Business PhD Students Lecture Notes

Mathematics Review for Business PhD Students Lecture Notes Mathematics Review for Business PhD Students Lecture Notes Anthony M. Marino Department of Finance and Business Economics Marshall School of Business University of Southern California Los Angeles, CA 90089-0804

More information

SOLUTION SET. Chapter 9 REQUIREMENTS FOR OBTAINING POPULATION INVERSIONS "LASER FUNDAMENTALS" Second Edition. By William T.

SOLUTION SET. Chapter 9 REQUIREMENTS FOR OBTAINING POPULATION INVERSIONS LASER FUNDAMENTALS Second Edition. By William T. SOLUTION SET Chapter 9 REQUIREMENTS FOR OBTAINING POPULATION INVERSIONS "LASER FUNDAMENTALS" Second Edition By William T. Silfvast C.11 q 1. Using the equations (9.8), (9.9), and (9.10) that were developed

More information

ECE430 Name 5 () ( '-'1-+/~ Or"- f w.s. Section: (Circle One) 10 MWF 12:30 TuTh (Sauer) (Liu) TOTAL: USEFUL INFORMATION

ECE430 Name 5 () ( '-'1-+/~ Or- f w.s. Section: (Circle One) 10 MWF 12:30 TuTh (Sauer) (Liu) TOTAL: USEFUL INFORMATION " ~~~~~,",,_~"",,"cr,~ - r " ECE430 Name 5 () ( '-'1-+/~ Or"- f ws Exam #2 (print Name) Spring 2005 Section: (Circle One) 10 MWF 12:30 TuTh (Sauer) (Liu) Problem 1 Problem 2 Problem 3 Problem 4 TOTAL:

More information

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B. Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets

More information

MATH 304 Linear Algebra Lecture 15: Linear transformations (continued). Range and kernel. Matrix transformations.

MATH 304 Linear Algebra Lecture 15: Linear transformations (continued). Range and kernel. Matrix transformations. MATH 304 Linear Algebra Lecture 15: Linear transformations (continued). Range and kernel. Matrix transformations. Linear mapping = linear transformation = linear function Definition. Given vector spaces

More information

6 Permutations Very little of this section comes from PJE.

6 Permutations Very little of this section comes from PJE. 6 Permutations Very little of this section comes from PJE Definition A permutation (p147 of a set A is a bijection ρ : A A Notation If A = {a b c } and ρ is a permutation on A we can express the action

More information

MATH 420 FINAL EXAM J. Beachy, 5/7/97

MATH 420 FINAL EXAM J. Beachy, 5/7/97 MATH 420 FINAL EXAM J. Beachy, 5/7/97 1. (a) For positive integers a and b, define gcd(a, b). (b) Compute gcd(1776, 1492). (c) Show that if a, b, c are positive integers, then gcd(a, bc) = 1 if and only

More information

Ring Theory Problems. A σ

Ring Theory Problems. A σ Ring Theory Problems 1. Given the commutative diagram α A σ B β A σ B show that α: ker σ ker σ and that β : coker σ coker σ. Here coker σ = B/σ(A). 2. Let K be a field, let V be an infinite dimensional

More information

A FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic

A FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic A FIRST COURSE IN LINEAR ALGEBRA An Open Text by Ken Kuttler Matrix Arithmetic Lecture Notes by Karen Seyffarth Adapted by LYRYX SERVICE COURSE SOLUTION Attribution-NonCommercial-ShareAlike (CC BY-NC-SA)

More information

BASIC MATHEMATICAL TECHNIQUES

BASIC MATHEMATICAL TECHNIQUES CHAPTER 1 ASIC MATHEMATICAL TECHNIQUES 1.1 Introduction To understand automata theory, one must have a strong foundation about discrete mathematics. Discrete mathematics is a branch of mathematics dealing

More information

Basic Concepts of Group Theory

Basic Concepts of Group Theory Chapter 1 Basic Concepts of Group Theory The theory of groups and vector spaces has many important applications in a number of branches of modern theoretical physics. These include the formal theory of

More information

35H MPa Hydraulic Cylinder 3.5 MPa Hydraulic Cylinder 35H-3

35H MPa Hydraulic Cylinder 3.5 MPa Hydraulic Cylinder 35H-3 - - - - ff ff - - - - - - B B BB f f f f f f f 6 96 f f f f f f f 6 f LF LZ f 6 MM f 9 P D RR DD M6 M6 M6 M. M. M. M. M. SL. E 6 6 9 ZB Z EE RC/ RC/ RC/ RC/ RC/ ZM 6 F FP 6 K KK M. M. M. M. M M M M f f

More information

MATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.

MATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1. MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection

More information

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter

More information

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.

More information

SUBSEMiGROUPS OF THE ADDITIVE POSITIVE INTEGERS 1. INTRODUCTION

SUBSEMiGROUPS OF THE ADDITIVE POSITIVE INTEGERS 1. INTRODUCTION SUBSEMiGROUPS OF THE ADDITIVE POSITIVE INTEGERS JOHNC.HIGGINS Brigham Young University, Provo, Utah 1. INTRODUCTION Many of the attempts to obtain representations for commutative and/or Archimedean semigroups

More information

QUESTION BANK II PUC SCIENCE

QUESTION BANK II PUC SCIENCE QUESTION BANK II PUC SCIENCE I. Very Short answer questions. (x9=9). Define Symmetric relation. Ans: A relation R on the set A is said to be symmetric if for all a, b, A, ar b Implies bra. i.e. (a, b)

More information

MTH 309 Supplemental Lecture Notes Based on Robert Messer, Linear Algebra Gateway to Mathematics

MTH 309 Supplemental Lecture Notes Based on Robert Messer, Linear Algebra Gateway to Mathematics MTH 309 Supplemental Lecture Notes Based on Robert Messer, Linear Algebra Gateway to Mathematics Ulrich Meierfrankenfeld Department of Mathematics Michigan State University East Lansing MI 48824 meier@math.msu.edu

More information

,0,",,.,*",,ffi:, *",",,,",*YnJt%ffi& (st& sc oev.sectton, No. 3\ q2tvvlz2or 5. MemoNo 3\q34o1s Date 1a 122o1s COI.IECTOMTE, MALKANGIRI OROER

,0,,,.,*,,ffi:, *,,,,,*YnJt%ffi& (st& sc oev.sectton, No. 3\ q2tvvlz2or 5. MemoNo 3\q34o1s Date 1a 122o1s COI.IECTOMTE, MALKANGIRI OROER ,0,",,.,*",,ff, CO.CTOMT, MALKANGR (st& sc ov.scton, No. \ q2vvlz2or OROR Publcal on of na eeced/rejeced s o Maron b be ena d n he c s Hosels Dev.Oepl of Makan D Bc. n puuance of adven seffenl No.2o7l1

More information

Division of Marks TOTAL [3 +2] Part -A Part-B Part-C

Division of Marks TOTAL [3 +2] Part -A Part-B Part-C GROUPS Division of Marks 1 2 5 MARK MARKS MARKS [3 +2] TOTAL Part -A Part-B Part-C 1 1 1 8 Set of Integers I or Z= Set Of Non negative integers ={0,1,2,3,4,--------,,,, -- - -- - - - -} Set Of Rationals=

More information

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

More information

MATH PRACTICE EXAM 1 SOLUTIONS

MATH PRACTICE EXAM 1 SOLUTIONS MATH 2359 PRACTICE EXAM SOLUTIONS SPRING 205 Throughout this exam, V and W will denote vector spaces over R Part I: True/False () For each of the following statements, determine whether the statement is

More information

TRAN S F O R M E R S TRA N SMI S S I O N. SECTION AB Issue 2, March, March,1958, by American Telephone and Telegraph Company

TRAN S F O R M E R S TRA N SMI S S I O N. SECTION AB Issue 2, March, March,1958, by American Telephone and Telegraph Company B B, ch, 9 B h f h c h l f f Bll lh, c chcl l l k l, h, h ch f h f ll ll l f h lh h c ll k f Bll lh, c ck ll ch,9, c lh lh B B c x l l f f f 9 B l f c l f f l 9 f B c, h f c x ch 9 B B h f f fc Bll c f

More information

Math 430 Exam 1, Fall 2006

Math 430 Exam 1, Fall 2006 c IIT Dept. Applied Mathematics, October 21, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 430 Exam 1, Fall 2006 These theorems may be cited at any time during the test by stating By

More information

Supplementary Material for MTH 299 Online Edition

Supplementary Material for MTH 299 Online Edition Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think

More information

A matrix over a field F is a rectangular array of elements from F. The symbol

A matrix over a field F is a rectangular array of elements from F. The symbol Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted

More information

Chapter 1 solutions. (E1) and (E2):

Chapter 1 solutions. (E1) and (E2): Chapter 1 solutions 1.1. A B means that every element of A is in B, and B A that every element of B is in A. The combination of these two statements is just what is meant by A B. 1.2. (a) In the expression

More information

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a. Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms

More information

SYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES

SYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 186, December 1973 SYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES BY MORRIS NEWMAN ABSTRACT. We show that any vector of n relatively prime

More information

Math 113 Practice Final Solutions

Math 113 Practice Final Solutions Math 113 Practice Final Solutions 1 There are 9 problems; attempt all of them. Problem 9 (i) is a regular problem, but 9(ii)-(iii) are bonus problems, and they are not part of your regular score. So do

More information

2.3. VECTOR SPACES 25

2.3. VECTOR SPACES 25 2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous

More information

Countable and uncountable sets. Matrices.

Countable and uncountable sets. Matrices. CS 441 Discrete Mathematics for CS Lecture 11 Countable and uncountable sets. Matrices. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Arithmetic series Definition: The sum of the terms of the

More information

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is

More information

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary

More information

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.

More information

THE NUMBER OF LOCALLY RESTRICTED DIRECTED GRAPHS1

THE NUMBER OF LOCALLY RESTRICTED DIRECTED GRAPHS1 THE NUMBER OF LOCALLY RESTRICTED DIRECTED GRAPHS1 LEO KATZ AND JAMES H. POWELL 1. Preliminaries. We shall be concerned with finite graphs of / directed lines on n points, or nodes. The lines are joins

More information

Week 4-5: Binary Relations

Week 4-5: Binary Relations 1 Binary Relations Week 4-5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all

More information

MATH Topics in Applied Mathematics Lecture 2-6: Isomorphism. Linear independence (revisited).

MATH Topics in Applied Mathematics Lecture 2-6: Isomorphism. Linear independence (revisited). MATH 311-504 Topics in Applied Mathematics Lecture 2-6: Isomorphism. Linear independence (revisited). Definition. A mapping f : V 1 V 2 is one-to-one if it maps different elements from V 1 to different

More information

Math 511, Algebraic Systems, Fall 2017 July 20, 2017 Edition. Todd Cochrane

Math 511, Algebraic Systems, Fall 2017 July 20, 2017 Edition. Todd Cochrane Math 511, Algebraic Systems, Fall 2017 July 20, 2017 Edition Todd Cochrane Department of Mathematics Kansas State University Contents Notation v Chapter 0. Axioms for the set of Integers Z. 1 Chapter 1.

More information

Exhibit 2-9/30/15 Invoice Filing Page 1841 of Page 3660 Docket No

Exhibit 2-9/30/15 Invoice Filing Page 1841 of Page 3660 Docket No xhibit 2-9/3/15 Invie Filing Pge 1841 f Pge 366 Dket. 44498 F u v 7? u ' 1 L ffi s xs L. s 91 S'.e q ; t w W yn S. s t = p '1 F? 5! 4 ` p V -', {} f6 3 j v > ; gl. li -. " F LL tfi = g us J 3 y 4 @" V)

More information

Downloaded From:

Downloaded From: C -A V Z -O -V E L B c s URDU Paper II ( LITERATURE) Time allowed: Three Hours Maximum Marks: 250 QUESTION PAPER SPECIFIC INSTRUCTIONS Please read each o f the following instructions carefully before attempting

More information

Lecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013

Lecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013 Lecture 6 & 7 Shuanglin Shao September 16th and 18th, 2013 1 Elementary matrices 2 Equivalence Theorem 3 A method of inverting matrices Def An n n matrice is called an elementary matrix if it can be obtained

More information

Solution to Problem Set 3

Solution to Problem Set 3 YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Cryptography and Computer Security Handout #11 (rev. 2) Xueyuan Su October 27, 2008 Solution to Problem Set 3 Due on Wednesday, October 22, 2008.

More information

More Books At www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com

More information

APPENDIX F WATER USE SUMMARY

APPENDIX F WATER USE SUMMARY APPENDX F WATER USE SUMMARY From Past Projects Town of Norman Wells Water Storage Facltes Exstng Storage Requrements and Tank Volume Requred Fre Flow 492.5 m 3 See Feb 27/9 letter MACA to Norman Wells

More information