語系:
繁體中文
English
說明(常見問題)
圖資館首頁
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
How to countan introduction to combi...
~
Beeler, Robert A.
How to countan introduction to combinatorics and its applications /
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
How to countby Robert A. Beeler.
其他題名:
an introduction to combinatorics and its applications /
作者:
Beeler, Robert A.
出版者:
Cham :Springer International Publishing :2015.
面頁冊數:
xv, 361 p. :ill. (some col.), digital ;24 cm.
Contained By:
Springer eBooks
標題:
Combinatorial analysis.
電子資源:
http://dx.doi.org/10.1007/978-3-319-13844-2
ISBN:
9783319138442 (electronic bk.)
How to countan introduction to combinatorics and its applications /
Beeler, Robert A.
How to count
an introduction to combinatorics and its applications /[electronic resource] :by Robert A. Beeler. - Cham :Springer International Publishing :2015. - xv, 361 p. :ill. (some col.), digital ;24 cm.
Preliminaries -- Basic Counting -- The Binomial Coefficient -- Distribution Problems -- Generating Functions -- Recurrence Relations -- Advanced Counting - Inclusion and Exclusion -- Advanced Counting - Polya Theory -- Application: Probability -- Application: Combinatorial Designs -- Application: Graph Theory -- Appendices.
Providing a self-contained resource for upper undergraduate courses in combinatorics, this text emphasizes computation, problem solving, and proof technique. In particular, the book places special emphasis the Principle of Inclusion and Exclusion and the Multiplication Principle. To this end, exercise sets are included at the end of every section, ranging from simple computations (evaluate a formula for a given set of values) to more advanced proofs. The exercises are designed to test students' understanding of new material, while reinforcing a working mastery of the key concepts previously developed in the book. Intuitive descriptions for many abstract techniques are included. Students often struggle with certain topics, such as generating functions, and this intuitive approach to the problem is helpful in their understanding. When possible, the book introduces concepts using combinatorial methods (as opposed to induction or algebra) to prove identities. Students are also asked to prove identities using combinatorial methods as part of their exercises. These methods have several advantages over induction or algebra.
ISBN: 9783319138442 (electronic bk.)
Standard No.: 10.1007/978-3-319-13844-2doiSubjects--Topical Terms:
182280
Combinatorial analysis.
LC Class. No.: QA164
Dewey Class. No.: 511.6
How to countan introduction to combinatorics and its applications /
LDR
:02426nmm a2200313 a 4500
001
462793
003
DE-He213
005
20151029092604.0
006
m d
007
cr nn 008maaau
008
151119s2015 gw s 0 eng d
020
$a
9783319138442 (electronic bk.)
020
$a
9783319138435 (paper)
024
7
$a
10.1007/978-3-319-13844-2
$2
doi
035
$a
978-3-319-13844-2
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA164
072
7
$a
PBV
$2
bicssc
072
7
$a
MAT036000
$2
bisacsh
082
0 4
$a
511.6
$2
23
090
$a
QA164
$b
.B414 2015
100
1
$a
Beeler, Robert A.
$3
709057
245
1 0
$a
How to count
$h
[electronic resource] :
$b
an introduction to combinatorics and its applications /
$c
by Robert A. Beeler.
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2015.
300
$a
xv, 361 p. :
$b
ill. (some col.), digital ;
$c
24 cm.
505
0
$a
Preliminaries -- Basic Counting -- The Binomial Coefficient -- Distribution Problems -- Generating Functions -- Recurrence Relations -- Advanced Counting - Inclusion and Exclusion -- Advanced Counting - Polya Theory -- Application: Probability -- Application: Combinatorial Designs -- Application: Graph Theory -- Appendices.
520
$a
Providing a self-contained resource for upper undergraduate courses in combinatorics, this text emphasizes computation, problem solving, and proof technique. In particular, the book places special emphasis the Principle of Inclusion and Exclusion and the Multiplication Principle. To this end, exercise sets are included at the end of every section, ranging from simple computations (evaluate a formula for a given set of values) to more advanced proofs. The exercises are designed to test students' understanding of new material, while reinforcing a working mastery of the key concepts previously developed in the book. Intuitive descriptions for many abstract techniques are included. Students often struggle with certain topics, such as generating functions, and this intuitive approach to the problem is helpful in their understanding. When possible, the book introduces concepts using combinatorial methods (as opposed to induction or algebra) to prove identities. Students are also asked to prove identities using combinatorial methods as part of their exercises. These methods have several advantages over induction or algebra.
650
0
$a
Combinatorial analysis.
$3
182280
650
1 4
$a
Mathematics.
$3
184409
650
2 4
$a
Combinatorics.
$3
274788
650
2 4
$a
Probability Theory and Stochastic Processes.
$3
274061
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer eBooks
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-13844-2
950
$a
Mathematics and Statistics (Springer-11649)
筆 0 讀者評論
全部
電子館藏
館藏
1 筆 • 頁數 1 •
1
條碼號
館藏地
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
000000112496
電子館藏
1圖書
電子書
EB QA164 B414 2015
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
多媒體檔案
http://dx.doi.org/10.1007/978-3-319-13844-2
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入