MATH1035: Workbook Four M. Daws, 2009

Size: px
Start display at page:

Download "MATH1035: Workbook Four M. Daws, 2009"

Transcription

1 MATH1035: Workbook Four M. Daws, 2009 Roots of uity A importat result which ca be proved by iductio is: De Moivre s theorem atural umber case: Let θ R ad N. The cosθ + i siθ = cosθ + i siθ. Proof: The result is obviously true whe = 1. We proceed by iductio, so suppose the claim is true for. The cosθ + i siθ +1 = cosθ + i siθ cosθ + i siθ by the iductio hypothesis, = cosθ cosθ siθ siθ + i cosθ siθ + siθ cosθ = cos + 1θ + i si + 1θ. So the result is true by mathematical iductio. Usig the complex expoetial otatio, De Moivre s theorem says simply that e iθ = e iθ for N, θ R. This looks obvious! However, it s ot quite: we have to do a little work. Remember that we have previously proved that e iθ e iϕ = e iθ+ϕ ideed, the proof was rather similar to the above, usig trigoometric double agle formulae: this is ot a coicidece! So, if e iθ = e iθ which is true if = 1 the e iθ +1 = e iθ e iθ = e i+1θ. So by iductio, the expoetial form of De Moivre s theorem is true this was so simple, you almost did t eed to use iductio. We ca prove a better result: De Moivre s theorem: Let θ R ad Z. The cosθ + i siθ = cosθ + i siθ. Proof: Whe 1 we have already proved this. Whe = 0, the as z 0 = 1 for ay o-zero 1 z C, ad cos0 + i si0 = 1, we have that the result holds whe = 0. Whe < 0, let m = N, so that cosθ + i siθ = cosθ + i siθ m = 1 cosθ + i siθ m 1 = by De Moivre for m, cosmθ + i simθ cosmθ i simθ = cos 2 mθ + si 2 = cosmθ i simθ mθ = cosθ + i siθ, which completes the proof. 1 Why is this true? To be really precise, this is actually a defiitio. 1

