Lecture 10: Mathematical Preliminaries

Size: px
Start display at page:

Download "Lecture 10: Mathematical Preliminaries"

Transcription

1 Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # I this ad the ext two lectures, our mai obective is to give a review of a variety of mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Most of these cocepts ad tools should be familiar to the studet. They are provided here maily as a referece ad for completeess.

2 Topics reviewed i this lecture Sets Tuples ad Cartesia Products Relatios ad Fuctios Proof Methods - Direct Proof - Idirect Proof - Proof by Cotradictio - Proof by Couterexample - Mathematical Iductio Logarithms Floor ad Ceilig Fuctios Factorial ad Biomial coefficiets The Pigeohole Priciple Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 2 The topics briefly reviewed i this lecture iclude the followig: - Sets - Tuples ad Cartesia Products - Relatios ad Fuctios - Five mathematical Proof methods which iclude:. The Direct Proof method 2. Idirect Proof 3. Proof by Cotradictio 4. Proof by Couterexample 5. Mathematical Iductio - The we will review logarithms - Floor ad Ceilig Fuctios - Factorial ad Biomial coefficiets, ad fially - The Pigeohole Priciple First we will itroduce Sets

3 Sets Why sets are importat to the algorithm course? Defiitio: A set is a collectio of distict elemets, which are called members or elemets of the set. This collectio of elemets is treated as a sigle obect. Two commoly used methods to represet a set:. By listig its elemets betwee a pair of curly braces, or 2. By describig its elemets betwee curly braces Lecture # <BUTTONS AREA: Do ot write aythig here> Why sets are importat to the algorithm course? We study set cocepts because iput of a algorithm may be cosidered as a set draw from some particular domai like the set of itegers. We will briefly preset basic cocepts ad a few elemetary properties of sets used i the desig ad aalysis of algorithms. But first let us defie sets. Defiitio: A set is a collectio of distict elemets, which are called members or elemets of the set. This collectio of elemets is treated as a sigle obect. The two commoly used methods to represet a set are: The first method is by listig list elemets betwee a pair of curly braces. The secod method is by describig list elemets betwee curly braces

4 Sets (Cot.) Examples. Example : The set of itegers betwee ad ca be represeted as {, 2, 3,..., }. This same set ca be represeted usig the secod method as S {x x ad x is a iteger}. The secod method is the oly way used to describe ucoutable set. Example 2: S {x x is a real umber ad x }. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 4 Examples o Sets: Example : Usig the first method of represetatio, the set of itegers betwee ad ca be represeted as {, 2, 3,..., }. O the other had, this same set ca be represeted usig the secod method by specifyig some properties as follows: S {x x ad x is a iteger}. The expressio for S is read the set of all elemets x such that x is equal or greater tha ad less tha or equal to ad x is a iteger. The secod method is the oly way used to describe ucoutable set. Example 2: The set otatio S {x x is a real umber ad x } is used to represet the set of real umbers betwee ad.

5 Sets (Cot.) Set Properties A set is fiite if it cotais elemets for some costat >, ad ifiite otherwise. - Example above represets a fiite set. - Examples of ifiite sets: Set of atural umbers {, 2, } Set of itegers Set of ratioals ad Set of reals. Ifiite set is coutable if its elemets ca be listed as the first elemet, secod elemet, ad so o; otherwise it is called ucoutable. The set of real umbers is ucoutable. Lecture # <BUTTONS AREA: Do ot write aythig here> Elemetary properties of sets A set is said to be fiite if it cotais elemets for some costat >, ad ifiite otherwise. - The set i Example above is a fiite set. - Examples of ifiite sets are: Set of atural umbers {, 2, } Set of itegers Set of ratioals ad Set of reals. A ifiite set is called coutable if its elemets ca be listed as the first elemet, secod elemet, ad so o; otherwise it is called ucoutable. For example, the set of real umbers is ucoutable.

6 Sets (Cot.) Set properties (Cot.) The empty set is deoted by {} or by φ, ad it is a subset of every set. The cardiality of a fiite set A deoted by A, is the umber of elemets i A. x A idicates that x is a member of A. A set B is a subset of a set A, deoted by B A, if each elemet of B is a elemet of A. A is said to be a superset of the set B. B A deotes that B is a proper subset of A. That is, i additio to B A, B A. For ay set A, A A, ad φ A. If A ad B are two sets, the A B ad B A, meas A B. The Uio of two sets A ad B, deoted by A U B, is the set {x x A or x B} Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 6 The empty set is deoted by {} or by φ, ad it is a subset of every set. The cardiality of a fiite set A deoted by A, is the umber of elemets i A. x A idicates that x is a member of A. A set B is a subset of a set A, deoted by B A, if each elemet of B is a elemet of A. A is said to be a superset of the set B. B A deotes that B is a proper subset of A. That is, i additio to B A, B A. For ay set A, A A, ad φ A. If A ad B are two sets, the A B ad B A, meas A B. The Uio of two sets A ad B, deoted by A U B, is the set {x x A or x B}

7 Sets (Cot.) Set properties (Cot.) The itersectio of two sets A ad B, deoted by A B, is the set {x x A ad x B}. The differece of a set A from a set B, deoted by A - B, is the set {x x A ad x B}. The complemet of a set A, deoted by A, is defied as U - A, where U is the uiversal set cotaiig A, which is usually uderstood from the cotext. If A, B ad C are sets, the A U ( B U C) (A U B) U C, ad A (B C) (A B) C. Two sets A ad B are said to be disoit if A B φ. The power set of a set A, deoted by P(A), or 2 A is the set of all subsets of A. If A, the P (A) 2. Note that φ P(A) ad A P(A). To describe the umber of distict subsets of cardiality k that a fiite set of elemets have, we use the special otatio, read as umber of combiatios of k items take k at a time, or choose k. Also, the otatio C (, k) is sometimes used. These quatities are called biomial coefficiets, as will be discussed later. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 7 The itersectio of two sets A ad B, deoted by A B, is the set {x x A ad x B}. The differece of a set A from a set B, deoted by A - B, is the set {x x A ad x B}. The complemet of a set A, deoted by A, is defied as U - A, where U is the uiversal set cotaiig A, which is usually uderstood from the cotext. If A, B ad C are sets, the A U ( B U C) (A U B) U C, ad A (B C) (A B) C. Two sets A ad B are said to be disoit if A B φ. The power set of a set A, deoted by P(A), or 2 A is the set of all subsets of A. If A, the P (A) 2. Note that φ P(A) ad A P(A). To describe the umber of distict subsets of cardiality k that a fiite set of elemets have, we use the special otatio, read as umber of combiatios k of items take k at a time, or choose k. Also, the otatio C (, k) is sometimes used. These quatities are called biomial coefficiets, as will be discussed later.

