Search Results for ""

Faà di Bruno's formula gives an explicit equation for the nth derivative of the composition f(g(t)). If f(t) and g(t) are functions for which all necessary derivatives are ...

Gauss's continued fraction is given by the continued fraction ...

Gauss's forward formula is f_p=f_0+pdelta_(1/2)+G_2delta_0^2+G_3delta_(1/2)^3+G_4delta_0^4+G_5delta_(1/2)^5+..., (1) for p in [0,1], where delta is the central difference and ...

Consider a clause (disjunction of literals) obtained from those of a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then an atomic statement ...

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 ...

The Kreisel conjecture is a conjecture in proof theory that postulates that, if phi(x) is a formula in the language of arithmetic for which there exists a nonnegative integer ...

Let ||f|| be the supremum of |f(x)|, a real-valued function f defined on (0,infty). If f is twice differentiable and both f and f^('') are bounded, Landau (1913) showed that ...

The Löwenheim-Skolem theorem is a fundamental result in model theory which states that if a countable theory has a model, then it has a countable model. Furthermore, it has a ...

A modification of Legendre's formula for the prime counting function pi(x). It starts with |_x_| = (1) where |_x_| is the floor function, P_2(x,a) is the number of integers ...

The number of multisets of length k on n symbols is sometimes termed "n multichoose k," denoted ((n; k)) by analogy with the binomial coefficient (n; k). n multichoose k is ...