Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn Higher Dimensional Fibonacci Numbers, Chebyshev Polynomials and Sequences of Vector Convergents
281
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integ
rate research
Read More
The generalized Fibonacci sequences are sequences ${f_n}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t in mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent paper, Amdeberhan, Chen, Moll, and Sagan considered some arithmetic properites of the generalized Fibonacci sequence. Specifically, they considered the behavior of analogues of the $p$-adic valuation and the Riemann zeta function. In this paper, we resolve some conjectures which they raised relating to these topics. We also consider the rank modulo $n$ in more depth and find an interpretation of the rank in terms of the order of an element in the multiplicative group of a finite field when $n$ is an odd prime. Finally, we study the distribution of the rank over different values of $s$ when $t = -1$ and suggest directions for further study involving the rank modulo prime powers of generalized Fibonacci sequences.
In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between the Euler numbers and the second kind stirling numbers.
Sequences of Genocchi numbers of the first and second kind are considered. For these numbers, an approach based on their representation using sequences of polynomials is developed. Based on this approach, for these numbers some identities generalizing the known identities are constructed.
Let a(n) be the Sterns diatomic sequence, and let x1,...,xr be the distances between successive 1s in the binary expansion of the (odd) positive integer n. We show that a(n) is obtained by evaluating generalized Chebyshev polynomials when the variables are given the values x1+1, ..., xr+1, and we derive a formula expressing the same polynomials in terms of sets of increasing integers of alternating parity. We also show that a(n) = Det(Ir + Mr), where Ir is the rxr identity matrix, and Mr is the rxr matrix that has x1,...,xr along the main diagonal, then all 1s just above and below the main diagonal, and all the other entries are 0.
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the recurrence relation S_{k,n} = kS_{k,n-1} +S{k,n-2} for n >= 2, where a, b, k are real numbers. Using the sequence S_{k,n}, we introduce and prove some special identities. Also, we deal with the circulant and skew circulant matrices for the sequence S_{k,n}.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
