First Concepts

Pablo Soberón
Additional contact information
Pablo Soberón: University College London, Department of Mathematics

Chapter 1 in Problem-Solving Methods in Combinatorics, 2013, pp 1-16 from Springer

Abstract: Abstract This chapter deals with the basic results needed to solve combinatorics problems. We start with set-theoretic definitions and constructions, and then carry on with the most important results needed to start working in combinatorics. Then, stronger solving-problems methods are presented, such as induction, the principle of inclusion-exclusion and the use of delimiters. Throughout the whole chapter there are examples of problems solved with the methods at hand. Even though this is an introductory chapter, we show how using only these methods we are able to solve problems that appeared in international mathematical competitions. At the end of the chapter, a list of 14 problems is given where the reader may practice.

Keywords: International Mathematics Competition; Combinatorial Problem Solving; Classical Trick; Exercise Deals; Counting Problem (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-0597-1_1

Ordering information: This item can be ordered from
http://www.springer.com/9783034805971

DOI: 10.1007/978-3-0348-0597-1_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().