Search Results for ""

Let E_1(x) be the En-function with n=1, E_1(x) = int_1^infty(e^(-tx)dt)/t (1) = int_x^infty(e^(-u)du)/u. (2) Then define the exponential integral Ei(x) by E_1(x)=-Ei(-x), (3) ...

There are essentially three types of Fisher-Tippett extreme value distributions. The most common is the type I distribution, which are sometimes referred to as Gumbel types ...

The falling factorial (x)_n, sometimes also denoted x^(n__) (Graham et al. 1994, p. 48), is defined by (x)_n=x(x-1)...(x-(n-1)) (1) for n>=0. Is also known as the binomial ...

The Fano plane is the configuration consisting of the two-dimensional finite projective plane over GF(2) ("of order two"), illustrated above. It is a block design with nu=7, ...

A Fermat pseudoprime to a base a, written psp(a), is a composite number n such that a^(n-1)=1 (mod n), i.e., it satisfies Fermat's little theorem. Sometimes the requirement ...

A Ferrers diagram represents partitions as patterns of dots, with the nth row having the same number of dots as the nth term in the partition. The spelling "Ferrars" (Skiena ...

There are two theorems commonly known as Feuerbach's theorem. The first states that circle which passes through the feet of the perpendiculars dropped from the polygon ...

The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...

A figurate number, also (but mostly in texts from the 1500 and 1600s) known as a figural number (Simpson and Weiner 1992, p. 587), is a number that can be represented by a ...

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