Search Results for ""
4361 - 4370 of 9727 for Numbered Equation 2Search Results
For some constant alpha_0, alpha(f,z)<alpha_0 implies that z is an approximate zero of f, where alpha(f,z)=(|f(z)|)/(|f^'(z)|)sup_(k>1)|(f^((k))(z))/(k!f^'(z))|^(1/(k-1)). ...
The backward difference is a finite difference defined by del _p=del f_p=f_p-f_(p-1). (1) Higher order differences are obtained by repeated operations of the backward ...
A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...
Given any open set U in R^n with compact closure K=U^_, there exist smooth functions which are identically one on U and vanish arbitrarily close to U. One way to express this ...
As defined by Kyrmse, a canonical polygon is a closed polygon whose vertices lie on a point lattice and whose edges consist of vertical and horizontal steps of unit length or ...
The chi distribution with n degrees of freedom is the distribution followed by the square root of a chi-squared random variable. For n=1, the chi distribution is a ...
The term "continuum" has (at least) two distinct technical meanings in mathematics. The first is a compact connected metric space (Kuratowski 1968; Lewis 1983, pp. 361-394; ...
Let {a_n} be a nonnegative sequence and f(x) a nonnegative integrable function. Define A_n = sum_(k=1)^(n)a_k (1) B_n = sum_(k=n)^(infty)a_k (2) and F(x) = int_0^xf(t)dt (3) ...
A graph G is said to be disconnected if it is not connected, i.e., if there exist two nodes in G such that no path in G has those nodes as endpoints. The numbers of ...
A right triangle whose legs are in the ratio 2:1 is sometimes known as a "dom," a name derived from "half a domino." The name was suggested by Andrew Clarke and preferred in ...
...
View search results from all Wolfram sites (480708 matches)

