• 제목/요약/키워드: k-Fibonacci numbers

검색결과 39건 처리시간 0.032초

SUM FORMULAE OF GENERALIZED FIBONACCI AND LUCAS NUMBERS

  • Cerin, Zvonko;Bitim, Bahar Demirturk;Keskin, Refik
    • 호남수학학술지
    • /
    • 제40권1호
    • /
    • pp.199-210
    • /
    • 2018
  • In this paper we obtain some formulae for several sums of generalized Fibonacci numbers $U_n$ and generalized Lucas numbers $V_n$ and their dual forms $G_n$ and $H_n$ by using extensions of an interesting identity by A. R. Amini for Fibonacci numbers to these four kinds of generalizations and their first and second derivatives.

ON THE INTERSECTION OF k-FIBONACCI AND PELL NUMBERS

  • Bravo, Jhon J.;Gomez, Carlos A.;Herrera, Jose L.
    • 대한수학회보
    • /
    • 제56권2호
    • /
    • pp.535-547
    • /
    • 2019
  • In this paper, by using the lower bound of linear forms in logarithms of Matveev and the theory of continued fractions by means of a variation of a result of Dujella and $Peth{\ddot{o}}$, we find all generalized Fibonacci numbers which are Pell numbers. This paper continues a previous work that searched for Pell numbers in the Fibonacci sequence.

수학적 추론과 연결성의 교수.학습을 위한 소재 연구 -도형수, 파스칼 삼각형, 피보나치 수열을 중심으로- (A Study on Teaching Material for Enhancing Mathematical Reasoning and Connections - Figurate numbers, Pascal's triangle, Fibonacci sequence -)

  • 손홍찬
    • 대한수학교육학회지:학교수학
    • /
    • 제12권4호
    • /
    • pp.619-638
    • /
    • 2010
  • 본 고에서는 평면이나 공간에서 정의된 도형수가 일반적으로 유한 차원에서 일반화될 때 저차원의 도형수인 그노몬수, 다각수 그리고 다각뿔수의 성질을 통합적으로 설명할 수 있음을 논하고, 도형수와 파스칼 삼각형, 피보나치 수열의 성질과 그들 사이의 관계를 알아봄으로써 이들에 대한 성질 탐구가 수학적 추론과 연결성을 지도하기 적합한 소재가 될 수 있음을 논한다.

  • PDF

SINGULAR CASE OF GENERALIZED FIBONACCI AND LUCAS MATRICES

  • Miladinovic, Marko;Stanimirovic, Predrag
    • 대한수학회지
    • /
    • 제48권1호
    • /
    • pp.33-48
    • /
    • 2011
  • The notion of the generalized Fibonacci matrix $\mathcal{F}_n^{(a,b,s)}$ of type s, whose nonzero elements are generalized Fibonacci numbers, is introduced in the paper [23]. Regular case s = 0 is investigated in [23]. In the present article we consider singular case s = -1. Pseudoinverse of the generalized Fibonacci matrix $\mathcal{F}_n^{(a,b,-1)}$ is derived. Correlations between the matrix $\mathcal{F}_n^{(a,b,-1)}$ and the Pascal matrices are considered. Some combinatorial identities involving generalized Fibonacci numbers are derived. A class of test matrices for computing the Moore-Penrose inverse is presented in the last section.

FIBONACCI LENGTHS INVOLVING THE WALL NUMBER k(n)

  • DOOSTIE H.;HASHEMI M.
    • Journal of applied mathematics & informatics
    • /
    • 제20권1_2호
    • /
    • pp.171-180
    • /
    • 2006
  • Two infinite classes of special finite groups considered (The group G is special, if G' and Z(G) coincide). Using certain sequences of numbers we give explicit formulas for the Fibonacci lenghts of these classes which involve the well-known Wall numbers k(n).

ON A CLASS OF q-BI-UNIVALENT FUNCTIONS OF COMPLEX ORDER RELATED TO SHELL-LIKE CURVES CONNECTED WITH THE FIBONACCI NUMBERS

  • Ahuja, Om P.;Cetinkaya, Asena;Bohra, Nisha
    • 호남수학학술지
    • /
    • 제42권2호
    • /
    • pp.319-330
    • /
    • 2020
  • We introduce a new subclass of q-bi-univalent functions of complex order related to shell-like curves connected with the Fibonacci numbers. We obtain the coefficient estimates and Fekete-Szegö inequalities for the functions belonging to this class. Relevant connections with various other known classes have been illustrated.

A NOTE ON THE MODIFIED k-FIBONACCI-LIKE SEQUENCE

  • Kwon, Youngwoo
    • 대한수학회논문집
    • /
    • 제31권1호
    • /
    • pp.1-16
    • /
    • 2016
  • The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the modified k-Fibonacci-like sequence and prove Binet's formula for this sequence and then use it to introduce and prove the Catalan, Cassini, and d'Ocagne identities for the modified k-Fibonacci-like sequence. Also, the ordinary generating function of this sequence is stated.

The Fibonacci Edge Labeling on Fibonacci Trees

  • Kim, yong-Seok
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -2
    • /
    • pp.731-734
    • /
    • 2000
  • We present a novel graph labeling problem called Fibonacci edge labeling. The constraint in this labeling is placed on the allowable edge label which is the difference between the labels of endvertices of an edge. Each edge label should be (3m+2)-th Fibonacci numbers. We show that every Fibonacci tree can be labeled Fibonacci edge labeling. The labelings on the Fibonacci trees are applied to their embeddings into Fibonacci Circulants.

  • PDF