Description
Introduction.- 1 First explorations.- 2 Recursion - a fundamental idea.- 3 Mathematical induction.- 4 Graphs.- 5 Counting.- 6 General problem solving strategies.- 7 Logic and proofs.- 8 Elementary number theory.- 9 The pigeonhole principle.- 10 The extremal principle.- 11 The invariance principle.- A A survey of problem-solving strategies.- B Basics on sets and maps.- List of symbols.- Glossary.- Lists of problems, theorems and methods.- Hints for selected exercises.- References.
Author: Daniel Grieser
Publisher: Springer
Published: 05/31/2018
Pages: 308
Binding Type: Paperback
Weight: 1.00lbs
Size: 9.21h x 6.14w x 0.67d
ISBN13: 9783319903194
ISBN10: 3319903195
BISAC Categories:
- Mathematics | General
- Education | Teaching | Subjects | Mathematics
Author: Daniel Grieser
Publisher: Springer
Published: 05/31/2018
Pages: 308
Binding Type: Paperback
Weight: 1.00lbs
Size: 9.21h x 6.14w x 0.67d
ISBN13: 9783319903194
ISBN10: 3319903195
BISAC Categories:
- Mathematics | General
- Education | Teaching | Subjects | Mathematics
About the Author
Daniel Grieser is Professor of Mathematics at Carl von Ossietzky Universität Oldenburg. He works in geometry, analysis and combinatorics. He won a gold medal at the International Mathematics Olympiad and in 2014 he received the Ars Legendi Faculty award for excellent teaching, a national prize awarded in Germany, for developing the course on which this book is based.