Related papers: DIGITAL ERA: Universal Bimagic Squares
Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…
A proof that there is no $3 \times 3$ magic square constructed with nine distinct square numbers is given.
We show arithmetic triplets of Gaussian squares are in 3-to-1 correspondence with Pythagorean triples thereof. This correspondence would transform a solution to the Magic Square of Squares puzzle into a larger structure of perfect Gaussian…
Given a negative $D>-(\log X)^{\log 2-\delta}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of…
Magic-square constraints define Diophantine systems whose solutions, in several natural families, exhibit rigid periodic structure. We study this structure in an oracle setting, where a marked set of integers is given by black-box access…
A cryptarithm (or alphametic) is a mathematical puzzle in which numbers are represented with words in such a way that identical letters stand for equal digits and distinct letters for unequal digits. An alphametic puzzle is usually given in…
Let P and Q be non-zero integers. The Lucas sequence U_n(P,Q) is defined by U_0=0, U_1=1, U_n= P*U_{n-1}-Q*U_{n-2} for n >1. The question of when U_n(P,Q) can be a perfect square has generated interest in the literature. We show that for…
Over the last decade, Sudoku, a combinatorial number-placement puzzle, has become a favorite pastimes of many all around the world. In this puzzle, the task is to complete a partially filled $9 \times 9$ square with numbers 1 through 9,…
Pandigital and penholodigital numbers are numbers that contain every digit or nonzero digit respectively. We study properties of pandigital or penholodigital numbers that are also square, oblong or prime.
In this article, we propose a new counter-based implementation of John von Neumann's middle-square random number generator (RNG). Several rounds of squaring are applied to a counter to produce a random output. We discovered that four rounds…
By utilizing a new procedure (the RADIO method) for deriving on-shell 2D, 2N-extended multiplets from off-shell 2D, N-extended multiplets, we derive a new on-shell 2D, N = 8 representation; the ultra-multiplet. By twisting with respect to…
In the making of origami, one starts with a piece of paper, and through a series of folds along seed points one constructs complicated three-dimensional shapes. Mathematically, one can think of the complex numbers as representing the piece…
A packing $k$-coloring is a natural variation on the standard notion of graph $k$-coloring, where vertices are assigned numbers from $\{1, \ldots, k\}$, and any two vertices assigned a common color $c \in \{1, \ldots, k\}$ need to be at a…
We present a generic digit serial method (DSM) to compute the digits of a real number $V$ . Bounds on these digits, and on the errors in the associated estimates of $V$ formed from these digits, are derived. To illustrate our results, we…
The lower bound for the chromatic number of the Euclidean space of dimension 8 is increased to 25.
The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…
In this paper, we introduce a method of constructing Universal Cycles on sets by taking "sums" and "products" of smaller cycles. We demonstrate this new approach by proving that if there exist Universal Cycles on the 4-subsets of [18] and…
Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the…
Lifting problem for universal quadratic forms asks for totally real number fields $K$ that admit a positive definite quadratic form with coefficients in $\mathbb{Z}$ that is universal over the ring of integers of $K$. In this paper, we show…
Although the quality of quantum bits (qubits) and quantum gates has been steadily improving, the available quantity of qubits has increased quite slowly. To address this important issue in quantum computing, we have demonstrated arbitrary…