Search Results for ""

The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas ...

In order to integrate a function over a complicated domain D, Monte Carlo integration picks random points over some simple domain D^' which is a superset of D, checks whether ...

Let T(x,y,z) be the number of times "otherwise" is called in the TAK function, then the Takeuchi numbers are defined by T_n(n,0,n+1). A recursive formula for T_n is given by ...

Church proved several important theorems that now go by the name Church's theorem. One of Church's theorems states that there is no consistent decidable extension of Peano ...

Consider a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then the Herbrand universe H of S is defined by the following rules. 1. All constants ...

A moment mu_n of a probability function P(x) taken about 0, mu_n^' = <x^n> (1) = intx^nP(x)dx. (2) The raw moments mu_n^' (sometimes also called "crude moments") can be ...

A moment mu_n of a univariate probability density function P(x) taken about the mean mu=mu_1^', mu_n = <(x-<x>)^n> (1) = int(x-mu)^nP(x)dx, (2) where <X> denotes the ...

Dawson's integral (Abramowitz and Stegun 1972, pp. 295 and 319), also sometimes called Dawson's function, is the entire function given by the integral F(x) = ...

A power series in a variable z is an infinite sum of the form sum_(i=0)^inftya_iz^i, where a_i are integers, real numbers, complex numbers, or any other quantities of a given ...

A recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of recurrence relation, the entire class of objects can ...