However, this is not a polynomial time algorithm because the number of digits in the solution may be as large as √"n", far larger than a polynomial in the number of digits in the input value "n" .
Metoda se vedno konča z rešitvijo, kar je dokazal Lagrange leta 1768.