\section{The orders from \texorpdfstring{$3024$}{3024} to \texorpdfstring{$3998$}{3998}}\label{b9:sec} By Corollary~\ref{b8:coarse}, what is left for the orders $n$ from $3024$ to $3998$ are the cyclic groups $\Z_n$ with $n$ a prime power, $n=2p$ or $n=3p$. For all but one of these $n$, a row of Table~\ref{bapp:table} in the appendix gives a good unit of large order. The table is a part of the proof. Its rows have a \emph{type}: P if $n$ is a prime, Q if $n$ is a prime power and not a prime, D if $n=2p$, and T if $n=3p$, with a prime $p$. \begin{lemma}[The list of the orders]\label{b9:list} Exactly $231$ integers $n$ with $3024\le n\le 3998$ are a prime power, or twice a prime, or three times a prime. They are the $230$ numbers $n$ of the rows of Table~\textup{\ref{bapp:table}} and the number $3062=2\cdot 1531$. \end{lemma} \begin{proof} This is a finite computation: step \textup{(V1)} of the procedure of Section~\ref{bapp:procedure}. Every integer $n\le 3998$ that is not a prime has a prime factor $q$ with $q^{2}\le n<64^{2}$, so $q\le 61$. Hence trial division by the primes up to $61$ decides which $n$ are primes; the same for $n/2$ and $n/3$. The prime powers in the interval that are not primes are $3125$, $3481$ and $3721$, by Lemma~\ref{b8:powers}. \end{proof} \begin{lemma}[The rows of the certificate]\label{b9:rows} In every row of Table~\textup{\ref{bapp:table}}: \begin{condlist}{(c)} \item[\textup{(a)}] the class of $c$ is a good unit of $\Z_n$; \item[\textup{(b)}] the order of $c$ in $\units{n}$ is the number $\ord_n(c)$ of the row; \item[\textup{(c)}] $\ord_n(c)\ge 486$ if the type is P or Q, $\ord_n(c)\ge 252$ if the type is D, and $\ord_n(c)\ge 324$ if the type is T. \end{condlist} \end{lemma} \begin{proof} \textup{(a)} In every row except the row $n=3079$: $\gcd(c,n)=1$, $|c|\ge 55$ and $54\,|c|+541531$. \textup{(1)} \emph{Good units.} The numbers $55$ and $-55$ are coprime to $3062$, and $3062>54\cdot 55+54=3024$. By Lemma~\ref{b3:G5} the classes of $55$ and of $-55$ are good units of $\Z_{3062}$. So $K$ is not empty. Let $M_0$ be the subgroup of $\units{3062}$ that $-55$ generates. It is a subset of $M$. \textup{(2)} \emph{$M_0$ has $90$ elements.} By the Chinese remainder theorem, the reduction modulo $1531$ is an isomorphism of $\units{3062}$ onto $\units{1531}$, because $1$ is the only unit modulo $2$. We compute modulo $1531$: \[ 55^{45}=1,\qquad 55^{15}=884,\qquad 55^{9}=1218 . \] The prime divisors of $45$ are $3$ and $5$, and $45/3=15$, $45/5=9$. So the order of $55$ is $45$. Let $j$ be the order of $-55$. Then $55^{2j}=(-55)^{2j}=1$, so $45$ divides $2j$; since $45$ is odd, $45$ divides $j$. And $(-55)^{90}=1$, so $j$ divides $90$. Since $(-55)^{45}=-1\ne 1$, we get $j=90$. \textup{(3)} \emph{Cosets and $90$th powers.} $\Z_{1531}$ is a field. Every element of the image of $M_0$ modulo $1531$ is a root of the polynomial $X^{90}-1$. This polynomial has at most $90$ roots, and the image has $90$ elements. So the image of $M_0$ is the set of all roots. Hence, for integers $w$, $w'$ that are not divisible by $1531$: \[ w\,w'^{-1}\ \text{is in the image of } M_0\quad\Longleftrightarrow\quad w^{90}=w'^{\,90}\ \text{modulo } 1531 . \] Since $90$ is even, $(-w)^{90}=w^{90}$. \textup{(4)} \emph{Two tables.} All entries are classes modulo $1531$. \begin{table}[H] \centering \small\setlength{\tabcolsep}{3.5pt} \begin{tabular}{@{}l|rrrrrrrrrrrrrr@{}} \hline $w$ & $1$ & $3$ & $5$ & $7$ & $9$ & $11$ & $13$ & $15$ & $17$ & $19$ & $21$ & $23$ & $25$ & $27$\\ $w^{90}$ & $1$ & $1288$ & $63$ & $1497$ & $871$ & $1288$ & $1009$ & $1$ & $1156$ & $1288$ & $607$ & $45$ & $907$ & $1156$\\ \hline \end{tabular} \vspace{4pt} \caption{The $90$th powers modulo $1531$ of the odd numbers from $1$ to $27$.}\label{b9:tab:odd} \end{table} \begin{table}[H] \centering \small\setlength{\tabcolsep}{3.5pt} \begin{tabular}{@{}l|rrrrrrrrrrrrr@{}} \hline $w$ & $1$ & $2$ & $3$ & $4$ & $5$ & $6$ & $7$ & $8$ & $9$ & $10$ & $11$ & $12$ & $13$\\ $w^{90}$ & $1$ & $502$ & $1288$ & $920$ & $63$ & $494$ & $1497$ & $1009$ & $871$ & $1006$ & $1288$ & $1497$ & $1009$\\ \hline \end{tabular} \vspace{4pt} \caption{The $90$th powers modulo $1531$ of the numbers from $1$ to $13$.}\label{b9:tab:half} \end{table} In Table~\ref{b9:tab:odd} no value occurs more than three times \textup{(}$1288$ occurs for $w=3$, $11$, $19$\textup{)}. In Table~\ref{b9:tab:half} no value occurs more than twice. The entries of the two tables and the three powers of $55$ in \textup{(2)} are checked by step \textup{(V4)} of the procedure of Section~\ref{bapp:procedure}. \textup{(5)} \emph{The hit bound.} Let $z\ne 0$ be an element of $\Z_{3062}$. We show that at most $6$ elements $c$ of $M_0$ have $cz$ in $S_0$. As in Section~\ref{b6:sec}, such a $c$ is a \emph{hit}, and it has $cz=w$ for an integer $w$ with $1\le|w|\le 27$, its \emph{target}. Take an integer in the class $z$ and call it $z$ again. \emph{Let $z$ be a unit.} Then different hits have different targets, and every target is a unit, so it is odd. Let $c$, $c'$ be hits with the targets $w$, $w'$. Then $w\,w'^{-1}=c\,c'^{-1}$ is in $M_0$. By \textup{(3)}, $w^{90}=w'^{\,90}$ modulo $1531$. So all targets $w$ of hits have the same value $|w|^{90}$ modulo $1531$. By Table~\ref{b9:tab:odd}, at most three odd numbers from $1$ to $27$ have this value. With the two signs there are at most $6$ targets, and at most $6$ hits. \emph{Let $z$ be even and not divisible by $1531$.} Write $z=2z'$; then $z'$ is not divisible by $1531$. Let $c$ be a hit with the target $w$. Then $w=cz$ modulo $3062$ is even: $w=2w'$ with $1\le|w'|\le 13$. And $3062$ divides $2\,(cz'-w')$, so $cz'=w'$ modulo $1531$. Different hits are different modulo $1531$, by \textup{(2)}; so they have different numbers $w'$. For two hits $c$, $c_1$ with the numbers $w'$, $w'_1$ we get $w'\,w_1'^{-1}=c\,c_1^{-1}$ modulo $1531$, in the image of $M_0$. By \textup{(3)} and Table~\ref{b9:tab:half}, at most two numbers from $1$ to $13$ can occur as $|w'|$. So there are at most $4$ hits. \emph{Let $z$ be divisible by $1531$.} For a unit $c$, the class $cz$ is a multiple of $1531$ and not $0$; so $cz=1531$ in $\Z_{3062}$. This class is not in $S_0$, because $27<1531<3062-27$. There is no hit. \textup{(6)} \emph{Conclusion.} By \textup{(5)}, the number $b_0=6$ has the property \textup{(i)} of Definition~\ref{b4:scaleset} for $M_0$, and $|M_0|=90\ge 54=9\,b_0$. So $M_0$ is a scale set for $n=3062$. Theorem~\ref{b5:product} gives the proposition. \end{proof} \subsection*{Proof of Theorem~\ref{b0:main}}\label{b9:proofmain} Let $\Gam$ be a finite abelian group of order $n\ge 3024$, and $G$ a finite bridgeless multigraph. If $n\ge 3999$, Proposition~\ref{b8:3999} applies. Let $3024\le n\le 3998$. By Corollary~\ref{b8:coarse}, $\Fl(G,\Gam)$ is connected, except possibly if $\Gam=\Z_n$ and $n$ is a prime power, $n=2p$ or $n=3p$. By Lemma~\ref{b9:list}, such an $n$ is $3062$ or a number of a row of Table~\ref{bapp:table}. Then Proposition~\ref{b9:3062} or Proposition~\ref{b9:interval}, with the trivial group $A'$, says that $\Fl(G,\Z_n)$ is connected. \qed