Search Results for ""

The amazing polynomial identity communicated by Euler in a letter to Goldbach on April 12, 1749 (incorrectly given as April 15, 1705--before Euler was born--in Conway and Guy ...

If f(x) is positive and decreases to 0, then an Euler constant gamma_f=lim_(n->infty)[sum_(k=1)^nf(k)-int_1^nf(x)dx] can be defined. For example, if f(x)=1/x, then ...

A global maximum, also known as an absolute maximum, the largest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

A global minimum, also known as an absolute minimum, is the smallest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

Every graph with n vertices and maximum vertex degree Delta(G)<=k is (k+1)-colorable with all color classes of size |_n/(k+1)_| or [n/(k+1)], where |_x_| is the floor ...

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

Let f:R->R, then the negative part of f is the function f^-:R->R defined by f^-(x)=max(-f(x),0). Note that the negative part is itself a nonnegative function. The negative ...

The angular position of a quantity. For example, the phase of a function cos(omegat+phi_0) as a function of time is phi(t)=omegat+phi_0. The complex argument of a complex ...

Given a function f specified by parametric variables u_1, ..., u_n, a reparameterization f^^ of f over domain U is a change of variables u_i in U->v_i->V via a function phi ...

For a given bounded function f(x) over a partition of a given interval, the upper sum is the sum of box areas M^*Deltax_k using the supremum M of the function f(x) in each ...