\begin{block}{}

In this paper, properties of integer sequences were deduced directly from

elementary matrix algebra.%{4}
\end{block}
\end{frame}

\section{Chapter 1}
\subsection{Introduction}

\begin{frame}
\frametitle{Introduction}
\pause
\begin{block}{}
Integer sequences, such as Fibonacci, Lucas, Jacobsthal, Jacobsthal Lucas, Pell and
Padovan charm us with their abundant applications in \pause \textbf{science and
art}.%\cite{8,9}
\end{block} \end{frame}

\begin{frame}
\pause
Take for example, the sunflower, \pause the display of its florets are a perfect
spiral of Fibonacci sequence. The \pause fruitlets of a pineapple and the \pause
pine cone create the spiral based on this sequence. \pause Buds on trees, \pause
sand dollars, \pause starfish, \pause petals on flowers and especially the \pause
nautilus shell are formed with this exact same blueprint. This sequence appears to
be a trademark of a designer. Many properties of these sequences were deduced
directly from \pause elementary matrix algebra.%\cite{4}
\end{frame}

\begin{frame}
\frametitle{Objectives of the Study}
\pause
\begin{block}{}
This study aims to do the following:
\end{block}

\begin{block}{}
\begin{enumerate}
\item To define $k$-Jacobsthal and $k$-Jacobsthal Lucas sequences and to
explore their properties. \vspace{.2 in}
\item To characterize the relationship between $k$-Jacobsthal and $k$-
Jacobsthal Lucas matrix sequences. \vspace{.2 in}
\end{enumerate}
\end{block}
\end{frame}

\begin{frame}
\frametitle{Significance of the Study}
\pause
\begin{block}{}
This study is an attempt to impart a better and more clear understanding of the
$k$-Jacobsthal and $k$-Jacobsthal Lucas
matrix sequences so that this paper may serve as a reference for students, faculty
members, and other researchers in their
future studies.
\end{block}
\end{frame}
\section{Chapter 2}
\subsection{Matrices}

\begin{frame}
\begin{block} {Definition} \label{Matrix} %\cite{12}
An $m\times n$ \textbf{matrix} $A$ is a rectangular array of $mn$ real \\ (or
complex) numbers arranged in $m$ horizontal \textbf{rows} and $n$ vertical
\textbf{columns}:
\begin{center}
$A=\begin{bmatrix} a_{11}&a_{12}&\cdots&a_{1n} \\ a_{21}&a_{22}&\cdots&a_{2n} \\
\vdots&\vdots&\ddots&\vdots \\ a_{m1}&a_{m2}&\cdots&a_{mn} \end{bmatrix}$
\end{center}\pause
The \textbf{ith row} of $A$ is
\begin{center}
$\begin{bmatrix} a_{i1}&a_{i2}&\cdots&a_{in} \end{bmatrix} \hspace{0.3cm} (1\leq
i \leq m)$;
\end{center}\pause
\end{block}
\end{frame}

\begin{frame}
\begin{block}{Definition}
The \textbf{jth column} of $A$ is
\begin{center}\pause
$\begin{bmatrix} a_{1j} \\ a_{2j} \\ \vdots \\ a_{mj} \end{bmatrix} \hspace{0.3cm}
(1\leq j \leq n)$.
\end{center}
\end{block}
\end{frame}
\pause

\begin{frame}
We shall say that $A$ is of size $m$ by $n$ \pause(written as $m\times n$). If
$m=n$, we say that \textit{A} is a \pause\textbf{square matrix} of order $n$, and
that the numbers $a_{11}, a_{22}, \ldots, a_{nn}$ form the \textbf{main diagonal}
of $A$.
\end{frame}

\begin{frame}
\begin{example}
The following are matrices:\pause
\begin{align*}
A& =\begin{bmatrix} 1&-2&3 \\ 0&1&-5 \end{bmatrix},&
B& =\begin{bmatrix} 3&-6 \\ 1&0 \end{bmatrix},\\
C& =\begin{bmatrix} i \\ 3 \\ 9 \end{bmatrix},&
D& =\begin{bmatrix} i+2&4 \\ 1&2i+i^2 \end{bmatrix}.
\end{align*}
\end{example}
\end{frame}

\begin{frame}
If all the entries of matrix are zero, the matrix is called a \textbf{zero} or
\textbf{null matrix} and is denoted by $0$.
\end{frame}

\subsection{Operations on Matrices}
\begin{frame}
\begin{block}{Definition}
If $A=[a_{ij}]$ and $B=[a_{ij}]$ are $m\times n$ matrices, then the \textbf{sum} of
$A$ and $B$ is the $m\times n$ matrix $C=[a_{ij}]$, defined by
\begin{center} $c_{ij}=a_{ij} + b_{ij} \qquad (1\leq j\leq m,1\leq j\leq n)$.\end
{center}
That is, $c$ is obtained by adding corresponding elements of $A$ and $B$.\cite{12}
\end{block}
\end{frame}
\pause

\subsection{Properties of Matrix Addition}

\begin{frame}
\begin{block}
Theorem \label{Matrix Add} %\cite{12}
Let $A,$ $B$ and $C$ be $m\times n$ matrices.\\
\rm $\left(\textbf{a}\right)$ \it $A+B=B+A$ \\
\rm $\left(\textbf{b}\right)$ \it $A+(B+C)=(A+B)+C$.
\end{block}
\end{frame}

\pause

\begin{frame}
\begin{block}{Definition} \label{}%\cite{12}
If $A=[a_{ij}]$ is an $m\times p$ matrix and $B=[b_{ij}]$ is a $p\times n$ matrix,
then the \textbf{product} of $A$ and $B$, denoted by$AB$, is the $m\times n$ matrix
$C=[c_{ij}]$, defined by\\
$$c_{ij}=a_{i1}b_{1j}+a_{i2}b_{12}+\ldots+a_{ip}b_{pj}=\sum^{p}_{k=i}
{a_{ik}b_{kj}}\qquad (1\leq i\leq m,1\leq j\leq n).$$
\end{block}
\end{frame}
\pause

\begin{frame}
\begin{example} \label{}\rm
Let \[A=\left[\begin{array}{ccc} 1&-2&0\\ 2&3&1\\ \end{array}\right] \qquad
\text{and}\qquad B= \left[\begin{array}{cc} 0&-1\\ 2&1\\ 1&0\\
\end{array}\right].\]
Then \[AB= \left[\begin{array}{cc} (1)(0)+(-2)(2)+(0)(1)&(1)(-1)+(-2)(1)+(0)(0)\\
(2)(0)+(3)(2)+(1)(1)&(2)(-1)+(3)(1)+(1)(0)\\ \end{array}\right]=
\left[\begin{array}{cc} -4&-3\\ 7&1\\
\end{array}\right].\]
\end{example}
\end{frame}

\subsection{Properties of Matrix Multiplication}

\begin{frame} \label{Matrix Mult}
\begin{block}

Theorem \label{Matrix Mult} %\cite{12}

Let A, B and C be any matrices of approriate sizes.\\
\rm $\left(\textbf{a}\right)$ \it $A(BC)=(AB)C$ \\
\rm $\left(\textbf{b}\right)$ \it$(A+B)C=AC+BC$ \\
\rm $\left(\textbf{c}\right)$ \it$C(A+B)=CA+CB$.
\end{block}
\end{frame}
\pause

