Related papers: On Pillai's problem involving two linear recurrent…
The Collatz map is defined for a positive even integer as half that integer, and for a positive odd integer as that integer threefold, plus one. The Collatz conjecture states that when the map is iterated the number one is eventually…
We develop a theory of the field of double Laurent series, iterated Laurent series, and Malcev-Neumann series that applies to most constant term evaluation problems. These include (i) MacMahon's partition analysis, counting solutions of…
In the present paper, we have developed a method for solving \textit{diophantine inequalities} using their relationship with the \textit{difference between consecutive primes}. Using this approach we have been able to prove some theorems,…
In this short article, we study different problems described as initial value problems of discrete differential equations and develop a a transform method called the sigma transform, a discrete version of the continuous Laplace transform to…
Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…
The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…
We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…
In previous papers, for an arithmetical function $f_0$, we defined functions $f_m$ and $c_m$ and designated numbers of restricted words over a finite alphabet counted by these functions. In this paper, we examine the reverse problem for…
The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…
A quick way to compute generating functions related to Pell-Padovan tetranacci numbers and classical sequences of recursions of order two is provided. Eight special instances can be computed at once.
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
Let $(q_{\alpha, n})_{n \geq 0}$ be the sequence of convergent denominators to the simple continued fraction expansion of $\alpha$. For certain specific choices of $\alpha$, this sequence is a Lehmer sequence. In this paper, we show that…
We investigate strong divisibility sequences and produce lower and upper bounds for the density of integers in the sequence which only have (somewhat) large prime factors. We focus on the special cases of Fibonacci numbers and elliptic…
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…
Underlying many Bayesian inference techniques that seek to approximate the posterior as a Gaussian distribution is a fundamental linear algebra problem that must be solved for both the mean and key entries of the covariance. Even when the…
We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…
Let $k\ge 2$ and $\{F_n^{(k)}\}_{n\geq 2-k}$ be the sequence of $k$--generalized Fibonacci numbers whose first $k$ terms are $0,\ldots,0,0,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we determine all…
We survey and prove properties a family of recurrences bears in relation to integer representations, compositions, the Pascal triangle, sums of digits, Nim games and Beatty sequences.
Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by the recurrence $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several generalizations of this sequence and also several interesting identities. In this…
A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, with $F_{n+1} = F_n + F_{n-1}$ and $F_1=1, F_2=2$. If instead we allow the…