Search Results for ""

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...

Brown numbers are pairs (m,n) of integers satisfying the condition of Brocard's problem, i.e., such that n!+1=m^2 where n! is the factorial and m^2 is a square number. Only ...

The algorithm for the construction of a Gröbner basis from an arbitrary ideal basis. Buchberger's algorithm relies on the concepts of S-polynomial and polynomial reduction ...

An algorithm which finds rational function extrapolations of the form R_(i(i+1)...(i+m))=(P_mu(x))/(P_nu(x))=(p_0+p_1x+...+p_mux^mu)/(q_0+q_1x+...+q_nux^nu) and can be used ...

In Note M, Burnside (1955) states, "The contrast that these results shew between groups of odd and of even order suggests inevitably that simple groups of odd order do not ...

A coordinate system obtained by inversion of the bicyclide coordinates. They are given by the transformation equations x = Lambda/(aUpsilon)snmudnnucospsi (1) y = ...

A dimension also called the fractal dimension, Hausdorff dimension, and Hausdorff-Besicovitch dimension in which nonintegral values are permitted. Objects whose capacity ...

A coordinate system (mu,nu,psi) defined by the coordinate transformation x = (munu)/((mu^2+nu^2)^2)cospsi (1) y = (munu)/((mu^2+nu^2)^2)sinpsi (2) z = ...

Assume that f is a nonnegative real function on [0,infty) and that the two integrals int_0^inftyx^(p-1-lambda)[f(x)]^pdx (1) int_0^inftyx^(q-1+mu)[f(x)]^qdx (2) exist and are ...

If f(z) is regular and of the form O(e^(k|z|)) where k<pi, for R[z]>=0, and if f(z)=0 for z=0, 1, ..., then f(z) is identically zero.