Search Results for ""

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...

A Poulet number is a Fermat pseudoprime to base 2, denoted psp(2), i.e., a composite number n such that 2^(n-1)=1 (mod n). The first few Poulet numbers are 341, 561, 645, ...

A quartic nonhamiltonian graph is a quartic graph that is nonhamiltonian. A number of such graphs are illustrated above. Van Cleemput and Zamfirescu (2018) gave a 39-vertex ...

A regular patch is a patch x:U->R^n for which the Jacobian J(x)(u,v) has rank 2 for all (u,v) in U. A patch is said to be regular at a point (u_0,v_0) in U provided that its ...

By a suitable rearrangement of terms, a conditionally convergent series may be made to converge to any desired value, or to diverge. For example, S = 1-1/2+1/3-1/4+1/5+... ...

In a noncommutative ring R, a right ideal is a subset I which is an additive subgroup of R and such that for all r in R and all a in I, ar in I. (1) For all a in R, the set ...

Let E be a Euclidean space, (beta,alpha) be the dot product, and denote the reflection in the hyperplane P_alpha={beta in E|(beta,alpha)=0} by ...

When computing the sample variance s numerically, the mean must be computed before s^2 can be determined. This requires storing the set of sample values. However, it is ...

A conformal mapping from the upper half-plane to a polygon.

A root-finding algorithm which assumes a function to be approximately linear in the region of interest. Each improvement is taken as the point where the approximating line ...