All Gaussian integers on such a line are integer multiples of some Gaussian integer "h". Algebraic numbers are those that are a solution to a polynomial equation with integer coefficients. This results in an algorithm that uses only integer arithmetic. The number can be any nonnegative integer. The case of polynomials with integer coefficients is fundamental for computer algebra. This asymmetry is analogous to the one between integer factorization and integer multiplication. Likewise, for any nonnegative integer . I has instructions for signed and unsigned integer multiplication and division. Python provides a codice 129 function for rounding a float to the nearest integer. Every odd integer exceeding 1 is trivially a nontotient. For sums involving the zeta-function at integer and half-integer values, see rational zeta series. They exploited a weakness unique to cryptosystems based on integer factorization. The function rounds to the nearest integer. The function formula 30 rounds to the nearest integer. At the poles at every negative integer, phase and amplitude are not defined.