\section{The certificate}\label{bapp:sec} Table~\ref{bapp:table} has one row for each of the $231$ orders of Lemma~\ref{b9:list}, except $3062$. A row gives: \begin{condlist}{(6)} \item[\textup{(1)}] the order $n$; \item[\textup{(2)}] its type: P if $n$ is a prime, Q if $n$ is a prime power and not a prime, D if $n=2p$, T if $n=3p$, with a prime $p$; \item[\textup{(3)}] an integer $c$, a unit modulo $n$; \item[\textup{(4)}] the order $\ord_n(c)$ of $c$ in $\units{n}$; \item[\textup{(5)}] the prime factorization of $\ord_n(c)$; \item[\textup{(6)}] for every prime divisor $q$ of $\ord_n(c)$, in the form ``$q$: residue'', the integer from $0$ to $n-1$ in the class of $c^{\ord_n(c)/q}$ modulo $n$. \end{condlist} In every row $c^{\ord_n(c)}=1$ modulo $n$. Lemma~\ref{b9:rows} says what the rows prove. \begingroup\small\makeatletter \begin{longtable}{@{}r@{\qquad}c@{\qquad}r@{\qquad}r@{\qquad}l@{\qquad}l@{}} \caption{The certificate: $230$ rows.}\label{bapp:table}\\ \hline $n$ & type & $c$ & $\ord_n(c)$ & prime factorization & $q$: $c^{\ord_n(c)/q}$ modulo $n$\\ \hline \endfirsthead \hline $n$ & type & $c$ & $\ord_n(c)$ & prime factorization & $q$: $c^{\ord_n(c)/q}$ modulo $n$\\ \hline \endhead \hline \endfoot \@@input BApp_rows.tex \end{longtable} \endgroup \subsection{The verification procedure}\label{bapp:procedure} Table~\ref{bapp:table} is a part of the proof of Theorem~\ref{b0:main}. Its content is a finite list of equations and inequalities of integers. The following procedure checks all of them. It uses integer arithmetic only: trial division, greatest common divisors, and powers modulo $n$ by repeated squaring. No graph is enumerated. \begin{condlist}{(V4)} \item[\textup{(V1)}] \emph{The list of the orders} \textup{(}Lemma~\ref{b9:list}\textup{)}. For every $n$ from $3024$ to $3998$, decide by trial division whether $n$ is a prime, a prime power, twice a prime or three times a prime. The numbers that are found must be the $230$ numbers of the rows and $3062$: together $231$ numbers. \item[\textup{(V2)}] \emph{The data of a row} \textup{(}Lemma~\ref{b9:rows}~(a),~(c)\textup{)}. For every row: the type is the type of $n$; the factors in column~\textup{(5)} are primes, and their product is $\ord_n(c)$; $\gcd(c,n)=1$; $|c|\ge 55$ and $54\,|c|+54