Search Results for ""

_2F_1(a,b;c;1)=((c-b)_(-a))/((c)_(-a))=(Gamma(c)Gamma(c-a-b))/(Gamma(c-a)Gamma(c-b)) for R[c-a-b]>0, where _2F_1(a,b;c;x) is a (Gauss) hypergeometric function. If a is a ...

The grouping of data into bins (spaced apart by the so-called class interval) plotting the number of members in each bin versus the bin number. The above histogram shows the ...

A type of number involving the roots of unity which was developed by Kummer while trying to solve Fermat's last theorem. Although factorization over the integers is unique ...

Divide a set of data into two groups (high and low) of equal size at the statistical median if there is an even number of data points, or two groups consisting of points on ...

The Jackson-Slater identity is the q-series identity of Rogers-Ramanujan-type given by sum_(k=0)^(infty)(q^(2k^2))/((q)_(2k)) = ...

A nonnegative measurable function f is called Lebesgue integrable if its Lebesgue integral intfdmu is finite. An arbitrary measurable function is integrable if f^+ and f^- ...

A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...

n vectors X_1, X_2, ..., X_n are linearly dependent iff there exist scalars c_1, c_2, ..., c_n, not all zero, such that sum_(i=1)^nc_iX_i=0. (1) If no such scalars exist, ...

An n-step Lucas sequence {L_k^((n))}_(k=1)^infty is defined by letting L_k^((n))=-1 for k<0, L_0^((n))=n, and other terms according to the linear recurrence equation ...

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...