LEADER 01959nam  2200529Ia 450 
001 9910465757503321
005 20200520144314.0
010   $a0-88385-930-0
035   $a(CKB)2560000000081729
035   $a(SSID)ssj0000577707
035   $a(PQKBManifestationID)11378679
035   $a(PQKBTitleCode)TC0000577707
035   $a(PQKBWorkID)10578415
035   $a(PQKB)10583499
035   $a(UkCbUP)CR9780883859308
035   $a(MiAaPQ)EBC3330410
035   $a(Au-PeEL)EBL3330410
035   $a(CaPaEBR)ebr10729381
035   $a(OCoLC)929120318
035   $a(EXLCZ)992560000000081729
100   $a20111024d1965      uy             0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt
182   $cc
183   $acr
200 10$aMathematics of choice$b[electronic resource] $eor how to count without counting /$fby Ivan Niven
210   $aWashington, D.C. $cMathematical Association of America$d1965
215   $a1 online resource (xi, 202 pages) $cdigital, PDF file(s)
225 0 $aAnneli Lax New Mathematical Library ;$v15
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a0-88385-615-8 
330   $aCounting lies at the heart of much mathematics, and Niven's subtitle is — How to count without counting. This is the whole art of combinatorics: permutations, combinations, binomial coefficients, the inclusion-exclusion principle, combinatorial probability, partitions of numbers, generating polynomials, the pigeonhole principle, and much more.
606   $aCombinatorial analysis
606   $aMathematical analysis
608   $aElectronic books.
615  0$aCombinatorial analysis.
615  0$aMathematical analysis.
676   $a511.6
700   $aNiven$b Ivan$f1915-1999.$012251
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910465757503321
996   $aMathematics of choice$91909058
997   $aUNINA