DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS
|
|
- Reginald Davidson
- 5 years ago
- Views:
Transcription
1 DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS JC Due in clss Wednesdy September 17. You my collborte but must write up your solutions by yourself. Lte homework will not be ccepted. Homework must either be typed or written legibly in blue or blck ink on lternte lines, illegible homework will be returned ungrded (so you cn rewrite it legibly. Plese write the nme of your recittion instructor nd the time nd plce of your recittion t the top of your homework. (1 Consider the experiment in which bised coin with probbility p of coming up heds is tossed N times. Write down formul for the expecttion vlue of the number of times the coin comes up heds. Prove tht this expecttion vlue is Np (why might we hve expected this nswer? As we sy in clss, the probbility of n outcome with heds is p (1 p N. There re ( N mny such outcomes, nd so esily the expecttion vlue of the number of heds is p (1 p N. =0 There re vrious tricks we might use to evlute this expecttion. Here is nice one. Let q = 1 p nd consider the expnsion of (x + q N by the Binomil theorem, tht is (x + q N = =0 x q N. Differentite both sides with respect to x nd get N(x + q N 1 = ( N =0 1 x 1 q N.
2 2 JC Multiply by x, set x = p, note tht p + q = 1 nd conclude Np = p q N =0 s required. We might hve expected this nswer becuse ech time we toss the coin there is probbility p tht it comes up heds, so tht ech of the N tosses mkes contribution p to the totl expecttion. Here is nother proof which mkes this ide precise. For ech let f be the function on the probbility spce of outcomes (strings of N mny H s nd T s which is 1 if toss yields hed nd 0 otherwise. Clerly if f is the function which gives the number of heds then f = f f N, nd so by n esy clcultion E(f = E(f E(f N. Now esily E(f is excty the probbility of the event coin comes up hed on toss, nd this probbility is p. So E(f = Np. I gve yet nother proof in clss, which involved using the identity = N! ( 1!(N! = N 1 to rerrnge the sum. (2 Consider the experiment in which the bised coin with probbility p of coming up heds is tossed repetedly until it comes up tils. Find formul for p n, the probbility tht the coin is tossed exctly n times. For given vlue of p, wht is the lest N such tht the probbility we toss the coin t most N times is t lest 0.99? To be tossed exctly n times, we must hve n 1 heds then til, so p n = p n 1 (1 p. The probbility tht we toss the coin t most N times is p p N = (1 p( p N 1 = 1 p N. Alterntive rgument: we do not toss the coin t most N times if nd only if we come up heds on the first N tries, nd this hs probbility p N. Now 1 p N 0.99 if nd only if p N 0.01, so esily the lest N tht works is the lest integer such tht N ln(0.01/ ln(p. (3 Consider the 3D generlistion of the notion of pth: pth is sequence (x 0, y 0, z 0, (x 1, y 1, z 1,... (x n, y n, z n where t ech
3 DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS 3 step one of the three coordintes increses by one while the other two remin constnt. If, b, c re nturl numbers show tht the number of pths from (0, 0, 0 to (, b, c is ( + b + c!!b!c! Clerly the set of pths cn be put in bijective correspondence with the set of strings of length +b+c from the lphbet {x, y, z} contining mny x s, b mny y s nd c mny z s. To count these strings, note tht if N = + b + c then there re ( ( N wys of plcing the x s nd then N b wys of plcing the y s, fter which the plcing of the z s is determined. This gives N!!(N! (N! b!(n b! = N!!b!c! possibilities. (4 If, b, c re nturl numbers with c > + b, find n expression for the number of pths from (0, 0, 0 to (, b, c such tht z > x + y for every point (x, y, z on the pth except for (0, 0, 0. (Geometricl picture: we re looking t pths which sty bove the plne z = x + y. (Sketchy, you should give bit more detil Given pth W from (0, 0, 0 to (, b, c such tht z > x + y t ll but the first point, we define pth W from (0, 0 to ( + b, c s follows: ech point (x i, y i, z i on W corresponds to point (x i + y i, z i on W. It is esy to see tht the pth W stys bove the digonl. The key question is now how mny vlues for W correspond to given vlue for W, tht is given pth from (0, 0 to ( + b, c which stys bove the digonl? Suppose W is the pth (s 0, z 0,... (s N, z N where N = + b + c. At one of the c steps where z i+1 = z i + 1 we must hve x i+1 = x i nd y i+1 = y i + 1, while t one of the + b steps where z i+1 = z i we must hve either x i+1 = x i + 1 or y i+1 = y i + 1. If we focus on the ltter clss of steps, we see tht we re trcing out pth from (0, 0 to (, b, nd tht in fct ny such pth corresponds to suitble W. So we get totl of c b c + + b ( ( + b + c + b c b.
4 4 JC (5 We re given n letters L 1,... L n nd n envelopes E 1,... E n. How mny wys re there of putting the letters in the envelopes so tht exctly one letter goes in ech envelope? How mny wys re there such tht for every i, letter L i does not go into envelope E i? There re n! wys of putting the letters in the envelopes. Let d n be the number of such wys in which every letter goes in the wrong envelope. Permuttions of set X which move every x X re clled derngements of X so we re counting the number of derngements of n n-element set. Solution one: let π be some derngement of {1,... n} nd suppose tht π(1 = i. If π(i = 1 then π gives derngement of {1,... n} \ {1, i}, nd there re d n 2 such derngements. We clim tht the set of derngements with π(1 = i nd π(i 1 is in bijection with the set of derngements of {2,... n}. Given derngement ρ of {2,... n} define ρ s follows: ρ (1 = i, ρ (ρ 1 (i = i, ρ (x = ρ(x for ll other x. We conclude tht d n = (n 1(d n 1 + d n 2 for ll n > 2. Clerly d 1 = 0 nd d 2 = 1, so this determines d n. Note : to get closed form expression rther thn recurrence we notice tht if e n = d n nd n 1 then from the recurrence e n = e n 1. Also e 2 = 1 so by n esy induction e n = ( 1 n. So we get d n = nd n 1 + ( 1 n, nd then esily d n = n! n!/2! + n!/3! +... n!/n!. Culturl remrk: it is musing to note tht d n /n! tends to 1/e for n lrge. Solution 2: use the inclusion exclusion formul s in the online notes. (6 (Chllenging Recll tht in clss we defined the n th Ctln number to be C n = 1 n + 1 ( 2n, n or equivlently the number of pths from (0, 0 to (n, n which do not go below the line y = x. ( Show tht C n is the number of sequences (1, 1,... n with i N nd i i nd i. Argument one (sketch, you should give bit more detil: consider pth from (0, 0 to (n, n which does not go below the line y = x. This pth must contin n verticl segments, nd the x-coordinte of the n th segment is t most n 1 becuse we re stying bove the digonl. If
5 DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS 5 we let i equl the x-coordinte for segment i plus 1 then we cn set up bijection between sequences nd pths, so the number of sequences equls the number of pths equls C n. (b Given 2n distinct points on the circumference of circle, C n is the number of wys of joining them in pirs by drwing n chords of the circle, no two of which intersect. Here is picture for the cse n = 2. Let D n be the number of wys of drwing the chords nd note D 0 = D 1 = 1. Lbel the points with lbels from 0 to 2n 1. It is cler tht 0 must be joined to point with n odd lbel 2i + 1, becuse there must be n even number of points on ech side s the chords re non-intersecting. It is lso cler tht there re D i wys of drwing the chords which connect the 2i points {1,... 2i} on one side of the chord joining 0 nd 2i + 1, nd D n i 1 wys of drwing the chords connecting the 2(n i 1 points {2i + 2, 2n 1} on the other side. So D n = i<n D i D n i 1, nd since this is the recurrence stisfied by the Ctln numbers we hve D n = C n.
USA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year
1/1/21. Fill in the circles in the picture t right with the digits 1-8, one digit in ech circle with no digit repeted, so tht no two circles tht re connected by line segment contin consecutive digits.
More informationProblem Set 9. Figure 1: Diagram. This picture is a rough sketch of the 4 parabolas that give us the area that we need to find. The equations are:
(x + y ) = y + (x + y ) = x + Problem Set 9 Discussion: Nov., Nov. 8, Nov. (on probbility nd binomil coefficients) The nme fter the problem is the designted writer of the solution of tht problem. (No one
More informationMath 61CM - Solutions to homework 9
Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More information(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer
Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.
More informationPhysics 9 Fall 2011 Homework 2 - Solutions Friday September 2, 2011
Physics 9 Fll 0 Homework - s Fridy September, 0 Mke sure your nme is on your homework, nd plese box your finl nswer. Becuse we will be giving prtil credit, be sure to ttempt ll the problems, even if you
More informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More informationSOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 2014
SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 014 Mrk Scheme: Ech prt of Question 1 is worth four mrks which re wrded solely for the correct nswer.
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationSummary: Method of Separation of Variables
Physics 246 Electricity nd Mgnetism I, Fll 26, Lecture 22 1 Summry: Method of Seprtion of Vribles 1. Seprtion of Vribles in Crtesin Coordintes 2. Fourier Series Suggested Reding: Griffiths: Chpter 3, Section
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationand that at t = 0 the object is at position 5. Find the position of the object at t = 2.
7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationa a a a a a a a a a a a a a a a a a a a a a a a In this section, we introduce a general formula for computing determinants.
Section 9 The Lplce Expnsion In the lst section, we defined the determinnt of (3 3) mtrix A 12 to be 22 12 21 22 2231 22 12 21. In this section, we introduce generl formul for computing determinnts. Rewriting
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationSolution to HW 4, Ma 1c Prac 2016
Solution to HW 4 M c Prc 6 Remrk: every function ppering in this homework set is sufficiently nice t lest C following the jrgon from the textbook we cn pply ll kinds of theorems from the textbook without
More informationThings to Memorize: A Partial List. January 27, 2017
Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors - Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationName Solutions to Test 3 November 8, 2017
Nme Solutions to Test 3 November 8, 07 This test consists of three prts. Plese note tht in prts II nd III, you cn skip one question of those offered. Some possibly useful formuls cn be found below. Brrier
More informationA-Level Mathematics Transition Task (compulsory for all maths students and all further maths student)
A-Level Mthemtics Trnsition Tsk (compulsory for ll mths students nd ll further mths student) Due: st Lesson of the yer. Length: - hours work (depending on prior knowledge) This trnsition tsk provides revision
More informationNotes on length and conformal metrics
Notes on length nd conforml metrics We recll how to mesure the Eucliden distnce of n rc in the plne. Let α : [, b] R 2 be smooth (C ) rc. Tht is α(t) (x(t), y(t)) where x(t) nd y(t) re smooth rel vlued
More informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More
More informationThe area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More informationFinite Automata. Informatics 2A: Lecture 3. Mary Cryan. 21 September School of Informatics University of Edinburgh
Finite Automt Informtics 2A: Lecture 3 Mry Cryn School of Informtics University of Edinburgh mcryn@inf.ed.c.uk 21 September 2018 1 / 30 Lnguges nd Automt Wht is lnguge? Finite utomt: recp Some forml definitions
More informationFinite Automata. Informatics 2A: Lecture 3. John Longley. 22 September School of Informatics University of Edinburgh
Lnguges nd Automt Finite Automt Informtics 2A: Lecture 3 John Longley School of Informtics University of Edinburgh jrl@inf.ed.c.uk 22 September 2017 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is
More informationHarvard University Computer Science 121 Midterm October 23, 2012
Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is
More informationIs there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them!
PUSHING PYTHAGORAS 009 Jmes Tnton A triple of integers ( bc,, ) is clled Pythgoren triple if exmple, some clssic triples re ( 3,4,5 ), ( 5,1,13 ), ( ) fond of ( 0,1,9 ) nd ( 119,10,169 ). + b = c. For
More informationMath Solutions to homework 1
Mth 75 - Solutions to homework Cédric De Groote October 5, 07 Problem, prt : This problem explores the reltionship between norms nd inner products Let X be rel vector spce ) Suppose tht is norm on X tht
More information4.4 Areas, Integrals and Antiderivatives
. res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order
More informationGoals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite
Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite
More information8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers.
8. Complex Numers The rel numer system is dequte for solving mny mthemticl prolems. But it is necessry to extend the rel numer system to solve numer of importnt prolems. Complex numers do not chnge the
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution
More informationPhysics 202H - Introductory Quantum Physics I Homework #08 - Solutions Fall 2004 Due 5:01 PM, Monday 2004/11/15
Physics H - Introductory Quntum Physics I Homework #8 - Solutions Fll 4 Due 5:1 PM, Mondy 4/11/15 [55 points totl] Journl questions. Briefly shre your thoughts on the following questions: Of the mteril
More informationp(t) dt + i 1 re it ireit dt =
Note: This mteril is contined in Kreyszig, Chpter 13. Complex integrtion We will define integrls of complex functions long curves in C. (This is bit similr to [relvlued] line integrls P dx + Q dy in R2.)
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More information8 Laplace s Method and Local Limit Theorems
8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved
More information63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1
3 9. SEQUENCES AND SERIES 63. Representtion of functions s power series Consider power series x 2 + x 4 x 6 + x 8 + = ( ) n x 2n It is geometric series with q = x 2 nd therefore it converges for ll q =
More informationIdentify graphs of linear inequalities on a number line.
COMPETENCY 1.0 KNOWLEDGE OF ALGEBRA SKILL 1.1 Identify grphs of liner inequlities on number line. - When grphing first-degree eqution, solve for the vrible. The grph of this solution will be single point
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationNondeterminism. Nondeterministic Finite Automata. Example: Moves on a Chessboard. Nondeterminism (2) Example: Chessboard (2) Formal NFA
Nondeterminism Nondeterministic Finite Automt Nondeterminism Subset Construction A nondeterministic finite utomton hs the bility to be in severl sttes t once. Trnsitions from stte on n input symbol cn
More informationES.182A Topic 32 Notes Jeremy Orloff
ES.8A Topic 3 Notes Jerem Orloff 3 Polr coordintes nd double integrls 3. Polr Coordintes (, ) = (r cos(θ), r sin(θ)) r θ Stndrd,, r, θ tringle Polr coordintes re just stndrd trigonometric reltions. In
More informationName Ima Sample ASU ID
Nme Im Smple ASU ID 2468024680 CSE 355 Test 1, Fll 2016 30 Septemer 2016, 8:35-9:25.m., LSA 191 Regrding of Midterms If you elieve tht your grde hs not een dded up correctly, return the entire pper to
More informationCSCI FOUNDATIONS OF COMPUTER SCIENCE
1 CSCI- 2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 My 7, 2015 2 Announcements Homework 9 is due now. Some finl exm review problems will be posted on the web site tody. These re prcqce problems not
More informationREPRESENTATION THEORY OF PSL 2 (q)
REPRESENTATION THEORY OF PSL (q) YAQIAO LI Following re notes from book [1]. The im is to show the qusirndomness of PSL (q), i.e., the group hs no low dimensionl representtion. 1. Representtion Theory
More information1 Structural induction
Discrete Structures Prelim 2 smple questions Solutions CS2800 Questions selected for Spring 2018 1 Structurl induction 1. We define set S of functions from Z to Z inductively s follows: Rule 1. For ny
More informationLecture 3 Gaussian Probability Distribution
Introduction Lecture 3 Gussin Probbility Distribution Gussin probbility distribution is perhps the most used distribution in ll of science. lso clled bell shped curve or norml distribution Unlike the binomil
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationBernoulli Numbers Jeff Morton
Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f
More informationMath 426: Probability Final Exam Practice
Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by
More informationUnit 1 Exponentials and Logarithms
HARTFIELD PRECALCULUS UNIT 1 NOTES PAGE 1 Unit 1 Eponentils nd Logrithms (2) Eponentil Functions (3) The number e (4) Logrithms (5) Specil Logrithms (7) Chnge of Bse Formul (8) Logrithmic Functions (10)
More informationState Minimization for DFAs
Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid
More informationLecture 13 - Linking E, ϕ, and ρ
Lecture 13 - Linking E, ϕ, nd ρ A Puzzle... Inner-Surfce Chrge Density A positive point chrge q is locted off-center inside neutrl conducting sphericl shell. We know from Guss s lw tht the totl chrge on
More informationMathematics Extension 2
00 HIGHER SCHOOL CERTIFICATE EXAMINATION Mthemtics Etension Generl Instructions Reding time 5 minutes Working time hours Write using blck or blue pen Bord-pproved clcultors my be used A tble of stndrd
More informationThe First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).
The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples
More information1 Structural induction, finite automata, regular expressions
Discrete Structures Prelim 2 smple uestions s CS2800 Questions selected for spring 2017 1 Structurl induction, finite utomt, regulr expressions 1. We define set S of functions from Z to Z inductively s
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationReview of Riemann Integral
1 Review of Riemnn Integrl In this chpter we review the definition of Riemnn integrl of bounded function f : [, b] R, nd point out its limittions so s to be convinced of the necessity of more generl integrl.
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER /2019
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS MATH00030 SEMESTER 208/209 DR. ANTHONY BROWN 7.. Introduction to Integrtion. 7. Integrl Clculus As ws the cse with the chpter on differentil
More informationWe partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.
Mth 255 - Vector lculus II Notes 4.2 Pth nd Line Integrls We begin with discussion of pth integrls (the book clls them sclr line integrls). We will do this for function of two vribles, but these ides cn
More informationMATH 185: COMPLEX ANALYSIS FALL 2009/10 PROBLEM SET 5 SOLUTIONS. cos t cos at dt + i
MATH 85: COMPLEX ANALYSIS FALL 9/ PROBLEM SET 5 SOLUTIONS. Let R nd z C. () Evlute the following integrls Solution. Since e it cos t nd For the first integrl, we hve e it cos t cos t cos t + i t + i. sin
More informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More informationdx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω.
Chpter 8 Stility theory We discuss properties of solutions of first order two dimensionl system, nd stility theory for specil clss of liner systems. We denote the independent vrile y t in plce of x, nd
More informationVectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:
Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )
More information1 Probability Density Functions
Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our
More informationMath 1102: Calculus I (Math/Sci majors) MWF 3pm, Fulton Hall 230 Homework 2 solutions
Mth 1102: Clculus I (Mth/Sci mjors) MWF 3pm, Fulton Hll 230 Homework 2 solutions Plese write netly, nd show ll work. Cution: An nswer with no work is wrong! Do the following problems from Chpter III: 6,
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More informationalong the vector 5 a) Find the plane s coordinate after 1 hour. b) Find the plane s coordinate after 2 hours. c) Find the plane s coordinate
L8 VECTOR EQUATIONS OF LINES HL Mth - Sntowski Vector eqution of line 1 A plne strts journey t the point (4,1) moves ech hour long the vector. ) Find the plne s coordinte fter 1 hour. b) Find the plne
More information38 Riemann sums and existence of the definite integral.
38 Riemnn sums nd existence of the definite integrl. In the clcultion of the re of the region X bounded by the grph of g(x) = x 2, the x-xis nd 0 x b, two sums ppered: ( n (k 1) 2) b 3 n 3 re(x) ( n These
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.
More informationLog1 Contest Round 3 Theta Individual. 4 points each 1 What is the sum of the first 5 Fibonacci numbers if the first two are 1, 1?
008 009 Log1 Contest Round Thet Individul Nme: points ech 1 Wht is the sum of the first Fiboncci numbers if the first two re 1, 1? If two crds re drwn from stndrd crd deck, wht is the probbility of drwing
More informationChapter 5. Numerical Integration
Chpter 5. Numericl Integrtion These re just summries of the lecture notes, nd few detils re included. Most of wht we include here is to be found in more detil in Anton. 5. Remrk. There re two topics with
More informationPh2b Quiz - 1. Instructions
Ph2b Winter 217-18 Quiz - 1 Due Dte: Mondy, Jn 29, 218 t 4pm Ph2b Quiz - 1 Instructions 1. Your solutions re due by Mondy, Jnury 29th, 218 t 4pm in the quiz box outside 21 E. Bridge. 2. Lte quizzes will
More informationMath 120 Answers for Homework 13
Mth 12 Answers for Homework 13 1. In this problem we will use the fct tht if m f(x M on n intervl [, b] (nd if f is integrble on [, b] then (* m(b f dx M(b. ( The function f(x = 1 + x 3 is n incresing
More informationUniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that
Problemen/UWC NAW 5/7 nr juni 006 47 Problemen/UWC UniversitireWiskundeCompetitie Edition 005/4 For Session 005/4 we received submissions from Peter Vndendriessche, Vldislv Frnk, Arne Smeets, Jn vn de
More informationDiscrete Random Variables Class 4, Jeremy Orloff and Jonathan Bloom
Lerning Gols Discrete Rndom Vribles Clss 4, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of discrete rndom vrible. 2. Know the Bernoulli, binomil, nd geometric distributions nd exmples of wht
More informationUSA Mathematical Talent Search Round 1 Solutions Year 25 Academic Year
1/1/5. Alex is trying to oen lock whose code is sequence tht is three letters long, with ech of the letters being one of A, B or C, ossibly reeted. The lock hs three buttons, lbeled A, B nd C. When the
More information7. Indefinite Integrals
7. Indefinite Integrls These lecture notes present my interprettion of Ruth Lwrence s lecture notes (in Herew) 7. Prolem sttement By the fundmentl theorem of clculus, to clculte n integrl we need to find
More informationapproaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below
. Eponentil nd rithmic functions.1 Eponentil Functions A function of the form f() =, > 0, 1 is clled n eponentil function. Its domin is the set of ll rel f ( 1) numbers. For n eponentil function f we hve.
More informationMATH 573 FINAL EXAM. May 30, 2007
MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.
More informationMATH 253 WORKSHEET 24 MORE INTEGRATION IN POLAR COORDINATES. r dr = = 4 = Here we used: (1) The half-angle formula cos 2 θ = 1 2
MATH 53 WORKSHEET MORE INTEGRATION IN POLAR COORDINATES ) Find the volume of the solid lying bove the xy-plne, below the prboloid x + y nd inside the cylinder x ) + y. ) We found lst time the set of points
More informationMath& 152 Section Integration by Parts
Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible
More information1.9 C 2 inner variations
46 CHAPTER 1. INDIRECT METHODS 1.9 C 2 inner vritions So fr, we hve restricted ttention to liner vritions. These re vritions of the form vx; ǫ = ux + ǫφx where φ is in some liner perturbtion clss P, for
More informationRead section 3.3, 3.4 Announcements:
Dte: 3/1/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: 1. f x = 3x 6, find the inverse, f 1 x., Using your grphing clcultor, Grph 1. f x,f
More informationClassification of Spherical Quadrilaterals
Clssifiction of Sphericl Qudrilterls Alexndre Eremenko, Andrei Gbrielov, Vitly Trsov November 28, 2014 R 01 S 11 U 11 V 11 W 11 1 R 11 S 11 U 11 V 11 W 11 2 A sphericl polygon is surfce homeomorphic to
More information