🤖 AI Summary
This study addresses the problem of computing the integer $e$-th root $\lfloor N^{1/e} \rfloor$ of a non-negative integer $N$ using only integer arithmetic, without floating-point operations or division. The authors propose a unified digit-by-digit construction framework grounded in the binomial theorem and invariant-based reasoning, which guarantees algorithmic termination, correctness of intermediate results, and enables perfect power detection. A key contribution is a constructive correctness theory proving that each digit in the square root case ($e=2$) is determined precisely and irrevocably during computation. The work further establishes that stable digit-by-digit extraction is feasible only for $e=2$; for higher-degree roots, nonlinear coupling among digits precludes such stability. The method is well-suited for symbolic computation, verified arithmetic, educational contexts, and hardware implementation.
📝 Abstract
We present a unified constructive digit-by-digit framework for exact root extraction using only integer arithmetic. The core contribution is a complete correctness theory for the fractional square root algorithm, proving that each computed decimal digit is exact and final, together with a sharp truncation error bound of $10^{-k}$ after $k$ digits. We further develop an invariant-based framework for computing the integer $e$-th root $\lfloor N^{1/e} \rfloor$ of a non-negative integer $N$ for arbitrary fixed exponents $e \ge 2$, derived directly from the binomial theorem. This method generalizes the classical long-division square root algorithm, preserves a constructive remainder invariant throughout the computation, and provides an exact decision procedure for perfect $e$-th power detection. We also explain why exact digit-by-digit fractional extraction with non-revisable digits is structurally possible only for square roots ($e=2$), whereas higher-order roots ($e \ge 3$) exhibit nonlinear coupling that prevents digit stability under scaling. All proofs are carried out in a constructive, algorithmic manner consistent with Bishop-style constructive mathematics, yielding explicit algorithmic witnesses, decidable predicates, and guaranteed termination. The resulting algorithms require no division or floating-point operations and are well suited to symbolic computation, verified exact arithmetic, educational exposition, and digital hardware implementation.