<abstract xmlns="http://www.w3.org/1999/xhtml">

The Wallace-Bolyai-Gerwien theorem states any polygon can be decomposed into a finite number of polygonal pieces that can be translated and rotated to form any polygon of equal area. The theorem was proved in the early 19th century. The minimum number of pieces necessary to form these common dissections remains an open question. In 1905, Henry Dudney demonstrated a four-piece common dissection between a square and equilateral triangle. We investigate the possible existence of a three-piece common dissection. Specifically, we prove that there does not exist a three-piece common dissection using only convex polygons.
</abstract>

Economical Dissections

<abstract xmlns="http://www.w3.org/1999/xhtml">

We study a very simple 2-player board game called Dodgem, curiously the game is difficult to analyze when the number of tokens is not the same for the two players. We provide theoretical and experimental elements which indicate which player benefits from the asymmetry of the game.
</abstract>

How Unfair is the Unfair Dodgem?

<abstract xmlns="http://www.w3.org/1999/xhtml">

Do you want to know what an anti-chiece Latin square is? Or what a non-consecutive toroidal modular Latin square is? We invented a ton of new types of Latin squares, some inspired by existing Sudoku variations. We can’t wait to introduce them to you and answer important questions, such as: do they even exist? If so, under what conditions? What are some of their interesting properties? And how do we generate them?
</abstract>

Fun with Latin Squares

<abstract xmlns="http://www.w3.org/1999/xhtml">

Before a game begins, the players need to decide the order of play. This order of play is determined by each player rolling a die. Does there exist a set of dice such that draws are excluded and each order of play is equally likely? For four players the solution involves four 12-sided dice, sold commercially as Go First Dice. However, the solution for five players remained an open question. We present two solutions. The first solution has a particular mathematical structure known as binary dice, and results in a set of five 60-sided dice, where every place is equally likely. The second solution is an inductive construction that results in one one 36-sided die; two 48-sided dice; one 54-sided die; and one 20-sided die, where each permutation is equally likely.
</abstract>

Go First Dice for Five Players and Beyond.

<abstract xmlns="http://www.w3.org/1999/xhtml">

In this paper we present several binary clocks. Using different geometric figures, we show how one can devise various novel ways of displaying time. We accompany each design with the mathematical background necessary to understand why these designs work.
</abstract>

How to Read a Clock

AHEAD OF PRINT

Volume 11 (2024): Issue 18 (March 2024)

Volume 10 (2023): Issue 17 (January 2023)

Volume 9 (2022): Issue 16 (June 2022)

Volume 8 (2021): Issue 15 (November 2021)

Volume 8 (2021): Issue 14 (October 2021)

Volume 7 (2020): Issue 13 (November 2020)

Volume 6 (2019): Issue 12 (December 2019)

Volume 6 (2019): Issue 11 (September 2019)

Volume 5 (2018): Issue 10 (December 2018)

Volume 5 (2018): Issue 9 (September 2018)

Volume 4 (2017): Issue 8 (December 2017)

Volume 4 (2017): Issue 7 (May 2017)

Volume 3 (2016): Issue 6 (December 2016)

Volume 3 (2016): Issue 5 (March 2016)

Recreational Mathematics Magazine

The Recreational Mathematics Magazine is published by the Ludus Association with the support of the　Interuniversity Centre for the History of Science and Technology. The journal is electronic and semiannual, and focuses on results that provide amusing, witty but nonetheless original and scientifically profound mathematical nuggets. The issues are published in the exact moments of the equinox. It's a magazine for mathematicians, and other mathematics lovers, who enjoy imaginative ideas, non-standard approaches, and surprising procedures. Occasionally, some papers that do not require any mathematical background will be published.  Examples of topics to be adressed include: games and puzzles, problems, mathmagic, mathematics and arts, math and fun with algorithms, reviews and news.  Recreational mathematics focuses on insight, imagination and beauty. Historically, we know that some areas of mathematics are strongly linked to recreational mathematics - probability, graph theory, number theory, etc. Thus, recreational mathematics can also be very serious. Many professional mathematicians confessed that their love for math was gained when reading the articles by Martin Gardner in Scientific American.  While there are conferences related to the subject as the amazing Gathering for Gardner, and high-quality magazines that accept recreational papers as the American Mathematical Monthly, the number of initiatives related to this important subject is not large.  This context led us to launch this magazine. We will seek to provide a quality publication. We shall endeavor to be read with pleasure. In mathematics, the most important are the underlying ideas and nothing is as exciting as an amazing idea. So, we seek sophistication, imagination and awe.  Rejection Rate   50%   Recreational Mathematics Magazine is a journal for mathematicians who enjoy imaginative ideas, non-standard approaches, and surprising procedures. The journal addresses such topics as: games and puzzles, problems, mathmagic, mathematics and arts, math and fun with algorithms.  Archiving  Sciendo archives the contents of this journal in Portico - digital long-term preservation service of scholarly books, journals and collections.  Plagiarism Policy  The editorial board is participating in a growing community of Similarity Check System's users in order to ensure that the content published is original and trustworthy. Similarity Check is a medium that allows for comprehensive manuscripts screening, aimed to eliminate plagiarism and provide a high standard and quality peer-review process.  Target group:   researchers in the fields of games and puzzles, problems, mathmagic, mathematics and arts, math and fun with algorithms  Financed by Fundação para a Ciência e a Tecnologia, I.P./MCTES through national funds (PIDDAC) – PTDC/HAR-HIS/28627/2017, UIDB/00286/2020 and UIDB/00678/2020. 