Related papers: Single Digit Representations of Natural Numbers

We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…

This work presents a formalization of analogy on numbers that relies on generalized means. It is motivated by recent advances in artificial intelligence and applications of machine learning, where the notion of analogy is used to infer…

We create a simple test for distinguishing between sets of primes and random numbers using just the sum-of-digits function. We find that the sum-of-the-digits of prime numbers does not have an equal probability of being odd or even. The…

The calculation of many and large Perrin pseudoprimes is a challenge. This is mainly due to their rarity. Perrin pseudoprimes are one of the rarest known pseudoprimes. In order to calculate many such large numbers, one needs not only a fast…

We consider a set of equations of the form $p_j (x,y) = (10 x+m_j)(10 y + n_j),\,\,x\geq 0, y\geq0$, $j=1,2,3$, such that $\{m_1=7, n_1=3\}$, $\{m_2=n_2=9\}$ and $\{m_3=n_3=1\}$, respectively. It is shown that if $(a(p_j),b(p_j)) \in N…

In this expository note, we introduce the reader to compositions of a natural number, e.g., $2+1+2+1+7+1$ is a composition of 14, and $1+2$ and $2+1$ are two different compositions of 3. We discuss some simple restricted forms of…

We say a natural number $n$ is matchable if there is a bijection from the set of $\tau(n)$ divisors of $n$ to the set $\{1,2,\dots,\tau(n)\}$, where corresponding numbers are relatively prime. We show that the set of matchable numbers has…

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

The following work is written in easy language for college level students. It shows how the first digit probabilities of a group of continuous real-valued functions can be calculated. Thus, examples explaining how the probabilities are…

The natural numbers divisible by the Prime Factors 2, 3, 5, 11, 13 and 17 lie on defined spiral graphs, which run through the Square Root Spiral. A mathematical analysis shows, that these spiral graphs are defined by specific quadratic…

Let $b \geq 3$ be a positive integer. A natural number is said to be a base-$b$ Zuckerman number if it is divisible by the product of its base-$b$ digits. Let $\mathcal{Z}_b(x)$ be the set of base-$b$ Zuckerman numbers that do not exceed…

We show the existence of several infinite monochromatic patterns in the integers obtained as values of suitable symmetric polynomials. The simplest example is the following. For every finite coloring of the natural numbers…

We study two positional numeration systems which are known for allowing very efficient addition and multiplication of complex numbers. The first one uses the base $\beta = \imath - 1$ and the digit set $\mathcal{D} = \{ 0, \pm 1, \pm \imath…

A natural number $n$ is called a repdigit if all its digits are same. In this paper, we prove that Euler totient function of no Pell number is a repdigit with at least two digits. This study is also extended to certain subclass of…

The aim of this note is to show that any even perfect number, other than $6$, can be written as the sum of 5 cubes of natural numbers. We also conjecture that any even perfect number, other than $6$, can be written as the sum of only 3…

Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a…

The study of decimal numbers in secondary education is often approached from algorithmic perspectives, which limits students' understanding of their structure. This paper presents the task Footprints of the Walking of Numbers, a dynamic…

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…

For $\alpha>1$ we represent a real number in $(0,1]$ in the form \[ \sum_{i=1}^{\infty}(\alpha-1)^{i-1}\alpha^{-(d_{1}+\dots+d_{i})}\] with $d_{i}\in\mathbb{N}$. We discuss ergodic theoretical and dimension theoretical aspects of this…

Which integers can be written as a quotient of sums of distinct powers of three? We outline our first steps toward an answer to this question, beginning with a necessary and almost sufficient condition. Then we discuss an algorithm that…