Search Results for ""

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).

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.

Consider the family of ellipses (x^2)/(c^2)+(y^2)/((1-c)^2)-1=0 (1) for c in [0,1]. The partial derivative with respect to c is -(2x^2)/(c^3)+(2y^2)/((1-c)^3)=0 (2) ...

A factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...

The first quadratic nonresidue mod p of a number is always less than 3(lnp)^2/2 (Wedeniwski 2001).

The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.