具体数学（英文版第2版）：计算机科学基础

作者: [美] Ronald L. 著 , [美] Donald E. Knuth 著

出版社: 机械工业出版社

出版时间: 2007-10

版次: 1

ISBN: 9787111105763

定价: 49.00

装帧: 平装

开本: 32开

纸张: 胶版纸

页数: 657页

正文语种: 简体中文，英语

原版书名: Concrete Mathematics

丛书: 经典原版书库

分类: 计算机与互联网

3 张插图图片

396人买过

ThisbookintroducesthemathematicsthatsupportsadvancedcomputerProgrammingandtheanalysisofalgorithms.Theprimaryaimofitswell-knownauthorsistoprovideasolidandrelevantbaseofmathematicalskills--theskillsneededtosolvecomplexproblems，toevaluatehorrendoussums,andtodiscoversubtlePatternsindata.Itisanindispensabletextandreferencenotonlyforcomputerscientists--theauthorsthemselvesrelyheavilyonit!butforserioususersOfmathematicsinvirtuallyeverydiscipline.ConcretemathematicsisablendingofcontinuousanddisCRETEmathematics："Moreconcretely,"theauthorsexplain,"itisthecontrolledmanipulationofmathematicalformulas,usingacollectionoftechniquesforsolvingproblems."ThesubjectmaterisprimarilyanexpansionoftheMathematicalPreliminariessectioninKnuthsc1assicArtofComputerProgramming,butthestyleofpresentationismoreleisurely,andindividualtopicsarecoveredmoredeeply.Severalnewtopicshavebeenadded,andthemostsignificantideashavebeentracedtotheirhistoricalroots.Thebookincludesmorethan500exercises,dividedintosixcategories.Completeanswersareprovidedforallexercises,exceptresearchproblems,makingthebookparticularlyvaluableforself-study. 作者：(美国)格雷厄姆(RonaldL.Graham) 【目录】
目录
1
Recurrent
Problems
1.l
The
Tower
of
Hanoi
1
1.2
Lines
in
the
P1ane
4
1.3
The
Josephus
Problem
8
Exercises
17
2
Sums
2.1
Notation
21
2.2
Sums
and
Recurrences
25
2.3
Mainpulation
of
Sums
30
2.4
Mu1tip1e
Sums
34
2.5
General
Methods
4l
2.6
Finite
and
Infinite
Calcu1us
47
2.7
Infinite
Sums
56
Exercises
62
3
Integer
Functions
3.1
Floors
and
Ceilings
67
3.2
Floor/Ceiling
Applications
70
3.3
Floor/Ceiling
Recurrences
78
3.4
’mod
The
Binary
Operation
81
3.5
F1oor/Cei1ing
Sums
86
Exercises
95
4
Number
Theory
4.1
Divisibility
102
4.2
Primes
105
4.3
Prime
Examples
1

……
内容简介:
ThisbookintroducesthemathematicsthatsupportsadvancedcomputerProgrammingandtheanalysisofalgorithms.Theprimaryaimofitswell-knownauthorsistoprovideasolidandrelevantbaseofmathematicalskills--theskillsneededtosolvecomplexproblems，toevaluatehorrendoussums,andtodiscoversubtlePatternsindata.Itisanindispensabletextandreferencenotonlyforcomputerscientists--theauthorsthemselvesrelyheavilyonit!butforserioususersOfmathematicsinvirtuallyeverydiscipline.ConcretemathematicsisablendingofcontinuousanddisCRETEmathematics："Moreconcretely,"theauthorsexplain,"itisthecontrolledmanipulationofmathematicalformulas,usingacollectionoftechniquesforsolvingproblems."ThesubjectmaterisprimarilyanexpansionoftheMathematicalPreliminariessectioninKnuthsc1assicArtofComputerProgramming,butthestyleofpresentationismoreleisurely,andindividualtopicsarecoveredmoredeeply.Severalnewtopicshavebeenadded,andthemostsignificantideashavebeentracedtotheirhistoricalroots.Thebookincludesmorethan500exercises,dividedintosixcategories.Completeanswersareprovidedforallexercises,exceptresearchproblems,makingthebookparticularlyvaluableforself-study.
作者简介:
作者：(美国)格雷厄姆(RonaldL.Graham)
目录:
【目录】
目录
1
Recurrent
Problems
1.l
The
Tower
of
Hanoi
1
1.2
Lines
in
the
P1ane
4
1.3
The
Josephus
Problem
8
Exercises
17
2
Sums
2.1
Notation
21
2.2
Sums
and
Recurrences
25
2.3
Mainpulation
of
Sums
30
2.4
Mu1tip1e
Sums
34
2.5
General
Methods
4l
2.6
Finite
and
Infinite
Calcu1us
47
2.7
Infinite
Sums
56
Exercises
62
3
Integer
Functions
3.1
Floors
and
Ceilings
67
3.2
Floor/Ceiling
Applications
70
3.3
Floor/Ceiling
Recurrences
78
3.4
’mod
The
Binary
Operation
81
3.5
F1oor/Cei1ing
Sums
86
Exercises
95
4
Number
Theory
4.1
Divisibility
102
4.2
Primes
105
4.3
Prime
Examples
1

……