Search Results for ""

An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...

The number 163 is very important in number theory, since d=163 is the largest number such that the imaginary quadratic field Q(sqrt(-d)) has class number h(-d)=1. It also ...

A procedure for finding the quadratic factors for the complex conjugate roots of a polynomial P(x) with real coefficients. (1) Now write the original polynomial as ...

If there is an integer x such that x^4=q (mod p), then q is said to be a biquadratic residue (mod p). If not, q is said to be a biquadratic nonresidue (mod p).

In Homogeneous coordinates (x_1,x_2,x_3), the equation of a circle C is a(x_1^2+x_2^2)+2fx_2x_3+2gx_1x_3+cx_3^2=0. The discriminant of this circle is defined as Delta=|a 0 g; ...

For any ideal I in a Dedekind ring, there is an ideal I_i such that II_i=z, (1) where z is a principal ideal, (i.e., an ideal of rank 1). Moreover, for a Dedekind ring with a ...

An entire Cremona transformation is a birational transformation of the plane. Cremona transformations are maps of the form x_(i+1) = f(x_i,y_i) (1) y_(i+1) = g(x_i,y_i), (2) ...

A cubic equation is an equation involving a cubic polynomial, i.e., one of the form a_3x^3+a_2x^2+a_1x+a_0=0. Since a_3!=0 (or else the polynomial would be quadratic and not ...

If there is an integer x such that x^3=q (mod p), then q is said to be a cubic residue (mod p). If not, q is said to be a cubic nonresidue (mod p).

An algebraic surface which can be represented implicitly by a polynomial of degree 10 in x, y, and z. An example is the Barth decic.