2 Agai, this is very easy i the expoetial form, we have already show that for ay θ R, we have 1/e iθ = e iθ. I ll leave it as a exercise to writeup the above proof usig expoetial otatio. De Moivre s theorem allows us to solve equatios of the form z = 1, where Z. Notice that for θ R, if θ = 2kπ for some k Z, the cosθ + i siθ = cosθ + i siθ = cos2kπ + i si2kπ = 1. Thus, whe 0, some solutios to z = 1 are 2kπ 2kπ z = cos + i si for k = 0, 1,, 1. Notice that there is o poit cosiderig k =, for the 2kπ/ = 2π ad the cos2π = cos0 ad si2π = si0, so we just get the same aswer as for k = 0. Similarly, if we try ay other k Z, we ll get the same result as for some 2 umber i the set {0, 1,, 1}. Claim: Let N, 0. The the solutios to z = 1 are z = cos 2kπ + i si 2kπ for k = 0, 1,, 1. Proof: We showed that these are solutios, so we eed to show that they are the oly solutios. Let z = 1. Thus z = z = 1 why? Agai, techically, this is a proof by iductio, but it s so simple I ll skip it. So z = 1, as z is a positive real, ad the oly solutio to t = 1 for t R with t > 0, is t = 1. We showed before that if z = 1, the z = cosθ + i siθ for some θ R. Ideed, we ca choose θ i the rage [0, 2π. So by De Moivre, 1 = z = cosθ + i siθ. So siθ = 0, which meas that θ is a iteger multiple of π. Similarly, cosθ = 1, which meas that θ is a iteger multiple of 2π. So θ = 2kπ for some k Z, that is, θ = 2kπ/. As 0 θ < 2π, we have 0 2kπ < 2π = 0 2kπ < 2π = 0 k <, usig that > 0. So k is i the set {0, 1,, 1} as required. If < 0, the z = 1 if ad oly if 1 = 1/z = z, ad the we ca apply the above theorem for. We call solutios to z = 1 the th roots of uity. This is a slightly old-fashioed phrase: uity meas 1, ad the we take the th root of 1. Questio: What are the complex solutios to z 2 = 1 + i? Aswer: Write z i polar form as z = rcosθ + i siθ, so by De Moivre, z 2 = r 2 cos2θ + i si2θ. Hece z 2 = 1 + i is equivalet to r 2 = 1 + i ad 2θ beig the argumet of 1 + i. Now, 1 + i = = 2 r = 2 1/4. The Pricipal Argumet of 1 + i is π/4, ad so the argumet of 1 + i is π/4 or 2π + π/4, ad so forth. Hece θ = π/8 or π + π/8 you ca check that ay other choice would just be oe of these added to a multiple of 2π. So z 2 = 1 + i z = 2 1/4 cosπ/8 + i siπ/8 or z = 2 1/4 cosπ + π/8 + i siπ + π/8. Of course, the secod solutio is just the egative of the first, as we were solvig a quadratic equatio i this specific case. 2 You might like to thik: which umber? 2

3 Quatifiers: ad You will have see phrases like there exists or for all quite a bit by ow. Just as we write to mea implies, we write to mea for all : remember this as upside dow A for all. We write to mea there exists : remember this as backwards E for there exists. These are called quatifiers. We ca ow traslate phrases i Eglish ito symbols. A example: x R [x 2 0] meas For all real umbers x, we have that x 2 0. We use the brackets simply to make the result easier to read. Just traslatig, you might have come up with For all x R, x 2 0, but this is still hard to read, so we traslate a bit more to the versio I have. Notice that this statemet is true. Some further examples: a R [a 2 = 2] which meas There is a real umber a, with a 2 = 2. We ca make this eve clearer: The square-root of 2 is a real umber. x C y C [xy = yx] meas: For all complex umbers x ad y, we have xy = yx. We ca say this is a simpler way: Multiplicatio of complex umbers is commutative. θ R Z [cosθ + i siθ = cosθ + i siθ]. This is just De Moivre s theorem! Thigs get a bit more complicated whe we combie both ad. For example, r R s R t C [rs = t 2 ]. This true statemet meas that for all r, s R, there exists t C with t 2 = rs. You could also say: For ay two real umbers r, s R, there is a square-root of rs i C. Fix a fuctio f : X Y. The cosider: y Y x X [fx = y] This meas: For each y Y there is some x X with fx = y. This is the defiitio of what it meas for f to be surjective! Notice that this statemet could be true or false, depedig upo what f is. Cosider ow y Z x Z [x < y]. So we traslate: There exists a iteger y, for all itegers x, we have that x is less tha y. If we thik about this for a little while, we see that this is equivalet to There exists a iteger y such that all itegers are less tha y. This is false of course: as y + 1 is ot less tha y. Let us thik about this a bit further: we caot fid a sigle couter-example: istead, we have to fid a ew couter-example for each y. But this is easy, for give ay y Z, we ca fid x Z with x y; just let x = y + 1 or x = y or x = y or whatever. If we swap the order aroud, ad cosider x Z y Z [x < y], the we do get a true statemet. If we traslate, we get For all itegers x, there exists a iteger y with y bigger tha x. This is true, because if I give you x, the you ca certaily fid some y with x < y, for example, y = x + 1 would work. Notice how I phrased this as a game or challege : I thik this is a good way to thik about such problems. 3

4 Agai, let f : X Y be a fuctio, ad cosider: x X y X [x y = fx fy]. This meas: For ay choice of x ad y i X, if x y the fx fy. This is the defiitio of what it meas for f to be ijective: differet elemets of X get mapped by f to differet elemets of Y. We saw before that this is equivalet to: x X y X [fx = fy = x = y]. This 2d coditio is easier to check. Notice that I used the implies symbol, but whe I traslated, I used the if... the... form, which I thik is easier to uderstad. We ca go the other way, ad covert mathematics statemets which are i Eglish ito statemets i symbols. We ca also work with geeral sets. Some examples: Let A = {1, 2, 3, 4, 5, 6}. The there is a atural umber greater tha all elemets of A ca be traslated to x N y A[x > y]. We ca traslate Every atural umber is either eve or odd as x N N[x = 2 or x = 2 1]. How did I do this? Well, a atural umber is eve if it s of the form 2 for some N; a atural is odd if it s of the form 2 1. Let B = 1, 123 R. The the square of ay umber x i B is greater tha x is x B[x 2 > x]. Fially, a example of a false statemet. There is a greatest real umber smaller tha 1. Let s defie a set C =, 1, so C is the collectio of all real umbers less tha 1. The our statemet is that C has a greatest elemet. This ca ow be writte as x C y C[x y]. Fially, why is this false? Equivalece relatios We wat to abstract the idea of equality, which will ultimately lead us to a rigourous defiitio of the ratioal umbers. A relatio o a set X is a very geeral idea, which we itroduce by givig some examples: 1. Numbers x ad y are related if ad oly if x = y. 2. A iteger x is related to a iteger y if ad oly if x divides y. 3. A perso p is related to a perso q if ad oly if p is a brother or sister of q. 4. Complex umbers w ad z are related if ad oly if w z < 1. We deote a relatio by R, ad for x, y X, we write xry if x is related to y. For example, we ca re-write the above as: 1. O R or C or... xry if ad oly if x = y. 2. O Z, defie xry if ad oly if x divides y. 3. O the set of people, defie prq if ad oly if p is a brother or sister of q. 4. O C, defie wrz if ad oly if w z < 1. 4

5 There are some commo properties of relatios. Let R be a relatio o X. The: R is reflexive if xrx for all x X. R is symmetric if xry implies that yrx. R is trasitive if, wheever xry ad yrz, the xrz as well. We ca write these usig quatifiers: R is reflexive if x X[xRx]. R is symmetric if x X y X[xRy = yrx]. R is trasitive if x X y X z X[xRy ad yrz = xrz]. Let us cosider our examples: 1. xry x = y. This is reflexive, as xrx x = x which is always true. This is symmetric, as if xry the x = y so also y = x so yrx. This is trasitive, as if xry ad yrz, the x = y ad y = z, so also x = y = z so x = z so xrz. 2. O Z, xry x divides y. This is reflexive, because for ay x R, certaily x divides x, so xrx holds. This is ot symmetric: a couter-example is that 5R10, because 5 divides 10, but 10 R5, because 10 does ot divide 5. As usual, a sigle couter-example is eough! This is trasitive, for if xry ad yrz, the x divides y ad y divides z. That meas I ca fid k, l Z with y/x = k ad z/y = l. But the z/x = ly/x = lk which is a iteger, showig that x divides z, that is, xrz. 3. prq if ad oly if p is a brother or sister of q. This is ot reflexive, because a perso is ot a siblig of themselves! This is symmetric: if prq the p is a sister or brother of q, so that q is a sister or brother of p, so qrp. This is also trasitive, for if prq ad qrs, the p ad q are sibligs, ad also q ad s are sibligs, so p ad s are also sibligs, so prs. 4. O C, defie wrz if ad oly if w z < 1. This is reflexive, as for ay w C, we have that w w = 0 < 1, so wrw. This is also clearly symmetric: if wrz the w z < 1 so also z w < 1 so zrw. It is ot trasitive: a couter-example is foud by settig x = 0, y = 4i/5 ad z = 4i/5 4/5. The x y = 0 4i/5 = 4/5 ad y z = 4i/5 4i/5 + 4/5 = 4/5 so xry ad yrz. However, x z = 0 4i/5 + 4/5 = 32/25 > 1 so x Rz. Defiitio: A equivalece relatio is a relatio which is reflexive, symmetric ad trasitive. We ted to write istead of R for a equivalece relatio. Let s do a log worked example. Claim: O C, z w if ad oly if e z = e w defies a equivalece relatio. 5

6 Proof: This is reflexive, as e z = e z for ay z, so z z. This is symmetric, for z w = e z = e w = e w = e z = w z. Similarly, this is trasitive, for if z w ad w x the e z = e w ad e w = e x so e z = e x, so z x. Suppose we fix z = a + bi C. Which w C satisfy z w? Well, let w = c + di so z w e z = e w e a e bi = e c e di e a = e c ad e bi = e di. Takig the logarithm, we see that e a = e c if ad oly if a = c. However, e bi = e di e di bi = e 0 = 1 cosd b = 1 ad sid b = 0. This is equivalet to d b beig a iteger multiple of 2π. That is, there exists k Z with d b = 2πk. We have show: Claim: For z = a + bi C fixed, we have that w = c + di is such that z w if ad oly if c = a ad d = b + 2πk for some k Z. However, if c = a ad d = b + 2πk the w = c + di = a + bi + 2πki = z + 2πki. So really we have: Claim: For z C fixed, we have that z w if ad oly if w = z + 2πki for some k Z. Or, i symbols, z w k Z[w = z + 2πki]. Ideas for the tutorial Here are some ideas for thigs which might be iterestig to discuss; aswers will be put o the VLE. yit might be a good idea to draw the solutios to z 5 = 1 o the Argad diagram. Do similar, or maybe slightly more complicated, examples. ya typical questio usig De Moivre is: Express si θ 3 usig siθ ad si3θ. Hit: We have two ways of workig out cos θ + i si θ 3, amely, De Moivre, ad just expadig out. The look at the imagiary parts. ythik about the fial example i the quatifiers sectio: amely, that There is a great real umber smaller tha 1 is false. yhere is a proof that a relatio R is reflexive if it s both symmetric ad trasitive. Ideed, suppose xry, so as R is symmetric, we have that yrx. Thus xry ad yrx, so as trasitive, also xrx. Thus R is reflexive. Why is this ot true? Thik: fid a couter-example! What, precisely was my mistake? yyou probably kow that a quadratic equatio has at most 2 roots or solutios. A cubic has a most three roots. A polyomial of degree meaig the highest power ivolved is has a most roots. If we believe this, the the argumet o the middle of page 2 is made a lot easier! However, why does a degree polyomial have at most roots? 6

7 Problem Set 4 Due i at the lecture o Wedesday 17 November. I the followig, I ll ofte write short proof. You should ow be startig to do some work i rough, ad the be writig up eat fial aswers to had i. By short proof, I mea a icely writte, short ad to-the-poit proof: similar to the way I wrote proofs out above. It s a learig process to decide how much detail you eed to give i a proof: ask i tutorials if you are usure if your proofs are too short or too log. 1. For the complex umber questios, there are electroic resources o the VLE which will help you. a Write the followig, i the simplest way possible, i the form a + bi. i. cos3π/28 + i si3π/28 7 ii. cos2π/3 i si2π/3 11 iii. 3 + i 201. Hit: Covert to the form rcosθ + i siθ. b Fid the solutios, with z C, to the followig equatios see the example at the ed of page 2. i. z 5 = 1 ii. z 8 = 1 iii. z i = 0. Hit: Covert 2 + i ito polar form. 2. a Covert the followig ito words. Try, if possible, to fid the icest form, ot just For all..., there exists.... I each case, decide if the result is true ad if so, write a short proof: some thigs are so obvious they do t eed a proof! or false ad if so, give a couter-example. i. x R y R [x 2 = y]. ii. y R x R [x 2 = y]. iii. y N x N [x 2 = y]. iv. x R [x 2 + 3x + 2 = 0]. v. x N [x 2 + 3x + 2 = 0]. vi. x N y C [yy = x]. b Covert the followig ito symbols. i. There exist two prime umbers whose sum is eve. You might wat to defie a set, P = {prime umbers}. ii. For each atural umber, there is a prime umber bigger tha. iii. There exists a ratioal umber greater tha 5. iv. For ay real umbers a ad b, there exists a solutio i C to the equatio x 2 + ax + b = 0. c Let A = {1, 2, 3} ad B = [0,. For each of the followig, prove that the statemet is true, or give a couter-example. You do t have to traslate the symbols ito words, but obviously this might help you! i. x A y Q [y > x]. ii. x B y Q [y > x]. iii. y Z x A [y > x]. iv. y Z x B [y > x]. v. x A [x 2 x]. 3. For the followig relatios, decide if they are reflexive or ot, symmetric or ot, ad trasitive or ot. You do ot eed to give a proof, but do give a couter-example if you thik the property does ot hold. 7

8 a O R, let xry if ad oly if x y N. b O R, let xry if ad oly if Z[y = 10 x]. c O Q Q, let x 1, x 2 Ry 1, y 2 if ad oly if x 1 = y The followig are equivalece relatios. I each case, give a short proof that we do have a equivalece relatio. Fix some x, ad the fid a simple coditio o y which tells us whe x y. For example, above we showed that z w e z = e w is a equivalece relatio. The z w is equivalet to w = z + 2πki for some k Z. a O C, defie x y if ad oly if Rex = Rey. b O Z, defie x y if ad oly if 10 divides x y. Agai, it might help to re-write this as x y k Z[x y = 10k]. c Let Q = {x 1, x 2 Z Z : x 2 0} i words, Q is the set of ordered pairs i Z Z with a o-zero secod co-ordiate. O Q, defie x 1, x 2 y 1, y 2 if ad oly if x 1 y 2 = x 2 y 1. Optioal questios for further practise 1. Fid the solutios, with z C, to the followig equatios. a z 2 + 2z + 4 = 0 b z 8 + 2z = 0 2. Covert the followig ito words. Are they true or false? a x R y R[x + y = 1]. b y R x R[x + y = 1]. c x N y N[x + y = 1]. 3. The followig are equivalece relatios. Prove this; the fix x ad fid a simple descriptio of those y with x y. a Let X ad Y be sets, ad f : X Y a fuctio. For x, y X defie x y if ad oly if fx = fy. b O C, defie x y if ad oly if x = y. c For x R, let x be the biggest iteger less tha or equal to x. So 1 = 1, π = 3, 17 = 4 ad 0.6 = 1. O R, we defie x y if ad oly if x = y. Hit: It might help to prove that for ay x R, we have x x < x

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Complex Numbers Primer

Complex Numbers Primer Complex Numbers Primer Complex Numbers Primer Before I get started o this let me first make it clear that this documet is ot iteded to teach you everythig there is to kow about complex umbers. That is

More information

1 Generating functions for balls in boxes

1 Generating functions for balls in boxes Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways

More information

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S. Basic Sets Example 1. Let S = {1, {2, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 (b) {1} S (c) {2, 3} S (d) {1, 4} S (e) 2 S. (f) S = {1, 4, {2, 3}} (g) S Example 2. Compute the

More information

Complex Numbers Primer

Complex Numbers Primer Before I get started o this let me first make it clear that this documet is ot iteded to teach you everythig there is to kow about complex umbers. That is a subject that ca (ad does) take a whole course

More information

Math F215: Induction April 7, 2013

Math F215: Induction April 7, 2013 Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains. The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values of the variable it cotais The relatioships betwee

More information

Lecture Notes for CS 313H, Fall 2011

Lecture Notes for CS 313H, Fall 2011 Lecture Notes for CS 313H, Fall 011 August 5. We start by examiig triagular umbers: T () = 1 + + + ( = 0, 1,,...). Triagular umbers ca be also defied recursively: T (0) = 0, T ( + 1) = T () + + 1, or usig

More information

Complex Numbers. Brief Notes. z = a + bi

Complex Numbers. Brief Notes. z = a + bi Defiitios Complex Numbers Brief Notes A complex umber z is a expressio of the form: z = a + bi where a ad b are real umbers ad i is thought of as 1. We call a the real part of z, writte Re(z), ad b the

More information

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book. THE UNIVERSITY OF WARWICK FIRST YEAR EXAMINATION: Jauary 2009 Aalysis I Time Allowed:.5 hours Read carefully the istructios o the aswer book ad make sure that the particulars required are etered o each

More information

2 Geometric interpretation of complex numbers

2 Geometric interpretation of complex numbers 2 Geometric iterpretatio of complex umbers 2.1 Defiitio I will start fially with a precise defiitio, assumig that such mathematical object as vector space R 2 is well familiar to the studets. Recall that

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

Basic Sets. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4

Basic Sets. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4 Basic Sets Example 1. Let S = {1, {, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 False. Note that the elemets of S are 1, the set {, 3}, ad 4. Thus S = 3. (b) {1} S False. While 1

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

INEQUALITIES BJORN POONEN

INEQUALITIES BJORN POONEN INEQUALITIES BJORN POONEN 1 The AM-GM iequality The most basic arithmetic mea-geometric mea (AM-GM) iequality states simply that if x ad y are oegative real umbers, the (x + y)/2 xy, with equality if ad

More information

FLC Ch 8 & 9. Evaluate. Check work. a) b) c) d) e) f) g) h) i) j) k) l) m) n) o) 3. p) q) r) s) t) 3.

