scholarly journals Divisibility Properties of the Fibonacci, Lucas, and Related Sequences

ISRN Algebra ◽  
2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Thomas Jeffery ◽  
Rajesh Pereira
Keyword(s):  
Fibonacci Numbers ◽  
Bézout’S Identity ◽  
Divisibility Properties

We use matrix techniques to give simple proofs of known divisibility properties of the Fibonacci, Lucas, generalized Lucas, and Gaussian Fibonacci numbers. Our derivations use the fact that products of diagonal matrices are diagonal together with Bezout’s identity.

scholarly journals The Proof of a Conjecture on the Density of Sets Related to Divisibility Properties of z(n)

Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2912
Author(s):  
Eva Trojovská ◽  
Venkatachalam Kandasamy
Keyword(s):  
Positive Integer ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Natural Density ◽  
Almost All ◽  
Divisibility Properties

Let (Fn)n be the sequence of Fibonacci numbers. The order of appearance (in the Fibonacci sequence) of a positive integer n is defined as z(n)=min{k≥1:n∣Fk}. Very recently, Trojovská and Venkatachalam proved that, for any k≥1, the number z(n) is divisible by 2k, for almost all integers n≥1 (in the sense of natural density). Moreover, they posed a conjecture that implies that the same is true upon replacing 2k by any integer m≥1. In this paper, in particular, we prove this conjecture.

Divisibility properties for Fibonacci and related numbers

2013 ◽  
Vol 97 (540) ◽  
pp. 461-464
Author(s):  
Jawad Sadek ◽  
Russell Euler
Keyword(s):  
Recurrence Relation ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Unified Approach ◽  
Lucas Numbers ◽  
Pell Numbers ◽  
Image Position ◽  
Divisibility Properties

Although it is an old one, the fascinating world of Fibonnaci numbers and Lucas numbers continues to provide rich areas of investigation for professional and amateur mathematicians. We revisit divisibility properties for t0hose numbers along with the closely related Pell numbers and Pell-Lucas numbers by providing a unified approach for our investigation.For non-negative integers n, the recurrence relation defined bywith initial conditionscan be used to study the Pell (Pn), Fibonacci (Fn), Lucas (Ln), and Pell-Lucas (Qn) numbers in a unified way. In particular, if a = 0, b = 1 and c = 1, then (1) defines the Fibonacci numbers xn = Fn. If a = 2, b = 1 and c = 1, then xn = Ln. If a = 0, b = 1 and c = 2, then xn = Pn. If a =b = c = 2, then xn = Qn [1].

The Matrix Connection: Fibonacci and Inductive Proof

2006 ◽  
Vol 99 (5) ◽  
pp. 328-333
Author(s):  
Tamara B. Veenstra ◽  
Catherine M. Miller
Keyword(s):  
Matrix Algebra ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Graphing Calculators ◽  
Inductive Proof ◽  
The Matrix ◽  
Divisibility Properties

This article presents several activities (some involving graphing calculators) designed to guide students to discover several interesting properties of Fibonacci numbers. Then, we explore interesting connections between Fibonacci numbers and matrices; using this connection and induction we prove divisibility properties of Fibonacci numbers. Includes problems and samples of tasks used to help student discover patterns within the Fibonacci Sequence and connections to matrix algebra.

Divisibility Properties of Graded Domains

1982 ◽  
Vol 34 (1) ◽  
pp. 196-215 ◽  
Author(s):  
D. D. Anderson ◽  
David F. Anderson
Keyword(s):  
Integral Domain ◽  
Homogeneous Element ◽  
Carry Over ◽  
Divisibility Properties ◽  
Krull Domains

Let R = ⊕α∊гRα be an integral domain graded by an arbitrary torsionless grading monoid Γ. In this paper we consider to what extent conditions on the homogeneous elements or ideals of R carry over to all elements or ideals of R. For example, in Section 3 we show that if each pair of nonzero homogeneous elements of R has a GCD, then R is a GCD-domain. This paper originated with the question of when a graded UFD (every homogeneous element is a product of principal primes) is a UFD. If R is Z+ or Z-graded, it is known that a graded UFD is actually a UFD, while in general this is not the case. In Section 3 we consider graded GCD-domains, in Section 4 graded UFD's, in Section 5 graded Krull domains, and in Section 6 graded π-domains.

