TOPICS
Search

Search Results for ""


671 - 680 of 1245 for transfer caseSearch Results
Suppose that f is an analytic function which is defined in the upper half-disk {|z|^2<1,I[z]>0}. Further suppose that f extends to a continuous function on the real axis, and ...
The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...
The Legendre polynomials, sometimes called Legendre functions of the first kind, Legendre coefficients, or zonal harmonics (Whittaker and Watson 1990, p. 302), are solutions ...
Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...
Calculus of variations can be used to find the curve from a point (x_1,y_1) to a point (x_2,y_2) which, when revolved around the x-axis, yields a surface of smallest surface ...
The permutation symbol (Evett 1966; Goldstein 1980, p. 172; Aris 1989, p. 16) is a three-index object sometimes called the Levi-Civita symbol (Weinberg 1972, p. 38; Misner et ...
Szemerédi's theorem states that every sequence of integers that has positive upper Banach density contains arbitrarily long arithmetic progressions. A corollary states that, ...
Given two intersecting lines or line segments, the amount of rotation about the point of intersection (the vertex) required to bring one into correspondence with the other is ...
The Dirichlet eta function is the function eta(s) defined by eta(s) = sum_(k=1)^(infty)((-1)^(k-1))/(k^s) (1) = (1-2^(1-s))zeta(s), (2) where zeta(s) is the Riemann zeta ...
The double factorial of a positive integer n is a generalization of the usual factorial n! defined by n!!={n·(n-2)...5·3·1 n>0 odd; n·(n-2)...6·4·2 n>0 even; 1 n=-1,0. (1) ...
1 ... 65|66|67|68|69|70|71 ... 125 Previous Next

...