Search Results for ""

A divisor, also called a factor, of a number n is a number d which divides n (written d|n). For integers, only positive divisors are usually considered, though obviously the ...

erf(z) is the "error function" encountered in integrating the normal distribution (which is a normalized form of the Gaussian function). It is an entire function defined by ...

The sum-of-factorial powers function is defined by sf^p(n)=sum_(k=1)^nk!^p. (1) For p=1, sf^1(n) = sum_(k=1)^(n)k! (2) = (-e+Ei(1)+pii+E_(n+2)(-1)Gamma(n+2))/e (3) = ...

A Fibonacci prime is a Fibonacci number F_n that is also a prime number. Every F_n that is prime must have a prime index n, with the exception of F_4=3. However, the converse ...

The finite difference is the discrete analog of the derivative. The finite forward difference of a function f_p is defined as Deltaf_p=f_(p+1)-f_p, (1) and the finite ...

The floor function |_x_|, also called the greatest integer function or integer value (Spanier and Oldham 1987), gives the largest integer less than or equal to x. The name ...

Seeks to obtain the best numerical estimate of an integral by picking optimal abscissas x_i at which to evaluate the function f(x). The fundamental theorem of Gaussian ...

The great rhombicuboctahedron (Cundy and Rowlett 1989, p. 106) is the 26-faced Archimedean solid consisting of faces 12{4}+8{6}+6{8}. It is sometimes called the ...

Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...

A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian ...