Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource How to Count : An Introduction to Combinatorics and Its Applications, by Robert A. Beeler, (electronic resource)
How to Count : An Introduction to Combinatorics and Its Applications, by Robert A. Beeler, (electronic resource)
Resource Information
The item How to Count : An Introduction to Combinatorics and Its Applications, by Robert A. Beeler, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item How to Count : An Introduction to Combinatorics and Its Applications, by Robert A. Beeler, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 Providing a selfcontained 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
 Language
 eng
 Extent
 XV, 361 p. 61 illus., 2 illus. in color.
 Contents

 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
 Isbn
 9783319138442
 Label
 How to Count : An Introduction to Combinatorics and Its Applications
 Title
 How to Count
 Title remainder
 An Introduction to Combinatorics and Its Applications
 Statement of responsibility
 by Robert A. Beeler
 Language
 eng
 Summary
 Providing a selfcontained 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
 http://library.link/vocab/creatorName
 Beeler, Robert A
 Image bit depth
 0
 LC call number
 QA164167.2
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName
 SpringerLink
 http://library.link/vocab/subjectName

 Mathematics
 Combinatorics
 Distribution (Probability theory)
 Mathematics
 Combinatorics
 Probability Theory and Stochastic Processes
 Label
 How to Count : An Introduction to Combinatorics and Its Applications, by Robert A. Beeler, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 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
 Dimensions
 unknown
 Extent
 XV, 361 p. 61 illus., 2 illus. in color.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783319138442
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319138442
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783319138442
 Label
 How to Count : An Introduction to Combinatorics and Its Applications, by Robert A. Beeler, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 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
 Dimensions
 unknown
 Extent
 XV, 361 p. 61 illus., 2 illus. in color.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783319138442
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319138442
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783319138442
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/HowtoCountAnIntroductiontoCombinatorics/YpeNrLomXtk/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/HowtoCountAnIntroductiontoCombinatorics/YpeNrLomXtk/">How to Count : An Introduction to Combinatorics and Its Applications, by Robert A. Beeler, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item How to Count : An Introduction to Combinatorics and Its Applications, by Robert A. Beeler, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/HowtoCountAnIntroductiontoCombinatorics/YpeNrLomXtk/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/HowtoCountAnIntroductiontoCombinatorics/YpeNrLomXtk/">How to Count : An Introduction to Combinatorics and Its Applications, by Robert A. Beeler, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>