8 Tuples ad the Cartesia Products A ordered -tuple is a ordered collectio (a, a 2,, a ) that has a as its first elemet, a 2 as its secod elemet,, ad a as its th elemet. A tuple ofte do ot have the same type. Short tuples have special ames: ordered pairs refer for 2-tuples, triples for 3-tuples, quadruple for 4-tuples, quituple for 5-tuples, ad so o. The Cartesia (or cross) product of two sets A ad B, deoted by A * B, is the set of all ordered pairs (a, b) where a A ad b B. I set otatio: A * B {(a, b) a A ad b B}. I geeral, the Cartesia product of sets is: A * A 2 * * A {(a, a 2,, a ) a i A i, i }. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 8 Tuples ad the Cartesia Products A ordered -tuple is a ordered collectio (a, a 2,, a ) that has a as its first elemet, a 2 as its secod elemet,, ad a as its th elemet. A tuple ofte do ot have the same type. Short tuples have special ames: ordered pairs refer for 2-tuples, triples for 3- tuples, quadruple for 4-tuples, quituple for 5-tuples, ad so o. The Cartesia (or cross) product of two sets A ad B, deoted by A * B, is the set of all ordered pairs (a, b) where a A ad b B. I set otatio: A * B {(a, b) a A ad b B}. I geeral, the Cartesia product of sets is: A * A 2 * * A {(a, a 2,, a ) a i A i, i }.

9 Relatios ad Fuctios Why we study fuctios ad relatios? Elemetary properties of relatios ad fuctios. - Let A ad B be two oempty sets, a biary relatio, or simply a relatio, R from A to B is a set of ordered pairs (a, b) where a A ad b B. That is R A * B. - If A B, we say that R is a relatio o the set A. - The domai of R writte as Dom (R) {a for some b B, (a, b) R}. - The rage of R writte as Ra (R) {b for some a A, (a, b) R}. Examples o domai ad rage S {(2, 5), (3, 3)}, S 2 {(x, y) x, y are positive itegers ad x y} ad S 3 {(x, y) x, y are real umbers ad x 2 y 2 } the, Dom (S ) {2, 3}; Ra (S ) {5, 3); Dom (S 2 ) Ra (S 2 ) is the set of atural umbers, ad Dom (S 3 ) Ra (S 3 ) is the set of real umbers i the iterval [-.. ]. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 9 Relatios ad Fuctios Why we study fuctios ad relatios? We study relatios ad fuctios because a algorithm ca be cosidered as a fuctio (or costraied relatio) that maps each possible iput to a specific output. Elemetary properties of relatios ad fuctios used i the desig ad aalysis of algorithms: - Let A ad B be two oempty sets, a biary relatio, or simply a relatio, R from A to B is a set of ordered pairs (a, b) where a A ad b B. That is R A * B. - If A B, we say that R is a relatio o the set A. - The domai of R writte as Dom (R) {a for some b B, (a, b) R}. - The rage of R writte as Ra (R) {b for some a A, (a, b) R}. Example o domai ad rage Assume the three sets S {(2, 5), (3, 3)}, S 2 {(x, y) x, y are positive itegers ad x y} ad S 3 {(x, y) x, y are real umbers ad x 2 y 2 } the, Dom (S ) {2, 3}; Ra (S ) {5, 3); Dom (S 2 ) Ra (S 2 ) is the set of atural umbers, ad Dom (S 3 ) Ra (S 3 ) is the set of real umbers i the iterval [-.. ].

10 Relatios ad Fuctios (Cot.) Elemetary properties of relatios ad fuctios (Cot.) - Let R be a relatio o a set A: the R is said to be: reflexive if (a, a) R a A. symmetric if (a, b) R implies (b, a) R. trasitive if (a, b) R ad (b, c) R implies (a, c) R. irreflexive if (a, a) R a A asymmetric if (a, b) R implies (b, a) R atisymmetric if (a, b) R ad (b, a) R implies a b. - A relatio that is reflexive, atisymmetric ad trasitive is called a partial order. Example o a partial order relatio: Let S {(x, y) x, y are positive itegers ad x divides y} S 2 {(x, y) x, y are itegers ad x y} the: both S ad S 2 are reflexive, atisymmetric ad trasitive ad hece both are partial order. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # Elemetary properties of relatios ad fuctios (Cot.) - Let R be a relatio o a set A: the R is said to be: reflexive if (a, a) R a A. symmetric if (a, b) R implies (b, a) R. trasitive if (a, b) R ad (b, c) R implies (a, c) R. irreflexive if (a, a) R a A asymmetric if (a, b) R implies (b, a) R atisymmetric if (a, b) R ad (b, a) R implies a b. - A relatio that is reflexive, atisymmetric ad trasitive is called a partial order. Example o a partial order relatio: Let S {(x, y) x, y are positive itegers ad x divides y} S 2 {(x, y) x, y are itegers ad x y} the: both S ad S 2 are reflexive, atisymmetric ad trasitive ad hece both are partial order.

11 Relatios ad Fuctios (Cot.) Equivalece Relatios It is a relatio that is, reflexive, trasitive ad symmetric. If R is a relatio o a set A, R partitios A ito equivalece classes such that: - For ay C i, i k, if x C i ad y C i, the (x, y) R. - If x C i ad y C i ad i, the (x, y) R. Example: x y (mod ) if x - y k * for some iteger k. That is, x y (mod ) if both x ad y leave the same remaider whe divided by. For istace: 3 8 (mod 5) If we defie the relatio: R {(x, y) x, y are itegers ad x y (mod )}, the R is a equivalece relatio. R partitios the set of itegers ito classes: C, C,, C - such that x C i ad y C i if ad oly if x y (mod ). Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # Equivalece Relatios A equivalece relatio is a relatio that is, reflexive, trasitive ad symmetric. If R is a relatio o a set A, R partitios A ito equivalece classes C, C 2,, C k such that ay two elemets i oe equivalece class are related by R. That is: - For ay C i, i k, if x C i ad y C i, the (x, y) R. - If x C i ad y C i ad i, the (x, y) R. Example o Equivalece relatio: Let x ad y be two itegers, ad let be a positive iteger, the x ad y are said to be cogruet modulo, deoted by x y (mod ) if x - y k * for some iteger k. Thus we say that x ad y are cogruet modulo if both x ad y leave the same remaider whe divided by. For istace: 3 8 (mod 5) as 3 8 * 5, or both 3 ad 8 both have the same remaider (3) whe divided by 5. If we defie the relatio: R {(x, y) x, y are itegers ad x y (mod )}, the R is a equivalece relatio. R partitios the set of itegers ito classes: C, C,, C - such that x C i ad y C i if ad oly if x y (mod ).