\begin{frame}
\begin{block}{Definition} %\cite{12}
If $A=[a_{ij}]$ and $r$ is a scalar, then the \textbf{scalar multiplication} is
define as $rA=[ra_{ij}]$.
\end{block}
\end{frame}
\pause

\begin{frame}
\begin{example} \label{}
Let \[A=\left[\begin{array}{cc} 2&-3\\ -4&2\\ \end{array}\right] \qquad
\text{and}\qquad r=-2.\]
Then \[rA=-2 \left[\begin{array}{cc} 2&-3\\ -4&2\\ \end{array}\right]=
\left[\begin{array}{cc} -2(2)&-2(3)\\ -2(-4)&-2(2)\\
\end{array}\right] =\left[\begin{array}{cc} -4&6\\ 8&-4\\ \end{array}\right].\]
\end{example}
\end{frame}

\section{Chapter 2}
\subsection{Principle of Mathematical Induction (PMI)}

\begin{frame}
\frametitle{Principle of Mathematical Induction (PMI)}
\begin{block}

Theorem %\cite{11}

Let $n_{0} \in \mathbb{N}$ and $P\left(n\right)$ be a statement for each natural
number $n \geq n_{0}$. Suppose that: \pause
\begin{enumerate}
\item $\left(\textbf{1}\right)$ \it $P\left(n_{0}\right)$ is true.
\item $\left(\textbf{2}\right)$ \it For all $k \geq n_{0}$, if $P_{k}$ is
true then $P_{k+1}$ is true. \pause \\
Then $P\left(n\right)$ is true for all $n \geq n_{0}$.
\end{enumerate}
\end{block}
\end{frame}

\section{Chapter 3}
\subsection{Review of Related Literature}
\begin{frame}
\begin{block}

There are many literatures on the study of different number sequences and many
of these sequences were derived directly from \pause elementary matrix algebra.
\pause In 1996 , A.F. Horadam examined the basic properties of Jacobsthal and
Jacobsthal Lucas numbers. Two sequences of numbers, the Jacobsthal and Jacobsthal
Lucas sequences are defined recurrently by

$j_{n}=j_{n-1} + 2j_{n-2}$ \hspace{20mm} $\left(j_{0}=0, j_{1}=1\right)$

$c_{n}=c_{n-1} + 2c_{n-2}$ \hspace{20mm} $\left(c_{0}=2, c_{1}=1\right)$ for any
integer $n\geq2$.

\end{block}
\end{frame}

\begin{frame}
\begin{block}

\pause In 1997, A.F. Horadam also show some basic properties of the Jacobsthal and
Jacobsthal Lucas polynomials which generalize the properties of the corresponding
Jacobsthal and Jacobsthal Lucas numbers.

\pause $j_{n}\left(x\right)=j_{n-1}\left(x\right) + 2 j_{n-2}\left(x\right)$

\hspace{20mm} $\left(j_{0}\left(x\right)=0, j_{1}\left(x\right)=1\right)$
$c_{n}\left(x\right)=c_{n-1}\left(x\right) + 2 c_{n-2}\left(x\right)$ \hspace{20mm}
$\left(c_{0}\left(x\right)=2, c_{1}\left(x\right)=1\right)$ for any integer
$n\geq2$. When $x=1$, we obtain the Jacobsthal and Jacobsthal Lucas numbers.

\end{block}
\end{frame}

\begin{frame}
\begin{block}

\pause In 2008, F. Koken and D. Bozkurt defined a Jacobsthal matrix of the type
$nxn$ and used this matrix to derived
the properties of Jacobsthal numbers.

\pause $F=\left[\begin{array}{cc} 1 & 2 \\ 1 & 0\end{array}\right]$.

From this form, it can be written as

\pause $\left[\begin{array}{c} j_{n+1} \\

j_n\end{array}\right]=F\left[\begin{array}{c} j_n \\ j_{n-1}\end{array}\right]$
and

$\left[\begin{array}{c} c_{n+1} \\ c_n\end{array}\right]=F\left[\begin{array}{c}

c_n \\ c_{n-1}\end{array}\right]$
\pause where they denote the $j_n$ and $c_n$ as the $n$th Jacobsthal and
Jacobsthal-Lucas numbers, respectively.

\end{block}
\end{frame}

\begin{frame}
\begin{block}

\pause Furthermore,
$M=\left[\begin{array}{cc} 3 & 2 \\ 1 & 2\end{array}\right].$ And they proved
that \pause $F^{n} = \left[\begin{array}{cc} j_{n+1} & 2j_{n} \\ j_{n} & 2j_{n-1}
\end{array}\right]$ and $M^{n} = \left[\begin{array}{cc} c_{2n+1} & 2c_{2n} \\
c_{2n} & 2c_{2n-1} \end{array}\right]$.

\pause They obtain the determinants and elements of $F^n$ and $M^n$
and get the Cassini formula for the Jacobsthal and Jacobsthal-Lucas numbers given
by

\pause $j_{n+1}j_{n-1}-j^{2}_{n}= (-1)^n\cdot2^n-1,$

and
$c_{n+1}c_{n-1}-c^{2}_{n}= 3^2\cdot(-1)^n+1\cdot2^n-1.$

\pause In 2008, H. Civciv, and R. Turkmen revealed that number theory and linear
algebra are intertwined to produce complex factorizations
of the classic Fibonacci, Pell, Jacobsthal, and Mersenne numbers and \pause they
also show that a number of properties of the $(s,t)$ Fibonacci and
Lucas sequences can be derived from a matrix representation.

\end{block}
\end{frame}

\begin{frame}
\begin{block}

\pause In the study of K. Uslu and S. Uygun in 2013, they firstly define $(s,t)$-
Jacobsthal and $(s,t)$-Jacobsthal Lucas sequences
then by using this sequences they defined $(s,t)$-Jacobsthal and $(s,t)$-
Jacobsthal-Lucas matrix sequences. After that they examined
the relationships between $\left(s,t\right)$-Jacobsthal and $(s,t)$-Jacobsthal
Lucas matrix sequences.
\end{block}
\end{frame}

\begin{frame}
\begin{block}
\pause In 2015, S. Uygun defined the two sequences namely, $(s,t)$-Jacobsthal and
$(s,t)$-Jacobsthal Lucas sequences in
view of the usual Jacobsthal and Jacobsthal Lucas numbers. After that, he establish
some properties of these
sequences and some important relationships between $(s,t)$-Jacobsthal and $(s,t)$-
Jacobsthal Lucas sequences.
\end{block}
\end{frame}

\begin{frame}
\begin{block}
\pause In this paper, we define $k$-Jacobsthal and $k$-Jacobsthal Lucas sequences,
then by using these sequences, we also define $k$-Jacobsthal and $k$-Jacobsthal
Lucas matrix sequences.
Then we investigate the relationship between $k$-Jacobsthal and $k$-Jacobsthal
Lucas matrix sequences.
\end{block}
\end{frame}

\begin{frame}
\begin{block} {Proof:} \rm For $n$=1, \pause by Definition \ref{J matrix},

${J}_{k,1}=\left(\begin{array}{cc} k & 2 \\ 1 & 0\end{array}\right)$

$= \left[\begin{array}{cc} k & 2\left(1\right) \\ 1 &

2\left(0\right)\end{array}\right]$