FLC Ch 8 & 9. Evaluate. Check work. a) b) c) d) e) f) g) h) i) j) k) l) m) n) o) 3. p) q) r) s) t) 3. Math 100 Elemetary Algebra Sec 8.1: Radical Expressios List perfect squares ad evaluate their square root. Kow these perfect squares for test. Def The positive (pricipal) square root of x, writte x, is

More information

The Structure of Z p when p is Prime

The Structure of Z p when p is Prime LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z

More information

Chapter 13: Complex Numbers

Chapter 13: Complex Numbers Sectios 13.1 & 13.2 Comple umbers ad comple plae Comple cojugate Modulus of a comple umber 1. Comple umbers Comple umbers are of the form z = + iy,, y R, i 2 = 1. I the above defiitio, is the real part

More information

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad

More information

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 304: MIDTERM EXAM SOLUTIONS MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

Complex Numbers Solutions

Complex Numbers Solutions Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i

More information

Stanford Math Circle January 21, Complex Numbers

Stanford Math Circle January 21, Complex Numbers Staford Math Circle Jauary, 007 Some History Tatiaa Shubi (shubi@mathsjsuedu) Complex Numbers Let us try to solve the equatio x = 5x + x = is a obvious solutio Also, x 5x = ( x )( x + x + ) = 0 yields

