发帖
雷达卡
Methods for Counting
Authors: Carlo Mariconda, Alberto Tonolo
A new and efficient way to learn combinatorics
Includes effective problem-solving methods
Efficient didactical approach, taking care of the reader
An original collection of important aspects of discrete mathematics, rarely presented in the same book
Includes numerous examples and exercises
Based on the extensive teaching experience of and fruitful discussions between the different authors
This book provides an introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find not only coverage of the basic elements of the subjects but also deep insights into a range of less common topics rarely considered within a single book, such as counting with occupancy constraints, a clear distinction between algebraic and analytical properties of formal power series, an introduction to discrete dynamical systems with a thorough description of Sarkovskii’s theorem, symbolic calculus, and a complete description of the Euler-Maclaurin formulas and their applications. Although several books touch on one or more of these aspects, precious few cover all of them. The authors, both pure mathematicians, have attempted to develop methods that will allow the student to formulate a given problem in a precise mathematical framework. The aim is to equip readers with a sound strategy for classifying and solving problems by pursuing a mathematically rigorous yet user-friendly approach. This is particularly useful in combinatorics, a field where, all too often, exercises are solved by means of ad hoc tricks. The book contains more than 400 examples and about 300 problems, and the reader will be able to find the proof of every result. To further assist students and teachers, important matters and comments are highlighted, and parts that can be omitted, at least during a first and perhaps second reading, are identified.
Table of contents (14 chapters)
Front Matter
Pages i-xxi
Let’s Learn to Count
Pages 1-26
Counting Sequences and Collections
Pages 27-64
Occupancy Constraints
Pages 65-82
Inclusion/Exclusion
Pages 83-104
Stirling Numbers and Eulerian Numbers
Pages 105-151
Manipulation of Sums
Pages 153-191
Formal Power Series
Pages 193-273
Generating Formal Series and Applications
Pages 275-318
Recurrence Relations
Pages 319-354
Linear Recurrence Relations
Pages 355-417
Symbolic Calculus
Pages 419-463
The Euler–Maclaurin Formulas of Order 1 and 2
Pages 465-534
The Euler–Maclaurin Formula of Arbitrary Order
Pages 535-578
Cauchy and Riemann Sums, Factorials, Ramanujan Numbers and Their Approximations
Pages 579-618
Back Matter
Pages 619-659
原版 PDF + EPUB:
本帖隐藏的内容
原版 PDF:
Discrete Calculus_Methods for Counting.pdf
(8.79 MB, 需要: 20 个论坛币)
PDF 压缩包：
Discrete Calculus (pdf).zip
(5.97 MB, 需要: 20 个论坛币)
本附件包括：- Discrete Calculus_Methods for Counting.pdf
EPUB:
Discrete Calculus_Methods for Counting.epub
(12.87 MB, 需要: 20 个论坛币)
EPUB 压缩包：
Discrete Calculus (epub).zip
(10.07 MB, 需要: 20 个论坛币)
本附件包括：- Discrete Calculus_Methods for Counting.epub
PDF + EPUB 压缩包：
Discrete Calculus (pdf epub).zip
(16.04 MB, 需要: 40 个论坛币)
本附件包括：- Discrete Calculus_Methods for Counting.pdf
- Discrete Calculus_Methods for Counting.epub
如果你喜欢我分享的书籍，请关注我：https://bbs.pinggu.org/z_guanzhu.php?action=add&fuid=5975757
订阅我的文库：【金融 + 经济 + 商学 + 国际政治】
https://bbs.pinggu.org/forum.php?mod=collection&action=view&ctid=3257
【数学 + 统计 + 计算机编程】
https://bbs.pinggu.org/forum.php?mod=collection&action=view&ctid=3258
【历史 + 心理学 + 社会自然科学】
https://bbs.pinggu.org/forum.php?mod=collection&action=view&ctid=3259
京公网安备 11010802022788号
