Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.
|
|
- Colin Andrews
- 6 years ago
- Views:
Transcription
1 Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn m 0, Z/0 is Z, bcaus vry numbr is quivalnt to itslf (mod 0), but not to any othr. But Z dos not hav multiplicativ invrss, and so it cannot b a fild. m 1: Whn m 1, Z/Z is {0}, bcaus vry numbr is quivalnt to vry othr numbr (mod 1). But {0} dos not hav a non-zro multiplicativ invrs, bcaus 1 0, and so {0} is not a fild. m 4: Hr, w hav that m is composit, and thrfor thr ar at last 2 factors a, b of m such that ab m, but 1 < a, b < m. Sinc a, b < m, w hav that a 0 (mod m) and m 0 (mod m), but ab m 0 (mod m). Now considr just th lmnts a, b. W know that in a fild, thy must both hav an invrs. In particular, thr is som a 1 Z/mZ such that a 1 a 1 aa 1. But thn a 1 ab a 1 0 b 0, which contradicts th fact that 1 < b < m (hr not that, in any ring, a 0 0 sinc a 0 a (0 + 0) a 0 + a 0, thn cancl th a 0). Thrfor, a 1 cannot xist, and Z/mZ is not a fild. Thus, in any cas whr m is composit, Z/mZ is not a fild, so if Z/mZ is a fild, m must b prim. ( ) Lt m p b prim. Thn for any a Z/pZ, with 1 a p 1, w must hav that a has a multiplicativ invrs. Sinc p is prim, a p, and a n p n 1. But thn ach a n {1, 2, dots, p 1}, and so thr ar a finit numbr of possibilitis, and an infinit numbr of xponnts. Thus, w must hav som rpat. That is, thr ar som n > k 1 such that a n a k (mod p). Thn, by dfinition, p a n a k a k (a n k 1). But, sinc p is prim and p a, p a k, and so p (a n k 1) (*). Thus, by dfinition, a n k aa n k 1 1 (mod p), and thus, by dfinition, a n k 1 is a multiplicativ invrs of a, and in gnral, a n k 1 is a multiplicativ invrs of a in Z/pZ.Thus, if p is prim, Z/pZ is a fild. (*): Hr w us that p ab implis p a or p b. To s this, w prov th contrapositiv: if p a and p b, thn pz + az Z pz + bz; thn Z (pz + az)(pz + bz) p 2 Z + paz + pbz + abz pz + abz, hnc p ab. Thrfor, w provd that th ring Z/mZ (for m 0) is a fild if and only if m is prim. Bonus: Using th sam tchniqu, show that if M is any finit monoid, thn any lmnt a M obying th cancllation proprty, (ab ac) (b c), is invrtibl. So sinc this cancllation proprty holds for ā Z/mZ whnvr gcd(a, m) 1, w conclud that ā is invrtibl if and only if gcd(a, m) 1. (In fact, for a finit monoid, not ncssarily commutativ, th following ar quivalnt: a is lft invrtibl, a is right invrtibl, am M, Ma M, a obys th lft cancllation proprty, and a obys th right cancllation proprty). 2. Prov that, if K H G ar subgroups, thn if [G : H or [H : K is infinit, so is [G : K. Thus, [G : K [G : H[H : K still holds in this cas (w provd th finit cas in class). Hint: Find a natural surjction G/K G/H and injction H/K G/K. 1
2 Proof: Assum [H : K is infinit. Now H/K by dfinition is all costs {hk h H}, and g G/K is, by dfinition, all costs {gk g G}. Sinc H G, thn h H h G. Thus, for any hk H/K, hk G/K. Thrfor, w can dfin f : H/K G/K by f(hk) hk. Thn for any ak, bk H/K, ak f(ak) f(bk) ak, and so by dfinition, f is injctiv. Thus, [G : K [H : K, bcaus vry lmnt in [H : K maps to a uniqu lmnt in [G : K. Now assum [G : H is infinit. With th sam dfinitions abov, w s that for any ah G/H, thr is som ak G/K so w can dfin f : G/H G/K, such that f(ak) ah, and thn f is a surjction by dfinition. Thus, [G : K [G : H, and so [G : K must b infinit as wll. Thus, bcaus if ithr [G : H or [H : K is infinit, thn [G : K is infinit, thn [G : K [G : H[H : K for all infinit cass. 3. Show that th invrsion map is a bijction G/H H\G, so that th numbr of lft costs always quals th numbr of right costs (vn if G is infinit). Hr G/H is th st of lft costs and H \G is th st of right costs. (Hint: (ah) 1 Ha 1 so this maps lft costs to right costs and vic-vrsa, and not that invrsion twic is th idntity.) Lt f b th invrsion map, so f(ah) (ah) 1 Ha 1 for all a G. Thus, f : G/H H \G. Now, lt f(ah) f(bh) Ha 1 Hb 1. Applying th invrsion principl again, w s that (Ha 1 ) 1 ah (Hb 1 ) 1 bh, and so w hav shown injctivity. Now lt Hc H \ G. Thn (Hc) 1 c 1 H G/H, and f(c 1 H) (c 1 H) 1 Hc, so all lmnts hav an invrs imag, and f is surjctiv. Thus, bcaus f is injctiv and surjctiv, f is bijctiv, and so th numbr of lft costs always quals th numbr of right costs. 4. Show that, if gcd(r, s) 1, thn Z/r Z/s Z/rs. Show that this dos not hold if gcd(r, s) 1. Hint for th first part: thr ar two possibl maps: ithr (ā, b) sa + rb in th forward dirction, or ā (ā, ā) in th rvrs dirction; howvr ths ar not invrs to ach othr: th composition of th two dirctions is multiplication by r + s. Hint for th scond part: Show that th ordr of vry lmnt in Z/r Z/s is a factor of lcm(r, s). (Why do th two maps givn bfor no longr dfin isomorphisms in this cas?) Considr th mapping φ : Z/r Z/s Z/rs, (ā, b) sa + rb. Thn w s that φ((a, b) + (c, d)) φ((a + c, b + d)) φ((a + c, b + d)) s(a + c) + r(b + d) sa + sc + rb + rd sa + rb + sc + rd φ((a, b)) + φ((c, d)) and so φ is a group homomorphism. (Not that it is not a ring homomorphism, although th othr possibl map, Z/rsZ Z/rZ Z/sZ, ā (ā, ā), is a ring homomorphism, which on can show is an isomorphism if gcd(r, s) 1 similarly to what w do hr.) 2
3 Considr φ((0, 0)) s0 + r0 0, so (0, 0) K, th krnl. Now considr any (a, b) such that φ((a, b)) sa + rb 0. Thn, by dfinition, sa + rb 0 (mod rs), so rs sa + rb. Thn s sa + rb, and sinc s sa, s rb. Sinc gcd(r, s) 1, w hav that s b. Similarly, w can s that r a. Thn a 0 (mod r) and b 0 (mod s), Thn a 0 in r, and b 0 in s, so (a, b) (0, 0), and so w s that (0, 0) is th only lmnt of th krnl, which, by a thorm from th book, shows that φ is injctiv. Now, not that th max ordr lmnt of Z/r Z/s is ordr lcm(r, s), and in Z/rs th max ordr lmnt is ordr rs. In th cas whr gcd(r, s) 1, sinc rs gcd(r, s) lcm(r, s), w hav that lcm(r, s) rs, and so th max ordr lmnts hav th sam ordr. Thn w not that Z/r Z/s rs, by th dfinition of how th cartsian product works, and Z/rs rs, by th dfinition of th Z/rs, which will hav rs quivalncy classs {0, 1,..., rs 1}. Thn, w apply problm 1(c) from homwork 3, and sinc Z/r Z/s Z/rs finit, injctivity implis surjctivity, and so w hav a bijctiv homomorphism. That is, φ is an isomorphism. rs gcd(r,s) Now, considr th cas whr gcd(r, s) > 1. Thn lcm(r, r) < rs, and so th maximum ordr of any lmnt in Z/r Z/s must b < rs, and so it cannot b isomorphic to th cyclic group Z/rs. 5. Chaptr 2, Miscllanous problm M.3. Classify groups of ordr 6 by analyzing th following thr cass: (i) G contains an lmnt of of ordr 6. Lt th lmnt b x. Thn th group must hav {1, x, x 2, x 3, x 4, x 5 }, and so x is a gnrator, and G is th cyclic group of ordr 6. (ii) G contains an lmnt of ordr 3 but non of ordr 6. Lt th lmnt b x. Thn th group H : x {1, x, x 2 } is a subgroup of indx two, so it must b normal (cf. Exrcis 7 blow): for any othr lmnt y / H, w must hav Hy yh G H, th st of lmnts of G not in H. Tak such a y / H. Thn y 2 H is a cost; w claim it is H. If not, y 2 H yh, and canclling, yh H, a contradiction. Thus y 2 H, and y has ordr two. Thus y 2 1 x 3. Sinc y was an arbitrary lmnt not in H, w actually s all lmnts not in H hav ordr two. So (xy) 2 1 as wll, or altrnativly, yx x 1 y 1 x 2 y. Thus x and y oby all th rlations of S 3 givn in (2.2.6). Sinc ths rlations dfin S 3, w gt a homomorphism S 3 G snding x S 3 to x G and y S 3 to y G. This is surjctiv sinc G is clarly gnratd by x and y. Sinc G 6 S 3, it must also b injctiv, hnc S 3 G is an isomorphism. (iii) All lmnts of G hav ordr 1 or 2. In this cas, all lmnts othr than th idntity must b of ordr 2, and so G must b of th form {1, a, b, c, d, }. Thn vry lmnt is its own invrs. But thn ab (ab) 1 b 1 a 1 ba, and so th group must b ablian. Thn w s that w hav a subgroup formd by S {1, a, b, ab}, whr ab is som othr lmnt of G (c, d, or ). But thn S 4, which contradicts Lagrang s thorm, which tlls us that S must divid G 6. Thus, thr can b no groups of ordr 6 of this typ. 3
4 a b 6. Chaptr 2, Exrcis Lt G b th group of uppr triangular ral matrics, with a and d diffrnt from zro. For ach of th following substs, dtrmin whthr or not S is a subgroup, and whthr or not S is a normal subgroup. If S is a normal subgroup, idntify th quotint group G/S. (i) S is th subst dfind by b 0. I 1 S. a 0 If A S, a, d 0, A 1 1 d 0 ad S. 0 a a 0 b 0 ab 0 S, so closd undr multiplication. 0 c c Thus, S is a subgroup of G. [ b c a 0 1 [ c b b ba cd 1 c 1 b b a ac+cd 1, and so S is not a normal subgroup of G. (ii) S is th subst dfind by d 1. I 1 S. [ a b If A, a 0, thn A b 1 b a a a S, so invrss ar in S. 0 a 0 1 a b c d ac ad + b, so closd undr multiplication [ c d a b 1 [ c c ca cb + d 1 1 c c a ad+cb+d 1, and so S is a normal subgroup of G. a b x y ax ay + b W s that, and so as x, y vary across R, w will 0 1 r s gt a cost of th form, r, s R, r 0. Thus, w s that as d spans R, d 0, this will span G, maning that w hav xamind all costs, and and so w can idntify th costs by d R, d 0. (iii) S is th subst dfind by a d. I 2 S. a b If A S, a 0, thn A 0 a 1 1 a b S, and A a 2 0 a so th invrss ar prsnt. a b c d ac ad + bc S, so closd undr multiplication. 0 a 0 c 0 ac Thus, S is a subgroup of G. [ c d a b 1 [ c c ca cb + da 1 1 c c a 0 0 a 0 normal subgroup of G. [ a b x y ax ay + bx W s that 0 x x [ r s gt a cost of th form dr 0 a a b S, 0 a a ad+cb+da, and so S is a 0 a. As x, y vary across R, x 0, w will, r, s R, r 0. Hr w s that, as d/a spans R, 4
5 d/a 0, this will span G, maning that w hav xamind all costs, and so w can again idntify th costs by d/a R, d/a Chaptr 2, Exrcis Prov that vry subgroup of indx 2 is a normal subgroup, and show by xampl that a subgroup of indx 3 nd not b normal. Lt H G such that [H : G 2. Sinc H is a group, and closd, h 1, h 2 H, h 1 h 2 H, and so h 1 H H Hh 2, and H is a lft and right cost of itslf. Sinc [H : G 2, thr is only on othr right cost and on othr lft cost. Thus, for g G, if g H, gh H, and so gh must b th othr lft cost. Similarly, Hg must b th othr right cost, and w s that sinc both ar G H (st diffrnc), thy ar quivalnt. Now considr th st S 3 {1, x, x 2, y, xy, x 2 y} with x 3 1, y 2 1, and yx x 2 y as on pag 42 of Artin. Now considr th subgroup A {1, y}. Sinc A 2 and S 3 6, by th counting formula, [S 3 : A 3. But xa {x, xy} and Ax {x, yx x 2 y}, and w s that thy ar not th sam. 8. Chaptr 2, Exrcis Lt G and G b cyclic groups of ordrs 12 and 6, gnratd by lmnts x and y, rspctivly, and lt φ : G G b th map dfind by φ(x i ) y i. Exhibit th corrspondnc rfrrd to in th Corrspondnc Thorm xplicitly. W s that φ(x a x b ) φ(x a+b ) y a+b y a y b φ(x a )φ(x b ), and so φ is a homomorphism. Thn w s that for y i G, which mans that 0 i 5, x i G, and so vry lmnt of G has a primag, and so w hav a surjctiv homomorphism. W s that φ( G ) φ(x 6 ) G, and this is not tru for any othr lmnts, sinc y i G if i 0 (mod 6). Thus, K { G, x 6 }. Thn th subgroups ar of G which contain X ar K, x 3 { G, x 3, x 6, x 9 }, x 2 { G, x 2, x 4, x 6, x 8, x 10 }, and G. Th corrsponding subgroups of G ar { G }, y 3 { G, y 3 }, y 2 { G, y 2, y 4 }, and G. Th bijction corrsponds thm in this ordr, and it is as givn in th txtbook, th imag undr φ. 9. Chaptr 2, Exrcis In ach of th following cass, dtrmin whthr or not G is isomorphic to th product group H K. Justify your answrs! (a) G R, H {±1}, K {positiv ral numbrs}. W hav shown bfor that H and K ar groups. It is obvious that H K {1}, and w s that 1K is th positiv rals and 1K is th ngativ rals, and sinc R dos not includ 0, HK G. Sinc multiplication is commutativ ovr th rals, gag 1 gg 1 a a, and so w s that all subgroups of G ar normal, and in particular H and K ar normal. Thrfor, w can apply part (d) of proposition from pag 65 of Artin, and so f : H X G, th multiplication map, is an isomorphism. (b) G {invrtibl uppr triangular 2 2 matrics}, H {invrtibl diagonal matrics}, K {uppr triangular matrics with diagonal ntris 1}. Not: It is apparnt that H and K must both b n n matrics. Sinc it must hold tru for any n, w must hav that it also holds for n 2, so w will considr (and show a countrxampl) for this cas. This will man that H has th form 1 c and K has th form, for a, b, c R, a, b [ a 0 0 b 5
6 W v sn bfor that H and K ar groups, but not that thy ar also ablian: a 0 c 0 ac 0 c 0 a 0 0 b 0 bd 0 b bcaus ac ca and db bd bcaus th rals ar ablian undr multiplication. Thrfor, H is an ablian group. Similarly: 1 a 1 b 1 a + b 1 b 1 a Thrfor, K is also an ablian group. Thn, w s that for any two lmnts in H K, (a, b)(c, d) (ac, bd) (ca, db) (c, d)(a, b), and so w s that H K is an ablian group. But s that: and [ d 0 f a b d 0 c 0 f a b 0 c ad a + bf 0 cf da db + c 0 fc and sinc db + c a + bf in gnral, G is not ablian. Now lt x, y H K. Thn xy yx, and so if thr was an isomorphism f : H K G, f(x)f(y) f(xy) f(yx) f(y)f(x), and thn G would also hav to b ablian, which is a contradiction. Thrfor, by countrxampl, thr can not xist any such isomorphism. (c) G C, H {unit circl}, K {positiv ral numbrs}. W hav shown bfor that H and K ar groups. Th only ral numbrs with r 1 ar ±1, and 1 K, so H K {1}. Sinc any non-zro complx numbr, and thrfor any complx numbr in C G, can b xprssd as r iθ for r > 0 and 0 θ < 2π, and iθ H, thn r iθ KH, and so KH G. Sinc th complx numbrs undr multiplication ar an ablian group, by th sam rasoning as part (a), w s that all subgroups, and in particular H and K, ar normal. Thrfor, w can again apply th sam proposition as in part (a), and f : H X G, th multiplication map, is an isomorphism. 10. Chaptr 2, Exrcis In th gnral linar group GL 3 (R), considr th substs H 0 1, and K 0 1 0, whr rprsnts an arbitrary ral numbr. Show that H is a subgroup of GL 3, that K is a normal subgroup of H, and idntify th quotint group H/K. Dtrmin th cntr of H. 1 a b W s that I 3 H by obsrvation. Now lt h 0 1 c. Thn h 1 6
7 1 a ac b 0 1 c H, so invrss ar prsnt. Thn 1 a b 1 d 1 d + a + af + b 0 1 c 0 1 f 0 1 f + c and so H is closd undr multiplication. Thrfor, H is a group. 1 0 a 1 0 a W s that I 3 K by obsrvation. Now lt k Thn k H, and so invrss ar prsnt. Thn 1 0 a 1 0 b 1 0 b + a so K is closd undr multiplication. Thrfor, K is a group. Now obsrv that 1 a b 1 0 f 1 a ac b 1 a f + b 1 a ac b 1 0 f 0 1 c c 0 1 c 0 1 c so K is a normal subgroup of H. 1 a b 1 0 f 1 a f + b Considr 0 1 c c. Whn w lt a, b, c R b fixd, 1 a r and f R varis, w s that w gt a cost of th form 0 1 c, whr r R can b any lmnt. Thus, w s that as w vary a and c, w will span H, and ach on givs a uniqu subgroup, and so w conclud that (a, c) idntify th subgroup. Mor 1 a b prcisly, th map snding 0 1 c to (a, c) R R is a surjctiv homomorphism with krnl K, so by th first isomorphism thorm, H/K R R. By a problm on a prvious homwork, w hav sn that only matrics of th form a a 0 commut with all lmnts of GL 3, and thrfor th only lmnt of th 0 0 a cntr of H is I
Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.
MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!
More informationRecall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1
Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013
18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:
More informationcycle that does not cross any edges (including its own), then it has at least
W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th
More informationCS 361 Meeting 12 10/3/18
CS 36 Mting 2 /3/8 Announcmnts. Homwork 4 is du Friday. If Friday is Mountain Day, homwork should b turnd in at my offic or th dpartmnt offic bfor 4. 2. Homwork 5 will b availabl ovr th wknd. 3. Our midtrm
More informationCombinatorial Networks Week 1, March 11-12
1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl
More informationHydrogen Atom and One Electron Ions
Hydrogn Atom and On Elctron Ions Th Schrödingr quation for this two-body problm starts out th sam as th gnral two-body Schrödingr quation. First w sparat out th motion of th cntr of mass. Th intrnal potntial
More informationECE602 Exam 1 April 5, You must show ALL of your work for full credit.
ECE62 Exam April 5, 27 Nam: Solution Scor: / This xam is closd-book. You must show ALL of your work for full crdit. Plas rad th qustions carfully. Plas chck your answrs carfully. Calculators may NOT b
More informationLie Groups HW7. Wang Shuai. November 2015
Li roups HW7 Wang Shuai Novmbr 015 1 Lt (π, V b a complx rprsntation of a compact group, show that V has an invariant non-dgnratd Hrmitian form. For any givn Hrmitian form on V, (for xampl (u, v = i u
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1
More informationCOUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM
COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM Jim Brown Dpartmnt of Mathmatical Scincs, Clmson Univrsity, Clmson, SC 9634, USA jimlb@g.clmson.du Robrt Cass Dpartmnt of Mathmatics,
More informationSECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.
SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain
More informationBasic Polyhedral theory
Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist
More information1 Minimum Cut Problem
CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms
More informationChapter 10. The singular integral Introducing S(n) and J(n)
Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don
More informationPropositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018
Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs
More informationSelf-Adjointness and Its Relationship to Quantum Mechanics. Ronald I. Frank 2016
Ronald I. Frank 06 Adjoint https://n.wikipdia.org/wiki/adjoint In gnral thr is an oprator and a procss that dfin its adjoint *. It is thn slf-adjoint if *. Innr product spac https://n.wikipdia.org/wiki/innr_product_spac
More informationHigher order derivatives
Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of
More informationThe graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the
Copyright itutcom 005 Fr download & print from wwwitutcom Do not rproduc by othr mans Functions and graphs Powr functions Th graph of n y, for n Q (st of rational numbrs) y is a straight lin through th
More information1 Isoparametric Concept
UNIVERSITY OF CALIFORNIA BERKELEY Dpartmnt of Civil Enginring Spring 06 Structural Enginring, Mchanics and Matrials Profssor: S. Govindj Nots on D isoparamtric lmnts Isoparamtric Concpt Th isoparamtric
More informationCOHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.
MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function
More informationWhat is a hereditary algebra?
What is a hrditary algbra? (On Ext 2 and th vanishing of Ext 2 ) Claus Michal Ringl At th Münstr workshop 2011, thr short lcturs wr arrangd in th styl of th rgular column in th Notics of th AMS: What is?
More information10. Limits involving infinity
. Limits involving infinity It is known from th it ruls for fundamntal arithmtic oprations (+,-,, ) that if two functions hav finit its at a (finit or infinit) point, that is, thy ar convrgnt, th it of
More informationFunction 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
unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr
More informationSCHUR S THEOREM REU SUMMER 2005
SCHUR S THEOREM REU SUMMER 2005 1. Combinatorial aroach Prhas th first rsult in th subjct blongs to I. Schur and dats back to 1916. On of his motivation was to study th local vrsion of th famous quation
More informationSupplementary Materials
6 Supplmntary Matrials APPENDIX A PHYSICAL INTERPRETATION OF FUEL-RATE-SPEED FUNCTION A truck running on a road with grad/slop θ positiv if moving up and ngativ if moving down facs thr rsistancs: arodynamic
More informationWeek 3: Connected Subgraphs
Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y
More informationON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park
Kangwon-Kyungki Math. Jour. 11 (2003), No. 2, pp. 147 153 ON RIGHT(LEFT) DUO PO-SEMIGROUPS S. K. L and K. Y. Park Abstract. W invstigat som proprtis on right(rsp. lft) duo po-smigroups. 1. Introduction
More informationCOMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH.
C:\Dallas\0_Courss\03A_OpSci_67\0 Cgh_Book\0_athmaticalPrliminaris\0_0 Combath.doc of 8 COPUTER GENERATED HOLOGRAS Optical Scincs 67 W.J. Dallas (onday, April 04, 005, 8:35 A) PART I: CHAPTER TWO COB ATH
More informationAbstract Interpretation: concrete and abstract semantics
Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion
More informationDifferentiation of Exponential Functions
Calculus Modul C Diffrntiation of Eponntial Functions Copyright This publication Th Northrn Albrta Institut of Tchnology 007. All Rights Rsrvd. LAST REVISED March, 009 Introduction to Diffrntiation of
More informationA. Limits and Horizontal Asymptotes ( ) f x f x. f x. x "±# ( ).
A. Limits and Horizontal Asymptots What you ar finding: You can b askd to find lim x "a H.A.) problm is asking you find lim x "# and lim x "$#. or lim x "±#. Typically, a horizontal asymptot algbraically,
More informationANALYSIS IN THE FREQUENCY DOMAIN
ANALYSIS IN THE FREQUENCY DOMAIN SPECTRAL DENSITY Dfinition Th spctral dnsit of a S.S.P. t also calld th spctrum of t is dfind as: + { γ }. jτ γ τ F τ τ In othr words, of th covarianc function. is dfind
More informationSolution: APPM 1360 Final (150 pts) Spring (60 pts total) The following parts are not related, justify your answers:
APPM 6 Final 5 pts) Spring 4. 6 pts total) Th following parts ar not rlatd, justify your answrs: a) Considr th curv rprsntd by th paramtric quations, t and y t + for t. i) 6 pts) Writ down th corrsponding
More informationQuasi-Classical States of the Simple Harmonic Oscillator
Quasi-Classical Stats of th Simpl Harmonic Oscillator (Draft Vrsion) Introduction: Why Look for Eignstats of th Annihilation Oprator? Excpt for th ground stat, th corrspondnc btwn th quantum nrgy ignstats
More informationA Propagating Wave Packet Group Velocity Dispersion
Lctur 8 Phys 375 A Propagating Wav Packt Group Vlocity Disprsion Ovrviw and Motivation: In th last lctur w lookd at a localizd solution t) to th 1D fr-particl Schrödingr quation (SE) that corrsponds to
More informationLecture 6.4: Galois groups
Lctur 6.4: Galois groups Matthw Macauly Dpartmnt of Mathmatical Scincs Clmson Univrsity http://www.math.clmson.du/~macaul/ Math 4120, Modrn Algbra M. Macauly (Clmson) Lctur 6.4: Galois groups Math 4120,
More informationPROBLEM SET Problem 1.
PROLEM SET 1 PROFESSOR PETER JOHNSTONE 1. Problm 1. 1.1. Th catgory Mat L. OK, I m not amiliar with th trminology o partially orr sts, so lt s go ovr that irst. Dinition 1.1. partial orr is a binary rlation
More informationCPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming
CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of
More informationAddition of angular momentum
Addition of angular momntum April, 07 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat
More informationThat is, we start with a general matrix: And end with a simpler matrix:
DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss
More informationu 3 = u 3 (x 1, x 2, x 3 )
Lctur 23: Curvilinar Coordinats (RHB 8.0 It is oftn convnint to work with variabls othr than th Cartsian coordinats x i ( = x, y, z. For xampl in Lctur 5 w mt sphrical polar and cylindrical polar coordinats.
More information(Upside-Down o Direct Rotation) β - Numbers
Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg
More informationMA 262, Spring 2018, Final exam Version 01 (Green)
MA 262, Spring 218, Final xam Vrsion 1 (Grn) INSTRUCTIONS 1. Switch off your phon upon ntring th xam room. 2. Do not opn th xam booklt until you ar instructd to do so. 3. Bfor you opn th booklt, fill in
More informationConstruction of asymmetric orthogonal arrays of strength three via a replacement method
isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy
More informationFourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.
Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform
More informationEquidistribution and Weyl s criterion
Euidistribution and Wyl s critrion by Brad Hannigan-Daly W introduc th ida of a sunc of numbrs bing uidistributd (mod ), and w stat and prov a thorm of Hrmann Wyl which charactrizs such suncs. W also discuss
More informationAddition of angular momentum
Addition of angular momntum April, 0 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat th
More informationObjective Mathematics
x. Lt 'P' b a point on th curv y and tangnt x drawn at P to th curv has gratst slop in magnitud, thn point 'P' is,, (0, 0),. Th quation of common tangnt to th curvs y = 6 x x and xy = x + is : x y = 8
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit
More informationBifurcation Theory. , a stationary point, depends on the value of α. At certain values
Dnamic Macroconomic Thor Prof. Thomas Lux Bifurcation Thor Bifurcation: qualitativ chang in th natur of th solution occurs if a paramtr passs through a critical point bifurcation or branch valu. Local
More informationHomework #3. 1 x. dx. It therefore follows that a sum of the
Danil Cannon CS 62 / Luan March 5, 2009 Homwork # 1. Th natural logarithm is dfind by ln n = n 1 dx. It thrfor follows that a sum of th 1 x sam addnd ovr th sam intrval should b both asymptotically uppr-
More informationExercise 1. Sketch the graph of the following function. (x 2
Writtn tst: Fbruary 9th, 06 Exrcis. Sktch th graph of th following function fx = x + x, spcifying: domain, possibl asymptots, monotonicity, continuity, local and global maxima or minima, and non-drivability
More informationREPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS
REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS JIAQI JIANG Abstract. This papr studis th rlationship btwn rprsntations of a Li group and rprsntations of its Li algbra. W will mak th corrspondnc in two
More informationThe van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012
Th van dr Waals intraction D. E. Sopr 2 Univrsity of Orgon 20 pril 202 Th van dr Waals intraction is discussd in Chaptr 5 of J. J. Sakurai, Modrn Quantum Mchanics. Hr I tak a look at it in a littl mor
More informationMATH 319, WEEK 15: The Fundamental Matrix, Non-Homogeneous Systems of Differential Equations
MATH 39, WEEK 5: Th Fundamntal Matrix, Non-Homognous Systms of Diffrntial Equations Fundamntal Matrics Considr th problm of dtrmining th particular solution for an nsmbl of initial conditions For instanc,
More informationINTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)
Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..
More informationRoadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems
Roadmap XML Indxing CPS 296.1 Topics in Databas Systms Indx fabric Coopr t al. A Fast Indx for Smistructurd Data. VLDB, 2001 DataGuid Goldman and Widom. DataGuids: Enabling Qury Formulation and Optimization
More informationa 1and x is any real number.
Calcls Nots Eponnts an Logarithms Eponntial Fnction: Has th form y a, whr a 0, a an is any ral nmbr. Graph y, Graph y ln y y Th Natral Bas (Elr s nmbr): An irrational nmbr, symboliz by th lttr, appars
More informationLinear-Phase FIR Transfer Functions. Functions. Functions. Functions. Functions. Functions. Let
It is impossibl to dsign an IIR transfr function with an xact linar-phas It is always possibl to dsign an FIR transfr function with an xact linar-phas rspons W now dvlop th forms of th linarphas FIR transfr
More informationChapter 13 GMM for Linear Factor Models in Discount Factor form. GMM on the pricing errors gives a crosssectional
Chaptr 13 GMM for Linar Factor Modls in Discount Factor form GMM on th pricing rrors givs a crosssctional rgrssion h cas of xcss rturns Hors rac sting for charactristic sting for pricd factors: lambdas
More informationME 321 Kinematics and Dynamics of Machines S. Lambert Winter 2002
3.4 Forc Analysis of Linkas An undrstandin of forc analysis of linkas is rquird to: Dtrmin th raction forcs on pins, tc. as a consqunc of a spcifid motion (don t undrstimat th sinificanc of dynamic or
More information10. The Discrete-Time Fourier Transform (DTFT)
Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w
More informationBrief Introduction to Statistical Mechanics
Brif Introduction to Statistical Mchanics. Purpos: Ths nots ar intndd to provid a vry quick introduction to Statistical Mchanics. Th fild is of cours far mor vast than could b containd in ths fw pags.
More informationMath 102. Rumbos Spring Solutions to Assignment #8. Solution: The matrix, A, corresponding to the system in (1) is
Math 12. Rumbos Spring 218 1 Solutions to Assignmnt #8 1. Construct a fundamntal matrix for th systm { ẋ 2y ẏ x + y. (1 Solution: Th matrix, A, corrsponding to th systm in (1 is 2 A. (2 1 1 Th charactristic
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Procsss: A Frindly Introduction for Elctrical and Computr Enginrs Roy D. Yats and David J. Goodman Problm Solutions : Yats and Goodman,4.3. 4.3.4 4.3. 4.4. 4.4.4 4.4.6 4.. 4..7
More informationLimiting value of higher Mahler measure
Limiting valu of highr Mahlr masur Arunabha Biswas a, Chris Monico a, a Dpartmnt of Mathmatics & Statistics, Txas Tch Univrsity, Lubbock, TX 7949, USA Abstract W considr th k-highr Mahlr masur m k P )
More informationCalculus concepts derivatives
All rasonabl fforts hav bn mad to mak sur th nots ar accurat. Th author cannot b hld rsponsibl for any damags arising from th us of ths nots in any fashion. Calculus concpts drivativs Concpts involving
More informationCS 6353 Compiler Construction, Homework #1. 1. Write regular expressions for the following informally described languages:
CS 6353 Compilr Construction, Homwork #1 1. Writ rgular xprssions for th following informally dscribd languags: a. All strings of 0 s and 1 s with th substring 01*1. Answr: (0 1)*01*1(0 1)* b. All strings
More informationSundials and Linear Algebra
Sundials and Linar Algbra M. Scot Swan July 2, 25 Most txts on crating sundials ar dirctd towards thos who ar solly intrstd in making and using sundials and usually assums minimal mathmatical background.
More informationUNTYPED LAMBDA CALCULUS (II)
1 UNTYPED LAMBDA CALCULUS (II) RECALL: CALL-BY-VALUE O.S. Basic rul Sarch ruls: (\x.) v [v/x] 1 1 1 1 v v CALL-BY-VALUE EVALUATION EXAMPLE (\x. x x) (\y. y) x x [\y. y / x] = (\y. y) (\y. y) y [\y. y /
More informationExam 1. It is important that you clearly show your work and mark the final answer clearly, closed book, closed notes, no calculator.
Exam N a m : _ S O L U T I O N P U I D : I n s t r u c t i o n s : It is important that you clarly show your work and mark th final answr clarly, closd book, closd nots, no calculator. T i m : h o u r
More informationThe Equitable Dominating Graph
Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay
More informationDeift/Zhou Steepest descent, Part I
Lctur 9 Dift/Zhou Stpst dscnt, Part I W now focus on th cas of orthogonal polynomials for th wight w(x) = NV (x), V (x) = t x2 2 + x4 4. Sinc th wight dpnds on th paramtr N N w will writ π n,n, a n,n,
More informationCoupled Pendulums. Two normal modes.
Tim Dpndnt Two Stat Problm Coupld Pndulums Wak spring Two normal mods. No friction. No air rsistanc. Prfct Spring Start Swinging Som tim latr - swings with full amplitud. stationary M +n L M +m Elctron
More informationSuperposition. Thinning
Suprposition STAT253/317 Wintr 213 Lctur 11 Yibi Huang Fbruary 1, 213 5.3 Th Poisson Procsss 5.4 Gnralizations of th Poisson Procsss Th sum of two indpndnt Poisson procsss with rspctiv rats λ 1 and λ 2,
More informationComputing and Communications -- Network Coding
89 90 98 00 Computing and Communications -- Ntwork Coding Dr. Zhiyong Chn Institut of Wirlss Communications Tchnology Shanghai Jiao Tong Univrsity China Lctur 5- Nov. 05 0 Classical Information Thory Sourc
More informationEXST Regression Techniques Page 1
EXST704 - Rgrssion Tchniqus Pag 1 Masurmnt rrors in X W hav assumd that all variation is in Y. Masurmnt rror in this variabl will not ffct th rsults, as long as thy ar uncorrlatd and unbiasd, sinc thy
More informationarxiv: v4 [math.at] 3 Aug 2017
AN EQUIVARIANT TENSOR PRODUCT ON MACKEY FUNCTORS arxiv:1508.04062v4 [math.at] 3 Aug 2017 KRISTEN MAZUR Abstract. For all subgroups H of a cyclic p-group w dfin norm functors that build a -Macky functor
More information22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.
Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M
More informationperm4 A cnt 0 for for if A i 1 A i cnt cnt 1 cnt i j. j k. k l. i k. j l. i l
h 4D, 4th Rank, Antisytric nsor and th 4D Equivalnt to th Cross Product or Mor Fun with nsors!!! Richard R Shiffan Digital Graphics Assoc 8 Dunkirk Av LA, Ca 95 rrs@isidu his docunt dscribs th four dinsional
More informationLecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields
Lctur 37 (Schrödingr Equation) Physics 6-01 Spring 018 Douglas Filds Rducd Mass OK, so th Bohr modl of th atom givs nrgy lvls: E n 1 k m n 4 But, this has on problm it was dvlopd assuming th acclration
More informationu x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula
7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting
More information1973 AP Calculus AB: Section I
97 AP Calculus AB: Sction I 9 Minuts No Calculator Not: In this amination, ln dnots th natural logarithm of (that is, logarithm to th bas ).. ( ) d= + C 6 + C + C + C + C. If f ( ) = + + + and ( ), g=
More informationOn spanning trees and cycles of multicolored point sets with few intersections
On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W
More informationCalculus II (MAC )
Calculus II (MAC232-2) Tst 2 (25/6/25) Nam (PRINT): Plas show your work. An answr with no work rcivs no crdit. You may us th back of a pag if you nd mor spac for a problm. You may not us any calculators.
More informationFirst derivative analysis
Robrto s Nots on Dirntial Calculus Chaptr 8: Graphical analysis Sction First drivativ analysis What you nd to know alrady: How to us drivativs to idntiy th critical valus o a unction and its trm points
More informationHardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R.
Hardy-Littlwood Conjctur and Excptional ral Zro JinHua Fi ChangLing Company of Elctronic Tchnology Baoji Shannxi P.R.China E-mail: fijinhuayoujian@msn.com Abstract. In this papr, w assum that Hardy-Littlwood
More informationGradebook & Midterm & Office Hours
Your commnts So what do w do whn on of th r's is 0 in th quation GmM(1/r-1/r)? Do w nd to driv all of ths potntial nrgy formulas? I don't undrstand springs This was th first lctur I actually larnd somthing
More informationDerangements and Applications
2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir
More informationEinstein Equations for Tetrad Fields
Apiron, Vol 13, No, Octobr 006 6 Einstin Equations for Ttrad Filds Ali Rıza ŞAHİN, R T L Istanbul (Turky) Evry mtric tnsor can b xprssd by th innr product of ttrad filds W prov that Einstin quations for
More informationECE 344 Microwave Fundamentals
ECE 44 Microwav Fundamntals Lctur 08: Powr Dividrs and Couplrs Part Prpard By Dr. hrif Hkal 4/0/08 Microwav Dvics 4/0/08 Microwav Dvics 4/0/08 Powr Dividrs and Couplrs Powr dividrs, combinrs and dirctional
More information(1) Then we could wave our hands over this and it would become:
MAT* K285 Spring 28 Anthony Bnoit 4/17/28 Wk 12: Laplac Tranform Rading: Kohlr & Johnon, Chaptr 5 to p. 35 HW: 5.1: 3, 7, 1*, 19 5.2: 1, 5*, 13*, 19, 45* 5.3: 1, 11*, 19 * Pla writ-up th problm natly and
More informationThere is an arbitrary overall complex phase that could be added to A, but since this makes no difference we set it to zero and choose A real.
Midtrm #, Physics 37A, Spring 07. Writ your rsponss blow or on xtra pags. Show your work, and tak car to xplain what you ar doing; partial crdit will b givn for incomplt answrs that dmonstrat som concptual
More information2F1120 Spektrala transformer för Media Solutions to Steiglitz, Chapter 1
F110 Spktrala transformr för Mdia Solutions to Stiglitz, Chaptr 1 Prfac This documnt contains solutions to slctd problms from Kn Stiglitz s book: A Digital Signal Procssing Primr publishd by Addison-Wsly.
More informationMSLC Math 151 WI09 Exam 2 Review Solutions
Eam Rviw Solutions. Comput th following rivativs using th iffrntiation ruls: a.) cot cot cot csc cot cos 5 cos 5 cos 5 cos 5 sin 5 5 b.) c.) sin( ) sin( ) y sin( ) ln( y) ln( ) ln( y) sin( ) ln( ) y y
More informationy = 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)
4. y = y = + 5. Find th quation of th tangnt lin for th function y = ( + ) 3 whn = 0. solution: First not that whn = 0, y = (1 + 1) 3 = 8, so th lin gos through (0, 8) and thrfor its y-intrcpt is 8. y
More information5. B To determine all the holes and asymptotes of the equation: y = bdc dced f gbd
1. First you chck th domain of g x. For this function, x cannot qual zro. Thn w find th D domain of f g x D 3; D 3 0; x Q x x 1 3, x 0 2. Any cosin graph is going to b symmtric with th y-axis as long as
More information