Isha Agarwal, M. Borodin, Aidan Duncan, Kaylee Ji, Shane Lee, B. Litchev, Anshul Rastogi, Garima Rastogi, Andrew Zhao, T. Khovanova
Abstract We start by exploring and analyzing the various aspects of Penney’s game, examining its possible outcomes as well as its fairness (or lack thereof). In search of a fairer game, we create many variations of the original Penney’s game by altering its rules. Specifically, we introduce the Head-Start Penney’s game, the Post-a-Bobalyptic Penney’s game, the Second-Occurrence Penney’s game, the Two-Coin game, the No-Flippancy game, and the Blended game. We then analyze each of these games and the odds of winning for both players.
{"title":"From Unequal Chance to a Coin Game Dance: Variants of Penney’s Game","authors":"Isha Agarwal, M. Borodin, Aidan Duncan, Kaylee Ji, Shane Lee, B. Litchev, Anshul Rastogi, Garima Rastogi, Andrew Zhao, T. Khovanova","doi":"10.2478/rmm-2021-0002","DOIUrl":"https://doi.org/10.2478/rmm-2021-0002","url":null,"abstract":"Abstract We start by exploring and analyzing the various aspects of Penney’s game, examining its possible outcomes as well as its fairness (or lack thereof). In search of a fairer game, we create many variations of the original Penney’s game by altering its rules. Specifically, we introduce the Head-Start Penney’s game, the Post-a-Bobalyptic Penney’s game, the Second-Occurrence Penney’s game, the Two-Coin game, the No-Flippancy game, and the Blended game. We then analyze each of these games and the odds of winning for both players.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114932052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Here I describe an infinite number of fractal tiles of regular rep-tiles in all dimensions above 1. Each rep-tile’s set of tiles can be divided into subsets based on certain visual characteristics. As fractals, they can be programmed and rendered in any size. They can be arranged in groups according to their aesthetic properties; used as an unending visual and pattern-recognition training ground for AI; and even animated as increments from one to the next.
{"title":"Infinite Tiles of Regular rep-tiles","authors":"Tony Hanmer","doi":"10.2478/rmm-2019-0008","DOIUrl":"https://doi.org/10.2478/rmm-2019-0008","url":null,"abstract":"Abstract Here I describe an infinite number of fractal tiles of regular rep-tiles in all dimensions above 1. Each rep-tile’s set of tiles can be divided into subsets based on certain visual characteristics. As fractals, they can be programmed and rendered in any size. They can be arranged in groups according to their aesthetic properties; used as an unending visual and pattern-recognition training ground for AI; and even animated as increments from one to the next.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116923783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract A meaning of three dots (. . . ) and the Gauss’s sum.
三个点的意思(…)和高斯和。
{"title":"Yes, Gauss’s Answer is Indeed Correct!","authors":"Z. Ercan, Mehmet Vural","doi":"10.2478/rmm-2019-0005","DOIUrl":"https://doi.org/10.2478/rmm-2019-0005","url":null,"abstract":"Abstract A meaning of three dots (. . . ) and the Gauss’s sum.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133022039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Borodin, Aidan Duncan, Joshua Guo, Kunal Kapoor Anuj Sakarda, Jerry Tan, Armaan Tipirneni, Max Xu, Kevin Zhao, T. Khovanova
Abstract We discuss some old common knowledge puzzles and introduce a lot of new common knowledge puzzles.
本文讨论了一些旧的常识谜题，并介绍了许多新的常识谜题。
{"title":"It’s Common Knowledge","authors":"M. Borodin, Aidan Duncan, Joshua Guo, Kunal Kapoor Anuj Sakarda, Jerry Tan, Armaan Tipirneni, Max Xu, Kevin Zhao, T. Khovanova","doi":"10.2478/rmm-2019-0006","DOIUrl":"https://doi.org/10.2478/rmm-2019-0006","url":null,"abstract":"Abstract We discuss some old common knowledge puzzles and introduce a lot of new common knowledge puzzles.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132994709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract A connected graph on 2n vertices is defined to be xor-magic if the vertices can be labeled with distinct n-bit binary numbers in such a way that the label at each vertex is equal to the bitwise xor of the labels on the adjacent vertices. We show that there is at least one 3-regular xor-magic graph on 2n vertices for every n ⩾ 2. We classify the 3-regular xor-magic graphs on 8 and 16 vertices, and give multiple examples of 3-regular xor-magic graphs on 32 vertices, including the well-known Dyck graph.
{"title":"Xor-Magic Graphs","authors":"J. Siehler","doi":"10.2478/rmm-2019-0004","DOIUrl":"https://doi.org/10.2478/rmm-2019-0004","url":null,"abstract":"Abstract A connected graph on 2n vertices is defined to be xor-magic if the vertices can be labeled with distinct n-bit binary numbers in such a way that the label at each vertex is equal to the bitwise xor of the labels on the adjacent vertices. We show that there is at least one 3-regular xor-magic graph on 2n vertices for every n ⩾ 2. We classify the 3-regular xor-magic graphs on 8 and 16 vertices, and give multiple examples of 3-regular xor-magic graphs on 32 vertices, including the well-known Dyck graph.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126160777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract The article describes an attempt to define a new mathematical constant - the probability of obtaining a hyperbola or an ellipse when throwing five random points on a plane.
摘要本文尝试定义一个新的数学常数——在平面上随机抛五个点得到双曲线或椭圆的概率。
{"title":"New Year Mathematical Card or V Points Mathematical Constant","authors":"V. Ochkov","doi":"10.2478/rmm-2019-0003","DOIUrl":"https://doi.org/10.2478/rmm-2019-0003","url":null,"abstract":"Abstract The article describes an attempt to define a new mathematical constant - the probability of obtaining a hyperbola or an ellipse when throwing five random points on a plane.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"4323 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115674404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract The Game of Poker Chips, Dominoes and Survival fosters team building and high level cooperation in large groups, and is a tool applied in management training exercises. Each player, initially given two colored poker chips, is allowed to make exchanges with the game coordinator according to two rules, and must secure a domino before time is called in order to ‘survive’. Though the rules are simple, it is not evident by their form that the survival of the entire group requires that they cooperate at a high level. From the point of view of the game coordinator, the di culty of the game for the group can be controlled not only by the time limit, but also by the initial distribution of chips, in a way we make precise by a time complexity type argument. That analysis also provides insight into good strategies for group survival, those taking the least amount of time. In addition, coordinators may also want to be aware of when the game is ‘solvable’, that is, when their initial distribution of chips permits the survival of all group members if given su cient time to make exchanges. It turns out that the game is solvable if and only if the initial distribution contains seven chips that have one of two particular color distributions. In addition to being a lively game to play in management training or classroom settings, the analysis of the game after play can make for an engaging exercise in any discrete mathematics course to give a basic introduction to elements of game theory, logical reasoning, number theory and the computation of algorithmic complexities.
{"title":"The Game of Poker Chips, Dominoes and Survival","authors":"Larry Goldstein","doi":"10.2478/rmm-2021-0005","DOIUrl":"https://doi.org/10.2478/rmm-2021-0005","url":null,"abstract":"Abstract The Game of Poker Chips, Dominoes and Survival fosters team building and high level cooperation in large groups, and is a tool applied in management training exercises. Each player, initially given two colored poker chips, is allowed to make exchanges with the game coordinator according to two rules, and must secure a domino before time is called in order to ‘survive’. Though the rules are simple, it is not evident by their form that the survival of the entire group requires that they cooperate at a high level. From the point of view of the game coordinator, the di culty of the game for the group can be controlled not only by the time limit, but also by the initial distribution of chips, in a way we make precise by a time complexity type argument. That analysis also provides insight into good strategies for group survival, those taking the least amount of time. In addition, coordinators may also want to be aware of when the game is ‘solvable’, that is, when their initial distribution of chips permits the survival of all group members if given su cient time to make exchanges. It turns out that the game is solvable if and only if the initial distribution contains seven chips that have one of two particular color distributions. In addition to being a lively game to play in management training or classroom settings, the analysis of the game after play can make for an engaging exercise in any discrete mathematics course to give a basic introduction to elements of game theory, logical reasoning, number theory and the computation of algorithmic complexities.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121907334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract In this paper, we discuss coin-weighing problems that use a 5-way scale which has five different possible outcomes: MUCH LESS, LESS, EQUAL, MORE, and MUCH MORE. The 5-way scale provides more information than the regular 3-way scale. We study the problem of finding two fake coins from a pile of identically looking coins in a minimal number of weighings using a 5-way scale. We discuss similarities and differences between the 5-way and 3-way scale. We introduce a strategy for a 5-way scale that can find both counterfeit coins among 2k coins in k + 1 weighings, which is better than any strategy for a 3-way scale.
{"title":"The 5-Way Scale","authors":"T. Khovanova, Joshua Lee","doi":"10.2478/rmm-2019-0001","DOIUrl":"https://doi.org/10.2478/rmm-2019-0001","url":null,"abstract":"Abstract In this paper, we discuss coin-weighing problems that use a 5-way scale which has five different possible outcomes: MUCH LESS, LESS, EQUAL, MORE, and MUCH MORE. The 5-way scale provides more information than the regular 3-way scale. We study the problem of finding two fake coins from a pile of identically looking coins in a minimal number of weighings using a 5-way scale. We discuss similarities and differences between the 5-way and 3-way scale. We introduce a strategy for a 5-way scale that can find both counterfeit coins among 2k coins in k + 1 weighings, which is better than any strategy for a 3-way scale.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"326 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125149700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract A dragon king is a shogi piece that moves any number of squares vertically or horizontally or one square diagonally but does not move through or jump over other pieces. We construct infinite families of solutions to the n + k dragon kings problem of placing k pawns and n + k mutually nonattacking dragon kings on an n×n board, including solutions symmetric with respect to quarter-turn or half-turn rotations, solutions symmetric with respect to one or two diagonal reections, and solutions not symmetric with respect to any nontrivial rotation or reection. We show that an n + k dragon kings solution exists whenever n > k + 5 and that, given some extra conditions, symmetric solutions exist for n > 2k + 5.
龙王是一种将任意数量的方块垂直或水平移动，或一个方块对角线移动，但不能穿过或跳过其他棋子的将棋。我们构造了在n×n棋盘上放置k个兵和n + k个互不攻击的龙王的n + k龙王问题的无限族解，包括关于四分之一回合或半回合旋转的对称解，关于一个或两个对角线反射的对称解，以及关于任何非平凡旋转或反射的非对称解。我们证明了n + k个龙王解存在于任何n > k + 5，并且在给定一些额外条件下，n > k + 5存在对称解。
{"title":"Reflections on the n +k dragon kings problem","authors":"D. Chatham","doi":"10.2478/rmm-2018-0007","DOIUrl":"https://doi.org/10.2478/rmm-2018-0007","url":null,"abstract":"Abstract A dragon king is a shogi piece that moves any number of squares vertically or horizontally or one square diagonally but does not move through or jump over other pieces. We construct infinite families of solutions to the n + k dragon kings problem of placing k pawns and n + k mutually nonattacking dragon kings on an n×n board, including solutions symmetric with respect to quarter-turn or half-turn rotations, solutions symmetric with respect to one or two diagonal reections, and solutions not symmetric with respect to any nontrivial rotation or reection. We show that an n + k dragon kings solution exists whenever n > k + 5 and that, given some extra conditions, symmetric solutions exist for n > 2k + 5.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121118180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Throughout history, recreational mathematics has always played a prominent role in advancing research. Following in this tradition, in this paper we extend some recent work with crazy sequential representations of numbers− equations made of sequences of one through nine (or nine through one) that evaluate to a number. All previous work on this type of puzzle has focused only on base ten numbers and whether a solution existed. We generalize this concept and examine how this extends to arbitrary bases, the ranges of possible numbers, the combinatorial challenge of finding the numbers, efficient algorithms, and some interesting patterns across any base. For the analysis, we focus on bases three through ten. Further, we outline several interesting mathematical and algorithmic complexity problems related to this area that have yet to be considered.
{"title":"Crazy Sequential Representations of Numbers for Small Bases","authors":"Tim Wylie","doi":"10.2478/rmm-2019-0007","DOIUrl":"https://doi.org/10.2478/rmm-2019-0007","url":null,"abstract":"Abstract Throughout history, recreational mathematics has always played a prominent role in advancing research. Following in this tradition, in this paper we extend some recent work with crazy sequential representations of numbers− equations made of sequences of one through nine (or nine through one) that evaluate to a number. All previous work on this type of puzzle has focused only on base ten numbers and whether a solution existed. We generalize this concept and examine how this extends to arbitrary bases, the ranges of possible numbers, the combinatorial challenge of finding the numbers, efficient algorithms, and some interesting patterns across any base. For the analysis, we focus on bases three through ten. Further, we outline several interesting mathematical and algorithmic complexity problems related to this area that have yet to be considered.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127460144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：