$= \left(\begin{array}{cc} \textit{{j}}_{k,2} & 2\textit{{j}}_{k,1} \\

\textit{{j}}_{k,1} & 2\textit{{j}}_{k,0}\end{array}\right)$.

\pause For, by Definition \ref{J sequence},

$j_{k,2}=k$

$j_{k,1}=1$

$j_{k,0}=0$.

\end{block}
\end{frame}

\begin{frame}
\begin{block}

\pause Hence, the statement is true for $n=1$. \pause Now, we assume that the
statement is true for all natural numbers less than or equal to $m$. Particularly,

$\textit{{J}}_{k,m}=\left(\begin{array}{cc} \textit{{j}}_{k,m+1} &

2\textit{{j}}_{k,m} \\ \textit{{j}}_{k,m} & 2\textit{{j}}_{k,m-1}\end{array}\right)
$

$\textit{{J}}_{k,m-1}=\left(\begin{array}{cc} \textit{{j}}_{k,m} &

2\textit{{j}}_{k,m-1} \\ \textit{{j}}_{k,m-1} & 2\textit{{j}}_{k,m-
2}\end{array}\right)$.

\pause We will show that the statement is true for $m+1.$ That is,

$\textit{{J}}_{k,m+1}=\left(\begin{array}{cc} \textit{{j}}_{k,m+2} &

2\textit{{j}}_{k,m+1} \\ \textit{{j}}_{k,m+1} &
2\textit{{j}}_{k,m}\end{array}\right)$.

\end{block}
\end{frame}

\begin{frame}
\begin{block}
\pause Now, by Definition \ref{J matrix} \hspace{0.25mm} $\textit{{J}}_{k,m+1} =
k\textit{{J}}_{k,m} + 2\textit{{J}}_{k,m-1},$ and by using the induction
hypothesis, we have
 $\textit{{J}}_{k,m+1} = k\left(\begin{array}{cc} \textit{{j}}_{k,m+1} &
2\textit{{j}}_{k,m} \\ \textit{{j}}_{k,m} & 2\textit{{j}}_{k,m-1}\end{array}\right)
+ 2\left(\begin{array}{cc} \textit{{j}}_{k,m} & 2\textit{{j}}_{k,m-1} \\
\textit{{j}}_{k,m-1} & 2\textit{{j}}_{k,m-2}\end{array}\right)$

$= \left(\begin{array}{cc} k\textit{{j}}_{k,m+1} & 2k\textit{{j}}_{k,m} \\

k\textit{{j}}_{k,m} & 2k\textit{{j}}_{k,m-1}\end{array}\right) +
\left(\begin{array}{cc} 2\textit{{j}}_{k,m} & 4\textit{{j}}_{k,m-1} \\
2\textit{{j}}_{k,m-1} & 4\textit{{j}}_{k,m-2}\end{array}\right)$

$= \left(\begin{array}{cc} k\textit{{j}}_{k,m+1}+2\textit{{j}}_{k,m} &

2k\textit{{j}}_{k,m}+4\textit{{j}}_{k,m-1} \\ k\textit{{j}}_{k,m}
+2\textit{{j}}_{k,m-1} & 2k\textit{{j}}_{k,m-1}+4\textit{{j}}_{k,m-
2}\end{array}\right).$

\pause But, by Definition \ref{J sequence},

$k\textit{{j}}_{k,m} + 2\textit{{j}}_{k,m-1} = \textit{{j}}_{k,m+1}$

$k\textit{{j}}_{k,m+1} + 2\textit{{j}}_{k,m} = \textit{{j}}_{k,m+2}$

$2\left(k\textit{{j}}_{k,m} + 2\textit{{j}}_{k,m-1}\right) =
2\textit{{j}}_{k,m+1}$

$2\left(k\textit{{j}}_{k,m-1} + 2\textit{{j}}_{k,m-2}\right) = 2\textit{{j}}_{k,m}

$.
\end{block}
\end{frame}

\begin{frame}
\begin{block}
\pause Thus, we have

$\textit{{J}}_{k,m+1} = \left[\begin{array}{cc} \textit{{j}}_{k,m+2} &

2\left(k\textit{{j}}_{k,m} + 2\textit{{j}}_{k,m-1}\right) \\ \textit{{j}}_{k,m+1} &
2\left(k\textit{{j}}_{k,m-1} +2\textit{{j}}_{k,m-2}\right)\end{array}\right]$

$= \left(\begin{array}{cc} \textit{{j}}_{k,m+2} & 2\textit{{j}}_{k,m+1} \\

\textit{{j}}_{k,m+1} & 2\textit{{j}}_{k,m}\end{array}\right).$

\pause Hence, we have shown that

$\textit{{J}}_{k,m+1} = \left(\begin{array}{cc} \textit{{j}}_{k,m+2} &

2\textit{{j}}_{k,m+1} \\ \textit{{j}}_{k,m+1} &
2\textit{{j}}_{k,m}\end{array}\right)$.

By PMI, $\textit{{J}}_{k,n}=\left(\begin{array}{cc} \textit{{j}}_{k,n+1} &

2\textit{{j}}_{k,n} \\ \textit{{j}}_{k,n} & 2\textit{{j}}_{k,n-1}\end{array}\right)
$ $\blacksquare$ %
\end{block}
\end{frame}

\begin{frame}
\begin{block} {Proof:} \rm We will do this by induction on $n$. For $n$=1, by
Theorem \ref{6}

$\textit{{J}}_{k,m+1} = \left(\begin{array}{cc} \textit{{j}}_{k,m+2} &

2\textit{{j}}_{k,m+1} \\ \textit{{j}}_{k,m+1} &
2\textit{{j}}_{k,m}\end{array}\right)$

$= \left(\begin{array}{cc} k\textit{{j}}_{k,m+1} + 2\textit{{j}}_{k,m} &

2\textit{{j}}_{k,m+1} \\ k\textit{{j}}_{k,m}+2\textit{{j}}_{k,m-1} &
2\textit{{j}}_{k,m}\end{array}\right)$

$=\left(\begin{array}{cc} \textit{{j}}_{k,m+1} & 2\textit{{j}}_{k,m} \\

\textit{{j}}_{k,m} & 2\textit{{j}}_{k,m-1}\end{array}\right)\left(\begin{array}{cc}
k & 2 \\ 1 & 0\end{array}\right)$

$= \textit{{J}}_{k,m}\cdot\textit{{J}}_{k,1}$.

\end{block}
\end{frame}

\begin{frame}
\begin{block}
\pause For, by Definition \ref{J matrix} and Theorem \ref{6},

${J}_{k,1}=\left(\begin{array}{cc} k & 2 \\ 1 & 0\end{array}\right)$

$\textit{{J}}_{k,m}=\left(\begin{array}{cc} \textit{{j}}_{k,m+1} &

2\textit{{j}}_{k,m} \\ \textit{{j}}_{k,m} & 2\textit{{j}}_{k,m-1}\end{array}\right)
$.

Hence, the statement holds true for $n=1.$ Now we assume that the statement is
true for all natural numbers less than or equal to $p$. Particularly,

$\textit{{J}}_{k,m+p} = \textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p}$

$\textit{{J}}_{k,m+p-1} = \textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p-1}$.

We will now show that the statement is true for $p+1.$ That is,

$\textit{{J}}_{k,m+p+1} = \textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p+1}.$
By Definition \ref{J matrix} and by the induction hypothesis,

