Search Results for ""

A method for finding recurrence relations for hypergeometric polynomials directly from the series expansions of the polynomials. The method is effective and easily ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

Let I be a set, and let U be an ultrafilter on I, let phi be a formula of a given language L, and let {A_i:i in I} be any collection of structures which is indexed by the set ...

There are at least two meanings of the term "total derivative" in mathematics. The first is as an alternate term for the convective derivative. The total derivative is the ...

A method of numerically integrating ordinary differential equations by using a trial step at the midpoint of an interval to cancel out lower-order error terms. The ...

A cubic polynomial is a polynomial of degree 3. A univariate cubic polynomial has the form f(x)=a_3x^3+a_2x^2+a_1x+a_0. An equation involving a cubic polynomial is called a ...

The Hurwitz zeta function zeta(s,a) is a generalization of the Riemann zeta function zeta(s) that is also known as the generalized zeta function. It is classically defined by ...

The set of terms of first-order logic (also known as first-order predicate calculus) is defined by the following rules: 1. A variable is a term. 2. If f is an n-place ...

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...

The Kepler-Poinsot polyhedra are four regular polyhedra which, unlike the Platonic solids, contain intersecting facial planes. In addition, two of the four Kepler-Poinsot ...