東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

How to count = an introduction to co...

Beeler, Robert A.

Linked to FindBook

Google Book

Amazon

博客來

How to count = an introduction to combinatorics and its applications /

Record Type:	Electronic resources : Monograph/item
Title/Author:	How to count/ by Robert A. Beeler.
Reminder of title:	an introduction to combinatorics and its applications /
Author:	Beeler, Robert A.
Published:	Cham :Springer International Publishing : : 2015.,
Description:	xv, 361 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer eBooks
Subject:	Combinatorial analysis. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-13844-2
ISBN:	9783319138442 (electronic bk.)

How to count = an introduction to combinatorics and its applications /
Beeler, Robert A.

How to countan 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:

523878
Combinatorial analysis.

LC Class. No.: QA164

Dewey Class. No.: 511.6

How to count = an introduction to combinatorics and its applications /
LDR:02426nmm a2200313 a 4500 001 1998075
003 DE-He213
005 20151029092604.0
006 m d
007 cr nn 008maaau
008 151112s2015 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 1277483
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 523878
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Combinatorics. $3 895617
650 2 4 $a Probability Theory and Stochastic Processes. $3 891080
710 2 $a SpringerLink (Online service) $3 836513
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)