没有合适的资源?快使用搜索试试~ 我知道了~
首页L. Lovasz - Discrete Mathematics Lecture Notes.pdf
L. Lovasz - Discrete Mathematics Lecture Notes.pdf
需积分: 32 11 下载量 179 浏览量
更新于2023-03-03
评论
收藏 890KB PDF 举报
This is Lecture Notes accompanying its textbook, Please also find the original textbook in this download site.
资源详情
资源评论
资源推荐
Discrete Mathematics
Lecture Notes, Yale University, Spring 1999
L. Lov´asz and K. Vesztergombi
Parts of these lecture notes are based on
L. Lov
´
asz – J. Pelik
´
an – K. Vesztergombi: Kombinatorika
(Tank¨onyvkiad´o, Budapest, 1972);
Chapter 14 is based on a section in
L. Lov
´
asz – M.D. Plummer: Matching theory
(Elsevier, Amsterdam, 1979)
1
2
Contents
1 Introduction 5
2 Let us count! 7
2.1 A party ...................................... 7
2.2 Sets and the like ................................. 9
2.3 The number of subsets .............................. 12
2.4 Sequences ..................................... 16
2.5 Permutations ................................... 17
3 Induction 21
3.1 Thesumofoddnumbers ............................ 21
3.2 Subset counting revisited ............................ 23
3.3 Counting regions ................................. 24
4 Counting subsets 27
4.1 The number of ordered subsets ......................... 27
4.2 The number of subsets of a given size ..................... 28
4.3 The Binomial Theorem ............................. 29
4.4 Distributing presents ............................... 30
4.5 Anagrams ..................................... 32
4.6 Distributing money ................................ 33
5 Pascal’s Triangle 35
5.1 Identities in the Pascal Triangle ......................... 35
5.2 A bird’s eye view at the Pascal Triangle .................... 38
6 Fibonacci numbers 45
6.1 Fibonacci’s exercise ................................ 45
6.2 Lots of identities ................................. 46
6.3 A formula for the Fibonacci numbers ...................... 47
7 Combinatorial probability 51
7.1 Events and probabilities ............................. 51
7.2 Independent repetition of an experiment .................... 52
7.3 The Law of Large Numbers ........................... 53
8 Integers, divisors, and primes 55
8.1 Divisibility of integers .............................. 55
8.2 Primes and their history ............................. 56
8.3 Factorization into primes ............................ 58
8.4 On the set of primes ............................... 59
8.5 Fermat’s “Little” Theorem ........................... 63
8.6 The Euclidean Algorithm ............................ 64
8.7 Testing for primality ............................... 69
3
9 Graphs 73
9.1 Even and odd degrees .............................. 73
9.2 Paths, cycles, and connectivity ......................... 77
10 Trees 81
10.1 How to grow a tree? ............................... 82
10.2 Rooted trees ................................... 84
10.3 How many trees are there? ........................... 84
10.4 How to store a tree? ............................... 85
11 Finding the optimum 93
11.1 Finding the best tree ............................... 93
11.2 Traveling Salesman ................................ 96
12 Matchings in graphs 98
12.1 A dancing problem ................................ 98
12.2 Another matching problem ........................... 100
12.3 The main theorem ................................ 101
12.4 How to find a perfect matching? ........................ 104
12.5 Hamiltonian cycles ................................ 107
13 Graph coloring 110
13.1 Coloring regions: an easy case .......................... 110
14 A Connecticut class in King Arthur’s court 114
15 A glimpse of cryptography 117
15.1 Classical cryptography .............................. 117
16 One-time pads 117
16.1 How to save the last move in chess? ...................... 118
16.2 How to verify a password—without learning it? ................ 120
16.3 How to find these primes? ............................ 120
16.4 Public key cryptography ............................. 122
4
1 Introduction
For most students, the first and often only area of mathematics in college is calculus. And
it is true that calculus is the single most important field of mathematics, whose emergence
in the 17th century signalled the birth of modern mathematics and was the key to the
successful applications of mathematics in the sciences.
But calculus (or analysis) is also very technical. It takes a lot of work even to introduce
its fundamental notions like continuity or derivatives (after all, it took 2 centuries just
to define these notions properly). To get a feeling for the power of its methods, say by
describing one of its important applications in detail, takes years of study.
If you want to become a mathematician, computer scientist, or engineer, this investment
is necessary. But if your goal is to develop a feeling for what mathematics is all about,
where is it that mathematical methods can be helpful, and what kind of questions do
mathematicians work on, you may want to look for the answer in some other fields of
mathematics.
There are many success stories of applied mathematics outside calculus. A recent hot
topic is mathematical cryptography, which is based on number theory (the study of positive
integers 1,2,3,...), and is widely applied, among others, in computer security and electronic
banking. Other important areas in applied mathematics include linear programming, coding
theory, theory of computing. The mathematics in these applications is collectively called
discrete mathematics. (“Discrete” here is used as the opposite of “continuous”; it is also
often used in the more restrictive sense of “finite”.)
The aim of this book is not to cover “discrete mathematics” in depth (it should be clear
from the description above that such a task would be ill-defined and impossible anyway).
Rather, we discuss a number of selected results and methods, mostly from the areas of
combinatorics, graph theory, and combinatorial geometry, with a little elementary number
theory.
At the same time, it is important to realize that mathematics cannot be done without
proofs. Merely stating the facts, without saying something about why these facts are valid,
would be terribly far from the spirit of mathematics and would make it impossible to give
any idea about how it works. Thus, wherever possible, we’ll give the proofs of the theorems
we state. Sometimes this is not possible; quite simple, elementary facts can be extremely
difficult to prove, and some such proofs may take advanced courses to go through. In these
cases, we’ll state at least that the proof is highly technical and goes beyond the scope of
this book.
Another important ingredient of mathematics is problem solving. You won’t be able
to learn any mathematics without dirtying your hands and trying out the ideas you learn
about in the solution of problems. To some, this may sound frightening, but in fact most
people pursue this type of activity almost every day: everybody who plays a game of chess,
or solves a puzzle, is solving discrete mathematical problems. The reader is strongly advised
to answer the questions posed in the text and to go through the problems at the end of
each chapter of this book. Treat it as puzzle solving, and if you find some idea that you
come up with in the solution to play some role later, be satisfied that you are beginning to
get the essence of how mathematics develops.
We hope that we can illustrate that mathematics is a building, where results are built
5
剩余138页未读,继续阅读
whatabig
- 粉丝: 13
- 资源: 58
上传资源 快速赚钱
- 我的内容管理 收起
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
会员权益专享
最新资源
- stc12c5a60s2 例程
- Android通过全局变量传递数据
- c++校园超市商品信息管理系统课程设计说明书(含源代码) (2).pdf
- 建筑供配电系统相关课件.pptx
- 企业管理规章制度及管理模式.doc
- vb打开摄像头.doc
- 云计算-可信计算中认证协议改进方案.pdf
- [详细完整版]单片机编程4.ppt
- c语言常用算法.pdf
- c++经典程序代码大全.pdf
- 单片机数字时钟资料.doc
- 11项目管理前沿1.0.pptx
- 基于ssm的“魅力”繁峙宣传网站的设计与实现论文.doc
- 智慧交通综合解决方案.pptx
- 建筑防潮设计-PowerPointPresentati.pptx
- SPC统计过程控制程序.pptx
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功
评论0