Search Results for ""

A linear transformation between two vector spaces V and W is a map T:V->W such that the following hold: 1. T(v_1+v_2)=T(v_1)+T(v_2) for any vectors v_1 and v_2 in V, and 2. ...

A Steiner quadruple system is a Steiner system S(t=3,k=4,v), where S is a v-set and B is a collection of k-sets of S such that every t-subset of S is contained in exactly one ...

A sequence of functions {f_n}, n=1, 2, 3, ... is said to be uniformly convergent to f for a set E of values of x if, for each epsilon>0, an integer N can be found such that ...

A uniform distribution, sometimes also known as a rectangular distribution, is a distribution that has constant probability. The probability density function and cumulative ...

Given a function f(x)=f_0(x), write f_1=f^'(x) and define the Sturm functions by f_n(x)=-{f_(n-2)(x)-f_(n-1)(x)[(f_(n-2)(x))/(f_(n-1)(x))]}, (1) where [P(x)/Q(x)] is a ...

The continuous Fourier transform is defined as f(nu) = F_t[f(t)](nu) (1) = int_(-infty)^inftyf(t)e^(-2piinut)dt. (2) Now consider generalization to the case of a discrete ...

The factorial n! is defined for a positive integer n as n!=n(n-1)...2·1. (1) So, for example, 4!=4·3·2·1=24. An older notation for the factorial was written (Mellin 1909; ...

Given a sequence of values {a_k}_(k=1)^n, the high-water marks are the values at which the running maximum increases. For example, given a sequence (3,5,7,8,8,5,7,9,2,5) with ...

An algorithm similar to Neville's algorithm for constructing the Lagrange interpolating polynomial. Let f(x|x_0,x_1,...,x_k) be the unique polynomial of kth polynomial order ...

A Belphegor prime (also known as a Beelphegor prime) is a prime Belphegor number, i.e., a palindromic prime of the form 1(0...)666(0...)1. The first few Belphegor primes are ...