Related papers: Counting base phi representations

We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we have determined all the powers of 2 which are sums of five Fibonacci numbers with few exceptions that…

Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these…

A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of the Fa\`a di Bruno's formula.…

Representing real numbers using convenient numeration systems (integer bases, $\beta$-numeration, Cantor bases, etc.) has been a longstanding mathematical challenge. This paper focuses on Cantor real bases and, specifically, on automatic…

For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of finding representations with minimal weight has been solved…

In this paper, we consider infinite sums derived from the reciprocals of the generalized Fibonacci numbers. We obtain some new and interesting identities for the generalized Fibonacci numbers.

We investigate a connection between generalized Fibonacci numbers and renewal theory for stochastic processes. Using Blackwell's renewal theorem we find an approximation to the generalized Fibonacci numbers. With the help of error estimates…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Motivated by multiplication algorithms based on redundant number representations, we study representations of an integer $n$ as a sum $n=\sum_k \epsilon_k U_k$, where the digits $\epsilon_k$ are taken from a finite alphabet $\Sigma$ and…

For every positive integer h, the representation function of order h associated to a subset A of the integers or, more generally, of any group or semigroup X, counts the number of ways an element of X can be written as the sum (or product,…

In the article integer divisibility properties and related prime factors natural number representation concepts have been defined over the whole infinite hyperoperation hierarchy. The definitions have been made across and above of unique…

In an unpublished 2005 paper T. Rivoal proved a formula giving 4/pi as the infinite product of factors (1 + 1/(k+1)) to a power involving the integer part of the logarithm of k in base 2 and a 4-periodic sequence. We show how a lemma in a…

We show that the $n$'th digit of the base-$b$ representation of the golden ratio is a finite-state function of the Zeckendorf representation of $b^n$, and hence can be computed by a finite automaton. Similar results can be proven for any…

In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…

The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. In this paper, we get the explicit expressions of all squares and cubes, then we determine the number of distinct squares and cubes…

In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic…

Denote by s_F(n) the minimal number of Fibonacci numbers needed to write n as a sum of Fibonacci numbers. We obtain the extremal minimal and maximal orders of magnitude of s_F(n^h)/s_F(n) for any h>= 2. We use this to show that for all…

Some properties of the optimal representation of numbers are investigated. This representation, which is to the base-e, is examined for coding of integers. An approximate representation without fractions that we call WF is introduced and…

A set $\mathcal{A}$ is said to be an additive $h$-basis if each element in $\{0,1,\ldots,hn\}$ can be written as an $h$-sum of elements of $\mathcal{A}$ in {\it at least} one way. We seek multiple representations as $h$-sums, and, in this…