DOCSLIB.ORG

Mathematical Circle Diaries, Year 2 Complete Curriculum for Grades 6 to 8

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Mathematical Circle Diaries, Year 2 Complete Curriculum for Grades 6 to 8 Mathematical Circles Library Mathematical Circle Diaries, Year 2 Complete Curriculum for Grades 6 to 8 Anna Burago Mathematical Circle Diaries, Year 2 Complete Curriculum for Grades 6 to 8 Mathematical Circles Library Mathematical Circle Diaries, Year 2 Complete Curriculum for Grades 6 to 8 Anna Burago Berkeley, California Advisory Board for the MSRI/Mathematical Circles Library Titu Andreescu Tatiana Shubin (Chair) David Auckly Zvezdelina Stankova H´el`ene Barcelo James Tanton Zuming Feng Ravi Vakil Tony Gardiner Diana White Nikolaj N. Konstantinov Ivan Yashchenko Andy Liu Paul Zeitz Alexander Shen Joshua Zucker Series Editor: Maia Averett, Mills College. Edited by Nelli Tkach and Maia Averett Illustrations by Susanna Hakobyan This volume is published with the generous support of the Simons Foundation and Tom Leighton and Bonnie Berger Leighton. 2010 Mathematics Subject Classification. Primary 97A20, 97A80, 00A07, 00A08, 00A09, 97D50. For additional information and updates on this book, visit www.ams.org/bookpages/mcl-20 Library of Congress Cataloging-in-Publication Data Names: Burago, Anna, 1967- author. Title:Mathematicalcirclediaries,year2: completecurriculumforgrades6to8/AnnaBurago. Description: Berkeley, California : MSRI Mathematical Sciences Research Institute ; Providence, Rhode Island : American Mathematical Society, c2018. | Series: MSRI mathematical circles library ; 20 | Includes bibliographical references. Identifiers: LCCN 2017058792 | ISBN 9781470437183 (alk. paper) Subjects: LCSH: Games in mathematics education. | Mathematics–Study and teaching (Middle school)–Activity programs. | AMS: Mathematics education – General, mathematics and educa- tion – Recreational mathematics, games. msc | Mathematics education – General, mathematics and education – Popularization of mathematics. msc | General – General and miscellaneous specific topics – Problem books. msc | General – General and miscellaneous specific topics – Recreational mathematics. msc | General – General and miscellaneous specific topics – Popularization of mathematics. msc | Mathematics education – Education and instruction in mathematics – Teaching problem solving and heuristic strategies. msc Classification: LCC QA20.G35 B8725 2018 | DDC 510.71/2–dc23 LC record available at https://lccn.loc.gov/2017058792 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy select pages for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for permission to reuse portions of AMS publication content are handled by the Copyright Clearance Center. For more information, please visit www.ams.org/publications/pubpermissions. Send requests for translation rights and licensed reprints to [email protected]. c 2018 by Anna Burago. All rights reserved. Printed in the United States of America. ∞ The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability. Visit the AMS home page at http://www.ams.org/ Visit the MSRI home page at htpp://www.msri.org/ 10987654321 232221201918 Contents Acknowledgments xiii Preliminaries 1 Mathematical Circles 1 A Few Words about This Book 2 Potential Students 3 Curriculum 3 Part 1. Session Plans 5 Introduction 7 Lessons and Problem Sets 7 Session 1: Checkerboard Problems 9 1.1. Introduction 9 1.2. Math Warm-up 10 1.3. Discussion of the Day: Checkerboard Problems 10 1.4. In-Class Problem Set 14 1.5. A Few Words about Problem Sets 15 1.6. Take-Home Problem Set 15 1.7. Additional “Checkerboard” Problems 17 Session 2: Review: Math Logic and Other Problem-Solving Strategies 19 2.1. Math Warm-up 19 2.2. Discussion of the Day: Problem-Solving Strategies 20 2.3. Take-Home Problem Set 23 Session 3: Invariants 25 3.1. Warm-up Discussion. Are Proofs Really Necessary? 25 3.2. Discussion of the Day: Invariants 28 3.3. Take-Home Problem Set 32 v vi Contents Session 4: Proof by Contradiction 33 4.1. Math Warm-up 33 4.2. Discussion of the Day: Proof by Contradiction 33 4.3. Take-Home Problem Set 37 Session 5: Decimal Number System and Problems on Digits 39 5.1. Warm-up Discussion. Egyptian Number System 39 5.2. Discussion of the Day: Problems on Digits 41 5.3. In-Class Problem Set 45 5.4. Take-Home Problem Set 45 5.5. Additional Problems 46 Session 6: Binary Numbers I 47 6.1. Math Warm-up 47 6.2. Discussion of the Day: Binary Land—an Informal Introduction to Binaries 48 6.3. Binary Number System 51 6.4. Binary Notation 53 6.5. Computers and Binary Numbers 53 6.6. Take-Home Problem Set 55 Session 7: Binary Numbers II 59 7.1. Math Warm-up 59 7.2. Discussion of the Day: Binary Arithmetic 60 7.3. How to Convert Decimals to Binary 61 7.4. Take-Home Problem Set 65 Session 8: Mathematical Dominoes Tournament 67 8.1. Math Warm-up 68 8.2. Rules of Mathematical Dominoes 68 8.3. Mathematical Dominoes Problems 69 8.4. Take-Home Problem Set 78 Session 9: Pigeonhole Principle 81 9.1. Math Warm-up 81 9.2. Discussion of the Day: Pigeonhole Principle 81 9.3. Take-Home Problem Set 85 9.4. Additional Problems 87 Session 10: Geometric Pigeonhole Principle 89 10.1. Math Warm-up 89 10.2. Discussion of the Day: Geometric Pigeonhole 89 10.3. Take-Home Problem Set 92 10.4. Additional Problems 93 Contents vii Session 11: Mathematical Olympiad I 95 11.1. Event of the Day: Mathematical Olympiad 95 11.2. Mathematical Olympiad I. First Set of Problems 96 11.3. Mathematical Olympiad I. Second Set of Problems 97 11.4. Mathematical Olympiad I. Additional Problems 97 Session 12: Combinatorics I. Review 99 12.1. Math Warm-up 99 12.2. Discussion of the Day: Review of Combinatorics Techniques 100 12.3. In-Class Problem Set 105 12.4. Take-Home Problem Set 106 12.5. Additional Problems 107 Session 13: Combinatorics II. Combinations 109 13.1. Math Warm-up 109 13.2. Discussion of the Day: Combinations 110 13.3. Take-Home Problem Set 114 Session 14: Mathematical Auction 117 14.1. Math Warm-up 118 14.2. Event of the Day: Mathematical Auction Game 118 14.3. Mathematical Auction Problems 119 14.4. Take-Home Problem Set 120 Session 15: Combinatorics III. Complements. Snake Pit Game 121 15.1. Math Warm-up 121 15.2. Discussion of the Day: Complements 122 15.3. Activity of the Day: Snake Pit on Combinatorics 124 15.4. Take-Home Problem Set 126 Session 16: Combinatorics IV. Combinatorial Conundrum 129 16.1. Math Warm-up 129 16.2. Discussion of the Day: Combinatorial Craftiness 130 16.3. Take-Home Problem Set 135 16.4. Additional Problems 136 Session 17: Magic Squares and Related Problems 139 17.1. Math Warm-up 139 17.2. Discussion of the Day: Magic Squares from 1 to 9 140 17.3. More on 3 × 3 Magic Squares 143 17.4. Magic Squares Extended 144 17.5. Take-Home Problem Set 144 viii Contents Session 18: Double Counting, or There Is More than One Way to Cut a Cake 147 18.1. Math Warm-up 147 18.2. Discussion of the Day: Double Counting 148 18.3. Take-Home Problem Set 152 18.4. Additional Problems 153 Session 19: Mathematical Olympiad II 157 19.1. Event of the Day: Mathematical Olympiad 157 19.2. Mathematical Olympiad II. First Set of Problems 157 19.3. Mathematical Olympiad II. Second Set of Problems 158 19.4. Mathematical Olympiad II. Additional Problems 159 Session 20: Divisibility I. Review 161 20.1. Math Warm-up 161 20.2. Discussion of the Day: Divisibility 162 20.3. Prime Factorization Practice. Set 1 168 20.4. Prime Factorization Practice. Set 2 168 20.5. Take-Home Problem Set 169 20.6. Additional Problems 170 Session 21: Divisibility II. Relatively Prime Numbers; GCF and LCM 171 21.1. Math Warm-up: Mysteries of Prime Numbers 171 21.2. Discussion of the Day: Relatively Prime Numbers 173 21.3. Greatest Common Factor (GCF) 174 21.4. Least Common Multiple (LCM) 175 21.5. How GCF and LCM Are Related 177 21.6. GCF and LCM. In-Class Practice Problems 177 21.7. Take-Home Problem Set 179 21.8. Additional Problems 180 Session 22: Divisibility III. Mathematical Race Game 181 22.1. Math Warm-up 182 22.2. Event of the Day: Mathematical Race 182 22.3. Take-Home Problem Set 183 Session 23: Mathematical Auction 185 23.1. Event of the Day: Mathematical Auction Game 185 23.2. Mathematical Auction Problems 186 23.3. Take-Home Problem Set 187 Session 24: Divisibility IV. Divisibility by 3 and Remainders 189 24.1. Math Warm-up 189 24.2. Discussion of the Day: Remainders When Divided by 3 189 Contents ix 24.3. Arithmetic of Remainders 190 24.4. Take-Home Problem Set 196 24.5. Additional Problems 197 Session 25: Divisibility V. Divisibility and Remainders 199 25.1. Math Warm-up 199 25.2. Discussion of the Day: Divisibility and Remainders 199 25.3. Divisibility and Remainders Practice 204 25.4. Take-Home Problem Set 205 25.5. Additional Problems 205 Session 26: Graph Theory I. Graphs and Their Applications 207 26.1. Math Warm-up 207 26.2. Discussion of the Day: Why Graphs Are Important 208 26.3. How to Calculate the Number of Edges in a Graph 210 26.4. Take-Home Problem Set 211 Session 27: Graph Theory II. Handshaking Theorem 213 27.1. Math Warm-up 213 27.2. Discussion of the Day: Odd Vertices Theorem 214 27.3. In-Class Problem Set 217 27.4.
Load more

Recommended publications
  • The Procedural Generation of Interesting Sokoban Levels
    THE PROCEDURAL GENERATION OF INTERESTING SOKOBAN LEVELS Joshua Taylor, B.S., M.S. Dissertation Prepared for the Degree of DOCTOR OF PHILOSOPHY UNIVERSITY OF NORTH TEXAS May 2015 APPROVED: Ian Parberry, Major Professor Robert Akl, Committee Member Armin R. Mikler, Committee Member Robert Renka, Committee Member Barrett R. Bryant, Chair of the Department of Computer Science and Engineering Costas Tsatsoulis, Dean of the College of Engineering and Interim Dean of the Toulouse Graduate School Taylor, Joshua. The Procedural Generation of Interesting Sokoban Levels. Doctor of Philosophy (Computer Science and Engineering), May 2015, 69 pp., 32 tables, 11 figures, references, 46 titles. As video games continue to become larger, more complex, and more costly to produce, research into methods to make game creation easier and faster becomes more valuable. One such research topic is procedural generation, which allows the computer to assist in the creation of content. This dissertation presents a new algorithm for the generation of Sokoban levels. Sokoban is a grid-based transport puzzle which is computational interesting due to being PSPACE-complete. Beyond just generating levels, the question of whether or not the levels created by this algorithm are interesting to human players is explored. A study was carried out comparing player attention while playing hand made levels versus their attention during procedurally generated levels. An auditory Stroop test was used to measure attention without disrupting play. Copyright 2015 by Joshua Taylor ii ACKNOWLEDGEMENTS I would like to thank Marcus Hof, David Holland, Evgeny Grigoriev, David W. Skinner, and Rick Sladkey for giving me permission to use their Sokoban levels in my study.
    [Show full text]
  • DOCUMENT RESUME ED 289 322 EC 201 283 TITLE Learning Materials Catalog: a Guide to Selection and Use of Games and Toys. Illinois
    DOCUMENT RESUME ED 289 322 EC 201 283 TITLE Learning Materials Catalog: A Guide to Selection and Use of Games and Toys. Illinois State Board of Education, Springfield.; Learning Games Libraries Association, Oak Park, IL. SPONS AGENCY Administration for Children, Youth and Families (DHHS), Chicago, IL. Region 5.; Illinois Council for Exceptional Children, Peoria. PUB DATE 86 NOTE 277p.; Also sponsored by the Resource Access Project at the University of Illinois. AVAILABLE FROMLearning Games Libraries Association, Box 4002, Oak Park, IL 60303 ($21.00 includes postage and handling). PUB TYPE Books (010) -- Reference Materials Directories /Catalogs (132) EDRS PRICE MF01 Plus Postage. PC Not Available from EDRS. DESCRIPTORS Auditory Discrimination; Cognitive Ability; Communication Skills; Daily Living Skills; Early Childhood Education; *Educational Games; Elementary Secondary Education; *Instructional Materials; Interpersonal Competence; *Learning Activities; *Learning Problems; Mathematics Instruction; *Physical Disabilities; Psychomotor Skills; Reading Readiness; Tactual Perception; *Toys; Visual Discrimination ABSTRACT The catalog was developed to provide information about more than 200 recommended learning games and toys for all children, especially those with learning problems or physical handicaps. The materials listed provide educational experiences through game formats and help to develop gross and fine motor skills, math and reading readiness skills, cognitive skills, auditory and visual discrimination, communication skills, social emotional skills, life skills, and tactile awareness. The listings are organized alphabetically by toy name within these skill areas. For each listing, the following information is provided: suggested developmental level, suggested interest level, a drawing of the item, brief description, suggested uses, manufacturer and price, and skill areas. In an appendix, a chart indicates the toy's availability from eight distributors across the country.
    [Show full text]
  • Video Game Design Composition Chapter 7 Glossary
    Video Game Design Composition © 2014 Chapter 7: Puzzle Composition—Glossary aha moment. Point where a player has a realization of what to do or the solution to a problem. circular logic. Solution keeps changing the statement, which, in turn, changes the solution. dissection puzzle. reassemble the shape. editor. Computer program that allows the designer to prototype the gameplay. \ In video games, state of immersion in the task or activity being undertaken. functional rules. Control how each part works. induction puzzle. Requires deductive reasoning from a limited amount of information about the opponents with no information about the player. inspiration. \ lateral thinking. [ linguistic puzzle. Uses words or sounds related to language. logic maze. [ logic puzzle. Player applies reasoning to determine the correct answer. logic-grid puzzle. Player is given certain clues to the solution, which the player then organizes into a grid to determine the solution. mechanical puzzle. Solved by physically linking, unlinking, or maneuvering pieces. metapuzzle. Single, large puzzle made up of smaller puzzles. Occurs in a game when all players know the strategies of the others and no single player can gain when only his or her strategy is changed; named after American mathematician John Nash. parts. Pieces of a puzzle that are manipulated in the game. playability attribute. Helps the player recognize each puzzle piece and maneuver it into place. puzzle. ![ [ Document that is a smaller version of the governing game design document (GGDD). recursion. When a method calls itself as part of the solution. recursive puzzle. Contains the solution as part of the puzzle; also called self-reference puzzle.
    [Show full text]
  • Using Genetic Programming to Evolve Solvers for the Rush Hour Puzzle
    GP-Rush: Using Genetic Programming to Evolve Solvers for the Rush Hour Puzzle Ami Hauptman Achiya Elyasaf Moshe Sipper Assaf Karmon Dept. of Computer Science, Ben-Gurion University, Beer-Sheva 84105, Israel {amihau,achiya.e,sipper,assafkar}@gmail.com ABSTRACT We evolve heuristics to guide IDA* search for the 6x6 and 8x8 versions of the Rush Hour puzzle, a PSPACE-Complete problem, for which no efficient solver has yet been reported. No effective heuristic functions are known for this domain, and—before applying any evolutionary thinking—we first devise several novel heuristic measures, which improve (non- evolutionary) search for some instances, but hinder search substantially for many other instances. We then turn to ge- netic programming (GP) and find that evolution proves im- mensely efficacious, managing to combine heuristics of such (a) (b) highly variable utility into composites that are nearly always beneficial, and far better than each separate component. GP Figure 1: (a) A sample Rush Hour configuration. is thus able to beat both the human player of the game and This is problem no. 9 of the problem set shipped also the human designers of heuristics. with the standard version of the game by Binary Arts, Inc. In the paper we refer to this problem as JAM09. (b) A possible goal state: the red car has Categories and Subject Descriptors reached the exit tile on the right-hand side of the I.2.1 [Applications and Expert Systems]: Games; I.2.8 grid. [Problem Solving, Control Methods, and Search]: Heuristic methods zle,1 which was proven to be PSPACE-Complete (i.e., more difficult than NP-Complete problems, if NP ⊂ P SP ACE) for the general n × n case [10].
    [Show full text]
  • Using Genetic Programming to Evolve Solvers for the Rush Hour Puzzle
    GP-Rush: Using Genetic Programming to Evolve Solvers for the Rush Hour Puzzle Ami Hauptman Achiya Elyasaf Moshe Sipper Assaf Karmon Dept. of Computer Science, Ben-Gurion University, Beer-Sheva 84105, Israel {amihau,achiya.e,sipper,assafkar}@gmail.com ABSTRACT We evolve heuristics to guide IDA* search for the 6x6 and 8x8 versions of the Rush Hour puzzle, a PSPACE-Complete problem, for which no efficient solver has yet been reported. No effective heuristic functions are known for this domain, and—before applying any evolutionary thinking—we first devise several novel heuristic measures, which improve (non- evolutionary) search for some instances, but hinder search substantially for many other instances. We then turn to ge- netic programming (GP) and find that evolution proves im- mensely efficacious, managing to combine heuristics of such (a) (b) highly variable utility into composites that are nearly always beneficial, and far better than each separate component. GP Figure 1: (a) A sample Rush Hour configuration. is thus able to beat both the human player of the game and This is problem no. 9 of the problem set shipped also the human designers of heuristics. with the standard version of the game by Binary Arts, Inc. In the paper we refer to this problem as JAM09. (b) A possible goal state: the red car has Categories and Subject Descriptors reached the exit tile on the right-hand side of the I.2.1 [Applications and Expert Systems]: Games; I.2.8 grid. [Problem Solving, Control Methods, and Search]: Heuristic methods zle,1 which was proven to be PSPACE-Complete (i.e., more difficult than NP-Complete problems, if NP ⊂ PSPACE) for the general n × n case [10].
    [Show full text]
  • 3 BAB 2 DATA DAN ANALISA 2.1 Sumber Data Data Dan Informasi
    BAB 2 DATA DAN ANALISA 2.1 Sumber Data Data dan informasi yang dipergunakan dalam mendukung proyek Tugas Akhir ini diambil dari: 2.1.1 Data literatur yang elektronik dan non-elektronik. Data non-elekronik diambil dari buku-buku sedangkan data elektronik berasal dari beberapa situs di Internet untuk menunjang sebagai referensi pengetahuan dan visual 2.1.2 Wawancara dengan narasumber dari pihak yang berhubungan dengan Kajeng Handycraft yaitu Bapak Mandar Utomo. Serta observasi pada toko-toko maianan 2.2 Data Umum 2.2.1 Sejarah Berdirinya Kajeng Handicraft dan Puzzle Kayu Pada tahun 1994 Kajeng Handicraft didirikan oleh Bapak Mandar Utomo di Senggotan, Jogjakarta. Awalnya Kajeng Handicraft membuat barang-barang fungsional seperti: asbak, tempat pensil, tempat kartu nama, dan tempat telur. Pada 1995, ekonomi semakin tidak mendukung dan saat itu anak Bapak Mandar Utomo sudah mulai besar dan mengerti mainan, Ia ingin membelikan mainan untuk sang anak tapi karena tidak mampu membelikan maka Ia mambuatkannya saja, lalu anaknya terlihat senang setelah dibuatkan mainan puzzle kayu itu. Berangkat dari situ maka muncullah ide untuk memproduksinya secara massal karena kalau anaknya senang dengan mainan itu maka anak-anak lain akan merasa senang juga. Tanggal 5 Oktober 2000 pindah ke Bantul Jogjakarta. Dan saat ini Kajeng Handicraft memiliki art shop yang terletak di Jalan Bantul No.19 Kweni Jogjakarta, warehouse yang terletak di Jalan Bantul Km 5 Panggungharjo Sewon Bantul Jogjakarta, sedangkan workshop berada di Jalan Bantul Km 9 Cepit, Bantul. Alasan memilih Bantul sebagai pusat bisnisnya adalah karena Bantul adalah tempat sentra industri keramik (Kasongan, desa Bojong) yang letaknya tidak terlalu jauh dari lokasi Kajeng Handicraft sendiri.
    [Show full text]
  • Modeling Problem Solving Times in Tutoring Systems
    MASARYKOVA UNIVERZITA F}w¡¢£¤¥¦§¨ AKULTA INFORMATIKY !"#$%&'()+,-./012345<yA| Modeling Problem Solving Times in Tutoring Systems PHDTHESIS Petr Jarušek Brno, 2013 Declaration Hereby I declare, that this paper is my original authorial work, which I have worked out by my own. All sources, references and literature used or excerpted during elaboration of this work are properly cited and listed in complete reference to the due source. Petr Jarušek Advisor: prof. RNDr. Ivana Cerná,ˇ CSc. ii Acknowledgement I would like to thank to my advisor Ivana Cernᡠfor her guidance and sup- port during my PhD studies. It was my pleasure to work with her. I am deeply grateful to my consultant Radek Pelánek for many things. Firstly, since he has been my advisor since my master thesis I am really grateful for all the knowledge and critical and analytical worldview he has shared with me. He has broadened my horizons, shaped many of my opin- ions and changed my mind-sets in certain areas. But not only that. I am grateful for all the PhD years when we struggled with our rather exper- imental research – many times failing, sometimes succeeding, but always experimenting. I can remember that when we started even I myself was not convinced that the topic we were dealing with would lead to successful conclusion. But it happened and now I can see interesting results that we have achieved. Among many other things I deeply admire his working ef- fort and ability to finish work long time before any deadlines even appear on the horizon. I also admire his sense for humanity and his modesty and I am curiously looking forward what he is going to deal with in the future.
    [Show full text]
  • ARG Relevance As a Marketing Strategy in a Museum Adam Roy Pastorello Worcester Polytechnic Institute
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by DigitalCommons@WPI Worcester Polytechnic Institute Digital WPI Interactive Qualifying Projects (All Years) Interactive Qualifying Projects May 2010 ARG Relevance as a Marketing Strategy in a Museum Adam Roy Pastorello Worcester Polytechnic Institute Riley Oliver Brown Worcester Polytechnic Institute Tyler Wesley Berg Worcester Polytechnic Institute Follow this and additional works at: https://digitalcommons.wpi.edu/iqp-all Repository Citation Pastorello, A. R., Brown, R. O., & Berg, T. W. (2010). ARG Relevance as a Marketing Strategy in a Museum. Retrieved from https://digitalcommons.wpi.edu/iqp-all/2587 This Unrestricted is brought to you for free and open access by the Interactive Qualifying Projects at Digital WPI. It has been accepted for inclusion in Interactive Qualifying Projects (All Years) by an authorized administrator of Digital WPI. For more information, please contact [email protected]. 48‐JLS‐0064 ARG Relevance as a Marketing Strategy in a Museum Interactive Qualifying Project Proposal Submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE In partial fulfillment of the requirements for graduation By ___________________________ ___________________________ Tyler Berg Adam Pastorello ____________________________ Riley Brown April 19, 2010 ____________________________________ Professor Jeffrey L. Forgeng. Major Advisor Keywords: ARG, Alternate Reality Game, Museums, Higgins Armory 1 Abstract This project explored the use of alternate reality games as a marketing strategy in a museum environment. An alternate reality game is a largely web‐based virtual scavenger hunt where the players find information and solve puzzles to uncover a story. The setting for the game was the Higgins Armory Museum.
    [Show full text]