Related papers: Patterned Numbers: A Novel Number Classification w…
Research on the distribution of prime numbers has revealed a dual character: deterministic in definition yet exhibiting statistical behavior reminiscent of random processes. In this paper we show that it is possible to use an image-focused…
This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…
A positive integer $n$ is practical if every $m \leq n$ can be written as a sum of distinct divisors of $n$. One can generalize the concept of practical numbers by applying an arithmetic function $f$ to each of the divisors of $n$ and…
This article presents a modern deterministic framework for the study of leading significant digit distributions in numerical data. Rather than relying on traditional probabilistic or mixture-based explanations, we demonstrate that the…
Let $A$ be a set of positive integers. We define a positive integer $n$ as an $A$-practical number if every positive integer from the set $\left\{1,\ldots ,\sum_{d\in A, d\mid n}d\right\}$ can be written as a sum of distinct divisors of $n$…
Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…
We define reflective numbers and their iterative summations. We provide classification of reflective numbers based on their iterative cyclical limits.
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…
A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…
The number of inversions is a statistic on permutation groups measuring the degree to which the entries of a permutation are out of order. We provide a generalization of that statistic by introducing the statistic number of pseudoinversions…
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of…
In this expository article, the real numbers are defined as infinite decimals. After defining an ordering relation and the arithmetic operations, it is shown that the set of real numbers is a complete ordered field. It is further shown that…
We investigate the distribution of the digits of quotients of randomly chosen positive integers taken from the interval $[1,T]$, improving the previously known error term for the counting function as $T\to+\infty$. We also resolve some…
In this paper, first, I introduce two-layered numbers. Two-layered numbers are positive integers that their positive divisors except 1 can be partitioned into two disjoint subsets. Similarly, I defined a half-layered number as a positive…
The use of patterns in predictive models is a topic that has received a lot of attention in recent years. Pattern mining can help to obtain models for structured domains, such as graphs and sequences, and has been proposed as a means to…
Number systems with a rational number $a/b > 1$ as base have gained interest in recent years. In particular, relations to Mahler's 3/2-problem as well as the Josephus problem have been established. In the present paper we show that the…
Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…
Let $g \geq 2$. A real number is said to be g-normal if its base g expansion contains every finite sequence of digits with the expected limiting frequency. Let \phi denote Euler's totient function, let \sigma be the sum-of-divisors…
The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…
Bounds on the entropy of patterns of sequences generated by independently identically distributed (i.i.d.) sources are derived. A pattern is a sequence of indices that contains all consecutive integer indices in increasing order of first…