Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Concrete Mathematics

From Wikipedia, the free encyclopedia
Textbook by Ronald Graham, Donald Knuth, and Oren Patashnik
Concrete Mathematics: A Foundation for Computer Science
The cover displays themathematical symbol for summationΣ, inscribed in concrete.
AuthorRonald Graham,Donald Knuth, andOren Patashnik
LanguageEnglish
SubjectMathematics
Computer science
PublisherAddison–Wesley
Publication date
1994
Publication placeUnited States
Media typePrint (Hardcover)
Pages657 pp(Second Edition)
ISBN0-201-55802-5
OCLC29357079
510 20
LC ClassQA39.2 .G733 1994

Concrete Mathematics: A Foundation for Computer Science, byRonald Graham,Donald Knuth, andOren Patashnik, first published in 1989, is a textbook that is widely used in computer-science departments as a substantive but light-hearted treatment of theanalysis of algorithms.

Contents and history

[edit]

The book provides mathematical knowledge and skills for computer science, especially for theanalysis of algorithms. According to the preface, the topics inConcrete Mathematics are "a blend of CONtinuous and disCRETE mathematics".Calculus is frequently used in the explanations and exercises. The term "concrete mathematics" also denotes a complement to "abstract mathematics".

The book is based on a course begun in 1970 by Knuth atStanford University. The book expands on the material (approximately 100 pages)[1] in the "Mathematical Preliminaries"[2] section of Knuth'sThe Art of Computer Programming. Consequently, some readers use it as an introduction to that series of books.

Concrete Mathematics has an informal and often humorous style. The authors reject what they see as the dry style of most mathematics textbooks. The margins contain "mathematicalgraffiti", comments submitted by the text's first editors: Knuth and Patashnik's students at Stanford.

As with many of Knuth's books, readers are invited to claim areward for any error found in the book—in this case, whether an error is "technically, historically, typographically, orpolitically incorrect".[3]

The book popularized some mathematical notation: theIverson bracket,floor and ceiling functions, andnotation for rising and falling factorials.

Typography

[edit]

Donald Knuth used the first edition ofConcrete Mathematics as a test case for theAMS Euler typeface andConcrete Roman font.[4]

Chapter outline

[edit]
  1. Recurrent Problems
  2. Summation
  3. Integer Functions
  4. Number Theory
  5. Binomial Coefficients
  6. Special Numbers
  7. Generating Functions
  8. Discrete Probability
  9. Asymptotics

Editions

[edit]

References

[edit]
  1. ^Stenger, Allen (18 November 2010)."Review ofConcrete Mathematics: A Foundation for Computer Science, 2nd edition by Ronald L. Graham, Donald E. Knuth, and Oren Patashnik".MAA Reviews, Mathematical Association of America.
  2. ^Knuth, Donald E. (1997)."Mathematical Preliminaries".The Art of Computer Programming, Volume 1. Fundamental Algorithms (3rd ed.).ISBN 9780321635747.
  3. ^Graham, Knuth and Patashnik: Concrete Mathematics
  4. ^Donald E. Knuth.Typesetting Concrete Mathematics, TUGboat10 (1989), 31–36, 342. Reprinted as chapter 18 of the bookDigital Typography.

External links

[edit]
Publications
Software
Fonts
Literate programming
Algorithms
Other
Retrieved from "https://en.wikipedia.org/w/index.php?title=Concrete_Mathematics&oldid=1260095882"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp