Related papers: Squares with three digits
The question of which triangular numbers have a decimal representation containing a single repeated digit seamed to be settled since at least the 1970s: Ballew and Weger provided a complete list and a proof that these are the only numbers…
We determine all integers $n$ such that $n^2$ has at most three base-$q$ digits for $q \in \{2, 3, 4, 5, 8, 16 \}$. More generally, we show that all solutions to equations of the shape $$ Y^2 = t^2 + M \cdot q^m + N \cdot q^n, $$ where $q$…
In this article, we study a sum of squares of integers except for a fixed one. For any nonnegative integer $n$, we find the minimum number of squares of integers except for $n$ whose sums represent all positive integers that are represented…
It is unknown at present whether a magic square of squared integers exists. Such an object is defined to be a 3 by 3 grid of 9 distinct integer squares, such that the entries of each row, column, and two main diagonals sum to the same…
In this paper, we study universal sums of triangular numbers and squares. Specifically, we prove that a sum of triangular numbers and squares is universal if and only if it represents…
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…
We re-examine previous constructions of infinite binary words containing few distinct squares with the goal of finding the "simplest", in a certain sense. We exhibit several new constructions. Rather than using tedious case-based arguments…
We show that almost every positive integer can be expressed as a sum of four squares of integers represented as the sums of three positive cubes.
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…
This paper is concerned with the problem of expressing three consecutive integers as sums of three cubes. We give several parametric solutions of the problem. We also give somewhat trivial solutions of five or seven consecutive integers…
We say a positive integer is a sum of three nonunit squares if it is a sum of three squares of integers other than one. In this article, we find all integers which are sums of three nonunit squares assuming that the Generalized Riemann…
In this short note we have produced for the first time in the history different kinds of universal bimagic squares. This we have made using only the digits 0,1 and 2. The universal bimagic squares of order 8x8 and 16x16 are with the digits…
In this short note we have produced different kinds of bimagic squares using only the digits 0, 1, 2, 5 and 8. The universal bimagic squares presented are of order 8x8, 9x9, 16x16 and 25x25. In order to bring universal bimagic square of…
In this short note we have produced different kind of magic squares using digital letter having only the algorisms: 0, 1, 2, 5, and 8. The interesting fact in considering these five digits is that the day 8th May 2010 also have these ones…
For any integer $x$, let $T_x$ denote the triangular number $\frac{x(x+1)}{2}$. In this paper we give a complete characterization of all the triples of positive integers $(\alpha, \beta, \gamma)$ for which the ternary sums $\alpha x^2…
We define a magic square to be a square matrix whose entries are nonnegative integers and whose rows, columns, and main diagonals sum up to the same number. We prove structural results for the number of such squares as a function of the…
We generalise our earlier work on the number of squares in binary recurrence sequences, $\left\{ y_{k} \right\}_{k \geq -\infty}$. In the notation of our previous papers, here we consider the case when $N_{\alpha}$ is any negative integer…
We have computed a table of the triangle sides of all congruent numbers less than 10,000, which improves and extends the existing public table. We give some background on properties of the triangle sides, and explain how we computed our…
Let $X_1,X_2,...$ be the digits in the base-$q$ expansion of a random variable $X$ defined on $[0,1)$ where $q\ge2$ is an integer. For $n=1,2,...$, we study the probability distribution $P_n$ of the (scaled) remainder…
In this work, we established symmetric representation of numbers where one can use any of 9 digits giving the same number. The representations of natural numbers from 0 to 1000 are given using only single digit in all the nine cases, i.e.,…