Results 21 to 30 of about 101 (80)

Stability of second‐order recurrences modulo pr

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 23, Issue 4, Page 225-241, 2000., 2000
The concept of sequence stability generalizes the idea of uniform distribution. A sequence is p‐stable if the set of residue frequencies of the sequence reduced modulo pr is eventually constant as a function of r. The authors identify and characterize the stability of second‐order recurrences modulo odd primes.
Lawrence Somer, Walter Carlip
wiley   +1 more source

On the Partial Finite Alternating Sums of Reciprocals of Balancing and Lucas-Balancing Numbers

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2020
In this note, the finite alternating sums of reciprocals of balancing and Lucas-balancing numbers are considered and several identities involving these sums are deduced.
Dutta Utkal Keshari, Ray Prasanta Kumar
doaj   +1 more source

Invariance of recurrence sequences under a galois group

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 19, Issue 2, Page 327-334, 1996., 1995
Let F be a Galois field of order q, k a fixed positive integer and R = Fk×k[D] where D is an indeterminate. Let L be a field extension of F of degree k. We identify Lf with fk×1 via a fixed normal basis B of L over F. The F‐vector space Γk(F)( = Γ(L)) of all sequences over Fk×1 is a left R‐module. For any regular f(D) ∈ R, Ωk(f(D)) = {S ∈ Γk(F) : f(D)S
Hassan Al-Zaid, Surjeet Singh
wiley   +1 more source

A Note on Two Fundamental Recursive Sequences

open access: yesAnnales Mathematicae Silesianae, 2021
In this note, we establish some general results for two fundamental recursive sequences that are the basis of many well-known recursive sequences, as the Fibonacci sequence, Lucas sequence, Pell sequence, Pell-Lucas sequence, etc.
Farhadian Reza, Jakimczuk Rafael
doaj   +1 more source

On Quaternion-Gaussian Fibonacci Numbers and Their Properties

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021
We study properties of Gaussian Fibonacci numbers. We start with some basic identities. Thereafter, we focus on properties of the quaternions that accept gaussian Fibonacci numbers as coefficients.
Halici Serpil, Cerda-Morales Gamaliel
doaj   +1 more source

A Hybrid Matrix–Based Encoding Scheme With Error Detection via Third‐Order Recurrences

open access: yesJournal of Mathematics, Volume 2026, Issue 1, 2026.
In this paper, we propose a novel encoding–decoding algorithm based on third‐order linear recurrence sequences and their associated matrix representations. In particular, third‐order Jacobsthal and third‐order Jacobsthal–Lucas matrix sequences are combined with Padovan and Perrin matrix sequences to construct a hybrid block–based coding scheme.
Sukran Uygun, Smritijit Sen
wiley   +1 more source

One-Parameter Generalization of Dual-Hyperbolic Jacobsthal Numbers

open access: yesAnnales Mathematicae Silesianae, 2023
In this paper, we introduce one-parameter generalization of dual-hyperbolic Jacobsthal numbers – dual-hyperbolic r-Jacobsthal numbers. We present some properties of them, among others the Binet formula, Catalan, Cassini, and d’Ocagne identities. Moreover,
Bród Dorota   +2 more
doaj   +1 more source

On the ψ− Sheffer F− Polynomials and Their Degenerate Matrices

open access: yesJournal of Mathematics, Volume 2026, Issue 1, 2026.
In this study, we systematically construct a novel framework within umbral calculus by integrating the structures of generalized F‐calculus and degenerate sequences. Utilizing Roman’s foundational approach to umbral calculus, we first introduce a new family of ψ − F− linear functionals and their corresponding ψ − F− differential operators on the ...
Semra Kuş, Smritijit Sen
wiley   +1 more source

Identities Arising from Binomial-Like Formulas Involving Divisors of Numbers

open access: yesAnnales Mathematicae Silesianae, 2023
In this article, we derive a great number of identities involving the ω function counting distinct prime divisors of a given number n. These identities also include Pochhammer symbols, Fibonacci and Lucas numbers and many more.
Gryszka Karol
doaj   +1 more source

Narayana Numbers With Zeckendorf Partition in Two Terms

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.
The Narayan’s cow sequence starts with the terms 1, 1, and 1. Each subsequent term is obtained as the sum of the previous term and the term three places before. A term of this sequence is called a Narayana number. The mathematician Zeckendorf proved that every positive integer has a unique decomposition into a sum of distinct and nonconsecutive ...
Japhet Odjoumani   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy