How to count : | an introduction to combinatorics / (Record no. 109641)

MARC details
000 -LEADER
fixed length control field 02348cam a2200289 a 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100617s2011 flua b 001 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781420082609
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1420082604
040 ## - CATALOGING SOURCE
Original cataloging agency SDU
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA164
Item number S425 H 2011
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Allenby, R. B. J. T.
245 10 - TITLE STATEMENT
Title How to count :
Remainder of title an introduction to combinatorics /
Statement of responsibility, etc. R.B.J.T. Allenby, Alan Slomson.
250 ## - EDITION STATEMENT
Edition statement 2nd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Boca Raton, FL :
Name of publisher, distributor, etc. CRC Press,
Date of publication, distribution, etc. 2011.
300 ## - PHYSICAL DESCRIPTION
Extent 430 p. :
Other physical details ill.
490 1# - SERIES STATEMENT
Series Statement Discrete mathematics and its applications
500 ## - GENERAL NOTE
General note First published as: an introduction to combinatorics, 1991.
505 0# - Formatted Contents Note
Formatted contents note What's it all about? -- Permutations and combinations -- Occupancy problems -- The inclusion-exclusion principle -- Stirling and Catalan numbers -- Partitions and dot diagrams -- Generating functions and recurrence relations -- Partitions and generating functions -- Introduction to graphs -- Trees -- Groups of permutations -- Group actions -- Counting patterns -- Pólya counting -- Dirichlet's pigeonhole principle -- Ramsey theory -- Rook polynomials and matchings.
505 0# - Formatted Contents Note
Formatted contents note HKBU library
518 ## - DATE/TIME AND PLACE OF AN EVENT NOTE
DATE/TIME AND PLACE OF AN EVENT NOTE YT2025 M10
520 ## - SUMMARY
Summary "Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics. This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet's pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises. Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and Pólya's counting theorem."--Publisher's description.
650 #0 - SUBJECT
Topical term Combinatorial analysis.
700 1# - PERSONAL NAME
Personal name Slomson, A. B.
700 1# - PERSONAL NAME
Personal name Slomson, A. B.
900 ## - Accession Number
Accession Number = C.1 SDU
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type English Books
Source of classification or shelving scheme Library of Congress Classification
100 1# - MAIN ENTRY--PERSONAL NAME
-- 211528
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Shelving location Date acquired Source of acquisition Total Checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Library of Congress Classification   Available for Loans General Books MATRIX Library MATRIX Library General Eng/FL.3 03/10/2025 Donation   QA164 S425 H 2011 1000377880 03/10/2025 C.1 03/10/2025 English Books
คัดลอกแล้ว!