Search Results for ""

An algorithm which allows digits of a given number to be calculated without requiring the computation of earlier digits. The BBP formula for pi is the best-known such ...

For n a positive integer, expressions of the form sin(nx), cos(nx), and tan(nx) can be expressed in terms of sinx and cosx only using the Euler formula and binomial theorem. ...

There are several closely related results that are variously known as the binomial theorem depending on the source. Even more confusingly a number of these (and other) ...

The axiom of Zermelo-Fraenkel set theory which asserts the existence for any set a and a formula A(y) of a set x consisting of all elements of a satisfying A(y), exists x ...

A transformation formula for continued fractions (Lorentzen and Waadeland 1992) which can, for example, be used to prove identities such as ...

Erdős offered a $3000 prize for a proof of the proposition that "If the sum of reciprocals of a set of integers diverges, then that set contains arbitrarily long arithmetic ...

The extended mean-value theorem (Anton 1984, pp. 543-544), also known as the Cauchy mean-value theorem (Anton 1984, pp. 543) and Cauchy's mean-value formula (Apostol 1967, p. ...

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

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