Search Results for ""

The 6.1.2 equation A^6=B^6+C^6 (1) is a special case of Fermat's last theorem with n=6, and so has no solution. No 6.1.n solutions are known for n<=6 (Lander et al. 1967; Guy ...

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...

For a bivariate normal distribution, the distribution of correlation coefficients is given by P(r) = (1) = (2) = (3) where rho is the population correlation coefficient, ...

The isotomic conjugate of a point is the point of concurrence Q of the isotomic lines relative to a point P. The isotomic conjugate alpha^':beta^':gamma^' of a point with ...

A Moore graph of type (v,g) is a regular graph of vertex degree v>2 and girth g that contains the maximum possible number of nodes, namely ...

Given order statistics Y_1=min_(j)X_j, Y_2, ..., Y_(N-1), Y_N=max_(j)X_j with sample size N, the midrange of the random sample is defined by MR=1/2(Y_1+Y_N) (Hogg and Craig ...

The trimean is defined to be TM=1/4(H_1+2M+H_2), where H_i are the hinges and M is the statistical median. Press et al. (1992) call this Tukey's trimean. It is an L-estimate.

A symmetric bilinear form on a vector space V is a bilinear function Q:V×V->R (1) which satisfies Q(v,w)=Q(w,v). For example, if A is a n×n symmetric matrix, then ...

The Farey sequence F_n for any positive integer n is the set of irreducible rational numbers a/b with 0<=a<=b<=n and (a,b)=1 arranged in increasing order. The first few are ...