A Path to Combinatorics for Undergraduates: Counting Strategies
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Birkhäuser Boston
2004
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | The main goal of the two authors is to help undergraduate students understand the concepts and ideas of combinatorics, an important realm of mathematics, and to enable them to ultimately achieve excellence in this field. This goal is accomplished by familiarizing students with typical examples illustrating central mathematical facts, and by challenging students with a number of carefully selected problems. It is essential that the student works through the exercises in order to build a bridge between ordinary high school permutation and combination exercises and more sophisticated, intricate, and abstract concepts and problems in undergraduate combinatorics. The extensive discussions of the solutions are a key part of the learning process. The concepts are not stacked at the beginning of each section in a blue box, as in many undergraduate textbooks. Instead, the key mathematical ideas are carefully worked into organized, challenging, and instructive examples. The authors are proud of their strength, their collection of beautiful problems, which they have accumulated through years of work preparing students for the International Mathematics Olympiads and other competitions. A good foundation in combinatorics is provided in the first six chapters of this book. While most of the problems in the first six chapters are real counting problems, it is in chapters seven and eight where readers are introduced to essay-type proofs. This is the place to develop significant problem-solving experience, and to learn when and how to use available skills to complete the proofs |
| Beschreibung: | 1 Online-Ressource (XIX, 228 p) |
| ISBN: | 9780817681548 9780817642884 |
| DOI: | 10.1007/978-0-8176-8154-8 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042419185 | ||
| 003 | DE-604 | ||
| 005 | 20180110 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2004 |||| o||u| ||||||eng d | ||
| 020 | |a 9780817681548 |c Online |9 978-0-8176-8154-8 | ||
| 020 | |a 9780817642884 |c Print |9 978-0-8176-4288-4 | ||
| 024 | 7 | |a 10.1007/978-0-8176-8154-8 |2 doi | |
| 035 | |a (OCoLC)879621447 | ||
| 035 | |a (DE-599)BVBBV042419185 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 511.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Andreescu, Titu |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A Path to Combinatorics for Undergraduates |b Counting Strategies |c by Titu Andreescu, Zuming Feng |
| 264 | 1 | |a Boston, MA |b Birkhäuser Boston |c 2004 | |
| 300 | |a 1 Online-Ressource (XIX, 228 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a The main goal of the two authors is to help undergraduate students understand the concepts and ideas of combinatorics, an important realm of mathematics, and to enable them to ultimately achieve excellence in this field. This goal is accomplished by familiarizing students with typical examples illustrating central mathematical facts, and by challenging students with a number of carefully selected problems. It is essential that the student works through the exercises in order to build a bridge between ordinary high school permutation and combination exercises and more sophisticated, intricate, and abstract concepts and problems in undergraduate combinatorics. The extensive discussions of the solutions are a key part of the learning process. The concepts are not stacked at the beginning of each section in a blue box, as in many undergraduate textbooks. Instead, the key mathematical ideas are carefully worked into organized, challenging, and instructive examples. The authors are proud of their strength, their collection of beautiful problems, which they have accumulated through years of work preparing students for the International Mathematics Olympiads and other competitions. A good foundation in combinatorics is provided in the first six chapters of this book. While most of the problems in the first six chapters are real counting problems, it is in chapters seven and eight where readers are introduced to essay-type proofs. This is the place to develop significant problem-solving experience, and to learn when and how to use available skills to complete the proofs | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Geometry | |
| 650 | 4 | |a Discrete groups | |
| 650 | 4 | |a Distribution (Probability theory) | |
| 650 | 4 | |a Convex and Discrete Geometry | |
| 650 | 4 | |a Probability Theory and Stochastic Processes | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Feng, Zuming |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-0-8176-8154-8 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027854602 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153089520828416 |
|---|---|
| any_adam_object | |
| author | Andreescu, Titu |
| author_facet | Andreescu, Titu |
| author_role | aut |
| author_sort | Andreescu, Titu |
| author_variant | t a ta |
| building | Verbundindex |
| bvnumber | BV042419185 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)879621447 (DE-599)BVBBV042419185 |
| dewey-full | 511.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.6 |
| dewey-search | 511.6 |
| dewey-sort | 3511.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-0-8176-8154-8 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03295nmm a2200505zc 4500</leader><controlfield tag="001">BV042419185</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180110 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2004 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780817681548</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-8176-8154-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780817642884</subfield><subfield code="c">Print</subfield><subfield code="9">978-0-8176-4288-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-0-8176-8154-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)879621447</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042419185</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Andreescu, Titu</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Path to Combinatorics for Undergraduates</subfield><subfield code="b">Counting Strategies</subfield><subfield code="c">by Titu Andreescu, Zuming Feng</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Birkhäuser Boston</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIX, 228 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">The main goal of the two authors is to help undergraduate students understand the concepts and ideas of combinatorics, an important realm of mathematics, and to enable them to ultimately achieve excellence in this field. This goal is accomplished by familiarizing students with typical examples illustrating central mathematical facts, and by challenging students with a number of carefully selected problems. It is essential that the student works through the exercises in order to build a bridge between ordinary high school permutation and combination exercises and more sophisticated, intricate, and abstract concepts and problems in undergraduate combinatorics. The extensive discussions of the solutions are a key part of the learning process. The concepts are not stacked at the beginning of each section in a blue box, as in many undergraduate textbooks. Instead, the key mathematical ideas are carefully worked into organized, challenging, and instructive examples. The authors are proud of their strength, their collection of beautiful problems, which they have accumulated through years of work preparing students for the International Mathematics Olympiads and other competitions. A good foundation in combinatorics is provided in the first six chapters of this book. While most of the problems in the first six chapters are real counting problems, it is in chapters seven and eight where readers are introduced to essay-type proofs. This is the place to develop significant problem-solving experience, and to learn when and how to use available skills to complete the proofs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometry</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete groups</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distribution (Probability theory)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Convex and Discrete Geometry</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probability Theory and Stochastic Processes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Feng, Zuming</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-0-8176-8154-8</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027854602</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042419185 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:04Z |
| institution | BVB |
| isbn | 9780817681548 9780817642884 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027854602 |
| oclc_num | 879621447 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XIX, 228 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Birkhäuser Boston |
| record_format | marc |
| spelling | Andreescu, Titu Verfasser aut A Path to Combinatorics for Undergraduates Counting Strategies by Titu Andreescu, Zuming Feng Boston, MA Birkhäuser Boston 2004 1 Online-Ressource (XIX, 228 p) txt rdacontent c rdamedia cr rdacarrier The main goal of the two authors is to help undergraduate students understand the concepts and ideas of combinatorics, an important realm of mathematics, and to enable them to ultimately achieve excellence in this field. This goal is accomplished by familiarizing students with typical examples illustrating central mathematical facts, and by challenging students with a number of carefully selected problems. It is essential that the student works through the exercises in order to build a bridge between ordinary high school permutation and combination exercises and more sophisticated, intricate, and abstract concepts and problems in undergraduate combinatorics. The extensive discussions of the solutions are a key part of the learning process. The concepts are not stacked at the beginning of each section in a blue box, as in many undergraduate textbooks. Instead, the key mathematical ideas are carefully worked into organized, challenging, and instructive examples. The authors are proud of their strength, their collection of beautiful problems, which they have accumulated through years of work preparing students for the International Mathematics Olympiads and other competitions. A good foundation in combinatorics is provided in the first six chapters of this book. While most of the problems in the first six chapters are real counting problems, it is in chapters seven and eight where readers are introduced to essay-type proofs. This is the place to develop significant problem-solving experience, and to learn when and how to use available skills to complete the proofs Mathematics Combinatorics Geometry Discrete groups Distribution (Probability theory) Convex and Discrete Geometry Probability Theory and Stochastic Processes Mathematik Kombinatorik (DE-588)4031824-2 gnd rswk-swf Kombinatorik (DE-588)4031824-2 s 1\p DE-604 Feng, Zuming Sonstige oth https://doi.org/10.1007/978-0-8176-8154-8 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Andreescu, Titu A Path to Combinatorics for Undergraduates Counting Strategies Mathematics Combinatorics Geometry Discrete groups Distribution (Probability theory) Convex and Discrete Geometry Probability Theory and Stochastic Processes Mathematik Kombinatorik (DE-588)4031824-2 gnd |
| subject_GND | (DE-588)4031824-2 |
| title | A Path to Combinatorics for Undergraduates Counting Strategies |
| title_auth | A Path to Combinatorics for Undergraduates Counting Strategies |
| title_exact_search | A Path to Combinatorics for Undergraduates Counting Strategies |
| title_full | A Path to Combinatorics for Undergraduates Counting Strategies by Titu Andreescu, Zuming Feng |
| title_fullStr | A Path to Combinatorics for Undergraduates Counting Strategies by Titu Andreescu, Zuming Feng |
| title_full_unstemmed | A Path to Combinatorics for Undergraduates Counting Strategies by Titu Andreescu, Zuming Feng |
| title_short | A Path to Combinatorics for Undergraduates |
| title_sort | a path to combinatorics for undergraduates counting strategies |
| title_sub | Counting Strategies |
| topic | Mathematics Combinatorics Geometry Discrete groups Distribution (Probability theory) Convex and Discrete Geometry Probability Theory and Stochastic Processes Mathematik Kombinatorik (DE-588)4031824-2 gnd |
| topic_facet | Mathematics Combinatorics Geometry Discrete groups Distribution (Probability theory) Convex and Discrete Geometry Probability Theory and Stochastic Processes Mathematik Kombinatorik |
| url | https://doi.org/10.1007/978-0-8176-8154-8 |
| work_keys_str_mv | AT andreescutitu apathtocombinatoricsforundergraduatescountingstrategies AT fengzuming apathtocombinatoricsforundergraduatescountingstrategies |