Related papers: Parasitic Numbers at Arbitrary Base
A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…
In this work we present a natural generalization of strong pseudoprime to base $b$, which we have called $q$-pseudoprime to base $b$. It allows us to present another way to define a Midy's number to base $b$ (overpseudoprime to base $b$).…
A real number \alpha is called recursively enumerable if there exists a computable, increasing sequence of rational numbers which converges to \alpha. The randomness of a recursively enumerable real \alpha can be characterized in various…
A Generalized Numeration Base is defined in this paper, and then particular cases are presented, such as Prime Base, Square Base, m-Power Base, Factorial Base, and operations in these bases. These bases are important for partitions of…
When an infectious disease strikes a population, the number of newly reported cases is often the only available information that one can obtain during early stages of the outbreak. An important goal of early outbreak analysis is to obtain a…
In this paper we present four necessary and sufficient conditions for a natural number to be prime.
A host-parasite model is considered for a population of cells that can be of two types, A or B, and exhibits unilateral reproduction: while a B-cell always splits into two cells of the same type, the two daughter cells of an A-cell can be…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
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…
In DOI:10.1017/etds.2022.2 the author proved that for each integer $k$ there is an implicit number $M > 0$ such that if $b_1, \cdots , b_k$ are multiplicatively independent integers greater than $M$, there are infinitely many integers whose…
We consider a branching model for a population of dividing cells infected by parasites. Each cell receives parasites by inheritance from its mother cell and independent contamination from outside the population. Parasites multiply randomly…
Analysing statistical properties of the normal forms of random braids, we observe that, except for an initial and a final region whose lengths are uniformly bounded (that is, the bound is independent of the length of the braid), the…
The random map model is a deterministic dynamical system in a finite phase space with n points. The map that establishes the dynamics of the system is constructed by randomly choosing, for every point, another one as being its image. We…
For integer $g\ge 5$, we prove that any positive integer can be written as a sum of three palindromes in base $g$.
Two permutations of the natural numbers diverge if the absolute value of the difference of their elements in the same position goes to infinity. We show that there exists an infinite number of pairwise divergent permutations of the…
We show that for a Salem number $\beta$ of degree $d$, there exists a positive constant $c(d)$ that $\beta^m$ is a Parry number for integers $m$ of natural density $\ge c(d)$. Further, we show $c(6)>1/2$ and discuss a relation to the…
We study the distribution of palindromic numbers (with respect to a fixed base $g\ge 2$) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes $n\le x$ as $x\to\infty$. Our results show…
The natural matroid of an integer polymatroid was introduced to show that a simple construction of integer polymatroids from matroids yields all integer polymatroids. As we illustrate, the natural matroid can shed much more light on integer…
An integral basis of the simplest number fields of degree 3,4 and 6 over $\mathbb{Q}$ are well-known, and widely investigated. We generalize the simplest number fields to any degree, and show that an integral basis of these fields is…
Recently the authors showed that the algebraic integers of the form $-m+\zeta_k$ are bases of a canonical number system of $\mathbb{Z}[\zeta_k]$ provided $m\geq \phi(k)+1$, where $\zeta_k$ denotes a $k$-th primitive root of unity and $\phi$…