Search Results for ""

A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...

The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...

Given a set of n men and n women, marry them off in pairs after each man has ranked the women in order of preference from 1 to n, {w_1,...,w_n} and each women has done ...

The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...

If M^n is a finite simplicial complex of dimension n>=5 that has the homotopy type of the sphere S^n and is locally piecewise linearly homeomorphic to the Euclidean space ...

Consider the sample standard deviation s=sqrt(1/Nsum_(i=1)^N(x_i-x^_)^2) (1) for n samples taken from a population with a normal distribution. The distribution of s is then ...

A standard normal distribution is a normal distribution with zero mean (mu=0) and unit variance (sigma^2=1), given by the probability density function and distribution ...

Stanley and Wilf conjectured (Bona 1997, Arratia 1999), that for every permutation pattern sigma, there is a constant c(sigma)<infty such that for all n, ...

Given n points, find the line segments with the shortest possible total length which connect the points. The segments need not necessarily be straight from one point to ...

A figurate number of the form StOct_n = O_n+8Te_(n-1) (1) = n(2n^2-1), (2) where O_n is an octahedral number and Te_n is a tetrahedral number. The first few are 1, 14, 51, ...