\section{The problem and the results}\label{sec:intro} To a word of $k$ digits in base $B\ge2$ associate \begin{equation}\label{eq:digits} P(X)=\sum_{i=0}^{k-1}d_iX^i,\quad 0\le d_i\le B-1,\qquad N=P(B),\quad N^{\rm rev}=B^{k-1}P(B^{-1}). \end{equation} The coefficient $d_0$ is the least significant digit; displayed words are read from the most significant digit. For $t\ge3$, the numerical modulus is always the full integer $Q=\Phi_t(B)$. \begin{definition} A \emph{false positive} is a word for which $Q$ divides both $N$ and $N^{\rm rev}$, but $\Phi_t(X)$ does not divide $P(X)$. Let $K_t(B)$ be the first length of a false positive. \end{definition} Palindromes and leading zeros are allowed. We prove that $K_t(B)$ exists and that minimum words have nonzero end digits. Thus the maximum safe length is $K_t(B)-1$. Let $\mathcal D_{B,k}$ be the coefficient box in \eqref{eq:digits}, and set \[ \mathcal E_{B,t}(P)=(P(B),P(B^{-1}))\pmod Q. \] The inverse of $B$ modulo $Q$ exists by Lemma~\ref{lem:endpoints}. Our question is exactness of the zero fibre under coefficient constraints: \begin{equation}\label{eq:zero-fibre-exactness} \mathcal D_{B,k}\cap\ker\mathcal E_{B,t} =\mathcal D_{B,k}\cap(\Phi_t) \quad\Longleftrightarrow\quad k1. \end{cases} \end{equation} \begin{theorem}[Explicit slopes]\label{thm:slopes} For every fixed $t\ge3$, \[ K_t(B)=t\mu_t(B)B+O_t(1). \] More precisely, with $D=B-1$, $E=2^w-1$, and $U_t(B)=\lfloor\mu_t(B)(B+1)^2+E\rfloor$, \begin{equation}\label{eq:slope-bounds} t\bigl(\lceil\mu_t(B)D\rceil-1\bigr)+1 \ \le K_t(B)\le\ t\left\lceil\frac{U_t(B)}D\right\rceil. \end{equation} \end{theorem} The error is bounded over all bases at fixed order. When $\delta_t(B)$ changes, no single limit of $K_t(B)/B$ is asserted. Let $R_t$ be the integer root matrix in the tensor basis constructed in \S\ref{sec:slopes}. Let $L_t$ be the least common multiple of the absolute values of its nonzero square minors, including 1. Set \begin{equation}\label{eq:rho} \rho_t=\begin{cases} 2,&t=2^a,\ a\ge2,\\ p,&t=p^a,\ p\text{ odd prime},\\ 2p,&t=2p^a,\ p\text{ odd prime},\\ 2^{w-1},&\text{otherwise}. \end{cases} \end{equation} \begin{theorem}[Effective finite description]\label{thm:effective} One can compute a cutoff $C_t$ and rational numbers $b_{t,j}$, $0\le j