$\textit{{J}}_{k,m+p+1} = k\textit{{J}}_{k,m+p} + 2\textit{{J}}_{k,m+p-1}$

$= k\left(\textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p}\right) +
2\left(\textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p-1}\right)$
 $= \textit{{J}}_{k,m}\left(k\textit{{J}}_{k,p}+2\textit{{J}}_{k,p-1}\right)$

$= \textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p+1}$.

Hence, we have shown that $\textit{{J}}_{k,m+p+1} =

\textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p+1}$.

By PMI, $\textit{{J}}_{m+n} = \textit{{J}}_{k,m}\cdot\textit{{J}}_{k,n}$.

\end{block}
\end{frame}

\begin{frame}
\begin{block}

\pause Furthermore, for $n=1$, by the first part of the Theorem we have

$\textit{{J}}_{k,m}\textit{{J}}_{k,1} = \textit{{J}}_{m+1}$. By Theorem \ref{6}

$\textit{{J}}_{k,m}\cdot\textit{{J}}_{k,1} =\left(\begin{array}{cc}
\textit{{j}}_{k,m+2} & 2\textit{{j}}_{k,m+1} \\ \textit{{j}}_{k,m+1} &
2\textit{{j}}_{k,m}\end{array}\right)$. By Definition \ref{J sequence}

$\textit{{J}}_{k,m}\cdot\textit{{J}}_{k,1} =\left(\begin{array}{cc}
k\textit{{j}}_{k,m+1} + 2\textit{{j}}_{k,m} & 2k\textit{{j}}_{k,m} +
4\textit{{j}}_{k,m-1} \\ \textit{{j}}_{k,m+1} &
2\textit{{j}}_{k,m}\end{array}\right)$

$=\left(\begin{array}{cc} k & 2 \\ 1 & 0\end{array}\right)\left(\begin{array}

{cc} \textit{{j}}_{k,m+1} & 2\textit{{j}}_{k,m} \\ \textit{{j}}_{k,m} &
2\textit{{j}}_{k,m-1}\end{array}\right)$

$=\textit{{J}}_{k,1}\cdot\textit{{J}}_{k,m}$.

Hence, the statement is true for $n=1$. Now, we assume that the statement is true
for all natural numbers less than or equal to $p$. Particularly,

$\textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p}=\textit{{J}}_{k,p}\cdot\textit{{J}}_{k,m
}$

$\textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p-1}=\textit{{J}}_{k,p-
1}\cdot\textit{{J}}_{k,m}$.

\end{block}
\end{frame}

\begin{frame}
\begin{block}
\pause We will now show that the statement is true for $p+1$. That is,
$\textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p+1}=\textit{{J}}_{k,p+1}\cdot\textit{{J}}_
{k,m}$.

By Definition \ref{J matrix} and the induction hypothesis,

$\textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p+1} =
\textit{{J}}_{k,m}\left(k\textit{{J}}_{k,p} + 2\textit{{J}}_{k,p-1}\right)$

$= k\left(\textit{{J}}_{k,p}\cdot\textit{{J}}_{k,m}\right) +
2\left(\textit{{J}}_{k,p-1}\cdot\textit{{J}}_{k,m}\right)$

$= \left(k\textit{{J}}_{k,p}+2\textit{{J}}_{k,p-1}\right)\textit{{J}}_{k,m}$

$= \textit{{J}}_{k,p+1}\textit{{J}}_{k,m}$

\pause Hence, we have shown that $\textit{{J}}_{k,m}\cdot\textit{{J}}_{k,p+1} =

\textit{{J}}_{k,p+1}\cdot\textit{{J}}_{k,m}$.
By PMI, $\textit{{J}}_{k,m}\cdot\textit{{J}}_{k,n} =
\textit{{J}}_{k,n}\cdot\textit{{J}}_{k,m}$ \pause $\blacksquare$ \\
\end{block}
\end{frame}

\begin{frame}
\begin{block} {Proof:} Clearly, equality holds for $n=1$ for $\textit{{J}}_{k,1}
= \left(\textit{{J}}_{k,1}\right)^{1} = \textit{{J}}^{1}_{k,1}.$

Now, assume that the statement is true for all integers less than or equal to $m.$
Particularly, $\textit{{J}}_{k,m} = \left(J_{k,1}\right)^{m} =
\textit{{J}}^{m}_{k,1}$. We will now show that $\textit{{J}}_{k,m+1} =
\textit{{J}}^{m+1}_{k,1}$. By Theorem \ref{7} and the induction hypothesis, we
have

$\textit{{J}}_{k,m+1} = \textit{{J}}_{k,m}\cdot\textit{{J}}_{k,1} =
\textit{{J}}^{m}_{k,1}\cdot\textit{{J}}_{k,1} =
\left(\textit{{J}}_{k,1}\right)^{m+1} = \textit{{J}}^{m+1}_{k,1}.$

By PMI, \hspace{50mm} $\textit{{J}}_{k,n} = \textit{{J}}^{n}_{k,1}$ $\blacksquare$

\end{block}
\end{frame}

\begin{frame}
\begin{block}
\begin{frame}
\begin{block}{Proof:} \rm For $n=1$, by Definition \ref{J Lucas matrix}

${C}_{k,1} = \left(\begin{array}{cc} k^2 +4 & 2k \\ k & 4\end{array}\right)$

$= \left(\begin{array}{cc} k^2 +4 & 2\left(k\right) \\ k & 2\left(2\right)

\end{array}\right)$

$= \left(\begin{array}{cc} {c}_{k,2} & 2{c}_{k,1} \\ {c}_{k,1} & 2{c}_{k,0}

\end{array}\right)$.

For, by Definition \ref{J Lucas sequence},

$\textit{{c}}_{k,2}=k^2 +4$

$\textit{{c}}_{k,1}=k$

$\textit{{c}}_{k,0}=2$.

Hence, the statement is true for $n=1$.

\end{block}
\end{frame}
\pause

\begin{frame}
\begin{block}

\pause Next, assume that the statement is true for all integers less than or equal
to $m.$ Particularly,

${C}_{k,m} = \left(\begin{array}{cc} {c}_{k,m+1} & 2{c}_{k,m} \\ {c}_{k,m} &

2{c}_{k,m-1} \end{array}\right)$

${C}_{k,m-1} = \left(\begin{array}{cc} {c}_{k,m} & 2{c}_{k,m-1} \\ {c}_{k,m-1} &

2{c}_{k,m-2} \end{array}\right)$.

Now, by Definition \ref{J Lucas matrix} and the induction hypothesis, we have

${C}_{k,m+1}=k{C}_{k,m} + 2{C}_{k,m-1}$

$=k\left(\begin{array}{cc} {c}_{k,m+1} & 2{c}_{k,m} \\ {c}_{k,m} & 2{c}_{k,m-1}

\end{array}\right) +2\left(\begin{array}{cc} {c}_{k,m} & 2{c}_{k,m-1} \\ {c}_{k,m-
1} & 2{c}_{k,m-2} \end{array}\right)$

$= \left(\begin{array}{cc} k{c}_{k,m+1} & 2k{c}_{k,m} \\ k{c}_{k,m} & 2k{c}_{k,m-

1} \end{array}\right) + \left(\begin{array}{cc} 2{c}_{k,m} & 4{c}_{k,m-1} \\
2{c}_{k,m-1} & 4{c}_{k,m-2} \end{array}\right)$

