Related papers: Trigonometry of The Gold-Bug
Peg solitaire is an old puzzle with a 300 year history. We consider two ways a computer can be utilized to find interesting peg solitaire puzzles. It is common for a peg solitaire puzzle to begin from a symmetric board position, we have…
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…
The incircle of a triangle touches the sides of the triangle in three points. It is well known that the lines from these points to the opposite vertices meet at a point known as the Gergonne point of the triangle. We use a computer to…
An almost forgotten gem of Gauss tells us how to compute the area of a pentagon by just going around it and measuring areas of each vertex triangles (i.e. triangles whose vertices are three consecutive vertices of the pentagon). We give…
This is a hands on introduction to McMullen's Polytope Algebra. More than interesting on its own, this algebra was McMullen's tool to give a combinatorial proof of the g-theorem.
Trisecting an angle has been proved to be impossible by Euclidean Geometry, using only straight edge and compass. However, there is a method using Origami (paper folding) procedure to trisect an angle. The algebraic analysis of the same…
Treasure hunt is the task of finding an inert target by a mobile agent in an unknown environment. We consider treasure hunt in geometric terrains with obstacles. Both the terrain and the obstacles are modeled as polygons and both the agent…
We consider Flipping Coins, a partizan version of the impartial game Turning Turtles, played on lines of coins. We show the values of this game are numbers, and these are found by first applying a reduction, then decomposing the position…
We give a short combinatorial proof of the classical pointwise ergodic theorem for probability measure preserving $\mathbb{Z}$-actions. Our approach reduces the theorem to a tiling problem: tightly tile each orbit by intervals with desired…
Consider the puzzle: given a number, remove $k$ digits such that the resulting number is as large as possible. Various techniques were employed to derive a linear-time solution to the puzzle: predicate logic was used to justify the…
A construction similar to Hagge's construction for circles through the orthocentre is shown to apply for any point.
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…
The Hodge conjecture is a major open problem in complex algebraic geometry. In this survey, we discuss the main cases where the conjecture is known, and also explain an approach by Griffiths-Green to solve the problem.
Twisting by a G-torsor an object endowed with an action of a group G is a classical tool. For instance one finds in the paragraph 5.3 of the book "cohomologie galoisienne" by Serre, the description of the "op\'eration de torsion" in a…
We develop a systematic method for computing the angle combinations at all vertices in an edge-to-edge tiling of the sphere by pentagons with the same five angles. The method is a useful and necessary step in many tiling problems about…
When searching for a planar line, if given no further information, one should adopt a logarithmic spiral strategy (although unproven).
We use the methods of empirical mathematics to show that iterative logarithmic operations will result in an attractor point on the complex plane. Moreover, we demonstrate that different bases converge onto different attractors. Finally, we…
We show that the Minesweeper game is PP-hard, when the object is to locate all mines with the highest probability. When the probability of locating all mines may be infinitesimal, the Minesweeper game is even PSPACE-complete. In our…
In this paper I investigate the problem of tagging elements of a set, and the elements of those elements, uniquely, when they admit an order, and two boundary elements are tagged. A heuristic sorting algorithm is also investigated. (Updated…
This book is addressed to students, professors and researchers of geometry, who will find herein many interesting and original results. The originality of the book The Geometry of Homological Triangles consists in using the homology of…