More information

SOLVED EXAMPLES

SOLVED EXAMPLES Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as

More information

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

Math 299 Supplement: Real Analysis Nov 2013

Math 299 Supplement: Real Analysis Nov 2013 Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example: 74 The Method of Partial Fractios I algebra oe speds much time fidig commo deomiators ad thus simplifyig ratioal epressios For eample: + + + 6 5 + = + = = + + + + + ( )( ) 5 It may the seem odd to be watig

More information

Zeros of Polynomials

Zeros of Polynomials Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree

More information

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the

More information

Math 234 Test 1, Tuesday 27 September 2005, 4 pages, 30 points, 75 minutes.

Math 234 Test 1, Tuesday 27 September 2005, 4 pages, 30 points, 75 minutes. Math 34 Test 1, Tuesday 7 September 5, 4 pages, 3 poits, 75 miutes. The high score was 9 poits out of 3, achieved by two studets. The class average is 3.5 poits out of 3, or 77.5%, which ordiarily would

More information

Properties and Tests of Zeros of Polynomial Functions

Properties and Tests of Zeros of Polynomial Functions Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by

More information

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term. 0. Sequeces A sequece is a list of umbers writte i a defiite order: a, a,, a, a is called the first term, a is the secod term, ad i geeral eclusively with ifiite sequeces ad so each term Notatio: the sequece

