On the relationship between the recurrences in nilpotent groups and the binomial formula

Karaduman E., Aydin H.

INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, cilt.35, sa.9, ss.1093-1103, 2004 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 35 Sayı: 9
  • Basım Tarihi: 2004
  • Dergi Adı: INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1093-1103
  • Atatürk Üniversitesi Adresli: Evet

Özet

In this paper, we constitute 2-step Fibonacci sequences by the two generating elements of a group of exponent p (p is prime) and nilpotency class it. Then, we examine the relationship between the number of recurrence sums involved in the jth term of the last component of the Fibonacci sequences and the coefficients of the binomial formula (a + b)(n-2), for n greater than or equal to 2.