Related papers: The structure of base phi expansions

We show that for any fixed base $a$, a positive proportion of primes have the property that they become composite after altering any one of their digits in the base $a$ expansion; the case $a=2$ was already established by Cohen-Selfridge…

We write out relations between the base of natural logarithms ($e$), the ratio of the circumference of a circle to its diameter ($\pi$), the golden ratios ($\Phi_p$) of the additive $p$-sequences, and the ratio of the diagonal of a square…

If alpha is an irrational number, we define Yoccoz's Brjuno function Phi by Phi(alpha)=sum_{n geq 0} alpha_0*alpha_1*...*alpha_{n-1}*log(1/alpha_n), where alpha_0 is the fractional part of alpha and alpha_{n+1} is the fractional part of…

Each $x\in (0,1]$ can be uniquely expanded as a power-2-decaying Gauss-like expansion, in the form of \begin{equation*} x=\sum_{i=1}^{\infty}2^{-(d_1(x)+d_2(x)+\cdots+d_i(x))},\qquad d_i(x)\in \mathbb{N}. \end{equation*} Let…

A positive linear recurrence sequence is of the form $H_{n+1} = c_1 H_n + \cdots + c_L H_{n+1-L}$ with each $c_i \ge 0$ and $c_1 c_L > 0$, with appropriately chosen initial conditions. There is a notion of a legal decomposition (roughly,…

Complex natural and technological systems can be considered, on a coarse-grained level, as assemblies of elementary components: for example, genomes as sets of genes, or texts as sets of words. On one hand, the joint occurrence of…

Given a finite set of real numbers $A$, the generalised golden ratio is the unique real number $\mathcal{G}(A) > 1$ for which we only have trivial unique expansions in smaller bases, and have non-trivial unique expansions in larger bases.…

A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatenation. A "nice" Friedman number is a Friedman number for…

The paper presents fundamental metrical theorems for a class of continued fraction-like expansions known as $\theta$-expansions. We first prove Khinchine's Weak Law of Large Numbers for the sum of digits, followed by the Diamond-Vaaler…

Using the classic two's complement notation of signed integers, the fundamental arithmetic operations of addition, subtraction, and multiplication are identical to those for unsigned binary numbers. We introduce a Fibonacci-equivalent of…

For $\beta > 1$, a sequence $(c_n)_{n \geq 1} \in \mathbb{Z}^{\mathbb{N}^+}$ with $0 \leq c_n < \beta$ is the \emph{beta expansion} of $x$ with respect to $\beta$ if $x = \sum_{n = 1}^\infty c_n\beta^{-n}$. Defining $d_\beta(x)$ to be the…

Given $\beta\in(1,2)$, a $\beta$-expansion of a real $x$ is a power series in base $\beta$ with coefficients 0 and 1 whose sum equals $x$. The aim of this note is to study certain problems related to the universality and combinatorics of…

In an article (which we will refer to as [BM]) of Boca and the fourth author of this paper, a new class of continued fraction expansions with odd partial quotients, parameterized by a parameter $\alpha\in [g,G]$, where…

We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…

For each positive integer $n$, let $\mathbb F_{q^n}$ be the unique $n$-degree extension of the finite field $\mathbb F_q$ with $q$ elements, where $q$ is a prime power. It is known that for arbitrary $q$ and $n$, there exists an element…

We count the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers. More precisely, we consider the sequence $(S_b(n))_{n\ge 0}$ counting the number of positive entries on each row of a…

Let $\alpha=(1+\sqrt 5)/2$, the golden ratio, and $\beta=-1/\alpha=(1 - \sqrt 5)/2$. Let $F_n$ and $L_n$ be the Fibonacci and Lucas numbers, defined by $F_n=(\alpha^n -\beta^n)/\sqrt 5$ and $L_n=\alpha^n + \beta^n$, for all non-negative…

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…