skip to content
Concrete mathematics : a foundation for computer science Preview this item
ClosePreview this item
Checking...

Concrete mathematics : a foundation for computer science

Author: Ronald L Graham; Donald Ervin Knuth; Oren Patashnik
Publisher: Reading, Mass. : Addison-Wesley, ©1994.
Edition/Format:   Book : English : 2nd edView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Online version:
Graham, Ronald L., 1935-
Concrete mathematics.
Reading, Mass. : Addison-Wesley, c1994
(OCoLC)607640064
Online version:
Graham, Ronald L., 1935-
Concrete mathematics.
Reading, Mass. : Addison-Wesley, c1994
(OCoLC)622347981
Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Ronald L Graham; Donald Ervin Knuth; Oren Patashnik
ISBN: 0201558025 9780201558029 0201580438 9780201580433 0201142368 9780201142365
OCLC Number: 29357079
Description: xiii, 657 p. : ill. ; 24 cm.
Contents: 1. Recurrent problems : The Tower of Hanoi ; Lines in the plane ; The Josephus problem --
2. Sums : Notation ; Sums and recurrences ; Manipulation of sums ; General methods ; Finite and infinite calculus ; Infinite sums --
3. Integer functions : Floors and ceilings ; Floor/ceiling applications ; Floor/ceiling recurrences ; 'mod': the binary operation ; Floor/ceiling sums --
4. Number theory : Divisibility ; Primes ; Prime examples ; Factorial factors ; Relative primality ; 'mod': the congruence relation ; Independent residues ; Additional applications ; Phi and mu --
5. Binomial coefficients : Basic identities ; Basic practice ; Tricks of the trade ; Generating functions ; Hypergeometric functions ; Hypergeometric transformations ; Partial hypergeometric sums ; Mechanical summation --
6. Special numbers : Stirling numbers ; Eulerian numbers ; Harmonic numbers ; Harmonic summation ; Bernoulli numbers ; Fibonacci numbers ; Continuants --
7. Generating functions : Domino theory and change ; Basic maneuvers ; Solving recurrence ; Special generating functions ; Convolutions ; Exponential generating functions ; Dirichlet generating functions --
8. Discrete probability : Definitions ; Mean and variance ; Probability generating functions ; Flipping coins ; Hashing --
9. Asymptotics : A hierarchy ; O notation ; O manipulation ; Two asymptotic tricks ; Euler's summation formula ; Final summations.
Responsibility: Ronald L. Graham, Donald E. Knuth, Oren Patashnik.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/29357079>
library:oclcnum"29357079"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/29357079>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/872460>
rdf:typeschema:Intangible
schema:name"Computer science--Mathematics"@en
schema:name"Computer science--Mathematics."@en
schema:about
schema:bookEdition"2nd ed."
schema:contributor
schema:contributor
schema:copyrightYear"1994"
schema:creator
schema:datePublished"1994"
schema:description"1. Recurrent problems : The Tower of Hanoi ; Lines in the plane ; The Josephus problem -- 2. Sums : Notation ; Sums and recurrences ; Manipulation of sums ; General methods ; Finite and infinite calculus ; Infinite sums -- 3. Integer functions : Floors and ceilings ; Floor/ceiling applications ; Floor/ceiling recurrences ; 'mod': the binary operation ; Floor/ceiling sums -- 4. Number theory : Divisibility ; Primes ; Prime examples ; Factorial factors ; Relative primality ; 'mod': the congruence relation ; Independent residues ; Additional applications ; Phi and mu -- 5. Binomial coefficients : Basic identities ; Basic practice ; Tricks of the trade ; Generating functions ; Hypergeometric functions ; Hypergeometric transformations ; Partial hypergeometric sums ; Mechanical summation -- 6. Special numbers : Stirling numbers ; Eulerian numbers ; Harmonic numbers ; Harmonic summation ; Bernoulli numbers ; Fibonacci numbers ; Continuants -- 7. Generating functions : Domino theory and change ; Basic maneuvers ; Solving recurrence ; Special generating functions ; Convolutions ; Exponential generating functions ; Dirichlet generating functions -- 8. Discrete probability : Definitions ; Mean and variance ; Probability generating functions ; Flipping coins ; Hashing -- 9. Asymptotics : A hierarchy ; O notation ; O manipulation ; Two asymptotic tricks ; Euler's summation formula ; Final summations."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/16246422>
schema:inLanguage"en"
schema:name"Concrete mathematics : a foundation for computer science"@en
schema:numberOfPages"657"
schema:publisher
schema:url
schema:workExample
schema:workExample
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.