000 03363nam a2200361 4500
001 OTLid0000182
003 MnU
005 20201105133302.0
006 m o d s
008 180907s2004 mnu o 0 0 eng d
040 _aMnU
_beng
_cMnU
050 4 _aQA1
050 4 _aQA37.3
100 1 _aBogart, Kenneth P.
_eauthor
245 0 0 _aCombinatorics Through Guided Discovery
_cKenneth Bogart
264 2 _bOpen Textbook Library
264 1 _bKenneth P. Bogart
300 _a1 online resource
490 0 _aOpen textbook library.
505 0 _a1 What is Combinatorics? -- 2 Applications of Induction and Recursion in Combinatorics and Graph Theory -- 3 Distribution Problems -- 4 Generating Functions -- 5 The Principle of Inclusion and Exclusion -- 6 Groups Acting on Sets
520 0 _aThis book is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as "counting." The book consists almost entirely of problems. Some of the problems are designed to lead you to think about a concept, others are designed to help you figure out a concept and state a theorem about it, while still others ask you to prove the theorem. Other problems give you a chance to use a theorem you have proved. From time to time there is a discussion that pulls together some of the things you have learned or introduces a new idea for you to work with. Many of the problems are designed to build up your intuition for how combinatorial mathematics works. There are problems that some people will solve quickly, and there are problems that will take days of thought for everyone. Probably the best way to use this book is to work on a problem until you feel you are not making progress and then go on to the next one. Think about the problem you couldn't get as you do other things. The next chance you get, discuss the problem you are stymied on with other members of the class. Often you will all feel you've hit dead ends, but when you begin comparing notes and listening carefully to each other, you will see more than one approach to the problem and be able to make some progress. In fact, after comparing notes you may realize that there is more than one way to interpret the problem. In this case your first step should be to think together about what the problem is actually asking you to do. You may have learned in school that for every problem you are given, there is a method that has already been taught to you, and you are supposed to figure out which method applies and apply it. That is not the case here. Based on some simplified examples, you will discover the method for yourself. Later on, you may recognize a pattern that suggests you should try to use this method again.
542 1 _fFree Documentation License (GNU)
546 _aIn English.
588 0 _aDescription based on print resource
650 0 _aMathematics
_vTextbooks
650 0 _aApplied mathematics
_vTextbooks
710 2 _aOpen Textbook Library
_edistributor
856 4 0 _uhttps://open.umn.edu/opentextbooks/textbooks/182
_zAccess online version
999 _c19595
_d19595