Ediciones

Revista y Edición

Volumen 10 (2023): Edición 17 (January 2023)

Volumen 9 (2022): Edición 16 (June 2022)

Volumen 8 (2021): Edición 15 (November 2021)

Volumen 8 (2021): Edición 14 (October 2021)

Volumen 7 (2020): Edición 13 (November 2020)

Volumen 6 (2019): Edición 12 (December 2019)

Volumen 6 (2019): Edición 11 (September 2019)

Volumen 5 (2018): Edición 10 (December 2018)

Volumen 5 (2018): Edición 9 (September 2018)

Volumen 4 (2017): Edición 8 (December 2017)

Volumen 4 (2017): Edición 7 (May 2017)

Volumen 3 (2016): Edición 6 (December 2016)

Volumen 3 (2016): Edición 5 (March 2016)

Detalles de la revista
Formato
Revista
eISSN
2182-1976
Publicado por primera vez
16 Apr 2016
Periodo de publicación
2 veces al año
Idiomas
Inglés

Buscar

Volumen 10 (2023): Edición 17 (January 2023)

Detalles de la revista
Formato
Revista
eISSN
2182-1976
Publicado por primera vez
16 Apr 2016
Periodo de publicación
2 veces al año
Idiomas
Inglés

Buscar

0 Artículos
Acceso abierto

Economical Dissections

Publicado en línea: 27 Jan 2023
Páginas: 1 - 39

Resumen

Abstract

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.

Acceso abierto

How Unfair is the Unfair Dodgem?

Publicado en línea: 27 Jan 2023
Páginas: 41 - 50

Resumen

Abstract

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.

Acceso abierto

Fun with Latin Squares

Publicado en línea: 27 Jan 2023
Páginas: 51 - 74

Resumen

Abstract

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?

Acceso abierto

Go First Dice for Five Players and Beyond.

Publicado en línea: 27 Jan 2023
Páginas: 75 - 87

Resumen

Abstract

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.

Acceso abierto

How to Read a Clock

Publicado en línea: 27 Jan 2023
Páginas: 89 - 96

Resumen

Abstract

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.

0 Artículos
Acceso abierto

Economical Dissections

Publicado en línea: 27 Jan 2023
Páginas: 1 - 39

Resumen

Abstract

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.

Acceso abierto

How Unfair is the Unfair Dodgem?

Publicado en línea: 27 Jan 2023
Páginas: 41 - 50

Resumen

Abstract

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.

Acceso abierto

Fun with Latin Squares

Publicado en línea: 27 Jan 2023
Páginas: 51 - 74

Resumen

Abstract

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?

Acceso abierto

Go First Dice for Five Players and Beyond.

Publicado en línea: 27 Jan 2023
Páginas: 75 - 87

Resumen

Abstract

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.

Acceso abierto

How to Read a Clock

Publicado en línea: 27 Jan 2023
Páginas: 89 - 96

Resumen

Abstract

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.