CS103X: Discrete Structures Homework 4 Solutions


 George Stokes
 2 years ago
 Views:
Transcription
1 CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible sixfigure salaries i whole dollar amouts are there that cotai at least three distict digits? b Secod Silico Valley questio: What is the umber of sixfigure salaries that are ot multiples of either 3, 5, or 7. Solutio a First ote that there are 999, , , 000 total possible salaries. Let us ow cout the complemet case  umber of sixfigure salaries that cotai at most two distict digits. There are 9 salaries with 1 distict digit , ,..., 999,999. Now let us cout the salaries that have exactly two distict digits. Sice the first digit caot be 0, we eed to cosider the case whe oe of the two distict digits is 0 differetly. So suppose oe of the two distict digits is 0, the we have 9 choices for the other digit. The first positio eeds to cotai this ozero digit ad we get to place either of the two i the last 5 positios however we wat. There are differet ways to do this, sice we ca cosider a bijectio betwee 5 digit biary umbers where 0 meas that 0 is i the positio, 1 meas that the other digit is i the positio. So there are i total differet salaries with two distict digits, oe of which is 0 sice a biary value of gives all 1 digit, we tae it out. For the case of two distict digits whe either digit is 0, we get First we choose two digits, ad the similar to the 0 case, we have differet ways of arragig the two umbers for two distict digits. Notice that we have have to disclude the values ad , which would oly iclude 1 distict digit. Therefore, i total, we have 900, , 480 b From a there are 900,000 possible sixfigure salaries. Now let us cout the umber of possible sixfigure salaries that are multiples of either 3, 5, or 7. We ca subtract this umber from the total to obtai the umber of sixfigure salaries that are ot multiples of either 3, 5, or 7. Let D 3, D 5, D 7 be the set of sixfigure salaries that are multiples of 3,5,7 respectively. We therefore eed to fid D 3 D 5 D 7. We will use the iclusioexclusio priciple to compute this. D 3 999, , , 000 D 5 999, , , 000 D 7 999, , , 572 D 3 D 5 999, , , 000 D 3 D 7 999, , , 858 D 5 D 7 999, , , 714 D 3 D 5 D 7 999, , , 571 1
2 From the iclusioexclusio priciple: D 3 D 5 D 7 D 3 D 5 D 7 D 3 D 5 D 3 D 7 D 5 D 7 D 3 D 5 D 7 488, 571 Therefore, the umber of sixfigure salaries that are ot multiples of either 3, 5, or 7 are give by: 900, , , 429 Exercise 2 15 poits. A roo o a chessboard is said to put aother chess piece uder attac if they are i the same row or colum. a How may ways are there to arrage 8 roos o a chessboard the usual 8 8 oe so that oe are uder attac? b How may ways are there to arrage roos o a chessboard so that oe are uder attac? c Imagie a threedimesioal chess variat played o a board. 512 cells overall. Call it WeirD Chess. A battleship is a WeirD Chess piece that ca attac ay piece that is i the same twodimesioal layer, alog some coordiate. For example, a battleship i positio 5, 2, 6 puts cell 8, 2, 1 uder attac, but ot cell 8, 3, 1. How may ways are there to arrage 8 battleships o a WeirD Chess board so that oe are uder attac? Give solutios with o summatio. Solutio a 8!. Cosider 8 8 board as 8 colums. I the first colum, you ca choose 8 differet positios for a roo. For the secod colum, there are oly 7 remaiig positios available, etc. The last colum will force the last roo ito positio. b. Cosider board as colums. I the first colum, you ca choose differet positios for a roo. For the secod colum, there are 1 remaiig positios available, etc dow to 1 remaiig positios for the last roo. We are placig roos, so we eed to choose which colums they are i. Thus, it is c 8! 2. Cosider a cube ad cosider placig a roo o each of the 8 plaes horizotally or vertically. The first roo placed has 8 8 positios i its plae. This roo elimiates a cross sectio of all the others such that there are effectively 7 7 valid positios i each remaiig plae. Similarly, the ext roo has 7 7 positios ad leaves 6 6 valid positios i each remaiig plae. If we cotiue i this fashio, we will have ! 2 ways of placig the roos. Exercise 3 15 poits. A fuctio f : {1, 2,..., } {1, 2,..., m} is called mootoe odecreasig if 1 i < j fi fj. a How may such fuctios are there? b How may such fuctios are there that are surjective? c How may such fuctios are there that are ijective? 2
3 Solutio a There are m 1 such fuctios. Cosider the codomai {1, 2,..., m} as bis ad the domai {1, 2,..., } as balls. If a bi codomai elemet cotais a ball, it meas that oe of the elemets i the domai maps to it. Thus, if we repeset this as bis ad balls, ay orderig of the bis ad balls will give us a uique mappig from domai to codomai sice it has to be mootoe odecreasig The bijectio as follows: the smallest valued bi that has a ball must must map to the miimal domai elemet. Remove that ball ad the ew smallest valued bi that could be the same value as the bi i the previous step has a ball must map to the secod miimal domai elemet, ad so o. Now we ca apply the caoical uordered with repetitio formula. b There are mm 1 m 1 m such fuctios. Agai, if we use the balls ad bis aalogy, we have to first allocate 1 ball for each bi, ad the choose positios for the rest of the balls. Thus, m balls are left for us to put ito bis, as i the caoical uordered with repetitio problem. c There are m. Oce we choose the a set of elemets from m, we will ow the exact mappig because the fuctio must be mootoe odecreasig. Thus, we eed to determie i how may ways ca we choose elemets from m. Exercise 4 10 poits. How may ways are there to express a positive iteger as: a A sum of atural umbers? For example, if 2 ad 3 the aswer is 6, sice b A sum of positive itegers? The order of the summads is importat. Imagie the summatio writte dow. Solutio a 1. Cosider each xi as a box ad there are balls. The we have the caoical uordered with repetitio. b Cosider the formula i part a. We ow have ragig from 1 to, with atleast 1 ball i each box. We allocate 1 ball i each box first, so we have balls left to place. Thus, we have Exercise 5 10 poits. Prove either algebraically or combiatorically: a For p, 0, b p p 1 p 1 m m 1 0 Solutios a Cosider what the RHS is coutig. We are choosig p 1 elemets from 1 possible elemets. Let us umber these elemets 1, 2, 3,...,, 1. Let us cout the umber of ways to select p 1 elemets i a particular way. Suppose the maximal elemet piced is goig to be p 1. The we have p p ways of choosig the last p elemets. Now suppose the maximal elemet piced is goig 3
4 to be p 2. The we have p1 p ways of choosig the last p elemets. I geeral, if the maximal elemet piced is 1, the we have p ways of choosig the last p elemets. So we have p as desired. b Cosider the RHS. Let s apply Pascal s rule repeatedly: m 1 m m 1 m m 1 m m m 1 m 2 m as desired. p. m m 1 m 2 m m 0 Exercise 6 10 poits. Give a closedform expressio without summatio for the followig: 2. Solutio m 0 Exercise 7 10 poits. I a mathematics cotest with three problems, 80% of the participats solved the first problem, 75% solved the secod ad 70% solved the third. Prove that at least 25% of the participats solved all three problems. The claim might seem obvious fid a proof. Solutio Let the total umber of participats be > 0 if 0, the proof is trivial. Deote the set of people who missed the first problem by A, the set of people who missed the secod by B, ad the set who missed the third by C. We ow that A , B ad C We also ow, from the lecture otes, that A B C A B C The set of people who solved all three problems is the complemet of A B C the set who missed at least oe problem, so it has size A B C Therefore at least 25% of the participats solved all three problems. Exercise 8 10 poits. What is the umber of iteger solutios of the equatio such that 0 x i 20 for each 1 i 3? x 1 x 2 x 3 50, 4
5 Solutio Let us cout the complemet. At least 1 bi has more tha 20 balls. This problem may be thought of as the uordered with repetitio problem. Cosider 3 bis ad 50 balls. Without loss of geerality, let the first bi cotai at least 21 balls. The there are 29 balls remaiig. There are effectively 3 bis ad 29 balls, which maes for ways of havig the first bi cotai at least 21 balls. Without loss of geerality, let the first two bis cotai at least 21 balls. The there are 8 balls remaiig. Still, there are effectively 3 bis ad 8 ball,s which maes for There caot be at ay time all three bis havig at least 21 balls, as > 50. Now we ca apply the iclusioexclusio priciple. Let P {1} be the umber ways that we ca have bi 1 have more tha 20 balls, P {1, 2} be the umber of ways that we ca have bis 1 ad 2 have more tha 20 balls, etc. P {1} P {2} P {3} P {1, 2} P {1, 3} P {2, 3} P {1, 2, 3} This is the complemet. I total, the umber of iteger solutios to the equatio is with o restrictios. Therefore, the umber of ways to mae 0 x i 20 for each 1 i 3 is: Exercise 9 10 poits. There are people at a party, ad each perso has arrived i a differet hat. The revelry leaves them slightly tipsy, so each of them goes home wearig someoe else s hat. Fid the umber of ways of puttig hats o people so that o perso is wearig his/her ow hat. Give the full proof. Solutio Refer sectio 11.2 Deragemets i lecture otes. 5
x(x 1)(x 2)... (x k + 1) = [x] k n+m 1
1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,
More informationReview for College Algebra Final Exam
Review for College Algebra Fial Exam (Please remember that half of the fial exam will cover chapters 14. This review sheet covers oly the ew material, from chapters 5 ad 7.) 5.1 Systems of equatios i
More information1.3 Binomial Coefficients
18 CHAPTER 1. COUNTING 1. Biomial Coefficiets I this sectio, we will explore various properties of biomial coefficiets. Pascal s Triagle Table 1 cotais the values of the biomial coefficiets ( ) for 0to
More informationMath Discrete Math Combinatorics MULTIPLICATION PRINCIPLE:
Math 355  Discrete Math 4.14.4 Combiatorics Notes MULTIPLICATION PRINCIPLE: If there m ways to do somethig ad ways to do aother thig the there are m ways to do both. I the laguage of set theory: Let
More information{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers
. Stirlig Numbers Whe coutig various types of fuctios from., we quicly discovered that eumeratig the umber of oto fuctios was a difficult problem. For a domai of five elemets ad a rage of four elemets,
More information1 The Binomial Theorem: Another Approach
The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets
More informationSum and Product Rules. Combinatorics. Some Subtler Examples
Combiatorics Sum ad Product Rules Problem: How to cout without coutig. How do you figure out how may thigs there are with a certai property without actually eumeratig all of them. Sometimes this requires
More informationwhen n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.
Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have
More informationrepresented by 4! different arrangements of boxes, divide by 4! to get ways
Problem Set #6 solutios A juggler colors idetical jugglig balls red, white, ad blue (a I how may ways ca this be doe if each color is used at least oce? Let us preemptively color oe ball i each color,
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationModule 4: Mathematical Induction
Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate
More information5.3. Generalized Permutations and Combinations
53 GENERALIZED PERMUTATIONS AND COMBINATIONS 73 53 Geeralized Permutatios ad Combiatios 53 Permutatios with Repeated Elemets Assume that we have a alphabet with letters ad we wat to write all possible
More informationChapter Gaussian Elimination
Chapter 04.06 Gaussia Elimiatio After readig this chapter, you should be able to:. solve a set of simultaeous liear equatios usig Naïve Gauss elimiatio,. lear the pitfalls of the Naïve Gauss elimiatio
More informationCombinatorics II. Combinatorics. Product Rule. Sum Rule II. Theorem (Product Rule) Theorem (Sum Rule)
Combiatorics Combiatorics I Slides by Christopher M. Bourke Istructor: Berthe Y. Choueiry Sprig 26 Computer Sciece & Egieerig 235 to Discrete Mathematics Sectios 4.4.6 & 6.56.6 of Rose cse235@cse.ul.edu
More informationARITHMETIC AND GEOMETRIC PROGRESSIONS
Arithmetic Ad Geometric Progressios Sequeces Ad ARITHMETIC AND GEOMETRIC PROGRESSIONS Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives
More informationSection IV.5: Recurrence Relations from Algorithms
Sectio IV.5: Recurrece Relatios from Algorithms Give a recursive algorithm with iput size, we wish to fid a Θ (best big O) estimate for its ru time T() either by obtaiig a explicit formula for T() or by
More informationThe second difference is the sequence of differences of the first difference sequence, 2
Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More information1. MATHEMATICAL INDUCTION
1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More information3. Greatest Common Divisor  Least Common Multiple
3 Greatest Commo Divisor  Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd
More information5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?
5.4 Amortizatio Questio 1: How do you fid the preset value of a auity? Questio 2: How is a loa amortized? Questio 3: How do you make a amortizatio table? Oe of the most commo fiacial istrumets a perso
More information2.7 Sequences, Sequences of Sets
2.7. SEQUENCES, SEQUENCES OF SETS 67 2.7 Sequeces, Sequeces of Sets 2.7.1 Sequeces Defiitio 190 (sequece Let S be some set. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationRiemann Sums y = f (x)
Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, oegative fuctio o the closed iterval [a, b] Fid
More informationNotes on exponential generating functions and structures.
Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a elemet set, (2) to fid for each the
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may
More information8.3 POLAR FORM AND DEMOIVRE S THEOREM
SECTION 8. POLAR FORM AND DEMOIVRE S THEOREM 48 8. POLAR FORM AND DEMOIVRE S THEOREM Figure 8.6 (a, b) b r a 0 θ Complex Number: a + bi Rectagular Form: (a, b) Polar Form: (r, θ) At this poit you ca add,
More informationElementary Theory of Russian Roulette
Elemetary Theory of Russia Roulette iterestig patters of fractios Satoshi Hashiba Daisuke Miematsu Ryohei Miyadera Itroductio. Today we are goig to study mathematical theory of Russia roulette. If some
More informationTrigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
More informationif A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S,
Lecture 5: Borel Sets Topologically, the Borel sets i a topological space are the σalgebra geerated by the ope sets. Oe ca build up the Borel sets from the ope sets by iteratig the operatios of complemetatio
More informationCounting II 3, 7 3, 2 3, 9 7, 2 7, 9 2, 9
Coutig II Sometimes we will wat to choose objects from a set of objects, ad we wo t be iterested i orderig them. For example, if you are leavig for vacatio ad you wat to pac your suitcase with three of
More informationSearching Algorithm Efficiencies
Efficiecy of Liear Search Searchig Algorithm Efficiecies Havig implemeted the liear search algorithm, how would you measure its efficiecy? A useful measure (or metric) should be geeral, applicable to ay
More informationCOMP 251 Assignment 2 Solutions
COMP 251 Assigmet 2 Solutios Questio 1 Exercise 8.34 Treat the umbers as 2digit umbers i radix. Each digit rages from 0 to 1. Sort these 2digit umbers ith the RADIXSORT algorithm preseted i Sectio
More informationSection 11.3: The Integral Test
Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult
More informationEngineering 323 Beautiful Homework Set 3 1 of 7 Kuszmar Problem 2.51
Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log
More information1 Correlation and Regression Analysis
1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationThe Euler Totient, the Möbius and the Divisor Functions
The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship
More informationMeasures of Central Tendency
Measures of Cetral Tedecy A studet s grade will be determied by exam grades ( each exam couts twice ad there are three exams, HW average (couts oce, fial exam ( couts three times. Fid the average if the
More informationLecture Notes CMSC 251
We have this messy summatio to solve though First observe that the value remais costat throughout the sum, ad so we ca pull it out frot Also ote that we ca write 3 i / i ad (3/) i T () = log 3 (log ) 1
More informationExample 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).
BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook  Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly
More informationPERMUTATIONS AND COMBINATIONS
Chapter 7 PERMUTATIONS AND COMBINATIONS Every body of discovery is mathematical i form because there is o other guidace we ca have DARWIN 7.1 Itroductio Suppose you have a suitcase with a umber lock. The
More informationChapter One BASIC MATHEMATICAL TOOLS
Chapter Oe BAIC MATHEMATICAL TOOL As the reader will see, the study of the time value of moey ivolves substatial use of variables ad umbers that are raised to a power. The power to which a variable is
More informationSolutions to Exercises Chapter 4: Recurrence relations and generating functions
Solutios to Exercises Chapter 4: Recurrece relatios ad geeratig fuctios 1 (a) There are seatig positios arraged i a lie. Prove that the umber of ways of choosig a subset of these positios, with o two chose
More informationChapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
More information8.5 Alternating infinite series
65 8.5 Alteratig ifiite series I the previous two sectios we cosidered oly series with positive terms. I this sectio we cosider series with both positive ad egative terms which alterate: positive, egative,
More informationThe Field of Complex Numbers
The Field of Complex Numbers S. F. Ellermeyer The costructio of the system of complex umbers begis by appedig to the system of real umbers a umber which we call i with the property that i = 1. (Note that
More informationChapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity
More informationSAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx
SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval
More informationCS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations
CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad
More informationB1. Fourier Analysis of Discrete Time Signals
B. Fourier Aalysis of Discrete Time Sigals Objectives Itroduce discrete time periodic sigals Defie the Discrete Fourier Series (DFS) expasio of periodic sigals Defie the Discrete Fourier Trasform (DFT)
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio
More information.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth
Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,
More information23 The Remainder and Factor Theorems
 The Remaider ad Factor Theorems Factor each polyomial completely usig the give factor ad log divisio 1 x + x x 60; x + So, x + x x 60 = (x + )(x x 15) Factorig the quadratic expressio yields x + x x
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS200609 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More informationLearning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr.
Algorithms ad Data Structures Algorithm efficiecy Learig outcomes Able to carry out simple asymptotic aalysisof algorithms Prof. Dr. Qi Xi 2 Time Complexity Aalysis How fast is the algorithm? Code the
More information4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then
SECTION 2.6 THE RATIO TEST 79 2.6. THE RATIO TEST We ow kow how to hadle series which we ca itegrate (the Itegral Test), ad series which are similar to geometric or pseries (the Compariso Test), but of
More informationMeasurable Functions
Measurable Fuctios Dug Le 1 1 Defiitio It is ecessary to determie the class of fuctios that will be cosidered for the Lebesgue itegratio. We wat to guaratee that the sets which arise whe workig with these
More informationTHE ARITHMETIC OF INTEGERS.  multiplication, exponentiation, division, addition, and subtraction
THE ARITHMETIC OF INTEGERS  multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,
More informationTaking DCOP to the Real World: Efficient Complete Solutions for Distributed MultiEvent Scheduling
Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed MultiEvet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria
More informationORDERS OF GROWTH KEITH CONRAD
ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus
More informationDivide and Conquer, Solving Recurrences, Integer Multiplication Scribe: Juliana Cook (2015), V. Williams Date: April 6, 2016
CS 6, Lecture 3 Divide ad Coquer, Solvig Recurreces, Iteger Multiplicatio Scribe: Juliaa Cook (05, V Williams Date: April 6, 06 Itroductio Today we will cotiue to talk about divide ad coquer, ad go ito
More informationRepeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.
5.5 Fractios ad Decimals Steps for Chagig a Fractio to a Decimal. Simplify the fractio, if possible. 2. Divide the umerator by the deomiator. d d Repeatig Decimals Repeatig Decimals are decimal umbers
More informationWeek 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable
Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5
More informationHypergeometric Distributions
7.4 Hypergeometric Distributios Whe choosig the startig lieup for a game, a coach obviously has to choose a differet player for each positio. Similarly, whe a uio elects delegates for a covetio or you
More information8.1 Arithmetic Sequences
MCR3U Uit 8: Sequeces & Series Page 1 of 1 8.1 Arithmetic Sequeces Defiitio: A sequece is a comma separated list of ordered terms that follow a patter. Examples: 1, 2, 3, 4, 5 : a sequece of the first
More informationSpss Lab 7: Ttests Section 1
Spss Lab 7: Ttests Sectio I this lab, we will be usig everythig we have leared i our text ad applyig that iformatio to uderstad ttests for parametric ad oparametric data. THERE WILL BE TWO SECTIONS FOR
More informationLesson 12. Sequences and Series
Retur to List of Lessos Lesso. Sequeces ad Series A ifiite sequece { a, a, a,... a,...} ca be thought of as a list of umbers writte i defiite order ad certai patter. It is usually deoted by { a } =, or
More informationI. Chisquared Distributions
1 M 358K Supplemet to Chapter 23: CHISQUARED DISTRIBUTIONS, TDISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad tdistributios, we first eed to look at aother family of distributios, the chisquared distributios.
More informationLecture 4: Cauchy sequences, BolzanoWeierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, BolzaoWeierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More informationFourier Series and the Wave Equation Part 2
Fourier Series ad the Wave Equatio Part There are two big ideas i our work this week. The first is the use of liearity to break complicated problems ito simple pieces. The secod is the use of the symmetries
More informationDivide and Conquer. Maximum/minimum. Integer Multiplication. CS125 Lecture 4 Fall 2015
CS125 Lecture 4 Fall 2015 Divide ad Coquer We have see oe geeral paradigm for fidig algorithms: the greedy approach. We ow cosider aother geeral paradigm, kow as divide ad coquer. We have already see a
More informationLesson 17 Pearson s Correlation Coefficient
Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) types of data scatter plots measure of directio measure of stregth Computatio covariatio of X ad Y uique variatio i X ad Y measurig
More informationYour organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:
Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network
More informationLecture 5: Span, linear independence, bases, and dimension
Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;
More informationWHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?
WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This
More information0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5
Sectio 13 KolmogorovSmirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.
More informationS. Tanny MAT 344 Spring 1999. be the minimum number of moves required.
S. Tay MAT 344 Sprig 999 Recurrece Relatios Tower of Haoi Let T be the miimum umber of moves required. T 0 = 0, T = 7 Iitial Coditios * T = T + $ T is a sequece (f. o itegers). Solve for T? * is a recurrece,
More informationSequences II. Chapter 3. 3.1 Convergent Sequences
Chapter 3 Sequeces II 3. Coverget Sequeces Plot a graph of the sequece a ) = 2, 3 2, 4 3, 5 + 4,...,,... To what limit do you thik this sequece teds? What ca you say about the sequece a )? For ǫ = 0.,
More informationMore Facts about Finite Symmetry Groups
More Facts about Fiite Symmetry Groups Last time we proved that a fiite symmetry group caot cotai a traslatio or a glide reflectio. We also discovered that i ay fiite symmetry group, either every isometry
More informationProperties of MLE: consistency, asymptotic normality. Fisher information.
Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout
More informationBasic Elements of Arithmetic Sequences and Series
MA40S PRECALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic
More informationMath 105: Review for Final Exam, Part II  SOLUTIONS
Math 5: Review for Fial Exam, Part II  SOLUTIONS. Cosider the fuctio fx) =x 3 l x o the iterval [/e, e ]. a) Fid the x ad ycoordiates of ay ad all local extrema ad classify each as a local maximum or
More informationSUMS OF GENERALIZED HARMONIC SERIES. Michael E. Ho man Department of Mathematics, U. S. Naval Academy, Annapolis, Maryland
#A46 INTEGERS 4 (204) SUMS OF GENERALIZED HARMONIC SERIES Michael E. Ho ma Departmet of Mathematics, U. S. Naval Academy, Aapolis, Marylad meh@usa.edu Courtey Moe Departmet of Mathematics, U. S. Naval
More informationChapter 4. Example: Q: Bob rolls a 6sided die. What is the sample space of this procedure? A: S = {1, 2, 3, 4, 5, 6}
Chapter 4 Key Ideas Evets, Simple Evets, Sample Space, Odds, Compoud Evets, Idepedece, Coditioal Probability, 3 Approaches to Probability Additio Rule, Complemet Rule, Multiplicatio Rule, Law of Total
More informationGregory Carey, 1998 Linear Transformations & Composites  1. Linear Transformations and Linear Composites
Gregory Carey, 1998 Liear Trasformatios & Composites  1 Liear Trasformatios ad Liear Composites I Liear Trasformatios of Variables Meas ad Stadard Deviatios of Liear Trasformatios A liear trasformatio
More informationAlgebra Work Sheets. Contents
The work sheets are grouped accordig to math skill. Each skill is the arraged i a sequece of work sheets that build from simple to complex. Choose the work sheets that best fit the studet s eed ad will
More informationKey Ideas Section 81: Overview hypothesis testing Hypothesis Hypothesis Test Section 82: Basics of Hypothesis Testing Null Hypothesis
Chapter 8 Key Ideas Hypothesis (Null ad Alterative), Hypothesis Test, Test Statistic, Pvalue Type I Error, Type II Error, Sigificace Level, Power Sectio 81: Overview Cofidece Itervals (Chapter 7) are
More information2.3. GEOMETRIC SERIES
6 CHAPTER INFINITE SERIES GEOMETRIC SERIES Oe of the most importat types of ifiite series are geometric series A geometric series is simply the sum of a geometric sequece, Fortuately, geometric series
More informationCHAPTER 3 THE TIME VALUE OF MONEY
CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all
More informationMath 475, Problem Set #6: Solutions
Math 475, Problem Set #6: Solutios A (a) For each poit (a, b) with a, b oegative itegers satisfyig ab 8, cout the paths from (0,0) to (a, b) where the legal steps from (i, j) are to (i 2, j), (i, j 2),
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the BruMikowski iequality for boxes. Today we ll go over the
More informationLecture 7: Borel Sets and Lebesgue Measure
EE50: Probability Foudatios for Electrical Egieers JulyNovember 205 Lecture 7: Borel Sets ad Lebesgue Measure Lecturer: Dr. Krisha Jagaatha Scribes: Ravi Kolla, Aseem Sharma, Vishakh Hegde I this lecture,
More informationEstimating the Mean and Variance of a Normal Distribution
Estimatig the Mea ad Variace of a Normal Distributio Learig Objectives After completig this module, the studet will be able to eplai the value of repeatig eperimets eplai the role of the law of large umbers
More informationMATH /2003. Assignment 4. Due January 8, 2003 Late penalty: 5% for each school day.
MATH 260 2002/2003 Assigmet 4 Due Jauary 8, 2003 Late pealty: 5% for each school day. 1. 4.6 #10. A croissat shop has plai croissats, cherry croissats, chocolate croissats, almod croissats, apple croissats
More informationSection 9.2 Series and Convergence
Sectio 9. Series ad Covergece Goals of Chapter 9 Approximate Pi Prove ifiite series are aother importat applicatio of limits, derivatives, approximatio, slope, ad cocavity of fuctios. Fid challegig atiderivatives
More informationM06/5/MATME/SP2/ENG/TZ2/XX MATHEMATICS STANDARD LEVEL PAPER 2. Thursday 4 May 2006 (morning) 1 hour 30 minutes INSTRUCTIONS TO CANDIDATES
IB MATHEMATICS STANDARD LEVEL PAPER 2 DIPLOMA PROGRAMME PROGRAMME DU DIPLÔME DU BI PROGRAMA DEL DIPLOMA DEL BI 22067304 Thursday 4 May 2006 (morig) 1 hour 30 miutes INSTRUCTIONS TO CANDIDATES Do ot ope
More information