相关论文: New Identities for Padovan Numbers
One of the best known and oldest identities for the Fibonacci sequence $F_n$ is $F_{n+1}F_{n-1}-F_{n}^2=(-1)^n$ which was derived first by R. Simson in 1753 and it is now called as Simson or Cassini Identity. In this paper, we generalize…
The abc conjecture is one of the most famous unsolved problems in number theory. The conjecture claims for each real $\epsilon > 0$ that there are only a finite number of coprime positive integer solutions to the equation $a+b = c$ with $c…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…
Continued fractions are linked to Stern's diatomic sequence 0,1,1,2,1,3,2,3,1,4,... (given by the recursion relation a_2n=a_n and a_{2n+1} = a_n + a_{n+1}, where a_0=0 and a_1=1), which has long been known. Using a particular…
If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…
Let N be the set all of non-negative integers, let A be a finite subset of N, and let (2A) be the set of all numbers of form a+b for each a and b in A. The arithmetic structure of A was accurately characterized by Freiman when (i)…
In this paper, we consider several combinatorial problems whose enumeration leads to the odd-indexed Fibonacci numbers, including certain types of Dyck paths, block fountains, directed column-convex polyominoes, and set partitions with no…
In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…
The notion of $(a,b)$-cores is closely related to rational $(a,b)$ Dyck paths due to Anderson's bijection, and thus the number of $(a,a+1)$-cores is given by the Catalan number $C_a$. Recent research shows that $(a,a+1)$ cores with distinct…
Based on the structure of Fibonacci sequence, we give a new proof for the irrationality exponents of the Fibonacci real numbers. Moreover, we obtain all the irrationality exponents of the real numbers corresponding to the differences of…
A Sidon sequence is a sequence of integers a_1 < a_2 < a_3 < ... with the property that the sums a_i+a_j (i\le j) are distinct. This work contains a survey of Sidon sequences and their generalizations, and an extensive annotated and…
A generalization of the Chu-Vandermonde convolution is presented and proved with the integral representation method. This identity can be transformed into another identity, which has as special cases two known identities. Another identity…
Aperiodic algebras are infinite dimensional algebras with generators corresponding to an element of the aperiodic set. These algebras proved to be an useful tool in studying elementary excitations that can propagate in multilayered…
Variable-length splittable codes are derived from encoding sequences of ordered integer pairs, where one of the pair's components is upper bounded by some constant, and the other one is any positive integer. Each pair is encoded by the…
In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0,…
We derive various weighted summation identities, including binomial and double binomial identities, for Tribonacci numbers. Our results contain some previously known results as special cases.
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
The optimal cube factor of a graph, a special kind of component factor, is first introduced. Furthermore, the optimal cube factors of Fibonacci and matchable Lucas cubes are studied; and some results on the Padovan sequence and binomial…
Narayana's cows problem is a problem similar to the Fibonacci's rabbit problem. We define the numbers which are the solutions of this problem as Narayana's cows numbers. Narayana's cows sequence satisfies the third order recurrence relation…
This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.