On a system of three difference equations of higher order solved in terms of Lucas and Fibonacci numbers

2020 ◽  
Vol 70 (3) ◽  
pp. 641-656
Author(s):  
Amira Khelifa ◽  
Yacine Halim ◽  
Abderrahmane Bouchair ◽  
Massaoud Berkal
Keyword(s):  
General Solution ◽  
Closed Form ◽  
Difference Equations ◽  
Fibonacci Numbers ◽  
Higher Order ◽  
Real Numbers ◽  
Lucas Numbers ◽  
Rational Difference Equations ◽  
Initial Values ◽  
Fibonacci And Lucas Numbers

AbstractIn this paper we give some theoretical explanations related to the representation for the general solution of the system of the higher-order rational difference equations$$\begin{array}{} \displaystyle x_{n+1} = \dfrac{1+2y_{n-k}}{3+y_{n-k}},\qquad y_{n+1} = \dfrac{1+2z_{n-k}}{3+z_{n-k}},\qquad z_{n+1} = \dfrac{1+2x_{n-k}}{3+x_{n-k}}, \end{array}$$where n, k∈ ℕ0, the initial values x−k, x−k+1, …, x0, y−k, y−k+1, …, y0, z−k, z−k+1, …, z1 and z0 are arbitrary real numbers do not equal −3. This system can be solved in a closed-form and we will see that the solutions are expressed using the famous Fibonacci and Lucas numbers.

scholarly journals Colored HOMFLY-PT for hybrid weaving knot $$ {\hat{\mathrm{W}}}_3 $$(m, n)

2021 ◽  
Vol 2021 (6) ◽  
Author(s):  
Vivek Kumar Singh ◽  
Rama Mishra ◽  
P. Ramadevi
Keyword(s):  
Closed Form ◽  
Topological Strings ◽  
Chebyshev Polynomials ◽  
Fibonacci Numbers ◽  
Infinite Family ◽  
Closed Form Expression ◽  
Two Dimensional ◽  
Laurent Polynomials ◽  
Form Expression ◽  
Torus Knots

Abstract Weaving knots W(p, n) of type (p, n) denote an infinite family of hyperbolic knots which have not been addressed by the knot theorists as yet. Unlike the well known (p, n) torus knots, we do not have a closed-form expression for HOMFLY-PT and the colored HOMFLY-PT for W(p, n). In this paper, we confine to a hybrid generalization of W(3, n) which we denote as $$ {\hat{W}}_3 $$ W ̂ 3 (m, n) and obtain closed form expression for HOMFLY-PT using the Reshitikhin and Turaev method involving $$ \mathrm{\mathcal{R}} $$ ℛ -matrices. Further, we also compute [r]-colored HOMFLY-PT for W(3, n). Surprisingly, we observe that trace of the product of two dimensional $$ \hat{\mathrm{\mathcal{R}}} $$ ℛ ̂ -matrices can be written in terms of infinite family of Laurent polynomials $$ {\mathcal{V}}_{n,t}\left[q\right] $$ V n , t q whose absolute coefficients has interesting relation to the Fibonacci numbers $$ {\mathrm{\mathcal{F}}}_n $$ ℱ n . We also computed reformulated invariants and the BPS integers in the context of topological strings. From our analysis, we propose that certain refined BPS integers for weaving knot W(3, n) can be explicitly derived from the coefficients of Chebyshev polynomials of first kind.

Divisibility Properties of Integers x, k Satisfying 1 k + ⋯+ (x - 1) k = x k

1994 ◽  
Vol 63 (208) ◽  
pp. 799 ◽  
Author(s):  
P. Moree ◽  
H. J. J. Te Riele ◽  
J. Urbanowicz
Keyword(s):  
Divisibility Properties
Sign in / Sign up

Export Citation Format

Share Document