SearcharxivSearch

arXiv · 1106.0953

Periodical plane puzzles with numbers

Abstract

Consider a periodical (in two independent directions) tiling of the plane with polygons (faces). In this article we shall only give examples using squares, regular hexagons, equilateral triangles and parallelograms ("unions" of two equilateral triangles). We shall call some "multiple" of the fundamental region "the board". We naturally identify pairs of corresponding edges of the the board. Figures 9 and 19-29, in this article, show different boards. The "border" of the board is represented by a yellow thick line, unless part of it or all of it is the edge of a face. The board is tiled by a finite number of polygons. Construct polygonal plates in the same number, shape and size as the polygons of the board. Adjacent to each side of each plate draw a number, or two numbers, like it is shown in Figures 1 and 18-29. Figure 1 shows the obvious possibility of having plates with simple drawings, coloured drawings, etc. Now the game is to put the plates over the board polygons in such a way that the numbers near each board edge are equal. If there is at least one solution of this puzzle one says that we have a periodical plane puzzle with numbers. These puzzles are a tool in teaching and learning mathematics. For those that already have some mathematical knowledge, they are a source for many examples and exercises, that go from the elementary to complex ones, in combinatorics, group theory (including symmetry and permutation groups), programming, and so on. The object of this work is to point out some possibilities by giving simple examples. The computer is the only practical way of "materializing" infinite periodical plane puzzles. Hence, these puzzles can be very well put into practice as computer games. This article follows some others on puzzles with numbers.

Explore related subjects

Keep this discovery

BibTeXRIS

Jorge Rezende. 2011-06-06. Periodical plane puzzles with numbers. https://arxiv.org/abs/1106.0953

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO