000			03104nam a22005055i 4500
001			978-1-4419-8047-2
003			DE-He213
005			20140220083726.0
007			cr nn 008mamaa
008			110131s2011 xxu| s |||| 0|eng d
020			_a9781441980472 _9978-1-4419-8047-2
024	7		_a10.1007/978-1-4419-8047-2 _2doi
050		4	_aQA241-247.5
072		7	_aPBH _2bicssc
072		7	_aMAT022000 _2bisacsh
082	0	4	_a512.7 _223
100	1		_aGallier, Jean. _eauthor.
245	1	0	_aDiscrete Mathematics _h[electronic resource] / _cby Jean Gallier.
250			_a1.
264		1	_aNew York, NY : _bSpringer New York, _c2011.
300			_aXIII, 465p. 220 illus., 20 illus. in color. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aUniversitext
505	0		_aMathematical Reasoning, Proof Principles and Logic -- Relations, Functions, Partial Functions -- Graphs, Part I: Basic Notions --  Some Counting Problems; Multinomial Coefficients -- Partial Orders, GCD's, RSA, Lattices -- Graphs, Part II: More Advanced Notions -- Answers to Selected Problems.
520			_aThis book gives an introduction to discrete mathematics for beginning undergraduates and starts with a chapter on the rules of mathematical reasoning.   This book  begins with a presentation of the rules of logic as used in mathematics where many examples of formal and informal proofs are given. With this logical framework firmly in place, the book describes the major axioms of set theory and introduces the natural numbers. The rest of the book deals with functions and relations, directed and undirected graphs and an introduction to combinatorics, partial orders and complete induction. There is a section on public key cryptography and RSA, with complete proofs of Fermat's little theorem and the correctness of the RSA scheme, as well as explicit algorithms to perform modular arithmetic. The last chapter provides more graph theory where Eulerian and Hamiltonian cycles are discussed. This book also includes network flows, matchings, covering, bipartite graphs, planar graphs and state the graph minor theorem of Seymour and Robertson.   The book is highly illustrated  and each chapter ends with a list of problems of varying difficulty. Undergraduates in mathematics and computer science will find this book useful.
650		0	_aMathematics.
650		0	_aComputer vision.
650		0	_aNumber theory.
650		0	_aEngineering design.
650	1	4	_aMathematics.
650	2	4	_aNumber Theory.
650	2	4	_aComputer Imaging, Vision, Pattern Recognition and Graphics.
650	2	4	_aEngineering Design.
650	2	4	_aApplications of Mathematics.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9781441980465
830		0	_aUniversitext
856	4	0	_uhttp://dx.doi.org/10.1007/978-1-4419-8047-2
912			_aZDB-2-SMA
999			_c105922 _d105922