Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userBinomial transforms of the modified k-Fibonacci-like sequence
101
0
0.0
(
0
)
Authors
Youngwoo Kwon
Ask ChatGPT about the research
No Arabic abstract
This study applies the binomial, k-binomial, rising k-binomial and falling k-binomial transforms to the modified k-Fibonacci-like sequence. Also, the Binet formulas and generating functions of the above mentioned four transforms are newly found by the recurrence relations.
rate research
Read More
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}.
Let $p$ be a prime with $p>3$, and let $a,b$ be two rational $p-$integers. In this paper we present general congruences for $sum_{k=0}^{p-1}binom akbinom{-1-a}kfrac p{k+b}pmod {p^2}$. For $n=0,1,2,ldots$ let $D_n$ and $b_n$ be Domb and Almkvist-Zudilin numbers, respectively. We also establish congruences for $$sum_{n=0}^{p-1}frac{D_n}{16^n},quad sum_{n=0}^{p-1}frac{D_n}{4^n}, quad sum_{n=0}^{p-1}frac{b_n}{(-3)^n},quad sum_{n=0}^{p-1}frac{b_n}{(-27)^n}pmod {p^2}$$ in terms of certain binary quadratic forms.
Carmichael showed for sufficiently large $L$, that $F_L$ has at least one prime divisor that is $pm 1({rm mod}, L)$. For a given $F_L$, we will show that a product of distinct odd prime divisors with that congruence condition is a Fibonacci pseudoprime. Such pseudoprimes can be used in an attempt, here unsuccessful, to find an example of a Baillie-PSW pseudoprime, i.e. an odd Fibonacci pseudoprime that is congruent to $pm 2({rm mod}, 5)$ and is also a base-2 pseudoprime.
We classify all functions which, when applied term by term, leave invariant the sequences of moments of positive measures on the real line. Rather unexpectedly, these functions are built of absolutely monotonic components, or reflections of them, with possible discontinuities at the endpoints. Even more surprising is the fact that functions preserving moments of three point masses must preserve moments of all measures. Our proofs exploit the semidefiniteness of the associated Hankel matrices and the complete monotonicity of the Laplace transforms of the underlying measures. As a byproduct, we characterize the entrywise transforms which preserve totally non-negative Hankel matrices, and those which preserve all totally non-negative matrices. The latter class is surprisingly rigid: such maps must be constant or linear. We also examine transforms in the multivariable setting, which reveals a new class of piecewise absolutely monotonic functions.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
