Related papers: Upside Down Numerical Equation, Bimagic Squares, a…

Based on the rules of magic cubes, a game of two-dimensional magic cube was deliberately designed. This essay will explore its properties with the assistance of group theory and computer programming. It will first elaborate the rules of…

A construction of the magic square, and hence of exceptional Lie algebras, is carried out using trialities rather than division algebras. By way of preparation, a comprehensive discussion of trialities is given, incorporating a number of…

We propose a numerical method to solve the three-dimensional static Maxwell equations in a singular axisymmetric domain, generated by the rotation of a singular polygon around one of its sides. The mathematical tools and an in-depth study…

This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…

Inversive meadows are commutative rings with a multiplicative identity element and a total multiplicative inverse operation whose value at 0 is 0. Divisive meadows are inversive meadows with the multiplicative inverse operation replaced by…

We adress the problem of the reasons for the existence of 12 symmetric spaces with the exceptional Lie groups. The 1+2 cases for $G_2$ and $F_4$ respectively are easily explained from the octonionic nature of these groups. The 4+3+2 cases…

In this paper; we prove that all sequences can be broken up in cycles. Each cycle follows the same pattern: 1) Upward trajectory. Odd and even numbers alternate until the cycle reaches an upper bound 2) Downward trajectory. Two or more…

We propose a neural network-based approach to calculate the value of a chess square-piece combination. Our model takes a triplet (Color, Piece, Square) as an input and calculates a value that measures the advantage/disadvantage of having…

For any $d \geq 2$, we prove that there exists an integer $n_0(d)$ such that there exists an $n \times n$ magic square of $d^\text{th}$ powers for all $n \geq n_0(d)$. In particular, we establish the existence of an $n \times n$ magic…

We study properties of an array of numbers, called "the triangle," in which each row is formed by rotating all the numbers in the previous row to the left by $m$ positions in cyclical fashion, then appending a number to the end of the row.…

Here, we present a variant of the sliding coins game. Two coins are placed on distinct squares of a semi-infinite linear board with squares numbered $0, 1, 2, dots, $. Two players take turns and move a coin to a lower unoccupied square.…

This article contains the last part of the mini-course `Spaces: a perspective view' delivered at the IFWGP2012. Here I deal with the part of the mini-course which centers on the classification questions associated to the simple real Lie…

So-called "twisted" black holes have recently been proposed by Zhang (1609.09721 [gr-qc]), and further considered by Chen and Jing (1610.00886 [gr-qc]), and more recently by Ong (1610.05757 [gr-qc]). While these spacetimes are certainly…

A brief history and two formulations of the Diophantine problem's requirements are presented. One tier consisting of three two-parameter solutions is studied for its ability to provide examples for the small natural numbers considered.…

A knight's tour on a board is a sequence of knight moves that visits each square exactly once. A knight's tour on a square board is called magic knight's tour if the sum of the numbers in each row and column is the same (magic constant).…

We defined numbers of the form $p\cdot a^2$ as SP numbers (Square-Prime numbers) ($a\neq1$, $p$ prime) in 'Distribution of Square-Prime Numbers' (arXiv:2109.10238). These numbers are listed in the OEIS as A228056. Some examples of SP…

We consider new types of perfect shuffles wherein a deck is split in half, one half of the deck is "reversed", and then the cards are interlaced. Flip shuffles are when the reversal comes from flipping the half over so that we also need to…

We discuss both simple and more subtle connections between the numbers of permutations and full cycles with some restrictions,in particular, between the numbers of permutations and full cycles with prescribed up-down structure.

An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves the square root of an elliptic operator of second order. Finite element approximation in space is employed.…

We propose a simple algorithm for generating Binary Magic Squares (BMS), i.e., square binary matrices where the sum of all rows and all columns are equal. We show by induction that our algorithm always returns valid BMS with optimal…