Editing Toom–Cook multiplication (section)

=== Toom-1 ===
Applying formally the definition, we may consider Toom-1 (''k''<sub>''m''</sub> = ''k''<sub>''n''</sub> = 1). This does not yield a multiplication algorithm, but a recursive algorithm that never halts, as it trivially reduces each input instance to a recursive call with the same instance. The algorithm requires 1 evaluation point, whose value is irrelevant, as it is used only to "evaluate" constant polynomials. Thus, the interpolation matrix is the identity matrix:

: <math>\left(\begin{matrix}1\end{matrix}\right)^{-1} = 
\left(\begin{matrix}1\end{matrix}\right).</math>