$= \left(\begin{array}{cc}k{c}_{k,m+1} + 2{c}_{k,m} & 2k{c}_{k,m} + 4{c}_{k,m-

1} \\ k{c}_{k,m} + 2{c}_{k,m-1} & 2k{c}_{k,m-1} + 4{c}_{k,m-2} \end{array}\right)$.
\end{block}
\end{frame}

\begin{frame}
\begin{block}

\pause But, by Definition \ref{J Lucas sequence}

$k{c}_{k,m} + 2{c}_{k,m-1} = {c}_{k,m+1}$

$k{c}_{k,m+1} + 2{c}_{k,m} = {c}_{k,m+2}$

$2\left(k{c}_{k,m} + 2{c}_{k,m-1}\right) = 2{c}_{k,m+1}$

$2\left(k{c}_{k,m-1} + 2{c}_{k,m-2}\right) = 2{c}_{k,m}$.

Thus, we have

$= \left[\begin{array}{cc} k{c}_{k,m+1} + 2{c}_{k,m} & 2\left(k{c}_{k,m} +

2{c}_{k,m-1}\right) \\ k{c}_{k,m} + 2{c}_{k,m-1} & 2\left(k{c}_{k,m-1} + 2{c}_{k,m-
2}\right)\end{array}\right]$

$= \left(\begin{array}{cc} {c}_{k,m+2} & 2{c}_{k,m+1} \\ {c}_{k,m+1} &

2{c}_{k,m}\end{array}\right).$

Hence, we have shown that ${C}_{k,m+1} = \left(\begin{array}{cc} {c}_{k,m+2} &

2{c}_{k,m+1} \\ {c}_{k,m+1} & {c}_{k,m}\end{array}\right)$.

By PMI, ${C}_{k,n} = \left(\begin{array}{cc} {c}_{k,n+1} & 2{c}_{k,n} \\

{c}_{k,n} & 2{c}_{k,n-1} \end{array}\right)$ \pause $\blacksquare$
\end{block}
\end{frame}

\begin{frame}
\begin{block}{Proof:} \rm For $n=1,$ by Definition \ref{J Lucas matrix}

${C}_{k,1} = \left(\begin{array}{cc} k^2 +4 & 2k \\ k & 4\end{array}\right)$

$= \left(\begin{array}{cc} k^2 & 2k \\ k & 0\end{array}\right) +

\left(\begin{array}{cc} 4 & 0 \\ 0 & 4\end{array}\right)$

$= k\left(\begin{array}{cc} k & 2 \\ 1 & 0\end{array}\right) +

4\left(\begin{array}{cc} 1 & 0 \\ 0 & 1\end{array}\right)$

$= k{J}_{k,1}+4{J}_{k,0}$.
\end{block}
\end{frame}

\begin{frame}
\begin{block}

Now, assume that for some $m \geq 1$, ${C}_{k,m} = k{J}_{k,m}+4{J}_{k,m-1}$. We

want to show that ${C}_{k,m+1} = k{J}_{k,m+1}+4{J}_{k,m}$.

Now, by Theorem \ref{10}

${C}_{k,m+1} = {C}_{k,1}\cdot{J}_{k,m}$.

By the first part of the proof

${C}_{k,m+1} = \left(k{J}_{k,1}+4{J}_{k,0}\right)\cdot{J}_{k,m}$

$= k{J}_{k,1}{J}_{k,m} + 4{J}_{k,0}{J}_{k,m}$.

By Theorem \ref{7}

${C}_{k,m+1} = k{J}_{k,1+m} + 4{J}_{k,0+m}$

$= k{J}_{k,m+1} + 4{J}_{k,m}$. $\blacksquare$

\end{block}
\end{frame}

\begin{frame}
\begin{block}

\begin{frame}
\begin{block}{Proof:} \rm From Theorem \ref{10},

${C}_{k,n+1}={C}_{k,1}\cdot{J}_{k,n}$
and from Theorem \ref{11},
${C}_{k,1}=k{J}_{k,1}+4{J}_{k,0}$. So that

${J}_{k,m}{C}_{k,n+1} = {J}_{k,m}{C}_{k,1}{J}_{k,n}$

$= {J}_{k,m}\left(k{J}_{k,1}+4{J}_{k,0}\right){J}_{k,n}$

$= k{J}_{k,m}{J}_{k,1}{J}_{k,n} + 4{J}_{k,m}{J}_{k,0}{J}_{k,n}$.

\end{block}
\end{frame}
\begin{frame}
\begin{block}

\pause By Theorem \ref{7}

${J}_{k,m}{C}_{k,n+1} = k\left({J}_{k,m+1}\right){J}_{k,n} +
4\left({J}_{k,m+0}\right){J}_{k,n}$

$= k\left({J}_{k,m+1+n}\right) + 4\left({J}_{k,m+n}\right)$

$= k{J}_{k,m+n+1} +4{J}_{k,m+n}$

$= k\left({J}_{k,1}\right){J}_{k,m+n} + 4{J}_{k,0}\left({J}_{k,m+n} \right)$

$= \left[k\left({J}_{k,1}\right)+ 4{J}_{k,0}\right]{J}_{k,m+n}$

$= {C}_{k,1}\left({J}_{k,m+n}\right)$

$= {C}_{k,1}\left({J}_{k,m}\right)\left({J}_{k,n}\right)$

$= {C}_{k,1}{J}_{k,n}{J}_{k,m}$

$= {C}_{k,n+1}{J}_{k,m}$ \pause $\blacksquare$

\end{block}
\end{frame}

\begin{frame}
\begin{block}{Proof:} \rm (i) Note that ${C}^{2}_{k,n+1} =
{C}_{k,n+1}\cdot{C}_{k,n+1}$.
By Theorem \ref{10}

${C}^{2}_{k,n+1}= \left({C}_{k,1}{J}_{k,n}\right)\left({C}_{k,1}{J}_{k,n}\right)$.

By Theorem \ref{Matrix Mult}$\left(a\right)$

${C}^{2}_{k,n+1} = \left({C}_{k,1}\right)\left({J}_{k,n}{C}_{k,1}\right){J}_{k,n}
$.

By Theorem \ref{12}

${C}^{2}_{k,n+1} = \left({C}_{k,1}\right)\left({C}_{k,1}{J}_{k,n}\right){J}_{k,n}$

$= \left({C}_{k,1}{C}_{k,1}\right)\left({J}_{k,n}{J}_{k,n}\right)$

$= {C}^{2}_{k,1}\left({J}_{k,n+n}\right)$

$= {C}^{2}_{k,1}{J}_{k,2n}$

\end{block}
\end{frame}

\begin{frame}
\begin{block}

(ii) From (i), we have

${C}^{2}_{k,n+1} = {C}^{2}_{k,1}{J}_{k,2n}$

$= \left({C}_{k,1}{C}_{k,1}\right)\left({J}_{k,2n}\right)$.

By Theorem \ref{Matrix Mult}$\left(a\right)$

${C}^{2}_{k,n+1} = \left({C}_{k,1}\right)\left({C}_{k,1}{J}_{k,2n}\right)$.

By Theorem \ref{10}

${C}^{2}_{k,n+1} = \left({C}_{k,1}\right)\left({C}_{k,2n+1}\right)$
\end{block}
\end{frame}

\begin{frame}
\begin{block}

(iii) From Theorem \ref{10},${C}_{k,n+1}={C}_{k,1}{J}_{k,n}$ so that