12 Relatios ad Fuctios (Cot.) Fuctios: Defiitio We write this as f (x) y Examples:. The relatio {(, 2), (3, 4), (2, 4) is a fuctio, 2. The relatio {(, 2), (, 4) is ot sice for the elemet i the domai there is more tha o elemet i the rage. 3. The relatio {(x, y)} x, y are positive itegers ad x y 3 } is a fuctio 4. The relatio {(x, y) x is a positive iteger, y is iteger ad x y 2 } is ot a fuctio. Importat properties of fuctios Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 2 Fuctios: A fuctio f is a (biary) relatio such that for every elemet x Dom (f) there exists oe elemet y Ra (f) with (x, y) f. Usually we write this as f (x) y istead of (x, y) f ad says that y is the value or image of f at x. Examples:. The relatio {(, 2), (3, 4), (2, 4) is a fuctio, 2. The relatio {(, 2), (, 4) is ot sice for the elemet i the domai there is more tha o elemet i the rage. 3. The relatio {(x, y)} x, y are positive itegers ad x y 3 } is a fuctio 4. The relatio {(x, y) x is a positive iteger, y is iteger ad x y 2 } is ot a fuctio. Properties of fuctios - Let f be a fuctio with Dom (f)a ad Ra (f) B for oempty sets A ad B: We say that f is oe to oe if f (x) f (y) implies x y, that is if for o differet elemets x ad y i A, f (x) f (y). - f is said to be oto B if Ra (f) B - f is said to be oe to oe correspodece betwee A ad B (also called biectio) if it is both oe to oe ad oto B.

13 Proof Techiques. Direct Proof 2. Idirect Proof 3. Proof by Cotradictio 4. Proof by Couterexample 5. Proof by Mathematical Iductio Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 3 Proof Techiques Mathematical proofs is cosidered as a essetial compoet ad prerequisite to algorithm desig ad aalysis. We will give here a brief review of five proof methods that are commoly used i algorithm desig ad aalysis.. Direct Proof 2. Idirect Proof 3. Proof by Cotradictio 4. Proof by Couterexample 5. Proof by Mathematical Iductio

14 Notatios used i mathematical proofs A propositio or assertio. The egatio symbol. The implicatio symbol. The if ad oly if symbol. Thus: - P Q stads for P implies Q or if P the Q. - The statemet P Q, stads for: P if ad oly if Q. It cosists of two parts (i.e., two implicatios) each of which should be prove separately: The if part (implicatio): P Q. The oly if part (implicatio): Q P. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 4 Notatios used i mathematical proofs The followig otatio is used i mathematical proof. A statemet that ca be either true or false but ot both is called a propositio or assertio. The symbol is the egatio symbol. The symbol is the implicatio symbol, ad is the if ad oly if symbol. Thus: - P Q stads for P implies Q or if P the Q. - The statemet P Q, stads for: P if ad oly if Q. That is: P is true if ad oly if Q is true. It cosists of two parts (two implicatios) each of which should be prove separately: The if part (implicatio): P Q. The oly if part (implicatio): Q P.

15 Direct proof method We wat to prove that if P the Q, that is: P Q. We start the proof by assumig that P is true, ad the deduce the truth of Q from the truth of P. 2 Example: If N is a eve iteger, the prove that N is also eve iteger. Solutio: Sice N is eve, N 2k for some iteger k. So, N 2 (2K) 2 4K 2 2 (2K 2 ). It follows that N 2 is a eve iteger. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 5 Direct Proof method We wat to prove that if P the Q, that is: P Q We start the proof by assumig that P is true, ad the deduce the truth of Q from the truth of P. Example: Use the direct proof method to prove that if N is a eve iteger, the prov that N 2 is also eve iteger. Solutio: Sice N is eve, N 2k for some iteger k. So, N 2 (2K) 2 4K 2 2 (2K 2 ). It follows that N 2 is a eve iteger.

16 Idirect proof method Idirect proof if ot Q the ot P P Q is logically equivalet to if ot Q the ot P The statemet if it is raiig the it is cloudy is equivalet to the statemet if it is ot cloudy the it is ot raiig. Example: Prove the assertio that if 2 is a eve iteger, the is a eve iteger Solutio: This assertio is logically equivalet to if is a odd iteger, the 2 is a odd iteger. Sice is odd the 2k for some iteger k. Hece, 2 (2k ) 2 4k 2 4k 2(2k 2 2k). Which implies that 2 is a odd iteger. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 6 Idirect proof method It is some times much easier to prove if ot Q the ot P tha usig a direct proof for the statemet if P the Q. P Q is logically equivalet to the cotrapositive implicatio if ot Q the ot P, which is also writte as Q P. For istace, the statemet if it is raiig the it is cloudy is equivalet to the statemet if it is ot cloudy the it is ot raiig. Example: Prove the assertio that if 2 is a eve iteger, the is a eve iteger usig idirect proof. Solutio: This assertio is logically equivalet to if is a odd iteger, the 2 is a odd iteger which is proved usig the direct method as follows: Sice is odd the 2k for some iteger k. Hece, 2 (2k ) 2 4k 2 4k 2(2k 2 2k). Which implies that 2 is a odd iteger.

17 Proof by cotradictio Widely used ad extremely powerful. To prove the statemet if P the Q : - Start with the assumptio that P is true but Q is false Logical reasoig for proof by cotradictio. Other cotradictios may be reached as well. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 7 Proof by cotradictio Widely used ad extremely powerful. Its power comes from makig proofs cocise ad short as will be see i the ext example. To prove the statemet if P the Q : - start with the assumptio that P is true but Q is false: If this leads to a cotradictio, it implies that our assumptio Q is false must be wrog ad hece Q must follow from P. Logical reasoig for proof by cotradictio: - If we kow that P Q is true ad Q is false, the P must be false. - So, if we assume at the begiig that P is true, Q is false, ad reach the coclusio that P is false, the we have that P is both true ad false. - But P caot be both true ad false - a cotradictio. - We coclude our assumptio that Q is false is wrog Q must be true. Other cotradictios may be reached as well: For istace, after assumig that P is true ad Q is false, we may reach the coclusio that, say, -.

18 Proof by cotradictio (Cot.) Example. Prove the theorem that: If balls are distributed ito m boxes, the oe box must cotai at least / m balls. Solutio: If all boxes have less tha / m balls, the the total umber of balls is at most m m m m m < m m m which is a cotradictio. This is a excellet example that shows its power i producig very short proofs. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 8 Example o proof by cotradictio: Prove by cotradictio the pigeohole pricipal theorem that: If balls are distributed ito m boxes, the oe box must cotai at least / m balls. The defiitio of this priciple will be give later i this lecture. Solutio: If all boxes have less tha / m balls, the the total umber of balls is at most m m m m m < m m m which is a cotradictio. This is a excellet example that shows the power of this proof method i producig very short proofs.

19 Proof by couterexample method Geeral Itroductio Example: Cosider the fuctio f () 2 4 defied o the set of oegative itegers: - f () 4, f () 43,, f (39) 6 are all primes. - Assertio: f () is always a prime umber. - We use Proof by couterexample, to falsify this assertio: cosider f (4) 68 (4) 2 which is ot a prime. We coclude that the assertio is false. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 9 Proof by couterexample method Geeral Itroductio: - This method is used to show that a propositio that holds true quite ofte is ot always true. - Also, it is usually used whe we are faced with a problem that requires provig or disprovig a give assertio. I this case, we may start by tryig to disprove the assertio with a couterexample. - I algorithm aalysis, this techique is frequetly used to show that a algorithm does ot always produce a result with certai properties. Example: Let f () 2 4 be a fuctio defied o the set of oegative itegers: - f () 4, f () 43,, f (39) 6 are all primes. - Assertio: f () is always a prime umber. - We use Proof by couterexample, to falsify this assertio: cosider f (4) 68 (4) 2 which is ot a prime. We coclude that the assertio is false.

20 Proof by mathematical iductio Proof By Mathematical Iductio: A powerful proof techique. The truth of a umber of statemets (propositios) ca be iferred from the truth of a few specific istaces. Suppose a sequece of statemets S, S 2,..., we wat to prove to be true. Suppose also that:. For some i, we kow that S, S 2,, S i are true. 2. The problem is such that for ay i, the truths of S, S 2,... S imply the truth of S. We ca the use iductio to show that every statemet i this sequece is true. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 2 Proof By Mathematical Iductio: It is a powerful proof techique for provig that a property holds for a sequece of atural umbers,, 2,. Typically, is take to be or, but it ca be ay atural umber. Also, the sequece,, 2, ca be ay liearly ordered set. However, i the maority of proofs by iductio, the set of atural umbers is assumed. I this techique, the truth of a umber of statemets (propositios) ca be iferred from the truth of a few specific istaces. Suppose we have a sequece of statemets S, S 2,..., we wat to prove to be true. Suppose also that the followig holds:. For some i, we kow that S, S 2,, S i are true. 2. The problem is such that for ay i, the truths of S, S 2,... S imply the truth of S. We ca the use iductio to show that every statemet i this sequece is true.

21 Proof by mathematical iductio (Cot.) Example Prove that a biary tree of height has at most 2 leaves: Proof: Let L () represet the umber of leaves of a biary tree of height. Show that L () 2 : Iductio Basis: Clearly L () 2 sice a tree of height has at most oe leaf. Iductio Hypothesis: Assume L (k) 2 k for all k, k. Iductio Step: Let T be a tree of height. By iductio hypothesis, the umber of leaves i the left ad right subtrees of the root is 2. It follows that the umber of leaves i T is {}. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 2 Example o Proof by mathematical iductio Usig the Priciple of Mathematical Iductio, Prove that a biary tree of height has at most 2 leaves: Proof: Let L () represet the umber of leaves of a biary tree of height. We wat to show that L () 2 usig mathematical iductio: Iductio Basis: Clearly L () 2 sice a tree of height ca have o odes other tha the root. That is, it has at most oe leaf. Iductio Hypothesis: Assume L (k) 2 k for all k, k. Iductio Step: Let T be a tree of height. By iductio hypothesis, the umber of leaves i the left ad right subtrees of the root is 2. It follows that the umber of leaves i T is {}. Thus, the property is true for ( ). Sice T is arbitrary, the proof is complete.

22 Logarithms Importace of the logarithm fuctio. Defiitio of the logarithm fuctio The base is omitted whe it is 2. The atural umber e, defied by e lim ! 2! 3! log e x is writte as l x, ad is called the atural logarithm of x. l x is also defied by: x l x dt. t Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 22 Logarithms The logarithm fuctio, ad specifically to the base 2, is used very extesively i the aalysis of may algorithms. Defiitio. Let b >, be a positive real umber, x a real umber, ad suppose that for some positive real umber y we have: y b x. The, x is called the logarithm of y to the base b ad is writte as x log y. Sice the log to the base 2 is used most ofte i computatioal complexity, therefore, we omit the base whe it is 2. Aother useful base is the atural umber e, which is defied by e lim ! 2! 3! Geerally, log e x is writte as l x, ad is called the atural logarithm of x. l x is also defied by: x l x dt. t b

23 Logarithms (Cot.) Properties of logarithms log b xy log b x log b y, ad log b ( c ) y log b c, if c >. log b is a strictly icreasig fuctio. log b is a oe-to-oe fuctio. log. b log e.443 ad log The derivative of l (x) is /x. The derivative of log (x) log (e) / x. log b a b a. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 23 Properties of logarithms For ay real umbers x ad y greater tha, the followig properties of logarithms follow from the defiitio: log b xy log b x log b y, ad log b ( c y ) y log b c, if c >. log is a strictly icreasig fuctio, that is, if x > y, the log x > log y. b log b is a oe-to-oe fuctio, that is, if log b x log b y, the x y. log b. log e.443. log The derivative of l (x) is /x. The derivative of log (x) log (e) / x. log b a b a. b b

24 Logarithms (Cot.) Properties of logarithms (Cot.) Covertig betwee bases: log a x log b x. log a b For example: l x log x ad l 2 log x l x. log e Importat idetity: x log b y logb x y, x, y >. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 24 More properties of logarithms To covert from oe base to aother, we use the followig chai rule: log a x log b x. log a b For example: l x log x ad l 2 log x l x. log e The followig idetity ca be proved by takig the logarithms of both sides: x log b y logb x y, x, y >.

25 Floor ad Ceilig Fuctios Defiitios: - Mootoically icreasig fuctio - Mootoically decreasig fuctio. - Strictly icreasig fuctio. - Strictly decreasig fuctio. The floor ad ceilig fuctios to be defied later are mootoically icreasig. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 25 Floor ad Ceilig Fuctios Defiitios: - A fuctio is mootoically icreasig if m implies f (m) f (). - A fuctio is mootoically decreasig if m implies f (m) f (). - A fuctio is strictly icreasig if m < implies f (m) < f (). - A fuctio is strictly decreasig if m < implies f (m) > f (). The floor ad ceilig fuctios to be defied later are mootoically icreasig.

26 Floor ad Ceilig Fuctios (Cot.) Let x be ay real umber, the: - x is defied as the greatest iteger x. - x is defied as the smallest iteger x. Examples: x / 2 x / 2 x. x x. x x. x- < x x / m < x. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 26 Let x be ay real umber, the: - The floor of x, deoted by x is defied as the greatest iteger x. - The ceilig of x, deoted by x is defied as the smallest iteger x. Examples: Few more importat properties are: x / 2 x / 2 x. x x x x.. x- < x x / m < x.

27 Floor ad Ceilig Fuctios (Cot.) Theorem. Let f (x) be a mootoically icreasig fuctio such that if f (x) is iteger, the x is iteger. The, ( x ) f ( x ad f ( x ) f ( x. f ) ) Examples: for ay positive iteger ad itegers a ad b : -. x / x / x / x / / a / b / ab / a / b / ab / 2 / 2 / 2 / 4 / 2 / If is ot a power of 2, the there is a iteger k such that 2 k < < 2 k. I this case, k ad. log log k The followig two iequalities hold: - 2 log < 2. - < 2 log 2 Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 27 Theorem. Let f (x) be a mootoically icreasig fuctio such that if f (x) is iteger, the x is iteger. The, ( x ) f ( x ad f ( x ) f ( x. f ) ) Examples: for ay positive iteger ad itegers a ad b : -. x / x / x / x / / a / b / ab / a / b / ab / 2 / 2 / 2 / 4 / 2 / If is ot a power of 2, the there is a iteger k such that 2 k < < 2 k. I this case, k ad. log log k The followig two iequalities hold: - 2 log < 2. - < 2 log 2

28 Factorial ad Biomial coefficiets Geeral Factorials - Permutatio of a set of distict obects - k-permutatio - Whe k, the quatity becomes P * 2 * *, ad is called factorial ad deoted by!. - Useful approximatio to! is Stirlig s formula ( 2π *( / e). - Usig Stirlig s formula, we compute 3! with relative error of about.27% oly. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 28 Factorial ad Biomial coefficiets We briefly list some of the importat combiatorial properties that are frequetly used i the aalysis of algorithm. These properties are used with combiatorial problems. I particular, we will limit our review to permutatios ad combiatios, which lead to the defiitios of factorials ad biomial coefficiets. Factorials - A permutatio of a set of distict obects is defied as a ordered arragemet of these obects. For example, i the 3-elemets set {a, b, c} there are 6 permutatios: abc, acb, bac, bca, cab, cba. - We may be also iterested i ordered arragemets of some of the elemets of a set. I this case, we use the term k-permutatio to refer to a ordered arragemet of k elemets of a set. The umber of ways to choose k obects i a ordered arragemet (also, called the umber of permutatios of obects take k at a time) is: (-) (-2) ( k ) ad deoted by P or P (, k) k

29 This is ot a ew slide Please ote that the spoke part below belogs to the previous slide. There was o space over there. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 29 - Whe k, the quatity becomes P * 2 * *, ad is called the umber of permutatios of obects. Because of its importace, this quatity is desigated as factorial ad deoted by!. By covetio,!, which gives the followig simple recursive defiitio of!: -!,! ( )! if. - A useful approximatio to! is Stirlig s formula ( 2π *( / e). - For example, usig Stirlig s formula, we compute 3! with relative error of about.27% oly.

30 Biomial coefficiets Combiatios (also, referred to as k-combiatios or choose k ) deoted by C. k Example: the combiatios of the four letters a, b, c ad d take three at a time This is i fact the uordered selectio of 3 elemets from the 4-elemets set. Pk! Ck, k k! k!( k)! Other commo otatios for C k are C (, k) ad Biomial coefficiet. k This umber is equivalet to the umber of k-elemet subsets i a set of elemets. Example, Subsets of the set {a, b, c, d} are : {a, b, c}, {a, b, d}, {a, c, d}, {b, c, d}. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 3 Biomial coefficiets Aother importat cocept is the combiatio of obects take k at a time (also, referred to as k-combiatios or choose k ). It refers to the possible ways to choose k obects out of obects, disregardig order, ad deoted by C k. Example: the combiatios of the four letters a, b, c ad d take three at a time are: a b c, a b d, a c d, b c d. This is i fact the uordered selectio of 3 elemets from the 4-elemets set. Sice order does ot matter here, the combiatios of obects take k at a time is equal to the umber of permutatios of obects take k at a time divided by k!. That is Pk! Ck, k k! k!( k)! Other commo otatios for Ck are C (, k) ad k This umber is also called the Biomial coefficiet. This ame is used because these umbers occur as coefficiets i the expasio of powers of biomial expressios such as (x y). This umber is equivalet to the umber of k-elemet subsets i a set of elemets. For example, the 3-elemet subsets of the set {a, b, c, d} are : {a, b, c}, {a, b, d}, {a, c, d}, {b, c, d}.

31 Biomial coefficiets (Cot.) Importat properties of Biomial coefficiets: - The umber of ways to choose k elemets out of elemets is equal to the umber of ways ot to choose -k elemets out of elemets. This implies that: k k k k k, i particular - The followig idetity is also importat oe: Lecture # Slide # 3 <BUTTONS AREA: Do ot write aythig here> Some of the importat properties of biomial coefficiets: - The # of ways to choose k elemets out of elemets is equal to the umber of ways ot to choose -k elemets out of elemets. This implies that: k k k k k, i particular This meas that the -combiatio ( the umber of obects take at a time) equals the -combiatio ( the umber of combiatios of obects take at a time) ad equals to. - The followig idetity is also importat oe: That is, the umber of combiatios of obects take k at a time equals to the umber of combiatios of - obects take k at a time the umber of combiatios of - obects take k - at a time.

32 Biomial coefficiets (Cot.) Properties of Biomial coefficiets (Cot.) - Pascal s Idetity. Used i the geometric arragemet of the biomial coefficiets i Pascal triagle. - It is stated as follows. Let ad k be positive itegers with k. The k k k The th row i Pascal s triagle cosists of the biomial coefficiets, k, k,..., as follows: Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 32 Properties of biomial coefficiets (Cot.) - Pascal s Idetity. It is used i the geometric arragemet of the biomial coefficiets i a triagle called Pascal triagle show later. - Pascal s Idetity is stated as follows. Let ad k be positive itegers with k. The k k k The th row i Pascal s triagle cosists of the biomial coefficiets, k,,..., as show i the ext slide. k

33 Biomial coefficiets (Cot.) Properties of Biomial coefficiets (Cot.) The first 5 rows i Pascal s Triagle. Lecture # Slide # 33 <BUTTONS AREA: Do ot write aythig here> The first 5 rows i Pascal s Triagle.

34 Biomial coefficiets (Cot.) Properties of Biomial coefficiets (Cot.) - Biomial theorem. It gives coefficiets of the expasio of powers of biomial expressios. - Biomial theorem statemet: Let be a positive iteger, ad x, y be two variables the:. y x y x ) (. y xy y x y x x Lecture # Slide # 34 <BUTTONS AREA: Do ot write aythig here> Properties of biomial coefficiets (Cot.) - A fudametal tool i the aalysis of algorithms is the biomial theorem. It gives coefficiets of the expasio of powers of biomial expressios, where a biomial expressio is simply the sum of two terms, such as x y. - The biomial theorem is stated as follows: Let be a positive iteger, ad x, y be two variables the:. y x y x ) (. y xy y x y x x

35 Biomial coefficiets (Cot.) Examples o Biomial theorem: Example : Fid the expasio of (x y) 3. Solutio: Usig the biomial theorem, we get: (x y) x y. C (3, ) x 3 C(3, ) x 2 y C (3, 2) xy 2 C (3, 3) y 3 x 3 3x 2 y 3xy 2 y 3 Example 2: What is the coefficiet of xy 3 i the expasio (x y) 4? Solutio: Usig the biomial theorem, we have the coefficiet as follows: 4 4! 4! 4 3 3!(4 3)! 3!! Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 35 Examples o Biomial theorem: Example : Fid the expasio of (x y) 3. Solutio: Usig the biomial theorem, we get: (x y) x y. C (3, ) x 3 C(3, ) x 2 y C (3, 2) xy 2 C (3, 3) y 3 x 3 3x 2 y 3xy 2 y 3 Example 2: What is the coefficiet of xy 3 i the expasio (x y) 4? Solutio: Usig the biomial theorem, we have the coefficiet as follows: 4 4! 4! 4 3 3!(4 3)! 3!!

36 Biomial coefficiets (Cot.) If x, the we get:. ) ( y y Makig x ad y, the we get, () ) ( that is 2... This states that the umber of all subsets of a set of size is equal to 2. If we let x - ad y, the we get: ) ( () (-) ) ) (( That is or.... ± odd eve Lecture # Slide # 36 <BUTTONS AREA: Do ot write aythig here> If we let x i the Biomial theorem above, the we get the followig importat idetity:. ) ( y y Makig x ad y, i the above theorem, the we get, () ) ( that is 2... I terms of combiatios, this idetity states that the umber of all subsets of a set of size is equal to 2, as expected. If we let x - ad y i the biomial theorem, the we get: ) ( () (-) ) ) (( That is, or.... ± odd eve

37 Biomial coefficiets (Cot.) From the Biomial theorem above, we have: ( x) 2 2x x 2 ; (x) 3 3x 3x 2 x 3 ad so o. Cotiuig this way idefiitely, we get the elemets of the Pascal triagle, where: Each row after the first is computed from the previous row usig the equatio k k k The Biomial coefficiets are the digits of the umber ( b) writte i base b otatio, if b is sufficietly large (e.g., ). Example: Cosider base, where ( ), we have: (), (), () 2 2*() 2 2, () 3 33, () ad so o. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 37 From the Biomial theorem above, we have: ( x) 2 2x x 2 ; (x) 3 3x 3x 2 x 3 ad so o. Cotiuig this way idefiitely, we get the elemets of the Pascal triagle show previously, where: Each row after the first is computed from the previous row usig the equatio k k k It is observed that the biomial coefficiets are the digits of the umber ( b) writte i base b otatio, if b is sufficietly large (e.g., ). Example: Cosider base, where ( ), we have: (), (), () 2 2*() 2 2, () 3 33, () ad so o., where the digits,4,6,4, i the last umber for example are the etries i the fifth row of Pascal s triagle!!!

38 The Pigeohole Priciple A easy, ituitive ad extremely powerful. States that: If k or more obects are placed ito k boxes, the there is at least oe box cotaiig two or more of the obects. Theorem: If obects are distributed ito m boxes, the: - Oe box cotai at least / m obects ad oe box must cotai at most / m obects. Example: Suppose that G (V, E) be a coected udirected graph with m vertices. Also, let p be a path i G that visits > m vertices. Usig the Pigeohole Priciple, we show that p must cotai a cycle. Solutio: Sice the / m 2, there is at least oe vertex, say v that is visited by p more tha oce. Thus, the portio of the path that starts ad eds at v costitutes a cycle. Lecture # <BUTTONS AREA: Do ot write aythig here> Slide # 38 The Pigeohole Priciple (also called: the Dirichlet drawer priciple) It is a easy, ituitive ad extremely powerful priciple ad is essetial i the aalysis of algorithms. I the 9 th cetury, the Germa mathematicia Dirichlet used this priciple i his work. The Pigeohole Priciple states that: If k or more obects are placed ito k boxes, the there is at least oe box cotaiig two or more of the obects. Theorem: If obects are distributed ito m boxes, the: - Oe box cotai at least / m obects ad oe box must cotai at most / m obects. Example o the Pigeohole Priciple: Suppose that G (V, E) be a coected udirected graph with m vertices. Also, let p be a path i G that visits > m vertices. Usig the Pigeohole Priciple, we show that p must cotai a cycle. Solutio: Sice the / m 2, there is at least oe vertex, say v that is visited by p more tha oce. Thus, the portio of the path that starts ad eds at v costitutes a cycle.

Chapter 0. Review of set theory. 0.1 Sets

Chapter 0. Review of set theory. 0.1 Sets Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.

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

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

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

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) = COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.

More information

1 Introduction. 1.1 Notation and Terminology

1 Introduction. 1.1 Notation and Terminology 1 Itroductio You have already leared some cocepts of calculus such as limit of a sequece, limit, cotiuity, derivative, ad itegral of a fuctio etc. Real Aalysis studies them more rigorously usig a laguage

More information

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

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

CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo

CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo Coutig Methods CSE 191, Class Note 05: Coutig Methods Computer Sci & Eg Dept SUNY Buffalo c Xi He (Uiversity at Buffalo CSE 191 Discrete Structures 1 / 48 Need for Coutig The problem of coutig the umber

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

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

Section 5.1 The Basics of Counting

Section 5.1 The Basics of Counting 1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of

More information

The Boolean Ring of Intervals

The Boolean Ring of Intervals MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,

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

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size. Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure

More information

Sets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram

Sets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram Sets MILESTONE Sets Represetatio of Sets Power Set Ve Diagram Operatios o Sets Laws of lgebra of Sets ardial Number of a Fiite ad Ifiite Set I Mathematical laguage all livig ad o-livig thigs i uiverse

More information

} is said to be a Cauchy sequence provided the following condition is true.

} is said to be a Cauchy sequence provided the following condition is true. Math 4200, Fial Exam Review I. Itroductio to Proofs 1. Prove the Pythagorea theorem. 2. Show that 43 is a irratioal umber. II. Itroductio to Logic 1. Costruct a truth table for the statemet ( p ad ~ r

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

ii. O = {x x = 2k + 1 for some integer k} (This set could have been listed O = { -3, -1, 1, 3, 5 }.)

ii. O = {x x = 2k + 1 for some integer k} (This set could have been listed O = { -3, -1, 1, 3, 5 }.) Sets 1 Math 3312 Set Theory Sprig 2008 Itroductio Set theory is a brach of mathematics that deals with the properties of welldefied collectios of objects, which may or may ot be of a mathematical ature,

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

CS161 Handout 05 Summer 2013 July 10, 2013 Mathematical Terms and Identities

CS161 Handout 05 Summer 2013 July 10, 2013 Mathematical Terms and Identities CS161 Hadout 05 Summer 2013 July 10, 2013 Mathematical Terms ad Idetities Thaks to Ady Nguye ad Julie Tibshirai for their advice o this hadout. This hadout covers mathematical otatio ad idetities that

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

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

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

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

4 The Sperner property.

4 The Sperner property. 4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,

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

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

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

7 Sequences of real numbers

7 Sequences of real numbers 40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are

More information

3 Gauss map and continued fractions

3 Gauss map and continued fractions ICTP, Trieste, July 08 Gauss map ad cotiued fractios I this lecture we will itroduce the Gauss map, which is very importat for its coectio with cotiued fractios i umber theory. The Gauss map G : [0, ]

More information

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of

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

Week 5-6: The Binomial Coefficients

Week 5-6: The Binomial Coefficients Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers

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

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

Sequence A sequence is a function whose domain of definition is the set of natural numbers.

Sequence A sequence is a function whose domain of definition is the set of natural numbers. Chapter Sequeces Course Title: Real Aalysis Course Code: MTH3 Course istructor: Dr Atiq ur Rehma Class: MSc-I Course URL: wwwmathcityorg/atiq/fa8-mth3 Sequeces form a importat compoet of Mathematical Aalysis

More information

REVIEW FOR CHAPTER 1

REVIEW FOR CHAPTER 1 REVIEW FOR CHAPTER 1 A short summary: I this chapter you helped develop some basic coutig priciples. I particular, the uses of ordered pairs (The Product Priciple), fuctios, ad set partitios (The Sum Priciple)

More information

Chapter 1 : Combinatorial Analysis

Chapter 1 : Combinatorial Analysis STAT/MATH 394 A - PROBABILITY I UW Autum Quarter 205 Néhémy Lim Chapter : Combiatorial Aalysis A major brach of combiatorial aalysis called eumerative combiatorics cosists of studyig methods for coutig

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

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

CIS Spring 2018 (instructor Val Tannen)

CIS Spring 2018 (instructor Val Tannen) CIS 160 - Sprig 2018 (istructor Val Tae) Lecture 5 Thursday, Jauary 25 COUNTING We cotiue studyig how to use combiatios ad what are their properties. Example 5.1 How may 8-letter strigs ca be costructed

More information

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients: Chapter 7 COMBINATIONS AND PERMUTATIONS We have see i the previous chapter that (a + b) ca be writte as 0 a % a & b%þ% a & b %þ% b where we have the specific formula for the biomial coefficiets: '!!(&)!

More information

Singular Continuous Measures by Michael Pejic 5/14/10

Singular Continuous Measures by Michael Pejic 5/14/10 Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces

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

Square-Congruence Modulo n

Square-Congruence Modulo n Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet

More information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio

More information

Math 220A Fall 2007 Homework #2. Will Garner A

Math 220A Fall 2007 Homework #2. Will Garner A Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative

More information

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime. MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,

More information

What is Probability?

What is Probability? Quatificatio of ucertaity. What is Probability? Mathematical model for thigs that occur radomly. Radom ot haphazard, do t kow what will happe o ay oe experimet, but has a log ru order. The cocept of probability

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

MA131 - Analysis 1. Workbook 3 Sequences II

MA131 - Analysis 1. Workbook 3 Sequences II MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

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

Lesson 10: Limits and Continuity

Lesson 10: Limits and Continuity www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals

More information

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

Sequences 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 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

Proof of Goldbach s Conjecture. Reza Javaherdashti

Proof of Goldbach s Conjecture. Reza Javaherdashti Proof of Goldbach s Cojecture Reza Javaherdashti farzijavaherdashti@gmail.com Abstract After certai subsets of Natural umbers called Rage ad Row are defied, we assume (1) there is a fuctio that ca produce

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

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer. SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify

More information

MathCity.org Merging man and maths

MathCity.org Merging man and maths MathCityorg Mergig ma ad maths Defiitios: Mathematics HSSC-I Textbook of Algebra ad Trigoometry for Class XI Collected by: Muhammad Waqas Sulaima This documet cotais all the defiitios of Mathematics HSSC-I

More information

Hoggatt and King [lo] defined a complete sequence of natural numbers

Hoggatt and King [lo] defined a complete sequence of natural numbers REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies

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

3.1 Counting Principles

3.1 Counting Principles 3.1 Coutig Priciples Goal: Cout the umber of objects i a set. Notatio: Whe S is a set, S deotes the umber of objects i the set. This is also called S s cardiality. Additio Priciple: Whe you wat to cout

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

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

Commutativity in Permutation Groups

Commutativity in Permutation Groups Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are

More information

Sequences and Series

Sequences and Series Sequeces ad Series Sequeces of real umbers. Real umber system We are familiar with atural umbers ad to some extet the ratioal umbers. While fidig roots of algebraic equatios we see that ratioal umbers

More information

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016 subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may

More information

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;

More information

Basic Counting. Periklis A. Papakonstantinou. York University

Basic Counting. Periklis A. Papakonstantinou. York University Basic Coutig Periklis A. Papakostatiou York Uiversity We survey elemetary coutig priciples ad related combiatorial argumets. This documet serves oly as a remider ad by o ways does it go i depth or is it

More information

MAS111 Convergence and Continuity

MAS111 Convergence and Continuity MAS Covergece ad Cotiuity Key Objectives At the ed of the course, studets should kow the followig topics ad be able to apply the basic priciples ad theorems therei to solvig various problems cocerig covergece

More information

Math 140A Elementary Analysis Homework Questions 1

Math 140A Elementary Analysis Homework Questions 1 Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula

More information

arxiv: v1 [math.co] 23 Mar 2016

arxiv: v1 [math.co] 23 Mar 2016 The umber of direct-sum decompositios of a fiite vector space arxiv:603.0769v [math.co] 23 Mar 206 David Ellerma Uiversity of Califoria at Riverside August 3, 208 Abstract The theory of q-aalogs develops

More information

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

4 Mathematical Induction

4 Mathematical Induction 4 Mathematical Iductio Examie the propositios for all, 1 + + ( + 1) + = for all, + 1 ( + 1) for all How do we prove them? They are statemets ivolvig a variable ruig through the ifiite set Strictly speakig,

More information

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6 Math 4 Activity (Due by EOC Apr. ) Graph the followig epoetial fuctios by modifyig the graph of f. Fid the rage of each fuctio.. g. g. g 4. g. g 6. g Fid a formula for the epoetial fuctio whose graph is

More information

SOME TRIBONACCI IDENTITIES

SOME TRIBONACCI IDENTITIES Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece

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

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

Topic 5: Basics of Probability

Topic 5: Basics of Probability Topic 5: Jue 1, 2011 1 Itroductio Mathematical structures lie Euclidea geometry or algebraic fields are defied by a set of axioms. Mathematical reality is the developed through the itroductio of cocepts

More information

Ma 530 Introduction to Power Series

Ma 530 Introduction to Power Series Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power

More information

International Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY

International Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY Iteratioal Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL TOPIC NUMBER THEORY METHODS OF PROOF. Couterexample - Cotradictio - Pigeohole Priciple Strog mathematical iductio 2 DIVISIBILITY....

More information

Part A, for both Section 200 and Section 501

Part A, for both Section 200 and Section 501 Istructios Please write your solutios o your ow paper. These problems should be treated as essay questios. A problem that says give a example or determie requires a supportig explaatio. I all problems,

More information

LinearAlgebra DMTH502

LinearAlgebra DMTH502 LiearAlgebra DMTH50 LINEAR ALGEBRA Copyright 0 J D Aad All rights reserved Produced & Prited by EXCEL BOOKS PRIVATE LIMITED A-45, Naraia, Phase-I, New Delhi-008 for Lovely Professioal Uiversity Phagwara

More information

Math 140A Elementary Analysis Homework Questions 3-1

Math 140A Elementary Analysis Homework Questions 3-1 Math 0A Elemetary Aalysis Homework Questios -.9 Limits Theorems for Sequeces Suppose that lim x =, lim y = 7 ad that all y are o-zero. Detarime the followig limits: (a) lim(x + y ) (b) lim y x y Let s

More information

Objective Mathematics

Objective Mathematics . If sum of '' terms of a sequece is give by S Tr ( )( ), the 4 5 67 r (d) 4 9 r is equal to : T. Let a, b, c be distict o-zero real umbers such that a, b, c are i harmoic progressio ad a, b, c are i arithmetic

More information

CS166 Handout 02 Spring 2018 April 3, 2018 Mathematical Terms and Identities

CS166 Handout 02 Spring 2018 April 3, 2018 Mathematical Terms and Identities CS166 Hadout 02 Sprig 2018 April 3, 2018 Mathematical Terms ad Idetities Thaks to Ady Nguye ad Julie Tibshirai for their advice o this hadout. This hadout covers mathematical otatio ad idetities that may

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

Tutorial F n F n 1

Tutorial F n F n 1 (CS 207) Discrete Structures July 30, 203 Tutorial. Prove the followig properties of Fiboacci umbers usig iductio, where Fiboacci umbers are defied as follows: F 0 =0,F =adf = F + F 2. (a) Prove that P

More information

TEACHER CERTIFICATION STUDY GUIDE

TEACHER CERTIFICATION STUDY GUIDE COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra

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

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

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

PROPERTIES OF THE POSITIVE INTEGERS

PROPERTIES OF THE POSITIVE INTEGERS PROPERTIES OF THE POSITIVE ITEGERS The first itroductio to mathematics occurs at the pre-school level ad cosists of essetially coutig out the first te itegers with oe s figers. This allows the idividuals

More information

Mathematical Foundations -1- Sets and Sequences. Sets and Sequences

Mathematical Foundations -1- Sets and Sequences. Sets and Sequences Mathematical Foudatios -1- Sets ad Sequeces Sets ad Sequeces Methods of proof 2 Sets ad vectors 13 Plaes ad hyperplaes 18 Liearly idepedet vectors, vector spaces 2 Covex combiatios of vectors 21 eighborhoods,

More information

Combinatorially Thinking

Combinatorially Thinking Combiatorially Thiig SIMUW 2008: July 4 25 Jeifer J Qui jjqui@uwashigtoedu Philosophy We wat to costruct our mathematical uderstadig To this ed, our goal is to situate our problems i cocrete coutig cotexts

More information