Binary Games. Keep this tetrahedron handy, we will use it when we play the game of Nim.
|
|
- Noah Summers
- 6 years ago
- Views:
Transcription
1 Binary Games. Binary Guessing Game: a) Build a binary tetrahedron using the net on the next page and look out for patterns: i) on the vertices ii) on each edge iii) on the faces b) For each vertex, we write down all the numbers connected to that vertex by one segment. We obtain the sets A, B, C, D below. Describe a defining rule for each of these sets: A: ; ; ; 7; 9; ; ; B: ; ; 6; 7; 0; ; ; C: ; ; 6; 7; ; ; ; D: 8; 9; 0; ; ; ; ; If I pick a number between and and tell you exactly in which of the sets above it is, can you tell me the number and its binary form without looking at the tetrahedron? (you can try by looking first). Keep this tetrahedron handy, we will use it when we play the game of Nim. Note: the number in the interior of the tetrahedron could not be included on the D net.
2 Binary Tetrahedron Construction: Preparation: Using coloured pen, convert the numbers in this triangle into binary: Cut and glue the borders to get a D triangular pyramid (aka a tetrahedron) like the one in this diagram: Note: the number in the interior of the tetrahedron could not be included on the D net.
3 . Nim with piles Nim is a game of strategy. There are many variants but we will try this one: Start with any number of counters in any number of piles. Two s take turns to remove any number of counters from a single pile. The winner is the who takes the last counter. For each of the following starting position, decide who if both s play the best possible moves. Once you convince yourself that the loser couldn t have played any better, place a in the winner s column. a) Playing with two piles: Counters in each pile st nd,,,,, b) Playing with three piles: Counters in each pile st nd,,,,,,,,,, i) What are all the possible LOSE positions when playing with piles? ii) What are all the possible WIN positions when playing with piles? Describe a winning strategy. Starting with the smaller numbers and moving on to bigger ones, take any numbers on the binary tetrahedron. i) Who will win if the numbers are all on the same line? ii) Who will win if the numbers include vertices but are not all on the same line? iii) Find more starting positions which insure that the st loses. c) Playing with four piles: Counters in each pile st nd,,,,,, m,m,n,n Using the binary tetrahedron above, can you find more pile positions which insure that the st will lose? How about when the st? d) Look at all the positions discovered in the steps above in which the nd. Write the numbers of counters in each pile in a column and convert them to binary. Do you notice any patterns? Example:,,, 7 is one such position.
4 . Binary Guessing Game: a) Build a binary tetrahedron using the net on the next page and look out for patterns: i) on the vertices ii) on each edge iii) on the faces b) For each vertex, write down all the numbers connected to that vertex by segment. Describe a defining rule for each of these sets. Here they are in binary: A: ; ; ; 7; 9; ; ; B: ; ; 6; 7; 0; ; ; C: ; ; 6; 7; ; ; ; D: 8; 9; 0; ; ; ; ; If I pick a number between and and tell you exactly in which of the sets above it is, can you tell me the number and its binary form without looking at the tetrahedron? (you can try by looking first). Solution: a) i) Powers of. In binary: ii) The midpoint on each edges is the sum of the vertices of that edge. In binary, the midpoints are always written with two -s. iii) The centre of each face is the sum of the vertices of the faces. It is also the sum of the endpoints of the medians. The centres of faces are always the binary numbers written with three -s. The centre of the tetrahedron is written like In binary: A= the set of binary numbers ending in : _ B= the set of binary numbers with the -s digit equal to : _ C= the set of binary numbers with the -s digit equal to : _ D= the set of binary numbers with the 8-s digit equal to : _ Based on this, if you tell me in which sets the number is and in which it isn t, I can immediately write the number in binary by translating IT IS IN THE SET into and IT ISN T IN THE SET into 0 for the corresponding digit. For example, the number found in the sets A, B and D but not in C is. Nim with piles Nim is a game of strategy. There are many variants but we will try this one: Start with any number of counters in any number of piles. Two s take turns to remove any number of counters from a single pile. The winner is the who takes the last counter. We call a starting position of a game a WIN position if there is a strategy by which the first can win. We call it a LOSE position if there is a strategy for the second to win the game against the first. In each of the following starting position, decide whether it is a winning or a losing position:
5 a) Playing with two piles: Counters in each pile st nd,,,,, The positions in which the nd are those in which the two piles have the same numbers of counters, because whatever move the st makes with one pile, the nd can always mirror with the other pile. Example: Start st nd st nd st nd nd Note: For these positions, the winner always has the same colour as the starting position. Thus colour-coding the s is a very handy way to keep track of who will win. If you start with any other position you can always take away the extra counters from the larger pile, thus making the piles even. Example: Start st st First has brought the game to a position which is a win for the current nd, but after the first move, the st has become nd, so he/she WINS. b) Playing with three piles: Counters in each pile,,,,,,,,,, st nd Starting with the smaller numbers and moving on to bigger ones, take any numbers on the binary tetrahedron. i) Who will win if the numbers are all on the same line? ii) Who will win if the numbers include vertices but are not all on the same line? iii) Find more starting positions which insure that the st loses. The first two positions in the table are WINs because the st can leave the nd with piles of equal numbers of counters: Start st st
6 Start st st Note that in these cases, the winner is coloured differently from the starting position. The starting position,, leads the nd winning the game. To prove this, we have to show that all possible moves of the st lead him to a position where the other : Start st nd nd nd nd nd nd Position,, leads to the st winning because it can be sent to,, in one move. Start st st
7 Position,, is a LOSE because whatever the st move, the nd move can send the game to one of these LOSE positions:,, (or a permutation) or,, or,. Start st nd or or or or or nd nd nd nd nd A shorter way to show how each game depends on the outcomes of the previous ones is to represent the possible moves as arrows in a table. A if there is an arrow starting from his/her initial position to a WIN position. A loses if all the arrows which can be drawn from its position end up in an empty slot. Counters in each pile st s turn nd s turn WIN with WIN,, or permutations WIN,, or permutations WIN,, or permutations WIN,, or permutations WIN,, or permutations i) If the numbers are all on the same line in the tetrahedron, then the nd. Indeed, starting with numbers on the same line and changing one of them with a smaller number, this smaller number, together with one of the other initial numbers, form a new line in the tetrahedron. Now the remaining of the initial numbers can be swapped with a number on the new line, which is always smaller than the original one. Indeed, this can be checked algebraically because any collinear numbers
8 satisfy (possibly after reordering): If the st move is and then so the next move can be Now are all on the same line, but are smaller than the starting numbers. We can continue this way till reaching,, which is a LOSE for the st. If the st move is and then so the next move can be ii) If the numbers include vertices but are not all on the same line, then they form a WIN position. Indeed this move can be reduced in move to a position where the numbers are all on the same line. Algebraically, if with satisfy then take and if then take. In fact all other points not on a line can boast the same property except some triples of midpoints. iii) Can you find other LOSING positions? There are some triplets of midpoints which also form LOSE positions. That is because these triplets also satisfy as if they were collinear. You can check on the tetrahedron that the only moves available lead to WIN positions above. (Note to tutors: the binary tetrahedron is in fact secretly the dimensional projective spaces with coordinates in, known as the Fano projective space. In this space, all midpoints of edges form a plane and the triplets of midpoints mentioned above are collinear, indeed.) c) Playing with four piles: c) Playing with four piles: Counters in each pile st nd,,,,,, m,m,n,n Using the binary tetrahedron above, can you find more pile positions which insure that the st will lose? How about when the st? WIN positions: m,m,n,p with p different from n. LOSE positions:,,, 7 and similar positions in the tetrahedron. In moves these can be reduced either to m,m,n,n or to a LOSE position with points on a line like in b). No exhaustive proof should be required during classtime. d) Look at all the positions discovered in the steps above in which the nd. Write the numbers of counters in each pile in a column and convert them to binary. Do you notice any patterns? Examples: v They all have even numbers of -s on each column. In fact, this is always true: the nd always when there are an even numbers of s in each column of the binary codes for the starting position, because: - the st s move will always disturb this property, - but this property can then always be restored in one move.
9 s in columns: s in columns: s in columns: 0 s in columns: s in columns: 0 Whenever the st moves, the digits in one of the rows are changed. In particular, there is a leftmost changed into a 0. We call that a pivot, and colour it and the following digits in blue. Because the number of s in each column is originally even, the pivot is paired with another from the same column but different row. When the pivot is changes into a 0 by the st, the number of s on the pivot s column becomes odd, (and the same may happen to some of the following columns). To rectify this, the second changes the pivot s paired, and possibly the following digits.
Number Bases. Ideally this should lead to discussions on polynomials see Polynomials Question Sheet.
Number Bases Summary This lesson is an exploration of number bases. There are plenty of resources for this activity on the internet, including interactive activities. Please feel free to supplement the
More informationGrade 7 & 8 Math Circles. Mathematical Games
Faculty of Mathematics Waterloo, Ontario N2L 3G1 The Loonie Game Grade 7 & 8 Math Circles November 19/20/21, 2013 Mathematical Games In the loonie game, two players, and, lay down 17 loonies on a table.
More informationCounters in a Cup In and Out. The student sets up the cup, drops the counters on it, and records how many landed in and out of the cup.
Counters in a Cup In and Out Cup Counters Recording Paper The student sets up the cup, drops the counters on it, and records how many landed in and out of the cup. 3 + 4 =7 2 + 5 =7 For subtraction, take
More informationExploring Concepts with Cubes. A resource book
Exploring Concepts with Cubes A resource book ACTIVITY 1 Gauss s method Gauss s method is a fast and efficient way of determining the sum of an arithmetic series. Let s illustrate the method using the
More informationSenior Math Circles February 10, 2010 Game Theory II
1 University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Senior Math Circles February 10, 2010 Game Theory II Take-Away Games Last Wednesday, you looked at take-away
More informationJim and Nim. Japheth Wood New York Math Circle. August 6, 2011
Jim and Nim Japheth Wood New York Math Circle August 6, 2011 Outline 1. Games Outline 1. Games 2. Nim Outline 1. Games 2. Nim 3. Strategies Outline 1. Games 2. Nim 3. Strategies 4. Jim Outline 1. Games
More informationThree Pile Nim with Move Blocking. Arthur Holshouser. Harold Reiter.
Three Pile Nim with Move Blocking Arthur Holshouser 3600 Bullard St Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223, USA hbreiter@emailunccedu
More informationGame Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games
Game Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games May 17, 2011 Summary: We give a winning strategy for the counter-taking game called Nim; surprisingly, it involves computations
More informationProblem F. Chessboard Coloring
Problem F Chessboard Coloring You have a chessboard with N rows and N columns. You want to color each of the cells with exactly N colors (colors are numbered from 0 to N 1). A coloring is valid if and
More informationGame 0: One Pile, Last Chip Loses
Take Away Games II: Nim April 24, 2016 The Rules of Nim The game of Nim is a two player game. There are piles of chips which the players take turns taking chips from. During a single turn, a player can
More informationChapter 4: Patterns and Relationships
Chapter : Patterns and Relationships Getting Started, p. 13 1. a) The factors of 1 are 1,, 3,, 6, and 1. The factors of are 1,,, 7, 1, and. The greatest common factor is. b) The factors of 16 are 1,,,,
More informationCombinatorial Games. Jeffrey Kwan. October 2, 2017
Combinatorial Games Jeffrey Kwan October 2, 2017 Don t worry, it s just a game... 1 A Brief Introduction Almost all of the games that we will discuss will involve two players with a fixed set of rules
More informationI.M.O. Winter Training Camp 2008: Invariants and Monovariants
I.M.. Winter Training Camp 2008: Invariants and Monovariants n math contests, you will often find yourself trying to analyze a process of some sort. For example, consider the following two problems. Sample
More informationof Nebraska - Lincoln
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2006 The Game of Nim Dean J. Davis University of Nebraska-Lincoln
More informationContest 1. October 20, 2009
Contest 1 October 20, 2009 Problem 1 What value of x satisfies x(x-2009) = x(x+2009)? Problem 1 What value of x satisfies x(x-2009) = x(x+2009)? By inspection, x = 0 satisfies the equation. Problem 1 What
More informationBmMT 2013 TEAM ROUND SOLUTIONS 16 November 2013
BmMT 01 TEAM ROUND SOLUTIONS 16 November 01 1. If Bob takes 6 hours to build houses, he will take 6 hours to build = 1 houses. The answer is 18.. Here is a somewhat elegant way to do the calculation: 1
More informationTHINGS TO DO WITH A GEOBOARD
THINGS TO DO WITH A GEOBOARD The following list of suggestions is indicative of exercises and examples that can be worked on the geoboard. Simpler, as well as, more difficult suggestions can easily be
More informationPositive Triangle Game
Positive Triangle Game Two players take turns marking the edges of a complete graph, for some n with (+) or ( ) signs. The two players can choose either mark (this is known as a choice game). In this game,
More informationBMT 2018 Combinatorics Test Solutions March 18, 2018
. Bob has 3 different fountain pens and different ink colors. How many ways can he fill his fountain pens with ink if he can only put one ink in each pen? Answer: 0 Solution: He has options to fill his
More informationFigure 1: The Game of Fifteen
1 FIFTEEN One player has five pennies, the other five dimes. Players alternately cover a number from 1 to 9. You win by covering three numbers somewhere whose sum is 15 (see Figure 1). 1 2 3 4 5 7 8 9
More informationILLUSION CONFUSION! - MEASURING LINES -
ILLUSION CONFUSION! - MEASURING LINES - WHAT TO DO: 1. Look at the line drawings below. 2. Without using a ruler, which long upright or vertical line looks the longest or do they look the same length?
More informationSOME MORE DECREASE AND CONQUER ALGORITHMS
What questions do you have? Decrease by a constant factor Decrease by a variable amount SOME MORE DECREASE AND CONQUER ALGORITHMS Insertion Sort on Steroids SHELL'S SORT A QUICK RECAP 1 Shell's Sort We
More informationLecture 2: Sum rule, partition method, difference method, bijection method, product rules
Lecture 2: Sum rule, partition method, difference method, bijection method, product rules References: Relevant parts of chapter 15 of the Math for CS book. Discrete Structures II (Summer 2018) Rutgers
More informationEXPLORING TIC-TAC-TOE VARIANTS
EXPLORING TIC-TAC-TOE VARIANTS By Alec Levine A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE OF STETSON UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR
More informationBackground. Game Theory and Nim. The Game of Nim. Game is Finite 1/27/2011
Background Game Theory and Nim Dr. Michael Canjar Department of Mathematics, Computer Science and Software Engineering University of Detroit Mercy 26 January 2010 Nimis a simple game, easy to play. It
More informationDefinition 1 (Game). For us, a game will be any series of alternating moves between two players where one player must win.
Abstract In this Circles, we play and describe the game of Nim and some of its friends. In German, the word nimm! is an excited form of the verb to take. For example to tell someone to take it all you
More information! Denver, CO! Demystifying Computing with Magic, continued
2012-03-07! Denver, CO! Demystifying Computing with Magic, continued Special Session Overview Motivation The 7 magic tricks ú Real-Time 4x4 Magic Square ú Left/Right Game ú The Tricky Dice ú The Numbers
More informationAnalyzing Games: Solutions
Writing Proofs Misha Lavrov Analyzing Games: olutions Western PA ARML Practice March 13, 2016 Here are some key ideas that show up in these problems. You may gain some understanding of them by reading
More informationMath Circle: Logic Puzzles
Math Circle: Logic Puzzles June 4, 2017 The Missing $1 Three people rent a room for the night for a total of $30. They each pay $10 and go upstairs. The owner then realizes the room was only supposed to
More informationA few chessboards pieces: 2 for each student, to play the role of knights.
Parity Party Returns, Starting mod 2 games Resources A few sets of dominoes only for the break time! A few chessboards pieces: 2 for each student, to play the role of knights. Small coins, 16 per group
More informationProblem 2A Consider 101 natural numbers not exceeding 200. Prove that at least one of them is divisible by another one.
1. Problems from 2007 contest Problem 1A Do there exist 10 natural numbers such that none one of them is divisible by another one, and the square of any one of them is divisible by any other of the original
More informationSolutions to Part I of Game Theory
Solutions to Part I of Game Theory Thomas S. Ferguson Solutions to Section I.1 1. To make your opponent take the last chip, you must leave a pile of size 1. So 1 is a P-position, and then 2, 3, and 4 are
More informationThe snail and bean conundrum
Maths B DAY 2008 Friday 21 November The snail and bean conundrum The Maths B Day is sponsored by and Introduction This Maths B day assignment comprises two parts. In the first part, you will study the
More informationIdeas beyond Number. Activity worksheets
Ideas beyond Number Activity sheet 1 Task 1 Some students started to solve this equation in different ways: For each statement tick True or False: = = = = Task 2: Counter-examples The exception disproves
More informationQUIZ: Fill in the blank. Necessity is the Mother of.
QUIZ: Fill in the blank Necessity is the Mother of. Necessity is the Mother of KLUDGE. Rube Goldberg Now let s examine a fun application of binary! The game(s) of Nim a.k.a. the Subtraction game German:
More informationLESSON 2: THE INCLUSION-EXCLUSION PRINCIPLE
LESSON 2: THE INCLUSION-EXCLUSION PRINCIPLE The inclusion-exclusion principle (also known as the sieve principle) is an extended version of the rule of the sum. It states that, for two (finite) sets, A
More informationImpartial Combinatorial Games Berkeley Math Circle Intermediate II Ted Alper Evans Hall, room 740 Sept 1, 2015
Impartial Combinatorial Games Berkeley Math Circle Intermediate II Ted Alper Evans Hall, room 740 Sept 1, 2015 tmalper@stanford.edu 1 Warmups 1.1 (Kozepiskolai Matematikai Lapok, 1980) Contestants B and
More informationProblem A To and Fro (Problem appeared in the 2004/2005 Regional Competition in North America East Central.)
Problem A To and Fro (Problem appeared in the 2004/2005 Regional Competition in North America East Central.) Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number
More informationPlan. Related courses. A Take-Away Game. Mathematical Games , (21-801) - Mathematical Games Look for it in Spring 11
V. Adamchik D. Sleator Great Theoretical Ideas In Computer Science Mathematical Games CS 5-25 Spring 2 Lecture Feb., 2 Carnegie Mellon University Plan Introduction to Impartial Combinatorial Games Related
More informationGrade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015 Chomp Chomp is a simple 2-player
More informationInternational mathematical olympiad Formula of Unity / The Third Millenium 2013/2014 year
1st round, grade R5 * example, all years from 1988 to 2012 were hard. Find the maximal number of consecutive hard years among the past years of Common Era (A.D.). 2. There are 6 candles on a round cake.
More informationPOKER (AN INTRODUCTION TO COUNTING)
POKER (AN INTRODUCTION TO COUNTING) LAMC INTERMEDIATE GROUP - 10/27/13 If you want to be a succesful poker player the first thing you need to do is learn combinatorics! Today we are going to count poker
More informationHackenbush. Nim with Lines (and something else) Rules: Example Boards:
Hackenbush Nim with Lines (and something else) 1. There is a long horizontal line at the bottom of the picture known as the ground line. All line segments in the picture must be connected by some path
More information2 Reasoning and Proof
www.ck12.org CHAPTER 2 Reasoning and Proof Chapter Outline 2.1 INDUCTIVE REASONING 2.2 CONDITIONAL STATEMENTS 2.3 DEDUCTIVE REASONING 2.4 ALGEBRAIC AND CONGRUENCE PROPERTIES 2.5 PROOFS ABOUT ANGLE PAIRS
More informationActivities. for building. geometric connections. MCTM Conference Cheryl Tucker
Activities for building geometric connections (handout) MCTM Conference 2013 Cheryl Tucker Minneapolis Public Schools Tucker.cherylj@gmail.com (Many materials are from Geometry Connections, CPM, used with
More informationNRP Math Challenge Club
Week 7 : Manic Math Medley 1. You have exactly $4.40 (440 ) in quarters (25 coins), dimes (10 coins), and nickels (5 coins). You have the same number of each type of coin. How many dimes do you have? 2.
More informationStudents use absolute value to determine distance between integers on the coordinate plane in order to find side lengths of polygons.
Student Outcomes Students use absolute value to determine distance between integers on the coordinate plane in order to find side lengths of polygons. Lesson Notes Students build on their work in Module
More information2 Event is equally likely to occur or not occur. When all outcomes are equally likely, the theoretical probability that an event A will occur is:
10.3 TEKS a.1, a.4 Define and Use Probability Before You determined the number of ways an event could occur. Now You will find the likelihood that an event will occur. Why? So you can find real-life geometric
More informationThe Fano Plane as an Octonionic Multiplication Table
The Fano Plane as an Octonionic Multiplication Table Peter Killgore June 9, 2014 1 Introduction When considering finite geometries, an obvious question to ask is what applications such geometries have.
More informationKey Stage 3 Mathematics. Common entrance revision
Key Stage 3 Mathematics Key Facts Common entrance revision Number and Algebra Solve the equation x³ + x = 20 Using trial and improvement and give your answer to the nearest tenth Guess Check Too Big/Too
More information13. a) 4 planes of symmetry b) One, line through the apex and the center of the square in the base. c) Four rotational symmetries.
1. b) 9 c) 9 d) 16 2. b)12 c) 8 d) 18 3. a) The base of the pyramid is a dodecagon. b) 24 c) 13 4. a) The base of the prism is a heptagon b) 14 c) 9 5. Drawing 6. Drawing 7. a) 46 faces b) No. If that
More informationo o o o o o o o o o o o
ONE ROW NIM Introduction: Nim is a two-person, perfect-knowledge game of strategy. Perfect knowledge means that there are no hidden cards or moves, and no dice to roll, and therefore that both players
More informationCARD GAMES AND CRYSTALS
CARD GAMES AND CRYSTALS This is the extended version of a talk I gave at KIDDIE (graduate student colloquium) in April 2011. I wish I could give this version, but there wasn t enough time, so I left out
More informationFinal Exam, Math 6105
Final Exam, Math 6105 SWIM, June 29, 2006 Your name Throughout this test you must show your work. 1. Base 5 arithmetic (a) Construct the addition and multiplication table for the base five digits. (b)
More informationHow to Play WADA s Anti-Doping Card Game
How to Play WADA s Anti-Doping Card Game Object of the game: The object of the game is to be the first person to discard all his/her cards, without being banned for life for doping. What you will need
More informationTangent: Boromean Rings. The Beer Can Game. Plan. A Take-Away Game. Mathematical Games I. Introduction to Impartial Combinatorial Games
K. Sutner D. Sleator* Great Theoretical Ideas In Computer Science CS 15-251 Spring 2014 Lecture 110 Feb 4, 2014 Carnegie Mellon University Tangent: Boromean Rings Mathematical Games I Challenge for next
More informationGeometry Vocabulary Book
Geometry Vocabulary Book Units 2-4 Page 1 Unit 2 General Geometry Point Characteristics: Line Characteristics: Plane Characteristics: RELATED POSTULATES: Through any two points there exists exactly one
More information1, 2,, 10. Example game. Pieces and Board: This game is played on a 1 by 10 board. The initial position is an empty board.
,,, 0 Pieces and Board: This game is played on a by 0 board. The initial position is an empty board. To Move: Players alternate placing either one or two pieces on the leftmost open squares. In this game,
More informationTitle: Quadrilaterals Aren t Just Squares
Title: Quadrilaterals ren t Just Squares Brief Overview: This is a collection of the first three lessons in a series of seven lessons studying characteristics of quadrilaterals, including trapezoids, parallelograms,
More informationProblem of the Month: Between the Lines
Problem of the Month: Between the Lines Overview: In the Problem of the Month Between the Lines, students use polygons to solve problems involving area. The mathematical topics that underlie this POM are
More informationExpansion/Analysis of a Card Trick Comprised of Transformations in 2-Dimensional Matrices Aaron Kazam Sherbany, Clarkstown North High School, NY
Expansion/Analysis of a Card Trick Comprised of Transformations in 2-Dimensional Matrices Aaron Kazam Sherbany, Clarkstown North High School, NY This paper illustrates the properties of a card trick which
More informationStandard Sudoku point. 1 point. P a g e 1
P a g e 1 Standard 1-2 Place a digit from 1 to 6 in each empty cell so that each digit appears exactly once in each row, column and 2X box. 1 point A 6 2 6 2 1 5 1 point B 5 2 2 4 1 1 6 5 P a g e 2 Standard
More informationGPLMS Revision Programme GRADE 6 Booklet
GPLMS Revision Programme GRADE 6 Booklet Learner s name: School name: Day 1. 1. a) Study: 6 units 6 tens 6 hundreds 6 thousands 6 ten-thousands 6 hundredthousands HTh T Th Th H T U 6 6 0 6 0 0 6 0 0 0
More informationObliged Sums of Games
Obliged Sums of Games Thomas S. Ferguson Mathematics Department, UCLA 1. Introduction. Let g be an impartial combinatorial game. In such a game, there are two players, I and II, there is an initial position,
More informationTopic : ADDITION OF PROBABILITIES (MUTUALLY EXCLUSIVE EVENTS) TIME : 4 X 45 minutes
Worksheet 6 th Topic : ADDITION OF PROBABILITIES (MUTUALLY EXCLUSIVE EVENTS) TIME : 4 X 45 minutes STANDARD COMPETENCY : 1. To use the statistics rules, the rules of counting, and the characteristic of
More informationCK-12 Geometry Inductive Reasoning
CK-12 Geometry Inductive Reasoning Learning Objectives Recognize visual and number patterns. Extend and generalize patterns. Write a counterexample. Review Queue a. Look at the patterns of numbers below.
More informationPRIMES STEP Plays Games
PRIMES STEP Plays Games arxiv:1707.07201v1 [math.co] 22 Jul 2017 Pratik Alladi Neel Bhalla Tanya Khovanova Nathan Sheffield Eddie Song William Sun Andrew The Alan Wang Naor Wiesel Kevin Zhang Kevin Zhao
More informationProblem Solving By Cynthia Northrup
UCI Math Circle September 28, 2013 Problem Solving By Cynthia Northrup 1. Graph Theory 2. The Game of Nim 3. The Calendar Game 4. Operating a Security System 5. Planets 6. Pie and Pawns 7. Games of Stones
More informationFind the coordinates of the midpoint of a segment having the given endpoints.
G.(2) Coordinate and transformational geometry. The student uses the process skills to understand the connections between algebra and geometry and uses the one- and two-dimensional coordinate systems to
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing May 8, 2017 May 8, 2017 1 / 15 Extensive Form: Overview We have been studying the strategic form of a game: we considered only a player s overall strategy,
More informationLECTURE 8: DETERMINANTS AND PERMUTATIONS
LECTURE 8: DETERMINANTS AND PERMUTATIONS MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1 Determinants In the last lecture, we saw some applications of invertible matrices We would now like to describe how
More information14th Bay Area Mathematical Olympiad. BAMO Exam. February 28, Problems with Solutions
14th Bay Area Mathematical Olympiad BAMO Exam February 28, 2012 Problems with Solutions 1 Hugo plays a game: he places a chess piece on the top left square of a 20 20 chessboard and makes 10 moves with
More informationUnderleague Game Rules
Underleague Game Rules Players: 2-5 Game Time: Approx. 45 minutes (+15 minutes per extra player above 2) Helgarten, a once quiet port town, has become the industrial hub of a vast empire. Ramshackle towers
More informationMath 3 Geogebra Discovery - Equidistance Decemeber 5, 2014
Math 3 Geogebra Discovery - Equidistance Decemeber 5, 2014 Today you and your partner are going to explore two theorems: The Equidistance Theorem and the Perpendicular Bisector Characterization Theorem.
More informationProbability and Statistics
Probability and Statistics Activity: Do You Know Your s? (Part 1) TEKS: (4.13) Probability and statistics. The student solves problems by collecting, organizing, displaying, and interpreting sets of data.
More informationInstruction Cards Sample
Instruction Cards Sample mheducation.com/prek-12 Instruction Cards Table of Contents Level A: Tunnel to 100... 1 Level B: Race to the Rescue...15 Level C: Fruit Collector...35 Level D: Riddles in the Labyrinth...41
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing April 16, 2017 April 16, 2017 1 / 17 Announcements Please bring a blue book for the midterm on Friday. Some students will be taking the exam in Center 201,
More informationCard Racer. By Brad Bachelor and Mike Nicholson
2-4 Players 30-50 Minutes Ages 10+ Card Racer By Brad Bachelor and Mike Nicholson It s 2066, and you race the barren desert of Indianapolis. The crowd s attention span isn t what it used to be, however.
More informationActivity: Fold Four Boxes
ctivity: Fold Four Boxes 1. Cut out your copy of the crease pattern for the square-base twist box but only cut along the solid lines. 2. Look at this key: mountain crease valley crease When folded, a mountain
More informationDyck paths, standard Young tableaux, and pattern avoiding permutations
PU. M. A. Vol. 21 (2010), No.2, pp. 265 284 Dyck paths, standard Young tableaux, and pattern avoiding permutations Hilmar Haukur Gudmundsson The Mathematics Institute Reykjavik University Iceland e-mail:
More informationStat 155: solutions to midterm exam
Stat 155: solutions to midterm exam Michael Lugo October 21, 2010 1. We have a board consisting of infinitely many squares labeled 0, 1, 2, 3,... from left to right. Finitely many counters are placed on
More informationwizprof Good luck and most of all have fun.! you may use 75 minutes calculators are not allowed
www.wijsen.nl www.e-nemo.nl www.education.ti.com wiprof 208 WWW.W4KANGOEROE.NL Good luck and most of all have fun.! Stichting Wiskunde Kangoeroe www.smart.be www.sanderspuelboeken.nl www.schoolsupport.nl
More informationIs muddled about the correspondence between multiplication and division facts, recording, for example: 3 5 = 15, so 5 15 = 3
Is muddled about the correspondence between multiplication and division facts, recording, for example: 3 5 = 15, so 5 15 = 3 Opportunity for: recognising relationships Resources Board with space for four
More informationRoll & Make. Represent It a Different Way. Show Your Number as a Number Bond. Show Your Number on a Number Line. Show Your Number as a Strip Diagram
Roll & Make My In Picture Form In Word Form In Expanded Form With Money Represent It a Different Way Make a Comparison Statement with a Greater than Your Make a Comparison Statement with a Less than Your
More informationDesign and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute. Module 6 Lecture - 37 Divide and Conquer: Counting Inversions
Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute Module 6 Lecture - 37 Divide and Conquer: Counting Inversions Let us go back and look at Divide and Conquer again.
More informationSituations Involving Multiplication and Division with Products to 50
Mathematical Ideas Composing, decomposing, addition, and subtraction of numbers are foundations of multiplication and division. The following are examples of situations that involve multiplication and/or
More informationPermutations. = f 1 f = I A
Permutations. 1. Definition (Permutation). A permutation of a set A is a bijective function f : A A. The set of all permutations of A is denoted by Perm(A). 2. If A has cardinality n, then Perm(A) has
More informationSample lessonsample lessons using ICT
Sample lessonsample lessons using ICT The Coalition Government took office on 11 May 2010. This publication was published prior to that date and may not reflect current government policy. You may choose
More informationMaking Middle School Math Come Alive with Games and Activities
Making Middle School Math Come Alive with Games and Activities For more information about the materials you find in this packet, contact: Sharon Rendon (605) 431-0216 sharonrendon@cpm.org 1 2-51. SPECIAL
More informationLEARNING ABOUT MATH FOR GR 1 TO 2. Conestoga Public School OCTOBER 13, presented by Kathy Kubota-Zarivnij
LEARNING ABOUT MATH FOR GR 1 TO 2 Conestoga Public School OCTOBER 13, 2016 6:30 pm 8:00 pm presented by Kathy Kubota-Zarivnij kathkubo@gmail.com TODAY S MATH TOOLS FOR counters playing cards dice interlocking
More informationSESSION THREE AREA MEASUREMENT AND FORMULAS
SESSION THREE AREA MEASUREMENT AND FORMULAS Outcomes Understand the concept of area of a figure Be able to find the area of a rectangle and understand the formula base times height Be able to find the
More informationChristmas Capers = said Santa as he ate a small piece of =. He had just finished loading the
Christmas Capers 1-0.59596 = said Santa as he ate a small piece of 2000 + 33006 =. He had just finished loading the 3691 125 = when 10 + 24 = realised he couldn t 67 5 = a single reindeer. He removed his
More informationSolving Big Problems
Solving Big Problems A 3-Week Book of Big Problems, Solved Solving Big Problems Students July 25 SPMPS/BEAM Contents Challenge Problems 2. Palindromes.................................... 2.2 Pick Your
More informationContents. MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes. 1 Wednesday, August Friday, August Monday, August 28 6
MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes Contents 1 Wednesday, August 23 4 2 Friday, August 25 5 3 Monday, August 28 6 4 Wednesday, August 30 8 5 Friday, September 1 9 6 Wednesday, September
More information18.S34 (FALL, 2007) PROBLEMS ON PROBABILITY
18.S34 (FALL, 2007) PROBLEMS ON PROBABILITY 1. Three closed boxes lie on a table. One box (you don t know which) contains a $1000 bill. The others are empty. After paying an entry fee, you play the following
More informationProblem Set 1: It s a New Year for Problem Solving!...
PCMI Outreach, Jan 21 22, 2017 Problem Set 1: It s a New Year for Problem Solving!... Welcome to PCMI! We know you ll learn a great deal of mathematics here maybe some new tricks, maybe some new perspectives
More informationE G 2 3. MATH 1012 Section 8.1 Basic Geometric Terms Bland
MATH 1012 Section 8.1 Basic Geometric Terms Bland Point A point is a location in space. It has no length or width. A point is represented by a dot and is named by writing a capital letter next to the dot.
More informationRecovery and Characterization of Non-Planar Resistor Networks
Recovery and Characterization of Non-Planar Resistor Networks Julie Rowlett August 14, 1998 1 Introduction In this paper we consider non-planar conductor networks. A conductor is a two-sided object which
More informationSituations Involving Multiplication and Division with Products to 100
Mathematical Ideas Composing, decomposing, addition, and subtraction of numbers are foundations of multiplication and division. The following are examples of situations that involve multiplication and/or
More informationPUTNAM PROBLEMS FINITE MATHEMATICS, COMBINATORICS
PUTNAM PROBLEMS FINITE MATHEMATICS, COMBINATORICS 2014-B-5. In the 75th Annual Putnam Games, participants compete at mathematical games. Patniss and Keeta play a game in which they take turns choosing
More information