${C}_{k,2n+1} = {C}_{k,1}{J}_{k,2n}$

$= {C}_{k,1}{J}_{k,n+n}$. By Theorem \ref{7}

${C}_{k,2n+1} = {C}_{k,1}\left({J}_{k,n}{J}_{k,n}\right)$.

By Theorem \ref{Matrix Mult} $\left(a\right)$

${C}_{k,2n+1} = \left({C}_{k,1}\cdot{J}_{k,n}\right)\left({J}_{k,n}\right)$.

${C}_{k,2n+1}= \left({C}_{k,n+1}\right){J}_{k,n}$.

By Theorem \ref{12}

${C}_{k,2n+1} = \left({J}_{k,n}\right)\left({C}_{k,n+1}\right)$ \pause

$\blacksquare$

\end{block}
\end{frame}

\begin{frame}
\begin{block}

\begin{frame}
\begin{block}{Proof:} \rm (i) From the initial condition of Definition \ref{J Lucas
matrix}
${C}_{k,1}=\left(\begin{array}{cc} k^2+4 & 2k \\ k & 4\end{array}\right)$, from
Theorem \ref{6}

$\textit{{J}}_{k,2n}=\left(\begin{array}{cc} \textit{{j}}_{k,2n+1} &

2\textit{{j}}_{k,2n} \\ \textit{{j}}_{k,2n} & 2\textit{{j}}_{k,2n-
1}\end{array}\right)$ and from Theorem \ref{9}

${C}_{k,n+1} = \left(\begin{array}{cc} {c}_{k,n+2} & 2{c}_{k,n+1} \\ {c}_{k,n+1} &

2{c}_{k,n} \end{array}\right)$.

\end{block}
\end{frame}

\begin{frame}

\pause Hence, from Theorem \ref{13}(i),

${C}^{2}_{k,n+1} = {C}^{2}_{k,1}\cdot{J}_{k,2n}$

$\left(\begin{array}{cc} {c}_{k,n+2} & 2{c}_{k,n+1} \\ {c}_{k,n+1} & 2{c}_{k,n}

\end{array}\right)^{2} = \left(\begin{array}{cc} k^2+4 & 2k \\ k &
4\end{array}\right)^{2}\left(\begin{array}{cc} {j}_{k,2n+1} & 2{j}_{k,2n} \\
{j}_{k,2n} & 2{j}_{k,2n-1} \end{array}\right)$

\end{frame}

\begin{frame}

$\left(\begin{array}{cc} {c}_{k,n+2} & 2{c}_{k,n+1} \\ {c}_{k,n+1} & 2{c}_{k,n}

\end{array}\right)\left(\begin{array}{cc} {c}_{k,n+2} & 2{c}_{k,n+1} \\ {c}_{k,n+1}
& 2{c}_{k,n} \end{array}\right) = \left(\begin{array}{cc} k^2+4 & 2k \\ k &
4\end{array}\right)\left(\begin{array}{cc} k^2+4 & 2k \\ k &
4\end{array}\right)\left(\begin{array}{cc} {j}_{k,2n+1} & 2{j}_{k,2n} \\ {j}_{k,2n}
& 2{j}_{k,2n-1} \end{array}\right)$

$= \left(\begin{array}{cc} k^{4}+10k^{2}+16 & 2k^{3}+16k \\ k^{3}+8k &

2k^{2}+16\end{array}\right)\left(\begin{array}{cc} {j}_{k,2n+1} & 2{j}_{k,2n} \\
{j}_{k,2n} & 2{j}_{k,2n-1} \end{array}\right)$

$\left[\begin{array}{cc} {c}^{2}_{k,n+2}+2{c}^{2}_{k,n+1} &

{c}_{k,n+2}\left(2{c}_{k,n+1}\right)+2{c}_{k,n+1}\left(2{c}_{k,n}\right) \\
{c}_{k,n+1}\left({c}_{k,n+2}\right)+2{c}_{k,n}\left({c}_{k,n+1}\right) &
2{c}^{2}_{k,n+1}+4{c}^{2}_{k,n} \end{array}\right] = \left[\begin{array}{cc}
\left(k^{4}+10k^{2}+16\right){j}_{k,2n+1}+\left(2k^{3}+16k\right){j}_{k,2n} &
\left(k^{4}+10k^{2}+16\right)2{j}_{k,2n}+\left(2k^{3}+16k\right)2{j}_{k,2n-1} \\
\left(k^{3}+8k\right){j}_{k,2n+1}+\left(2k^{2}+16\right){j}_{k,2n} &
\left(k^{3}+8k\right)2{j}_{k,2n}+\left(2k^{2}+16\right)2{j}_{k,2n-
1}\end{array}\right].$
\end{frame}

\begin{frame}

\pause This implies that

${c}^{2}_{k,n+2}+2{c}^{2}_{k,n+1} = \left(k^{4}+10k^{2}+16\right)
{j}_{k,2n+1}+\left(2k^{3}+16k\right){j}_{k,2n}$

$= k^{4}{j}_{k,2n+1}+10k^{2}{j}_{k,2n+1}+16{j}_{k,2n+1}+2k^{3}{j}_{k,2n}
+16k{j}_{k,2n}$

$= k^{4}{j}_{k,2n+1}+2k^{3}{j}_{k,2n}+10k^{2}{j}_{k,2n+1}+16k{j}_{k,2n}
+16{j}_{k,2n+1}$

$= k^{3}\left(k{j}_{k,2n+1}+2{j}_{k,2n}\right)+\left(8k^{2}+2k^{2}\right)
{j}_{k,2n+1}+16k{j}_{k,2n}+16{j}_{k,2n+1}$

$= k^{3}\left(k{j}_{k,2n+1}+2{j}_{k,2n}\right)+8k^{2}{j}_{k,2n+1}+2k^{2}
{j}_{k,2n+1}+16k{j}_{k,2n}+16{j}_{k,2n+1}$

$= k^{3}\left(k{j}_{k,2n+1}+2{j}_{k,2n}\right)+8k^{2}{j}_{k,2n+1}+16k{j}_{k,2n}
+2k^{2}{j}_{k,2n+1}+16{j}_{k,2n+1}$

$= k^{3}\left(k{j}_{k,2n+1}+2{j}_{k,2n}\right)
+8k\left(k{j}_{k,2n+1}+2{j}_{k,2n}\right)+2k^{2}{j}_{k,2n+1}+16{j}_{k,2n+1}.$

\end{frame}

\begin{frame}

\pause Note that from Definition \ref{J sequence},

${j}_{k,2n} = k{j}_{k,2n-1}+2{j}_{k,2n-2},$

${j}_{k,2n+1} = k{j}_{k,2n}+2{j}_{k,2n-1},$

${j}_{k,2n+2} = k{j}_{k,2n+1}+2{j}_{k,2n},$

${j}_{k,2n+3} = k{j}_{k,2n+2}+2{j}_{k,2n+1}$.

\pause It follows that,

${c}^{2}_{k,n+2}+2{c}^{2}_{k,n+1} = k^{3}\left({j}_{k,2n+2}\right)
+8k\left({j}_{k,2n+2}\right)+2k^{2}{j}_{k,2n+1}+16{j}_{k,2n+1}$

