TOPICS
Search

Search Results for ""


2021 - 2030 of 3946 for complex functionSearch Results
Let sumu_k be a series with positive terms and let f(x) be the function that results when k is replaced by x in the formula for u_k. If f is decreasing and continuous for ...
A bijective map between two metric spaces that preserves distances, i.e., d(f(x),f(y))=d(x,y), where f is the map and d(a,b) is the distance function. Isometries are ...
Knuth's series is given by S = sum_(k=1)^(infty)((k^k)/(k!e^k)-1/(sqrt(2pik))) (1) = -2/3-1/(sqrt(2pi))zeta(1/2) (2) = -0.08406950872765599646... (3) (OEIS A096616), where ...
Levenberg-Marquardt is a popular alternative to the Gauss-Newton method of finding the minimum of a function F(x) that is a sum of squares of nonlinear functions, ...
The Longuet-Higgins circle is the radical circle of the circles centered at the vertices A, B, and C of a reference triangle with respective radii b+c, c+a, and a+b. Its ...
The function defined by y=ks^xb^(q^x) which is used in actuarial science for specifying a simplified mortality law (Kenney and Keeping 1962, pp. 241-242). Using s(x) as the ...
The word "median" has several different meanings in mathematics all related to the "middle" of mathematical objects. The statistical median is an order statistic that gives ...
A nonnegative function g(x,y) describing the "distance" between neighboring points for a given set. A metric satisfies the triangle inequality g(x,y)+g(y,z)>=g(x,z) (1) and ...
A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...
Let g(x_1,...,x_n,y) be a function such that for any x_1, ..., x_n, there is at least one y such that g(x_1,...,x_n,y)=0. Then the mu-operator muy(g(x_1,...,x_n,y)=0) gives ...
1 ... 200|201|202|203|204|205|206 ... 395 Previous Next

...