More information

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) = AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,

More information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22 CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

MA131 - Analysis 1. Workbook 2 Sequences I

MA131 - Analysis 1. Workbook 2 Sequences I MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................

More information

Induction: Solutions

Induction: Solutions Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For

More information

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4. 11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although

More information

De Moivre s Theorem - ALL

De Moivre s Theorem - ALL De Moivre s Theorem - ALL. Let x ad y be real umbers, ad be oe of the complex solutios of the equatio =. Evaluate: (a) + + ; (b) ( x + y)( x + y). [6]. (a) Sice is a complex umber which satisfies = 0,.

More information

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play. Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers

More information

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains. the Further Mathematics etwork wwwfmetworkorguk V 07 The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values

More information

Solutions to Problem Set 8

Solutions to Problem Set 8 8.78 Solutios to Problem Set 8. We ow that ( ) ( + x) x. Now we plug i x, ω, ω ad add the three equatios. If 3 the we ll get a cotributio of + ω + ω + ω + ω 0, whereas if 3 we ll get a cotributio of +

More information

2.4 Sequences, Sequences of Sets

2.4 Sequences, Sequences of Sets 72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each

More information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

Mathematical Induction

Mathematical Induction Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a

More information

Solutions to Math 347 Practice Problems for the final

Solutions to Math 347 Practice Problems for the final Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is

