Specific mathematics: computer science basics: Version 2nd

Specific mathematics: computer science basics: Version 2nd
Basic Information
Original Title: concrete mathematics: a foundation for computer science, Second Edition
By (US) Ronald L. Graham Donald E. knuth Oren patashnik
Translator: Zhang Mingyao Zhang Fan
Series name: Turing Computer Science Series
Press: People's post and telecommunications Press
ISBN: 9787115308108
Mounting time:
Published on: February 1, April 2013
Start: 16
Page number: 1
Version: 2-1
Category: Computer

More about specific mathematics: Basics of Computer Science: Version 2nd
Introduction
Computer books
Specific mathematics: Basics of Computer Science: Version 2nd is a classic mathematics textbook widely used in universities. the book explains many mathematical knowledge and skills used in computer science. It teaches you how to evolve an actual problem into a mathematical model step by step and solve it through a computer, especially in algorithm analysis. its main content involves the sum formula, integer function, number theory, binary coefficient, special number, generative function, discrete probability, and gradient formula, which are all essential knowledge for programming. in addition, this book includes six categories of over 500 exercises, and provides answers to all the exercises, helping readers to deepen their understanding of the content.
Specific mathematics: Basics of Computer Science: Version 2nd is intended for personnel engaged in computer science, computational mathematics, computing technology, and related majors of colleges and universities.
Directory
Specific mathematics: computer science basics: Version 2nd
Chapter 1 recursion 1
1.1 HANOI tower 1
1.2 Straight Line 4 on the plane
1.3 Joseph's question 7
Exercise 14
Chapter 18 and formula 18
2.1 mark 18
2.2 sum and Recursion 21
2.3 balanced processing 25
2.4 multiple sum 28
2.5 General Method 35
2.6 finite calculus and infinite calculus 39
2.7 infinite Sum 47
Exercise 52
Chapter 1 integer functions 56
Bottom 3.1 and top 56
Applications at the bottom of 3.2 and at the top of 58
3.3 bottom and top recursion 66
3.4 mod: Binary computation 68
3.5 bottom and top sum 72
Exercise 79
Chapter 2 number 85
4.1 integer 85
4.2 prime number 88
Example 89 of the 4.3 Prime Number
4.4 factorial factor 93
4.5 reciprocal 96
4.6 mod: 103 of the same link
4.7 independence remaining 105
4.8 further application 107
4.9 functions and functions 110
Exercise 119
Chapter 2 binary coefficient 5th
5.1 basic equality 126
5.2 basic exercises 143
5.3 processing skills 154
5.4 generate function 164
5.5 hypergeometric functions 170
5.6 hyper-geometric transformation 180
Part 1 hyper- ry 5.7
5.8 mechanical summation method 191
Exercise 202
Chapter 2 special numbers 6th
6.1 stringnumber 214
6.2 ouarla 223
6.3 reconciliation count 228
6.4 harmonic Summation Method 233
6.5 bernuoli: 237
6.6 Fibonacci: 244
6.7 connection 252
Exercise 259
Chapter 1 Generating Functions 7th
7.1 domino theory and change of money 268
7.2 basic policy 277
7.3 solution recursion 282
7.4 Special generation functions 294
7.5 convolution 296
7.6 exponential generation function 305
7.7 Dirichlet generation function 310
Exercise 312
Chapter 2 discrete probability 8th
8.1 definition 320
8.2 mean and variance 325
8.3 probability generation function 331
8.4 throwing a coin 336
8.5 hash 344
Exercise 357
Chapter 2 gradient 9th
9.1 of the total quantity, 368
9.2 Odo 370
9.3 O operation rule 376
9.4 two cryptographic techniques 388
9.5 Euler's summation formula 393
9.6 final summation method 398
Exercise 410
Appendix A exercise answer 417
Appendix B reference 508
Appendix C exercise contributor 536
Post note 541
Index 543
Table Indexing 563

Source of this book: China Interactive publishing network