$= k^{3}\left({j}_{k,2n+2}\right)+8k\left({j}_{k,2n+2}\right)
+2\left(k^{2}+8\right){j}_{k,2n+1}$
 $= \left[k^{3}\left({j}_{k,2n+2}\right)+8k\left({j}_{k,2n+2}\right)\right]
+2\left(k^{2}+8\right){j}_{k,2n+1}$

$= \left(k^{3}+8k\right){j}_{k,2n+2}+2\left(k^{2}+8\right){j}_{k,2n+1}$

$= k\left(k^{2}+8\right){j}_{k,2n+2}+2\left(k^{2}+8\right){j}_{k,2n+1}$

$= \left(k^{2}+8\right)\left(k{j}_{k,2n+2}+2{j}_{k,2n+1}\right)$

$= \left(k^{2}+8\right)\left({j}_{k,2n+3}\right).$

\end{frame}

\begin{frame}

\pause Therefore,

${c}^{2}_{k,n+2}+2{c}^{2}_{k,n+1} = \left(k^{2}+8\right)\cdot{j}_{k,2n+3}.$

(ii) From Definition \ref{J Lucas matrix}

${C}_{k,1} = \left(\begin{array}{cc} k^2+4 & 2k \\ k & 4\end{array}\right)$

and from Theorem \ref{9},

${C}_{k,n+1} = \left(\begin{array}{cc} {c}_{k,n+2} & 2{c}_{k,n+1} \\ {c}_{k,n+1} &

2{c}_{k,n} \end{array}\right)$ and ${C}_{k,2n+1} = \left(\begin{array}{cc}
{c}_{k,2n+2} & 2{c}_{k,2n+1} \\ {c}_{k,2n+1} & 2{c}_{k,2n} \end{array}\right)$.

\end{frame}

\begin{frame}

\pause Hence by Theorem \ref{13}(ii)

${C}^{2}_{k,n+1} = {C}_{k,1}\cdot{C}_{k,2n+1}$

$\left(\begin{array}{cc} {c}_{k,n+2} & 2{c}_{k,n+1} \\ {c}_{k,n+1} & 2{c}_{k,n}

\end{array}\right)^{2} = \left(\begin{array}{cc} k^2+4 & 2k \\ k &
4\end{array}\right)\left(\begin{array}{cc} {c}_{k,2n+2} & 2{c}_{k,2n+1} \\
{c}_{k,2n+1} & 2{c}_{k,2n} \end{array}\right)$

$\left(\begin{array}{cc} {c}_{k,n+2} & 2{c}_{k,n+1} \\ {c}_{k,n+1} & 2{c}_{k,n}

\end{array}\right)\left(\begin{array}{cc} {c}_{k,n+2} & 2{c}_{k,n+1} \\ {c}_{k,n+1}
& 2{c}_{k,n} \end{array}\right) = \left(\begin{array}{cc} k^2+4 & 2k \\ k &
4\end{array}\right)\left(\begin{array}{cc} {c}_{k,2n+2} & 2{c}_{k,2n+1} \\
{c}_{k,2n+1} & 2{c}_{k,2n} \end{array}\right)$

$\left[\begin{array}{cc} {c}^{2}_{k,n+2}+2{c}^{2}_{k,n+1} &

{c}_{k,n+2}\left(2{c}_{k,n+1}\right)+2{c}_{k,n+1}\left(2{c}_{k,n}\right) \\
{c}_{k,n+1}\left({c}_{k,n+2}\right)+2{c}_{k,n}\left({c}_{k,n+1}\right) &
2{c}^{2}_{k,n+1}+4{c}^{2}_{k,n} \end{array}\right] = \vspace{1.25mm}
\left[\begin{array}{cc} \left(k^{2}+4\right)\left({c}_{k,2n+2}\right)
+2k\left({c}_{k,2n+1}\right) & \left(k^{2}+4\right)\left(2{c}_{k,2n+1}\right)
+2k\left(2{c}_{k,2n}\right) \\ k\left({c}_{k,2n+2}\right)
+4\left({c}_{k,2n+1}\right) & k\left(2{c}_{k,2n+1}\right)
+4\left(2{c}_{k,2n}\right)\end{array}\right]$
\end{frame}

\begin{frame}
${c}^{2}_{k,n+2}+2{c}^{2}_{k,n+1} = \left(k^{2}+4\right)
{c}_{k,2n+2}+\left(2k\right){c}_{k,2n+1}$

$= k^{2}{c}_{k,2n+2}+4{c}_{k,2n+2}+2k{c}_{k,2n+1}$

$= k^{2}{c}_{k,2n+2}+2k{c}_{k,2n+1}+4{c}_{k,2n+2}$

$= k\left(k{c}_{k,2n+2}+2{c}_{k,2n+1}\right)+\left(2+2\right){c}_{k,2n+2}$

\end{frame}

\begin{frame}

\pause From Definition \ref{J Lucas sequence},

${c}_{k,2n+3} = k{c}_{k,2n+2}+2{c}_{k,2n+1}$,

${c}_{k,2n+4} = k{c}_{k,2n+3}+2{c}_{k,2n+2}$.

It follows that,

${c}^{2}_{k,n+2}+2{c}^{2}_{k,n+1} = k{c}_{k,2n+3}+2{c}_{k,2n+2}+2{c}_{k,2n+2}$

$= {c}_{k,2n+4}+2{c}_{k,2n+2}.$

Therefore,

${c}^{2}_{k,n+2}+2{c}^{2}_{k,n+1} = {c}_{k,2n+4}+2{c}_{k,2n+2}.$

\end{frame}

\begin{frame}

\pause (iii) From Theorem \ref{6},

${J}_{k,n-1} = \left(\begin{array}{cc} {j}_{k,n} & 2{j}_{k,n-1} \\ {j}_{k,n-1} &

2{j}_{k,n-2} \end{array}\right)$

and from Theorem \ref{10}

${C}_{k,n} = \left(\begin{array}{cc} {c}_{k,n+1} & 2{c}_{k,n} \\ {c}_{k,n} &

2{c}_{k,n-1} \end{array}\right)$ and ${C}_{k,2n} = \left(\begin{array}{cc}
{c}_{k,2n+1} & 2{c}_{k,2n} \\ {c}_{k,2n} & 2{c}_{k,2n-1} \end{array}\right)$.

It follows from Theorem \ref{13}(iii) that ${C}_{k,2n} = {J}_{k,n-1}{C}_{k,n}$,

so that

$\left(\begin{array}{cc} {c}_{k,2n+1} & 2{c}_{k,2n} \\ {c}_{k,2n} & 2{c}_{k,2n-

1} \end{array}\right) = \left(\begin{array}{cc} {j}_{k,n} & 2{j}_{k,n-1} \\
{j}_{k,n-1} & 2{j}_{k,n-2} \end{array}\right)\left(\begin{array}{cc} {c}_{k,n+1} &
2{c}_{k,n} \\ {c}_{k,n} & 2{c}_{k,n-1} \end{array}\right)$

$= \left[\begin{array}{cc} {j}_{k,n}\left({c}_{k,n+1}\right)+2{j}_{k,n-
1}\left({c}_{k,n}\right) & {j}_{k,n}\left(2{c}_{k,n}\right)+2{j}_{k,n-
1}\left(2{c}_{k,n-1}\right) \\ {j}_{k,n-1}\left({c}_{k,n+1}\right)+2{j}_{k,n-
2}\left({c}_{k,n}\right) & {j}_{k,n-1}\left(2{c}_{k,n}\right)+2{j}_{k,n-
2}\left(2{c}_{k,n-1}\right) \end{array}\right]$.