More information

Presentation of complex number in Cartesian and polar coordinate system

Presentation of complex number in Cartesian and polar coordinate system a + bi, aεr, bεr i = z = a + bi a = Re(z), b = Im(z) give z = a + bi & w = c + di, a + bi = c + di a = c & b = d The complex cojugate of z = a + bi is z = a bi The sum of complex cojugates is real: z +

More information

Math 2784 (or 2794W) University of Connecticut

Math 2784 (or 2794W) University of Connecticut ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really

More information

Series III. Chapter Alternating Series

Series III. Chapter Alternating Series Chapter 9 Series III With the exceptio of the Null Sequece Test, all the tests for series covergece ad divergece that we have cosidered so far have dealt oly with series of oegative terms. Series with

More information

Exercises 1 Sets and functions

Exercises 1 Sets and functions Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,

More information

Math 113, Calculus II Winter 2007 Final Exam Solutions

Math 113, Calculus II Winter 2007 Final Exam Solutions Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you

More information

Some examples of vector spaces

Some examples of vector spaces Roberto s Notes o Liear Algebra Chapter 11: Vector spaces Sectio 2 Some examples of vector spaces What you eed to kow already: The te axioms eeded to idetify a vector space. What you ca lear here: Some

More information

The Binomial Theorem

The Binomial Theorem The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Sequences I. Chapter Introduction

