Related papers: DIGITAL ERA: Universal Bimagic Squares
We study 4-by-4 squares formed by cards from the EvenQuads deck. EvenQuads is a card game with 64 cards where cards have 3 attributes with 4 values in each attribute. A quad is four cards with all attributes the same, all different, or half…
We give a variety of magic hexagons of Orders from 3 to 7, many of which are extensions of known results. We also give a theorem that their are an infinite number of magic hexagons of Order $n$ for any fixed positive integer $n$ for any…
A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…
The problem of the construction of magic squares occupied many mathematicians of the 17th century. The Polish Jesuit and polymath Adam Adamandy Kocha\'nski studied this subject too, and in 1686 he published a paper in Acta Eruditorum titled…
An abelian square is a string of length 2n where the last n symbols form a permutation of the first n symbols. In this note we count the number of abelian squares and give an asymptotic estimate of this quantity.
We present systematic methods of constructing pandiagonal sudoku squares of order k*k and Knut Vik sudoku squares of order k*k not divisible by 2 or 3. Pandiagonal magic squares are constructed from these squares. Examples of all these…
By using two different invariants for the Rubik's Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually…
We find the numbers of $3 \times 3$ magic, semimagic, and magilatin squares, as functions either of the magic sum or of an upper bound on the entries in the square. Our results on magic and semimagic squares differ from previous ones in…
We demonstrate the existence of $K$-multimagic squares of order $N$ consisting of distinct integers whenever $N>2 K(K+1)$. This improves upon our earlier result in which we only required $N+1$ distinct integers. Additionally, we present a…
A \emph{magic square} is an $n \times n$ array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for $n=4$, as a function of either the magic sum or an…
In this paper, new schemes for a squarer, multiplier and divider of complex numbers are proposed. Traditional structural solutions for each of these operations require the presence some number of general-purpose binary multipliers. The…
For any fixed positive integer $n$, we provide a method to compute all imaginary bicyclic biquadratic number fields with class number $n$, along with their class group structures, using the list of all imaginary quadratic number fields…
Let $\Gamma$ be a group of order $n^2$ and $SMS_{\Gamma}(n)=(a_{i,j})_{n\times n}$ be an $n\times n$ array whose entries are all distinct elements of $\Gamma$. If there exists an element $\mu\in\Gamma$ such that for every row $i$, there…
We report recent progress in the problem of distinguishing convex subsets of cyclotomic model sets $\varLambda$ by (discrete parallel) X-rays in prescribed $\varLambda$-directions. It turns out that for any of these model sets $\varLambda$…
A new idea for a binary clock is presented. It displays the time using a triangular array of 15 bits. It is shown that such a geometric, triangular arrangement is only possible because our system of time divisions is based on a sexagesimal…
Permutation matrices play an important role in understand the structure of magic squares. In this work, we use a class of symmetric permutation matrices than can be used to categorize magic squares. Many magic squares with a high degree of…
A curious number is a palindromic number whose base ten representation has the form $a \ldots a b \ldots b a \ldots a$. In this paper, we determine all curious numbers that are perfect squares. Our proof involves reducing the search for…
In this article, we reveal how Benjamin Franklin constructed his second $8 \times 8$ magic square. We also construct two new $8 \times 8$ Franklin squares.
Using the methods developed for the proof that the 2-universality criterion is unique, we partially characterize criteria for the n-universality of positive-definite integer-matrix quadratic forms. We then obtain the uniqueness of Oh's…
An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the…