Search Results for ""

The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...

Given a system of ordinary differential equations of the form d/(dt)[x; y; v_x; v_y]=-[0 0 -1 0; 0 0 0 -1; Phi_(xx)(t) Phi_(yx)(t) 0 0; Phi_(xy)(t) Phi_(yy)(t) 0 0][x; y; ...

The values of -d for which imaginary quadratic fields Q(sqrt(-d)) are uniquely factorable into factors of the form a+bsqrt(-d). Here, a and b are half-integers, except for ...

For every dimension n>0, the orthogonal group O(n) is the group of n×n orthogonal matrices. These matrices form a group because they are closed under multiplication and ...

The Meijer G-function is a very general function which reduces to simpler special functions in many common cases. The Meijer G-function is defined by (1) where Gamma(s) is ...

Let B_t={B_t(omega)/omega in Omega}, t>=0, be one-dimensional Brownian motion. Integration with respect to B_t was defined by Itô (1951). A basic result of the theory is that ...

A pair of closed form functions (F,G) is said to be a Wilf-Zeilberger pair if F(n+1,k)-F(n,k)=G(n,k+1)-G(n,k). (1) The Wilf-Zeilberger formalism provides succinct proofs of ...

An almost unit is a nonunit in the integral domain of formal power series with a nonzero first coefficient, P=a_1x+a_2x^2+..., where a_1!=0. Under the operation of ...

A solution to a problem that can be written in "closed form" in terms of known functions, constants, etc., is often called an analytic solution. Note that this use of the ...

A number of the form p^a·A is said to be an antisquare if it fails to be a square number for the two reasons that a is odd and A is a nonsquare (modulo p). The first few ...