Sequences I. Chapter Introduction Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which

More information

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

P1 Chapter 8 :: Binomial Expansion

P1 Chapter 8 :: Binomial Expansion P Chapter 8 :: Biomial Expasio jfrost@tiffi.kigsto.sch.uk www.drfrostmaths.com @DrFrostMaths Last modified: 6 th August 7 Use of DrFrostMaths for practice Register for free at: www.drfrostmaths.com/homework

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

September 2012 C1 Note. C1 Notes (Edexcel) Copyright   - For AS, A2 notes and IGCSE / GCSE worksheets 1 September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright

More information

Appendix F: Complex Numbers

Appendix F: Complex Numbers Appedix F Complex Numbers F1 Appedix F: Complex Numbers Use the imagiary uit i to write complex umbers, ad to add, subtract, ad multiply complex umbers. Fid complex solutios of quadratic equatios. Write

More information

Algorithms and Data Structures 2014 Exercises and Solutions Week 13

Algorithms and Data Structures 2014 Exercises and Solutions Week 13 Algorithms ad Data Structures 204 Exercises ad Solutios Week 3 Toom-Cook (cotiued) Durig the last lecture, two polyomials A(x) a 0 + a x ad B(x) b 0 + b x both of degree were multiplied, first by evaluatig

More information

PHYSICS 116A Homework 2 Solutions

PHYSICS 116A Homework 2 Solutions PHYSICS 6A Homework 2 Solutios I. [optioal] Boas, Ch., 6, Qu. 30 (proof of the ratio test). Just follow the hits. If ρ, the ratio of succcessive terms for is less tha, the hits show that the terms of the

More information

1. Complex numbers. Chapter 13: Complex Numbers. Modulus of a complex number. Complex conjugate. Complex numbers are of the form

1. Complex numbers. Chapter 13: Complex Numbers. Modulus of a complex number. Complex conjugate. Complex numbers are of the form Comple umbers ad comple plae Comple cojugate Modulus of a comple umber Comple umbers Comple umbers are of the form Sectios 3 & 32 z = + i,, R, i 2 = I the above defiitio, is the real part of z ad is the

More information

For use only in [the name of your school] 2014 FP2 Note. FP2 Notes (Edexcel)

For use only in [the name of your school] 2014 FP2 Note. FP2 Notes (Edexcel) For use oly i [the ame of your school] 04 FP Note FP Notes (Edexcel) Copyright wwwpgmathscouk - For AS, A otes ad IGCSE / GCSE worksheets For use oly i [the ame of your school] 04 FP Note BLANK PAGE Copyright

More information

Solutions to Homework 1

