000			01463cam a2200277Ia 4500
999			_c2345 _d2345
001			7884786
003			ZET-ke
005			20211202020010.0
006			m u
007			cr cn|||||||||
008			990907s2009 ii a s 001 0 eng d
020			_a9780198507178
040			_aLCC _cZET-ke
050	1	4	_aQA76.9.M35 _bB54 2002
100	1		_aBiggs, Norman L.
245	1	0	_aDiscrete mathematics / _cNorman L. Biggs
250			_a2nd ed.
260			_aNew Delhi : _bOxford University Press, _cc2002.
300			_axiv, 425 pages : _bill.
500			_aIncludes index.
505			_aStatements and proofs -- Set notation -- The logical framework -- Natural numbers -- Functions -- How to count -- Integers -- Divisibility and prime numbers -- Fractions and real numbers -- Principles of counting -- Subsets and designs -- Partition, classification and distribution -- Modular arithmetic -- Algorithms and their efficiency -- Graphs -- Trees, sorting and searching -- Bipartite graphs and matching problems -- Digraphs, networks and flows -- Recursive techniques -- Groups -- Groups of permutations -- Rings, fields and polynomials-- Finite fields and some applications -- Error-correcting codes -- Generating functions -- Partitions of a positive integer -- Symmetry and counting.
650		0	_aComputer science _xMathematics.
650		0	_aMathematics. _942
942			_2lcc _cBK _hQA76.9.M35 _iB54 2002 _01