<div>Some of the most important matrices that are used in number theory are known as the adjacency matrix and the transition matrix. An adjacency matrix is given by the vertices of that matrix and is labeled with a&nbsp;<span class="ltx_Math" contenteditable="false" data-equation="0">\(0\)</span>&nbsp;or&nbsp;<span class="ltx_Math" contenteditable="false" data-equation="1">\(1\)</span>&nbsp;depending on its adjacency. The way we label such a vertex with its adjacency is by <span class="ltx_Math" contenteditable="false" data-equation="\left(i,j\right)">\(\left(i,j\right)\)</span>, where&nbsp;<span class="ltx_Math" contenteditable="false" data-equation="i">\(i\)</span>&nbsp;is the row while&nbsp;<span class="ltx_Math" contenteditable="false" data-equation="j">\(j\)</span>&nbsp;is the column. Adjacency matrices can also be used to find the number of walks between vertices. To show this we raise our matrix to the <span class="ltx_Math" contenteditable="false" data-equation="L">\(L\)</span>, where&nbsp;<span class="ltx_Math" contenteditable="false" data-equation="L">\(L\)</span>&nbsp;is the length of the walk and read off the matrix as&nbsp;<span class="ltx_Math" contenteditable="false" data-equation="\left(i,j\right)">\(\left(i,j\right)\)</span>.&nbsp;<br></div>