Search Results for ""

A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...

A second-order algebraic surface given by the general equation (1) Quadratic surfaces are also called quadrics, and there are 17 standard-form types. A quadratic surface ...

Let (a)_i be a sequence of complex numbers and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as f_(nk)=(product_(j=k)^(n-1)(a_j+k))/((n-k)!) and ...

Faà di Bruno's formula gives an explicit equation for the nth derivative of the composition f(g(t)). If f(t) and g(t) are functions for which all necessary derivatives are ...

A quadratic form Q(x) is indefinite if it is less than 0 for some values and greater than 0 for others. The quadratic form, written in the form (x,Ax), is indefinite if ...

A binary quadratic form is a quadratic form in two variables having the form Q(x,y)=ax^2+2bxy+cy^2, (1) commonly denoted <a,b,c>. Consider a binary quadratic form with real ...

For a quadratic form Q in the canonical form Q=y_1^2+y_2^2+...+y_p^2-y_(p+1)^2-y_(p+2)^2-...-y_r^2, the rank is the total number r of square terms (both positive and ...

A quadratic field Q(sqrt(D)) with D>0.

A quadratic recurrence is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a second-degree polynomial in x_k with k<n. For example, x_n=x_(n-1)x_(n-2) ...

In his famous paper of 1859, Riemann stated that the number N(T) of Riemann zeta function zeros sigma+it with 0<t<=T is asymptotically given by ...