Solutions to Homework 1 Solutios to Homework MATH 36. Describe geometrically the sets of poits z i the complex plae defied by the followig relatios /z = z () Re(az + b) >, where a, b (2) Im(z) = c, with c (3) () = = z z = z 2.

More information

Lecture 7: Fourier Series and Complex Power Series

Lecture 7: Fourier Series and Complex Power Series Math 1d Istructor: Padraic Bartlett Lecture 7: Fourier Series ad Complex Power Series Week 7 Caltech 013 1 Fourier Series 1.1 Defiitios ad Motivatio Defiitio 1.1. A Fourier series is a series of fuctios

More information

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1 . Ifiite Series Oce we have a sequece of umbers, the ext thig to do is to sum them up. Give a sequece a be a sequece: ca we give a sesible meaig to the followig expressio? a = a a a a While summig ifiitely

More information

INTEGRATION BY PARTS (TABLE METHOD)

INTEGRATION BY PARTS (TABLE METHOD) INTEGRATION BY PARTS (TABLE METHOD) Suppose you wat to evaluate cos d usig itegratio by parts. Usig the u dv otatio, we get So, u dv d cos du d v si cos d si si d or si si d We see that it is ecessary

More information

MAT 271 Project: Partial Fractions for certain rational functions

MAT 271 Project: Partial Fractions for certain rational functions MAT 7 Project: Partial Fractios for certai ratioal fuctios Prerequisite kowledge: partial fractios from MAT 7, a very good commad of factorig ad complex umbers from Precalculus. To complete this project,

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the

More information

Random Models. Tusheng Zhang. February 14, 2013

Random Models. Tusheng Zhang. February 14, 2013 Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the

More information

Addition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c

Addition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c Notes for March 31 Fields: A field is a set of umbers with two (biary) operatios (usually called additio [+] ad multiplicatio [ ]) such that the followig properties hold: Additio: Name Descriptio Commutativity

More information

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

More information

Frequentist Inference

Frequentist Inference Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for

More information

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row: Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,

More information

Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function

Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this

More information

Worksheet on Generating Functions

Worksheet on Generating Functions Worksheet o Geeratig Fuctios October 26, 205 This worksheet is adapted from otes/exercises by Nat Thiem. Derivatives of Geeratig Fuctios. If the sequece a 0, a, a 2,... has ordiary geeratig fuctio A(x,

More information

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam 4 will cover.-., 0. ad 0.. Note that eve though. was tested i exam, questios from that sectios may also be o this exam. For practice problems o., refer to the last review. This

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION OF FIBONACCI VECTORS CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

Cardinality Homework Solutions

Cardinality Homework Solutions Cardiality Homework Solutios April 16, 014 Problem 1. I the followig problems, fid a bijectio from A to B (you eed ot prove that the fuctio you list is a bijectio): (a) A = ( 3, 3), B = (7, 1). (b) A =

More information

Homework 9. (n + 1)! = 1 1

Homework 9. (n + 1)! = 1 1 . Chapter : Questio 8 If N, the Homewor 9 Proof. We will prove this by usig iductio o. 2! + 2 3! + 3 4! + + +! +!. Base step: Whe the left had side is. Whe the right had side is 2! 2 +! 2 which proves

More information

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f

More information

ARRANGEMENTS IN A CIRCLE

ARRANGEMENTS IN A CIRCLE ARRANGEMENTS IN A CIRCLE Whe objects are arraged i a circle, the total umber of arragemets is reduced. The arragemet of (say) four people i a lie is easy ad o problem (if they liste of course!!). With

More information

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More information

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006 MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the

More information

APPENDIX F Complex Numbers

APPENDIX F Complex Numbers APPENDIX F Complex Numbers Operatios with Complex Numbers Complex Solutios of Quadratic Equatios Polar Form of a Complex Number Powers ad Roots of Complex Numbers Operatios with Complex Numbers Some equatios

More information

Complex Number Theory without Imaginary Number (i)

Complex Number Theory without Imaginary Number (i) Ope Access Library Joural Complex Number Theory without Imagiary Number (i Deepak Bhalchadra Gode Directorate of Cesus Operatios, Mumbai, Idia Email: deepakm_4@rediffmail.com Received 6 July 04; revised

More information