Related papers: Repdigits as difference of two balancing or Lucas-…
In this article some difficulties are deduced from the set of natural numbers. By using the method of transfinite recursion we define an iterative process which is designed to deduct all the non-greatest elements of the set of natural…
We study the combinatorics of addition using balanced digits, deriving an analog of Holte's "amazing matrix" for carries in usual addition. The eigenvalues of this matrix for base b balanced addition of n numbers are found to be…
In the present paper we explore a way to represent numbers with respect to the base $-\frac32$ using the set of digits $\{0,1,2\}$. Although this number system shares several properties with the classical decimal system, it shows remarkable…
\noindent In this article, we determine all the integers $c$ having at least two representations as difference between two linear recurrent sequences. This is a variant of the Pillai's equation. This equation is an exponential Diophantine…
For scientific computations on a digital computer the set of real number is usually approximated by a finite set F of "floating-point" numbers. We compare the numerical accuracy possible with difference choices of F having approximately the…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
Many mathematical, man-made and natural systems exhibit a leading-digit bias, where a first digit (base 10) of 1 occurs not 11\% of the time, as one would expect if all digits were equally likely, but rather 30\%. This phenomenon is known…
We introduce the continued logarithm representation of real numbers and prove results on the occurrence and frequency of digits with respect to this representation
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
In this paper we deal with a classical problem in elementary number theory, namely repeating decimals. We show how the digits of the period of the decimal representation of any fraction $\frac{k}{m}$, where $k$ and $m$ are positive integers…
We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$. We give…
Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…
Deterministic two-way transducers with pebbles (aka pebble transducers) capture the class of polyregular functions, which extend the string-to-string regular functions allowing polynomial growth instead of linear growth. One of the most…
We show how Benford's Law (BL) for first, second, ..., digits, emerges from the distribution of digits of numbers of the type $a^{R}$, with $a$ any real positive number and $R$ a set of real numbers uniformly distributed in an interval $[…
In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence…
Champernowne famously proved that the number $0.(1)(2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12)...$ formed by concatenating all the integers one after another is normal base 10. We give a generalization of Champernowne's construction to various…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
The Richardson-Lucy unfolding approach is simple and excellently performing. It efficiently suppresses artificial high frequency contributions and permits to introduce known features of the true distribution. An algorithm to fix the number…
In this paper, new families of generalized Fibonacci and Lucas numbers are introduced. In addition, we present the recurrence relations and the generating functions of the new families for $k=2$.
In this paper, we study the representation of pi as sum of arcotangents. In particular, we obtain new identities by using linear recurrent sequences. Moreover, we provide a method in order to express pi as sum of arcotangents involving the…