Chapter 5 Counting Discrete Structures for Computer Science (CO1007)

... applications, aggregates may contain water over and above the SSD condition Therefore, the extra water in the aggregates above the SSD condition must be estimated and included in the calculation of ... is the Portland cement The production of one ton of cement emits approximately one ton of carbon dioxide to the atmosphere Moreover, cement production is not only highly energy-intensive, next...

Ngày tải lên: 09/12/2016, 07:56

... drone has one grandfather and one grandmother; he has one greatgrandfather and two great-grandmothers; he has two great-great-grandfathers and three great-great-grandmothers In general, it is easy ... name We have, for example, a0 + 1 a1 + ~ a2 + G = K(ao,al,az ,a3 ) -K(al,az ,a3 ) ' (6.1 35) The same pattern holds for continued fractions of any depth It is easily proved by induction;...

Ngày tải lên: 14/08/2014, 04:21

... are reading, we can read again or slow down for intensive reading For the teachers, silent reading is helpful for controlling the class In silent reading, students are in fact concentrating on ... included: definition of reading and reading comprehension, classification of reading according to the purposes of reading; reading in ESP teaching and learning such as d...

Ngày tải lên: 18/12/2013, 15:37

... relation? In Exercise 1. 3-1 , the numbers related to are the set { 0, 3, 6, 9, 12 }, those related to are { 1, 4, 7, 10 }, those related to are { 2, 5, 8, 11 }, those related to are { 0, 3, 6, 9, 12 }, those ... of 0, 3, 6, 9, or 1 2, if and only if it is in the set { 0, 3, 6, 9, 12 }, a number is r...

Ngày tải lên: 31/03/2014, 15:58

... the concrete ” -Z A Melzak 12 1 41 Concrete Ma the- matics is a bridge to abstract mathematics “The advanced reader who skips parts that appear too elementary may miss more than the less advanced ... Cataloging-in-Publication Data Graham, Ronald Lewis, 19 3 5Concrete mathematics : a foundation for computer science / Ronald L Graham, Donald E Knuth, Oren Patashnik xii...

Ngày tải lên: 14/08/2014, 04:21

... generality, we can assume that < a < 1; let us write a = ~ap’J , b = [va-‘l , a- ’ = a+ a’; va-’ = b -v’ Thus a = {a ‘} is the fractional part of a- ‘, and v’ is the mumble-fractional part of va-‘ ... zero, and the first can be evaluated by our usual routine: k,m>O = tm((m+l)‘-m2)[m+16al ll@O = ~m(2m+l)[m

Ngày tải lên: 14/08/2014, 04:21

... BBBB Each of the nm possible patterns appears at least once in this array of mN(m,n) strings, and some patterns appear more than once How many times does a pattern a~ a, ,-, appear? That’s easy: ... mathematical formulas that are easy to deal with? A bit of experimentation suggests that the best way is to maintain a x matrix that holds the four quantities involved in the ancestral fra...

Ngày tải lên: 14/08/2014, 04:21

... named A, B, C, D, the 4! = 24 possible ways for hats to land generate the following numbers of rightful owners: ABCD ABDC ACBD ACDB ADBC ADCB 2 1 BACD BADC BCAD BCDA BDAC BDCA 0 CABD CADB CBAD ... the air The hats come back randomly, one hat to each of the n fans How many ways h(n, k) are there for exactly k fans to get their own hats back? For example, if n = and if the hats and fan...

Ngày tải lên: 14/08/2014, 04:21

... following problem: How many sequences (al ,a2 , al,,) of +1's and -1's have the property that al + a2 + + azn = and have all their partial sums al, al +a2 , al +a2 + +aZn nonnegative? There must be ... the pattern.) There is no closed form for p(n), but the theory of partitions is a fascinating branch of mathematics in which many remarkable discoveries have been made For example, Ram...

Ngày tải lên: 14/08/2014, 04:21