\pause Therefore,

${c}_{k,2n+1} = {j}_{k,n}\left({c}_{k,n+1}\right) + 2{j}_{k,n-

1}\left({c}_{k,n}\right)$,
$= {j}_{k,n}{c}_{k,n+1} + 2{c}_{k,n}{j}_{k,n-1}$ \pause $\blacksquare$

\end{frame}

\begin{frame}
{Proof:} From Theorem \ref{6},

${J}_{k,n} = \left(\begin{array}{cc} {j}_{k,n+1} & 2{j}_{k,n} \\ {j}_{k,n} &

2{j}_{k,n-1} \end{array}\right)$.

By Definition \ref{J sequence}

${J}_{k,n} = \left(\begin{array}{cc} k{j}_{k,n}+2{j}_{k,n-1} & 2{j}_{k,n} \\

{j}_{k,n} & 2{j}_{k,n-1} \end{array}\right)$.

By Lemma \ref{4}
${J}_{k,n} = \left[\begin{array}{cc} k\left(\frac{r^{n}_{1}-r^{n}_{2}}{r_{1}-
r_{2}}\right)+2\left(\frac{r^{n-1}_{1}-r^{n-1}_{2}}{r_{1}-r_{2}}\right) &
2\left(\frac{r^{n}_{1}-r^{n}_{2}}{r_{1}-r_{2}}\right) \\ \left(\frac{r^{n}_{1}-
r^{n}_{2}}{r_{1}-r_{2}}\right) & 2\left(\frac{r^{n-1}_{1}-r^{n-1}_{2}}{r_{1}-
r_{2}}\right) \end{array}\right]$
 $= \frac{1}{r_{1}-r_{2}}\left[\begin{array}{cc} k\left(r^{n}_{1}-
r^{n}_{2}\right)-\left(-2\right)\left(r^{n-1}_{1}-r^{n-1}_{2}\right) &
2\left(r^{n}_{1}-r^{n}_{2}\right) \\ r^{n}_{1}-r^{n}_{2} & 2\left(r^{n-1}_{1}-r^{n-
1}_{2}\right)\end{array}\right]$.
\end{frame}

\begin{frame}
Since $r_{1}r_{2}=-2$

${J}_{k,n} = \frac{1}{r_{1}-r_{2}}\left[\begin{array}{cc} k\left(r^{n}_{1}-

r^{n}_{2}\right)-r_{1}r_{2}\left(r^{n-1}_{1}-r^{n-1}_{2}\right) & 2\left(r^{n}_{1}-
r^{n}_{2}\right) \\ r^{n}_{1}-r^{n}_{2} & 2\left(r^{n-1}_{1}-r^{n-
1}_{2}\right)\end{array}\right]$

$= \frac{1}{r_{1}-r_{2}}\left[\begin{array}{cc} kr^{n}_{1}-kr^{n}_{2}-
r_{2}r^{n}_{1}+r_{1}r^{n}_{2} & 2r^{n}_{1}-2r^{n}_{2} \\ r^{n}_{1}-r^{n}_{2} &
-\left(-2\right)\left(r^{n-1}_{1}-r^{n-1}_{2}\right) \end{array}\right]$.

For $r_{1}r_{2}=-2$

${J}_{k,n} = \frac{1}{r_{1}-r_{2}}\left[\begin{array}{cc} kr^{n}_{1}-

r_{2}r^{n}_{1}-kr^{n}_{2}+r_{1}r^{n}_{2} & 2r^{n}_{1}-2r^{n}_{2} \\ r^{n}_{1}-
r^{n}_{2} & -r_{1}r_{2}\left(r^{n-1}_{1}-r^{n-1}_{2}\right) \end{array}\right]$

\end{frame}

\begin{frame}

\pause $= \frac{1}{r_{1}-r_{2}}\left[\begin{array}{cc} r^{n}_{1}\left(k-

r_{2}\right)-r^{n}_{2}\left(k-r_{1}\right) & 2r^{n}_{1}-2r^{n}_{2} \\ r^{n}_{1}-
r^{n}_{2} & -r_{2}r^{n}_{1}+r_{1}r^{n}_{2} \end{array}\right]$

$= \frac{1}{r_{1}-r_{2}}\left[\begin{array}{cc} \left(\begin{array}{cc}
r^{n}_{1}\left(k-r_{2}\right) & 2r^{n}_{1} \\ r^{n}_{1} & -r_{2}r^{n}_{1}
\end{array}\right)-\left(\begin{array}{cc} r^{n}_{2}\left(k-r_{1}\right) &
2r^{n}_{2} \\ r^{n}_{2} & -r_{1}r^{n}_{2} \end{array}\right)\end{array}\right]$

$= \frac{1}{r_{1}-r_{2}}\left[\begin{array}{cc} r^{n}_{1}\left(\begin{array}
{cc}k-r_{2} & 2 \\ 1 & -r_{2} \end{array}\right)-r^{n}_{2}\left(\begin{array}{cc}
k-r_{1} & 2 \\ 1 & -r_{1} \end{array}\right)\end{array}\right]$

$= \frac{r^{n}_{1}}{r_{1}-r_{2}}\left(\begin{array}{cc} k-r_{2} & 2 \\ 1 &

-r_{2} \end{array}\right)-\left(\begin{array}{cc} k-r_{1} & 2 \\ 1 & -r_{1}
\end{array}\right)\frac{r^{n}_{2}}{r_{1}-r_{2}}$
\end{frame}

\begin{frame}
 $= \frac{r^{n}_{1}}{r_{1}-r_{2}}\left[\left(\begin{array}{cc} k & 2 \\ 1 & 0
\end{array}\right)-\left(\begin{array}{cc} r_{2} & 0 \\ 0 & r_{2}
\end{array}\right)\right]-\left[\left(\begin{array}{cc} k & 2 \\ 1 & 0
\end{array}\right)-\left(\begin{array}{cc} r_{1} & 0 \\ 0 & r_{1}
\end{array}\right)\right]\frac{r^{n}_{2}}{r_{1}-r_{2}}$

$= \frac{r^{n}_{1}}{r_{1}-r_{2}}\left[\left(\begin{array}{cc} k & 2 \\ 1 & 0

\end{array}\right)-r_{2}\left(\begin{array}{cc} 1 & 0 \\ 0 & 1
\end{array}\right)\right]-\left[\left(\begin{array}{cc} k & 2 \\ 1 & 0
\end{array}\right)-r_{1}\left(\begin{array}{cc} 1 & 0 \\ 0 & 1
\end{array}\right)\right]\frac{r^{n}_{2}}{r_{1}-r_{2}}$

$= \frac{r^{n}_{1}}{r_{1}-r_{2}}\left({J}_{k,1}-r_{2}
{J}_{k,0}\right)-\left({J}_{k,1}-r_{1}{J}_{k,0}\right)\frac{r^{n}_{2}}{r_{1}-r_{2}}
$

$= \left(\frac{{J}_{k,1}-r_{2}{J}_{k,0}}{r_{1}-
r_{2}}\right)r^{n}_{1}-\left(\frac{{J}_{k,1}-r_{1}{J}_{k,0}}{r_{1}-
r_{2}}\right)r^{n}_{2}$ \pause $\blacksquare$

\end{frame}