CD Tesis
Hubungan Matriks Tribonacci Dan Matriks Pascal
Tribonacci sequences are generalization of Fibonacci sequences having a unique shape and easily recognizable, where each subsequence term obtained by summing of the previous three terms that begins with 0, 0, and 1. Pascal’s triangle shape is obtained from the coefficients of the powers of summation of the two numbers, i.e. (x+y)^n. All numbers in every row of the Pascal’s triangle are the coefficients in the binomial expansion of (x+y)^n. Tribonacci numbers and Pascal’s triangle can be represented in the form of a square matrix, i.e. as a lower triangular matrix. Tribonacci matrix is written as T_n, ∀n∈N with each element of the tribonacci matrix is a tribonacci numbers. The Pascal matrix is written as P_n, ∀n∈N with each element of the Pascal matrix is a numbers on the Pascal’s triangle. This thesis discusses the relations between the tribonacci and Pascal matrices and by using algebraic calculations obtained a formula for the two new matrices, i.e. the matrix R_n and A_n. In addition, by defining these two new matrices, we have some of the relations which is stated in the theorem and two different factorizations.
Keywords: Tribonacci numbers, Pascal’s triangle, tribonacci matrix, Pascal’s matrix
Tidak tersedia versi lain