Results 51 to 60 of about 263 (131)
The k-Tribonacci Matrix and the Pascal Matrix
This article discusses the relationship between the k-Tribonacci matrix Tn(k) and the Pascal matrix Pn, by first constructing the k-Tribonacci matrix and then looking for its inverse.
Sri Gemawati +2 more
doaj +1 more source
We prove some identities for the squares of generalized Tribonacci numbers. Various summation identities involving these numbers are derived.
openaire +2 more sources
The row first-minus-last right (RFMLR) circulant matrix and row last-minus-first left (RLMFL) circulant matrices are two special pattern matrices. By using the inverse factorization of polynomial, we give the exact formulae of determinants of the two ...
Zhaolin Jiang, Nuo Shen, Juan Li
doaj +1 more source
On some properties of generalized tribonacci quaternions
Fen Bilimleri Enstitüsü, Matematik Ana Bilim Dalı, Cebir ve Sayılar Teorisi Bilim DalıBu tezde, katsayıları sırasıyla keyfi Tribonacci sayıları ve Tribonacci-Lucas sayılarından alınarak Tribonacci ve Tribonacci-Lucas kuaterniyonlarının bir genellemesi ...
Karabulut, Leyla
core
In this paper, we obtain explicit Euclidean norm, eigenvalues, spectral norm and determinant of circulant matrix with the generalized Tribonacci (generalized (r, s, t)) numbers.
Yüksel Soykan
core +1 more source
Incomplete Tribonacci numbers and its determinants
Bu çalışmada, ilk olarak Tribonacci ve Tribonacci-Lucas sayıları üçlü bant matrislerin determinantları yardımıyla elde edildi. Daha sonra da, tamamlanmamış Tribonacci ve tamamlanmamış Tribonacci-Lucas sayıları tanımlandı. Tribonacci ailesinin genellemesi
Yılmaz, Nazmiye
core
A search for Tribonacci-Wieferich primes [PDF]
summary:Such problems as the search for Wieferich primes or Wall-Sun-Sun primes are intensively studied and often discused at present.
Klaška, Jiří
core
On Tribonacci numbers written as a product of three Fibonacci numbers
The present paper examines the following Diophantine equation: Tn = Fk · Fl · Fm where Tn is the n-th Tribonacci number and likewise Fk is the k-th Fibonacci number and so on as variables.
Ozkaya Zeynep Demirkol
doaj +1 more source
The numbers of repeated palindromes in the Fibonacci and Tribonacci words
The Fibonacci word \(F\) is the fixed point beginning with \(a\) of the morphism \(\sigma(a)=ab\) and \(\sigma(b)=a\). Similarly, the Tribonacci word \(T\) is the fixed point beginning with \(a\) of the morphism \(\tau(a)=ab\), \(\tau(b)=ac\) and \(\tau(c)=a\). Let \(F[1, n]\) (resp. \(T[1, n]\)) be the prefix of \(F\) (resp. \(T\)) of length \(n\).
Yuke Huang, Zhiying Wen
openaire +1 more source
Multiset rewriting over Fibonacci and Tribonacci numbers
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources

